1982-01-01
Speed Reasoning in Propositional Logic," Proposal to AF Office of Scientific Researchp July 1981. 3. Roussel, P., OPRLOG: manuel de reference et ...dlutilization,o Groupe d’Intelligence Artificielle , Universite d’Aix- Marseille, Luminy, France, September 1975. 4. Clocksint W.F. and C.S. Mellish...for reasoning in higher-order logics such as the first-order predicate calculus; the latter is required for applications in artificial intelligence
ERIC Educational Resources Information Center
BACKER, P.O.; BOHNERT, H.G.
THE LATEST IN A SERIES OF ENGLISH-LIKE LANGUAGES IS DESCRIBED WHICH IS TRANSLATABLE INTO FORMS OF A FIRST-ORDER PREDICATE CALCULUS NOTATION. THE STUDY IS BASED ON THE HYPOTHESIS THAT SYNTACTIC AMBIGUITY ARISING FROM DIFFERENCES IN DEEP STRUCTURE CAN BE ADEQUATELY DESCRIBED ONLY IF THE DEEP STRUCTURES CAN BE SYSTEMATICALLY REPRESENTED. THE NOTATION…
Coinductive Logic Programming with Negation
NASA Astrophysics Data System (ADS)
Min, Richard; Gupta, Gopal
We introduce negation into coinductive logic programming (co-LP) via what we term Coinductive SLDNF (co-SLDNF) resolution. We present declarative and operational semantics of co-SLDNF resolution and present their equivalence under the restriction of rationality. Co-LP with co-SLDNF resolution provides a powerful, practical and efficient operational semantics for Fitting's Kripke-Kleene three-valued logic with restriction of rationality. Further, applications of co-SLDNF resolution are also discussed and illustrated where Co-SLDNF resolution allows one to develop elegant implementations of modal logics. Moreover it provides the capability of non-monotonic inference (e.g., predicate Answer Set Programming) that can be used to develop novel and effective first-order modal non-monotonic inference engines.
A New Approach to Teaching Mathematics
1994-02-01
We propose a new approach to teaching discrete math : First, teach logic as a powerful and versatile tool for discovering and communicating truths...using logic in other areas of study. Our experiences in teaching discrete math at Cornell shows that such success is possible. Propositional logic, Predicate logic, Discrete mathematics.
Automated Verification of Design Patterns with LePUS3
NASA Technical Reports Server (NTRS)
Nicholson, Jonathan; Gasparis, Epameinondas; Eden, Ammon H.; Kazman, Rick
2009-01-01
Specification and [visual] modelling languages are expected to combine strong abstraction mechanisms with rigour, scalability, and parsimony. LePUS3 is a visual, object-oriented design description language axiomatized in a decidable subset of the first-order predicate logic. We demonstrate how LePUS3 is used to formally specify a structural design pattern and prove ( verify ) whether any JavaTM 1.4 program satisfies that specification. We also show how LePUS3 specifications (charts) are composed and how they are verified fully automatically in the Two-Tier Programming Toolkit.
Serbo-Croatian Word Order: A Logical Approach
ERIC Educational Resources Information Center
Mihalicek, Vedrana
2012-01-01
This dissertation presents a formal theory of Serbo-Croatian grammar. The theory predicts acceptable form/meaning pairs for a substantial chunk of Serbo-Croatian. In particular, we analyze Serbo-Croatian declarative and interrogative main clauses, embedded clauses, a couple of different types of nominal modification, control and predication, as…
Deciding Full Branching Time Logic by Program Transformation
NASA Astrophysics Data System (ADS)
Pettorossi, Alberto; Proietti, Maurizio; Senni, Valerio
We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL*) properties of finite state reactive systems. The finite state systems and the CTL* properties we want to verify, are encoded as logic programs on infinite lists. Our verification method consists of two steps. In the first step we transform the logic program that encodes the given system and the given property, into a monadic ω -program, that is, a stratified program defining nullary or unary predicates on infinite lists. This transformation is performed by applying unfold/fold rules that preserve the perfect model of the initial program. In the second step we verify the property of interest by using a proof method for monadic ω-programs.
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.
On the Importance of Set-Based Meanings for Categories and Connectives in Mathematical Logic
ERIC Educational Resources Information Center
Dawkins, Paul Christian
2017-01-01
Based on data from a series of teaching experiments on standard tools of mathematical logic, this paper characterizes a range of student meanings for mathematical properties and logical connectives. Some observed meanings inhibited students' adoption of logical structure, while others greatly facilitated it. "Reasoning with predicates"…
A method of transition conflict resolving in hierarchical control
NASA Astrophysics Data System (ADS)
Łabiak, Grzegorz
2016-09-01
The paper concerns the problem of automatic solving of transition conflicts in hierarchical concurrent state machines (also known as UML state machine). Preparing by the designer a formal specification of a behaviour free from conflicts can be very complex. In this paper, it is proposed a method for solving conflicts through transition predicates modification. Partially specified predicates in the nondeterministic diagram are transformed into a symbolic Boolean space, whose points of the space code all possible valuations of transition predicates. Next, all valuations under partial specifications are logically multiplied by a function which represents all possible orthogonal predicate valuations. The result of this operation contains all possible collections of predicates, which under given partial specification make that the original diagram is conflict free and deterministic.
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-box model such as a pairwise SVM while providing relevant insights on the predictions. Conclusions The numerical studies show that MLN achieves very good predictive performance while opening the door to some interpretability of the decisions. Besides the ability to suggest new regulations, such an approach allows to cross-validate experimental data with existing knowledge. PMID:24028533
Learning a Markov Logic network for supervised gene regulatory network inference.
Brouard, Céline; Vrain, Christel; Dubois, Julie; Castel, David; Debily, Marie-Anne; d'Alché-Buc, Florence
2013-09-12
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. 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-box model such as a pairwise SVM while providing relevant insights on the predictions. The numerical studies show that MLN achieves very good predictive performance while opening the door to some interpretability of the decisions. Besides the ability to suggest new regulations, such an approach allows to cross-validate experimental data with existing knowledge.
Linear {GLP}-algebras and their elementary theories
NASA Astrophysics Data System (ADS)
Pakhomov, F. N.
2016-12-01
The polymodal provability logic {GLP} was introduced by Japaridze in 1986. It is the provability logic of certain chains of provability predicates of increasing strength. Every polymodal logic corresponds to a variety of polymodal algebras. Beklemishev and Visser asked whether the elementary theory of the free {GLP}-algebra generated by the constants \\mathbf{0}, \\mathbf{1} is decidable [1]. For every positive integer n we solve the corresponding question for the logics {GLP}_n that are the fragments of {GLP} with n modalities. We prove that the elementary theory of the free {GLP}_n-algebra generated by the constants \\mathbf{0}, \\mathbf{1} is decidable for all n. We introduce the notion of a linear {GLP}_n-algebra and prove that all free {GLP}_n-algebras generated by the constants \\mathbf{0}, \\mathbf{1} are linear. We also consider the more general case of the logics {GLP}_α whose modalities are indexed by the elements of a linearly ordered set α: we define the notion of a linear algebra and prove the latter result in this case.
Instrumentation of Java Bytecode for Runtime Analysis
NASA Technical Reports Server (NTRS)
Goldberg, Allen; Haveland, Klaus
2003-01-01
This paper describes JSpy, a system for high-level instrumentation of Java bytecode and its use with JPaX, OUT system for runtime analysis of Java programs. JPaX monitors the execution of temporal logic formulas and performs predicative analysis of deadlocks and data races. JSpy s input is an instrumentation specification, which consists of a collection of rules, where a rule is a predicate/action pair The predicate is a conjunction of syntactic constraints on a Java statement, and the action is a description of logging information to be inserted in the bytecode corresponding to the statement. JSpy is built using JTrek an instrumentation package at a lower level of abstraction.
["Understanding" in psychiatry-part 1 : Philosophical sources and concept analysis].
Valdés-Stauber, J
2017-11-29
The dichotomy comprehension/understanding vs. explanation has been initially developed with a legitimating intention for the humanities vis à vis the natural sciences. This investigation examines the different usages of understanding/comprehension in psychiatry and psychotherapy as well as its relevance for medical practice. Critical discussion of the historical roots of the comprehension-explanation dichotomy and its introduction into the psychiatry by Jaspers. A propaedeutic logical analysis of the concept of "understanding" will be proposed. This investigation aims to elucidate latent dimensions in the usage of "understanding" in psychiatry and psychotherapy. In more detail the operation of assignment and attribution will be discussed as well as the elucidation of individual meaning and supraindividual significance. The term analysis shows that "to understand" as a predicate is gradually and polysemic; its definition must take the different logically additive meanings into account. These meanings can be condensed into three dimensions: i. Rational diagnostic assignment; ii. Elucidation of meaning through individual empathetic re-experiencing as a psychological approach respectively the supraindividual elucidation of significance, and; iii. Dialogic attitude. Psychological understanding roots in Jaspers' epistemology on assignment to and alignment with supraindividual meaningful connections and not on empathetic re-experiencing. "To understand" as a logical operation of assignment and as meaning elucidation takes for granted a predicate in its transitive first-person perspective ("who" should be understood, as objectified) in conjunction to a third-person perspective ("what" should be understood). This analysis should be complemented by a first-person perspective ("who" should be understood, as a subject) in conjunction with a dialogic second-person perspective ("how" should be understood, following a mutual disposition). This last approach will be discussed in an additional article.
META 2f: Probabilistic, Compositional, Multi-dimension Model-Based Verification (PROMISE)
2011-10-01
Equational Logic, Rewriting Logic, and Maude ................................................ 52 5.3 Results and Discussion...and its discrete transitions are left unchanged. However, the differential equations describing the continuous dynamics (in each mode) are replaced by...by replacing hard-to-analyze differential equations by discrete transitions. In principle, predicate and qualitative abstraction can be used on a
Development and evaluation of a biomedical search engine using a predicate-based vector space model.
Kwak, Myungjae; Leroy, Gondy; Martinez, Jesse D; Harwell, Jeffrey
2013-10-01
Although biomedical information available in articles and patents is increasing exponentially, we continue to rely on the same information retrieval methods and use very few keywords to search millions of documents. We are developing a fundamentally different approach for finding much more precise and complete information with a single query using predicates instead of keywords for both query and document representation. Predicates are triples that are more complex datastructures than keywords and contain more structured information. To make optimal use of them, we developed a new predicate-based vector space model and query-document similarity function with adjusted tf-idf and boost function. Using a test bed of 107,367 PubMed abstracts, we evaluated the first essential function: retrieving information. Cancer researchers provided 20 realistic queries, for which the top 15 abstracts were retrieved using a predicate-based (new) and keyword-based (baseline) approach. Each abstract was evaluated, double-blind, by cancer researchers on a 0-5 point scale to calculate precision (0 versus higher) and relevance (0-5 score). Precision was significantly higher (p<.001) for the predicate-based (80%) than for the keyword-based (71%) approach. Relevance was almost doubled with the predicate-based approach-2.1 versus 1.6 without rank order adjustment (p<.001) and 1.34 versus 0.98 with rank order adjustment (p<.001) for predicate--versus keyword-based approach respectively. Predicates can support more precise searching than keywords, laying the foundation for rich and sophisticated information search. Copyright © 2013 Elsevier Inc. All rights reserved.
A Logical Basis In The Layered Computer Vision Systems Model
NASA Astrophysics Data System (ADS)
Tejwani, Y. J.
1986-03-01
In this paper a four layer computer vision system model is described. The model uses a finite memory scratch pad. In this model planar objects are defined as predicates. Predicates are relations on a k-tuple. The k-tuple consists of primitive points and relationship between primitive points. The relationship between points can be of the direct type or the indirect type. Entities are goals which are satisfied by a set of clauses. The grammar used to construct these clauses is examined.
Design of an intelligent information system for in-flight emergency assistance
NASA Technical Reports Server (NTRS)
Feyock, Stefan; Karamouzis, Stamos
1991-01-01
The present research has as its goal the development of AI tools to help flight crews cope with in-flight malfunctions. The relevant tasks in such situations include diagnosis, prognosis, and recovery plan generation. Investigation of the information requirements of these tasks has shown that the determination of paths figures largely: what components or systems are connected to what others, how are they connected, whether connections satisfying certain criteria exist, and a number of related queries. The formulation of such queries frequently requires capabilities of the second-order predicate calculus. An information system is described that features second-order logic capabilities, and is oriented toward efficient formulation and execution of such queries.
Context recognition for a hyperintensional inference machine
NASA Astrophysics Data System (ADS)
Duží, Marie; Fait, Michal; Menšík, Marek
2017-07-01
The goal of this paper is to introduce the algorithm of context recognition in the functional programming language TIL-Script, which is a necessary condition for the implementation of the TIL-Script inference machine. The TIL-Script language is an operationally isomorphic syntactic variant of Tichý's Transparent Intensional Logic (TIL). From the formal point of view, TIL is a hyperintensional, partial, typed λ-calculus with procedural semantics. Hyperintensional, because TIL λ-terms denote procedures (defined as TIL constructions) producing set-theoretic functions rather than the functions themselves; partial, because TIL is a logic of partial functions; and typed, because all the entities of TIL ontology, including constructions, receive a type within a ramified hierarchy of types. These features make it possible to distinguish three levels of abstraction at which TIL constructions operate. At the highest hyperintensional level the object to operate on is a construction (though a higher-order construction is needed to present this lower-order construction as an object of predication). At the middle intensional level the object to operate on is the function presented, or constructed, by a construction, while at the lowest extensional level the object to operate on is the value (if any) of the presented function. Thus a necessary condition for the development of an inference machine for the TIL-Script language is recognizing a context in which a construction occurs, namely extensional, intensional and hyperintensional context, in order to determine the type of an argument at which a given inference rule can be properly applied. As a result, our logic does not flout logical rules of extensional logic, which makes it possible to develop a hyperintensional inference machine for the TIL-Script language.
Analytical learning and term-rewriting systems
NASA Technical Reports Server (NTRS)
Laird, Philip; Gamble, Evan
1990-01-01
Analytical learning is a set of machine learning techniques for revising the representation of a theory based on a small set of examples of that theory. When the representation of the theory is correct and complete but perhaps inefficient, an important objective of such analysis is to improve the computational efficiency of the representation. Several algorithms with this purpose have been suggested, most of which are closely tied to a first order logical language and are variants of goal regression, such as the familiar explanation based generalization (EBG) procedure. But because predicate calculus is a poor representation for some domains, these learning algorithms are extended to apply to other computational models. It is shown that the goal regression technique applies to a large family of programming languages, all based on a kind of term rewriting system. Included in this family are three language families of importance to artificial intelligence: logic programming, such as Prolog; lambda calculus, such as LISP; and combinatorial based languages, such as FP. A new analytical learning algorithm, AL-2, is exhibited that learns from success but is otherwise quite different from EBG. These results suggest that term rewriting systems are a good framework for analytical learning research in general, and that further research should be directed toward developing new techniques.
Scalable DB+IR Technology: Processing Probabilistic Datalog with HySpirit.
Frommholz, Ingo; Roelleke, Thomas
2016-01-01
Probabilistic Datalog (PDatalog, proposed in 1995) is a probabilistic variant of Datalog and a nice conceptual idea to model Information Retrieval in a logical, rule-based programming paradigm. Making PDatalog work in real-world applications requires more than probabilistic facts and rules, and the semantics associated with the evaluation of the programs. We report in this paper some of the key features of the HySpirit system required to scale the execution of PDatalog programs. Firstly, there is the requirement to express probability estimation in PDatalog. Secondly, fuzzy-like predicates are required to model vague predicates (e.g. vague match of attributes such as age or price). Thirdly, to handle large data sets there are scalability issues to be addressed, and therefore, HySpirit provides probabilistic relational indexes and parallel and distributed processing . The main contribution of this paper is a consolidated view on the methods of the HySpirit system to make PDatalog applicable in real-scale applications that involve a wide range of requirements typical for data (information) management and analysis.
Unpacking the Logic of Mathematical Statements.
ERIC Educational Resources Information Center
Selden, John; Selden, Annie
1995-01-01
Investigated (n=61) undergraduates' ability to unpack informally written mathematical statements into the language of predicate calculus in an introduction to proofs and mathematical reasoning. Found that students were unable to construct proofs or validate them. Appendices are "A Sample Validation" and "Building a Statement Image." (MKR)
What conceptual spaces can do for Carnap's late inductive logic.
Sznajder, Marta
2016-04-01
In the last published account of his late inductive logic, the Basic System of Inductive Logic, Rudolf Carnap introduced a new element to the systems of inductive logic, namely the so-called attribute spaces. These geometrical structures model the meanings of the predicates of the object language and have a similar structure as the conceptual spaces employed by cognitive scientists like Peter Gärdenfors. I show how the development of the theory of conceptual spaces helps us to see the addition of attribute spaces as a step forward in explicating the concept of confirmation. I discuss the differences and similarities of the two theories and investigate the possibilities for developing further connections. Copyright © 2016 Elsevier Ltd. All rights reserved.
Cooperation Among Theorem Provers
NASA Technical Reports Server (NTRS)
Waldinger, Richard J.
1998-01-01
This is a final report, which supports NASA's PECSEE (Persistent Cognizant Software Engineering Environment) effort and complements the Kestrel Institute project "Inference System Integration via Logic Morphism". The ultimate purpose of the project is to develop a superior logical inference mechanism by combining the diverse abilities of multiple cooperating theorem provers. In many years of research, a number of powerful theorem-proving systems have arisen with differing capabilities and strengths. Resolution theorem provers (such as Kestrel's KITP or SRI's, SNARK) deal with first-order logic with equality but not the principle of mathematical induction. The Boyer-Moore theorem prover excels at proof by induction but cannot deal with full first-order logic. Both are highly automated but cannot accept user guidance easily. The PVS system (from SRI) in only automatic within decidable theories, but it has well-designed interactive capabilities: furthermore, it includes higher-order logic, not just first-order logic. The NuPRL system from Cornell University and the STeP system from Stanford University have facilities for constructive logic and temporal logic, respectively - both are interactive. It is often suggested - for example, in the anonymous "QED Manifesto"-that we should pool the resources of all these theorem provers into a single system, so that the strengths of one can compensate for the weaknesses of others, and so that effort will not be duplicated. However, there is no straightforward way of doing this, because each system relies on its own language and logic for its success. Thus. SNARK uses ordinary first-order logic with equality, PVS uses higher-order logic. and NuPRL uses constructive logic. The purpose of this project, and the companion project at Kestrel, has been to use the category-theoretic notion of logic morphism to combine systems with different logics and languages. Kestrel's SPECWARE system has been the vehicle for the implementation.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Friedman, N.; Koller, D.; Halpern, J.Y.
Conditional logics play an important role in recent attempts to investigate default reasoning. This paper investigates first-order conditional logic. We show that, as for first-order probabilistic logic, it is important not to confound statistical conditionals over the domain (such as {open_quotes}most birds fly{close_quotes}), and subjective conditionals over possible worlds (such as I believe that Tweety is unlikely to fly). We then address the issue of ascribing semantics to first-order conditional logic. As in the propositional case, there are many possible semantics. To study the problem in a coherent way, we use plausibility structures. These provide us with a general frameworkmore » in which many of the standard approaches can be embedded. We show that while these standard approaches are all the same at the propositional level, they are significantly different in the context of a first-order language. We show that plausibilities provide the most natural extension of conditional logic to the first-order case: We provide a sound and complete axiomatization that contains only the KLM properties and standard axioms of first-order modal logic. We show that most of the other approaches have additional properties, which result in an inappropriate treatment of an infinitary version of the lottery paradox.« less
Omitted Arguments and Complexity of Predication
ERIC Educational Resources Information Center
Port, Martin
2010-01-01
This work focuses on the licensing conditions and logical structure of understood-argument constructions, or complement-drop constructions, in English. There are two main types of such arguments: Indefinite Understood Arguments (IUA) and Definite Understood Arguments (DUA). IUA readings occur in such cases in "He ate, He cooked". In such cases,…
A Relational/Object-Oriented Database Management System: R/OODBMS
1992-09-01
Concepts In 1968, Dr. Edgar F . Codd had the idea that "predicate logic could be applied to maintaining the logical integrity of the data" in a DBMS [CD90, p...Hall, Inc., Englewood Cliffs, NJ, 1990. [Co70] Codd , E. F ., "A Relational Model for Large Shared Data Banks," Communications of the ACM, v. 13, no.6...pp. 377-387 Jun 1970. [CD90] Interview between E. F . Codd and DBMS, "Relational philosopher: the creator of the relational model talks about his
ERIC Educational Resources Information Center
Weber, Brenda R.
2010-01-01
The ways in which both postfeminism and neoliberalism contest the legitimacy of traditional feminist dogma, which is to say second-wave principles and practices, becomes particularly acute in the classroom. Feminist pedagogies have largely been predicated on two socio-political givens that postfeminist and neoliberal logics disallow: (1) that…
EMRlog method for computer security for electronic medical records with logic and data mining.
Martínez Monterrubio, Sergio Mauricio; Frausto Solis, Juan; Monroy Borja, Raúl
2015-01-01
The proper functioning of a hospital computer system is an arduous work for managers and staff. However, inconsistent policies are frequent and can produce enormous problems, such as stolen information, frequent failures, and loss of the entire or part of the hospital data. This paper presents a new method named EMRlog for computer security systems in hospitals. EMRlog is focused on two kinds of security policies: directive and implemented policies. Security policies are applied to computer systems that handle huge amounts of information such as databases, applications, and medical records. Firstly, a syntactic verification step is applied by using predicate logic. Then data mining techniques are used to detect which security policies have really been implemented by the computer systems staff. Subsequently, consistency is verified in both kinds of policies; in addition these subsets are contrasted and validated. This is performed by an automatic theorem prover. Thus, many kinds of vulnerabilities can be removed for achieving a safer computer system.
EMRlog Method for Computer Security for Electronic Medical Records with Logic and Data Mining
Frausto Solis, Juan; Monroy Borja, Raúl
2015-01-01
The proper functioning of a hospital computer system is an arduous work for managers and staff. However, inconsistent policies are frequent and can produce enormous problems, such as stolen information, frequent failures, and loss of the entire or part of the hospital data. This paper presents a new method named EMRlog for computer security systems in hospitals. EMRlog is focused on two kinds of security policies: directive and implemented policies. Security policies are applied to computer systems that handle huge amounts of information such as databases, applications, and medical records. Firstly, a syntactic verification step is applied by using predicate logic. Then data mining techniques are used to detect which security policies have really been implemented by the computer systems staff. Subsequently, consistency is verified in both kinds of policies; in addition these subsets are contrasted and validated. This is performed by an automatic theorem prover. Thus, many kinds of vulnerabilities can be removed for achieving a safer computer system. PMID:26495300
Knowledge represented using RDF semantic network in the concept of semantic web
DOE Office of Scientific and Technical Information (OSTI.GOV)
Lukasova, A., E-mail: alena.lukasova@osu.cz; Vajgl, M., E-mail: marek.vajgl@osu.cz; Zacek, M., E-mail: martin.zacek@osu.cz
The RDF(S) model has been declared as the basic model to capture knowledge of the semantic web. It provides a common and flexible way to decompose composed knowledge to elementary statements, which can be represented by RDF triples or by RDF graph vectors. From the logical point of view, elements of knowledge can be expressed using at most binary predicates, which can be converted to RDF-triples or graph vectors. However, it is not able to capture implicit knowledge representable by logical formulas. This contribution shows how existing approaches (semantic networks and clausal form logic) can be combined together with RDFmore » to obtain RDF-compatible system with ability to represent implicit knowledge and inference over knowledge base.« less
Hidden patterns of reciprocity.
Syi
2014-03-21
Reciprocity can help the evolution of cooperation. To model both types of reciprocity, we need the concept of strategy. In the case of direct reciprocity there are four second-order action rules (Simple Tit-for-tat, Contrite Tit-for-tat, Pavlov, and Grim Trigger), which are able to promote cooperation. In the case of indirect reciprocity the key component of cooperation is the assessment rule. There are, again, four elementary second-order assessment rules (Image Scoring, Simple Standing, Stern Judging, and Shunning). The eight concepts can be formalized in an ontologically thin way we need only an action predicate and a value function, two agent concepts, and the constant of goodness. The formalism helps us to discover that the action and assessment rules can be paired, and that they show the same patterns. The logic of these patterns can be interpreted with the concept of punishment that has an inherent paradoxical nature. Copyright © 2013 Elsevier Ltd. All rights reserved.
Predicating from an Early Age: Edusemiotics and the Potential of Children's Preconceptions
ERIC Educational Resources Information Center
Olteanu, Alin; Kambouri, Maria; Stables, Andrew
2016-01-01
This paper aims to explain how semiotics and constructivism can collaborate in an educational epistemology by developing a joint approach to prescientific conceptions. Empirical data and findings of constructivist research are interpreted in the light of Peirce's semiotics. Peirce's semiotics is an anti-psychologistic logic (CP 2.252; CP 4.551; W…
A Model of Object-Identities and Values
1990-02-23
integrity constraints in its construct, which provides the natural integration of the logical database model and the object-oriented database model. 20...portions are integrated by a simple commutative diagram of modeling functions. The formalism includes the expression of integrity constraints in its ...38 .5.2.2 The (Concept Model and Its Semantics .. .. .. .. ... .... ... .. 40 5.2.3 Two K%.inds of Predicates
Replacing positivism in medical geography.
Bennett, David
2005-06-01
Revisiting debates about philosophical approaches in medical geography suggests that logical positivism may have been prematurely discarded. An analysis of authoritative texts in medical geography and their sources in human geography shows that logical positivism has been conflated with Comtean positivism, science, empiricism, quantification, science politics, scientism and so on, to produce the "standard version" of the all-purpose pejorative "positivism", which it is easy to dismiss as an evil. It is argued that the standard version fails to do justice to logical positivism, being constructed on sources which are at some distance from the logical positivist movement itself. An alternative approach is then developed, an historically and geographically situated interpretation of logical positivism as a deliberately and knowingly constructed oppositional epistemology within an oppressive and anti-scientific culture predicated on idealist intuitionism. Contrasting the standard version with this alternative reading of logical positivism suggests that much may have been lost in human, and thus, medical geography, by throwing out the logical positivist baby with the "positivism" bath water. It is concluded that continuing to unpack the standard version of logical positivism may identify benefits from a more nuanced appreciation of logical positivism, but it is premature to take these to the level of detailed impacts on the kinds of medical geographies that could be done or the ways of doing them.
Chen, Shyi-Ming; Chen, Shen-Wen
2015-03-01
In this paper, we present a new method for fuzzy forecasting based on two-factors second-order fuzzy-trend logical relationship groups and the probabilities of trends of fuzzy-trend logical relationships. Firstly, the proposed method fuzzifies the historical training data of the main factor and the secondary factor into fuzzy sets, respectively, to form two-factors second-order fuzzy logical relationships. Then, it groups the obtained two-factors second-order fuzzy logical relationships into two-factors second-order fuzzy-trend logical relationship groups. Then, it calculates the probability of the "down-trend," the probability of the "equal-trend" and the probability of the "up-trend" of the two-factors second-order fuzzy-trend logical relationships in each two-factors second-order fuzzy-trend logical relationship group, respectively. Finally, it performs the forecasting based on the probabilities of the down-trend, the equal-trend, and the up-trend of the two-factors second-order fuzzy-trend logical relationships in each two-factors second-order fuzzy-trend logical relationship group. We also apply the proposed method to forecast the Taiwan Stock Exchange Capitalization Weighted Stock Index (TAIEX) and the NTD/USD exchange rates. The experimental results show that the proposed method outperforms the existing methods.
Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners)
NASA Astrophysics Data System (ADS)
Benzmüller, Christoph
Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higher-order logic). Furthermore, off-the-shelf reasoning systems for simple type type theory exist that can be uniformly employed for reasoning within and about embedded logics. In this paper we focus on reasoning about modal logics and exploit our framework for the automated verification of inclusion and equivalence relations between them. Related work has applied first-order automated theorem provers for the task. Our solution achieves significant improvements, most notably, with respect to elegance and simplicity of the problem encodings as well as with respect to automation performance.
Cooperation Among Theorem Provers
NASA Technical Reports Server (NTRS)
Waldinger, Richard J.
1998-01-01
In many years of research, a number of powerful theorem-proving systems have arisen with differing capabilities and strengths. Resolution theorem provers (such as Kestrel's KITP or SRI's SNARK) deal with first-order logic with equality but not the principle of mathematical induction. The Boyer-Moore theorem prover excels at proof by induction but cannot deal with full first-order logic. Both are highly automated but cannot accept user guidance easily. The purpose of this project, and the companion project at Kestrel, has been to use the category-theoretic notion of logic morphism to combine systems with different logics and languages.
1991-02-01
3 2.2 Hybrid Rule/Fact Schemas .............................................................. 3 3 THE LIMITATIONS OF RULE BASED KNOWLEDGE...or hybrid rule/fact schemas. 2 UNCLASSIFIED .WA UNCLASSIFIED ERL-0520-RR 2.1 Propositional Logic The simplest form of production-rules are based upon...requirements which may lead to poor system performance. 2.2 Hybrid Rule/Fact Schemas Hybrid rule/fact relationships (also known as Predicate Calculus ) have
Logical definability and asymptotic growth in optimization and counting problems
DOE Office of Scientific and Technical Information (OSTI.GOV)
Compton, K.
1994-12-31
There has recently been a great deal of interest in the relationship between logical definability and NP-optimization problems. Let MS{sub n} (resp. MP{sub n}) be the class of problems to compute, for given a finite structure A, the maximum number of tuples {bar x} in A satisfying a {Sigma}{sub n} (resp. II{sub n}) formula {psi}({bar x}, {bar S}) as {bar S} ranges over predicates on A. Kolaitis and Thakur showed that the classes MS{sub n} and MP{sub n} collapse to a hierarchy of four levels. Papadimitriou and Yannakakis previously showed that problems in the two lowest levels MS{sub 0} andmore » MS{sub 1} (which they called Max Snp and Max Np) are approximable to within a contrast factor in polynomial time. Similarly, Saluja, Subrahmanyam, and Thakur defined SS{sub n} (resp. SP{sub n}) to be the class of problems to compute, for given a finite structure A, the number of tuples ({bar T}, {bar S}) satisfying a given {Sigma}{sub n} (resp. II{sub n}) formula {psi}({bar T}, {bar c}) in A. They showed that the classes SS{sub n} and SP{sub n} collapse to a hierarchy of five levels and that problems in the two lowest levels SS{sub 0} and SS{sub 1} have a fully polynomial time randomized approximation scheme. We define extended classes MSF{sub n}, MPF{sub n} SSF{sub n}, and SPF{sub n} by allowing formulae to contain predicates definable in a logic known as least fixpoint logic. The resulting hierarchies classes collapse to the same number of levels and problems in the bottom levels can be approximated as before, but now some problems descend from the highest levels in the original hierarchies to the lowest levels in the new hierarchies. We introduce a method characterizing rates of growth of average solution sizes thereby showing a number of important problems do not belong MSF{sub 1} and SSF{sub 1}. This method is related to limit laws for logics and the probabilistic method from combinatorics.« less
Chen, Shyi-Ming; Manalu, Gandhi Maruli Tua; Pan, Jeng-Shyang; Liu, Hsiang-Chuan
2013-06-01
In this paper, we present a new method for fuzzy forecasting based on two-factors second-order fuzzy-trend logical relationship groups and particle swarm optimization (PSO) techniques. First, we fuzzify the historical training data of the main factor and the secondary factor, respectively, to form two-factors second-order fuzzy logical relationships. Then, we group the two-factors second-order fuzzy logical relationships into two-factors second-order fuzzy-trend logical relationship groups. Then, we obtain the optimal weighting vector for each fuzzy-trend logical relationship group by using PSO techniques to perform the forecasting. We also apply the proposed method to forecast the Taiwan Stock Exchange Capitalization Weighted Stock Index and the NTD/USD exchange rates. The experimental results show that the proposed method gets better forecasting performance than the existing methods.
Jiao, Pengfei; Cai, Fei; Feng, Yiding; Wang, Wenjun
2017-08-21
Link predication aims at forecasting the latent or unobserved edges in the complex networks and has a wide range of applications in reality. Almost existing methods and models only take advantage of one class organization of the networks, which always lose important information hidden in other organizations of the network. In this paper, we propose a link predication framework which makes the best of the structure of networks in different level of organizations based on nonnegative matrix factorization, which is called NMF 3 here. We first map the observed network into another space by kernel functions, which could get the different order organizations. Then we combine the adjacency matrix of the network with one of other organizations, which makes us obtain the objective function of our framework for link predication based on the nonnegative matrix factorization. Third, we derive an iterative algorithm to optimize the objective function, which converges to a local optimum, and we propose a fast optimization strategy for large networks. Lastly, we test the proposed framework based on two kernel functions on a series of real world networks under different sizes of training set, and the experimental results show the feasibility, effectiveness, and competitiveness of the proposed framework.
Verified Separate Compilation for C
2015-06-01
simulations, says that the visible set is closed under reachability. These two conditions, plus (6.2) and monotonicity of the REACH relation, imply...erase to a CompCert memory m. By erasure, we mean the removal of the “ juice ” that is unnecessary for execution (as in Curry-style type erasure of...simply typed lambda calculus). The “ juice ” has several components: permission shares controlling access to objects in the program logic; predicates in the
Verification and Planning Based on Coinductive Logic Programming
NASA Technical Reports Server (NTRS)
Bansal, Ajay; Min, Richard; Simon, Luke; Mallya, Ajay; Gupta, Gopal
2008-01-01
Coinduction is a powerful technique for reasoning about unfounded sets, unbounded structures, infinite automata, and interactive computations [6]. Where induction corresponds to least fixed point's semantics, coinduction corresponds to greatest fixed point semantics. Recently coinduction has been incorporated into logic programming and an elegant operational semantics developed for it [11, 12]. This operational semantics is the greatest fix point counterpart of SLD resolution (SLD resolution imparts operational semantics to least fix point based computations) and is termed co- SLD resolution. In co-SLD resolution, a predicate goal p( t) succeeds if it unifies with one of its ancestor calls. In addition, rational infinite terms are allowed as arguments of predicates. Infinite terms are represented as solutions to unification equations and the occurs check is omitted during the unification process. Coinductive Logic Programming (Co-LP) and Co-SLD resolution can be used to elegantly perform model checking and planning. A combined SLD and Co-SLD resolution based LP system forms the common basis for planning, scheduling, verification, model checking, and constraint solving [9, 4]. This is achieved by amalgamating SLD resolution, co-SLD resolution, and constraint logic programming [13] in a single logic programming system. Given that parallelism in logic programs can be implicitly exploited [8], complex, compute-intensive applications (planning, scheduling, model checking, etc.) can be executed in parallel on multi-core machines. Parallel execution can result in speed-ups as well as in larger instances of the problems being solved. In the remainder we elaborate on (i) how planning can be elegantly and efficiently performed under real-time constraints, (ii) how real-time systems can be elegantly and efficiently model- checked, as well as (iii) how hybrid systems can be verified in a combined system with both co-SLD and SLD resolution. Implementations of co-SLD resolution as well as preliminary implementations of the planning and verification applications have been developed [4]. Co-LP and Model Checking: The vast majority of properties that are to be verified can be classified into safety properties and liveness properties. It is well known within model checking that safety properties can be verified by reachability analysis, i.e, if a counter-example to the property exists, it can be finitely determined by enumerating all the reachable states of the Kripke structure.
Temporal Precedence Checking for Switched Models and its Application to a Parallel Landing Protocol
NASA Technical Reports Server (NTRS)
Duggirala, Parasara Sridhar; Wang, Le; Mitra, Sayan; Viswanathan, Mahesh; Munoz, Cesar A.
2014-01-01
This paper presents an algorithm for checking temporal precedence properties of nonlinear switched systems. This class of properties subsume bounded safety and capture requirements about visiting a sequence of predicates within given time intervals. The algorithm handles nonlinear predicates that arise from dynamics-based predictions used in alerting protocols for state-of-the-art transportation systems. It is sound and complete for nonlinear switch systems that robustly satisfy the given property. The algorithm is implemented in the Compare Execute Check Engine (C2E2) using validated simulations. As a case study, a simplified model of an alerting system for closely spaced parallel runways is considered. The proposed approach is applied to this model to check safety properties of the alerting logic for different operating conditions such as initial velocities, bank angles, aircraft longitudinal separation, and runway separation.
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.
Semantics of Inheritance and Attributions in the Description System Omega. Revision.
1982-01-01
criticized either for being too general or too inflexible. General deductive procedures for predicate logic easily go out of control. There have been a...6 and 7. Section 8 is concerned with a discussion of attributions: the language is extended by introducing syntactic notations for four different...for valid formulas of the theory. The models prorided earlier are usefulL in this stage for providing a guideline and a criterion for suitability of
Predicate calculus for an architecture of multiple neural networks
NASA Astrophysics Data System (ADS)
Consoli, Robert H.
1990-08-01
Future projects with neural networks will require multiple individual network components. Current efforts along these lines are ad hoc. This paper relates the neural network to a classical device and derives a multi-part architecture from that model. Further it provides a Predicate Calculus variant for describing the location and nature of the trainings and suggests Resolution Refutation as a method for determining the performance of the system as well as the location of needed trainings for specific proofs. 2. THE NEURAL NETWORK AND A CLASSICAL DEVICE Recently investigators have been making reports about architectures of multiple neural networksL234. These efforts are appearing at an early stage in neural network investigations they are characterized by architectures suggested directly by the problem space. Touretzky and Hinton suggest an architecture for processing logical statements1 the design of this architecture arises from the syntax of a restricted class of logical expressions and exhibits syntactic limitations. In similar fashion a multiple neural netword arises out of a control problem2 from the sequence learning problem3 and from the domain of machine learning. 4 But a general theory of multiple neural devices is missing. More general attempts to relate single or multiple neural networks to classical computing devices are not common although an attempt is made to relate single neural devices to a Turing machines and Sun et a!. develop a multiple neural architecture that performs pattern classification.
Quantum Enhanced Inference in Markov Logic Networks
NASA Astrophysics Data System (ADS)
Wittek, Peter; Gogolin, Christian
2017-04-01
Markov logic networks (MLNs) reconcile two opposing schools in machine learning and artificial intelligence: causal networks, which account for uncertainty extremely well, and first-order logic, which allows for formal deduction. An MLN is essentially a first-order logic template to generate Markov networks. Inference in MLNs is probabilistic and it is often performed by approximate methods such as Markov chain Monte Carlo (MCMC) Gibbs sampling. An MLN has many regular, symmetric structures that can be exploited at both first-order level and in the generated Markov network. We analyze the graph structures that are produced by various lifting methods and investigate the extent to which quantum protocols can be used to speed up Gibbs sampling with state preparation and measurement schemes. We review different such approaches, discuss their advantages, theoretical limitations, and their appeal to implementations. We find that a straightforward application of a recent result yields exponential speedup compared to classical heuristics in approximate probabilistic inference, thereby demonstrating another example where advanced quantum resources can potentially prove useful in machine learning.
Quantum Enhanced Inference in Markov Logic Networks.
Wittek, Peter; Gogolin, Christian
2017-04-19
Markov logic networks (MLNs) reconcile two opposing schools in machine learning and artificial intelligence: causal networks, which account for uncertainty extremely well, and first-order logic, which allows for formal deduction. An MLN is essentially a first-order logic template to generate Markov networks. Inference in MLNs is probabilistic and it is often performed by approximate methods such as Markov chain Monte Carlo (MCMC) Gibbs sampling. An MLN has many regular, symmetric structures that can be exploited at both first-order level and in the generated Markov network. We analyze the graph structures that are produced by various lifting methods and investigate the extent to which quantum protocols can be used to speed up Gibbs sampling with state preparation and measurement schemes. We review different such approaches, discuss their advantages, theoretical limitations, and their appeal to implementations. We find that a straightforward application of a recent result yields exponential speedup compared to classical heuristics in approximate probabilistic inference, thereby demonstrating another example where advanced quantum resources can potentially prove useful in machine learning.
Quantum Enhanced Inference in Markov Logic Networks
Wittek, Peter; Gogolin, Christian
2017-01-01
Markov logic networks (MLNs) reconcile two opposing schools in machine learning and artificial intelligence: causal networks, which account for uncertainty extremely well, and first-order logic, which allows for formal deduction. An MLN is essentially a first-order logic template to generate Markov networks. Inference in MLNs is probabilistic and it is often performed by approximate methods such as Markov chain Monte Carlo (MCMC) Gibbs sampling. An MLN has many regular, symmetric structures that can be exploited at both first-order level and in the generated Markov network. We analyze the graph structures that are produced by various lifting methods and investigate the extent to which quantum protocols can be used to speed up Gibbs sampling with state preparation and measurement schemes. We review different such approaches, discuss their advantages, theoretical limitations, and their appeal to implementations. We find that a straightforward application of a recent result yields exponential speedup compared to classical heuristics in approximate probabilistic inference, thereby demonstrating another example where advanced quantum resources can potentially prove useful in machine learning. PMID:28422093
Data Model as an Architectural View
2009-10-01
store order - processing system. Logical. The logical data model is an evolution of the conceptual data model towards a data management technology (e.g...online store order - processing system at different stages. Perhaps the first draft was elaborated by the architect during discussion of requirements
ERIC Educational Resources Information Center
Meador, Ryan E.
2012-01-01
This study examined students who successfully applied for reinstatement after being academically dismissed for the first time in order to discover indicators of future success. This study examined 666 students' appeals filed at the DeVry University Kansas City campus between 2004 and 2009. Binary logistic regression was used to discover if a…
An Arbitrary First Order Theory Can Be Represented by a Program: A Theorem
NASA Technical Reports Server (NTRS)
Hosheleva, Olga
1997-01-01
How can we represent knowledge inside a computer? For formalized knowledge, classical logic seems to be the most adequate tool. Classical logic is behind all formalisms of classical mathematics, and behind many formalisms used in Artificial Intelligence. There is only one serious problem with classical logic: due to the famous Godel's theorem, classical logic is algorithmically undecidable; as a result, when the knowledge is represented in the form of logical statements, it is very difficult to check whether, based on this statement, a given query is true or not. To make knowledge representations more algorithmic, a special field of logic programming was invented. An important portion of logic programming is algorithmically decidable. To cover knowledge that cannot be represented in this portion, several extensions of the decidable fragments have been proposed. In the spirit of logic programming, these extensions are usually introduced in such a way that even if a general algorithm is not available, good heuristic methods exist. It is important to check whether the already proposed extensions are sufficient, or further extensions is necessary. In the present paper, we show that one particular extension, namely, logic programming with classical negation, introduced by M. Gelfond and V. Lifschitz, can represent (in some reasonable sense) an arbitrary first order logical theory.
Specifying and Verifying Organizational Security Properties in First-Order Logic
NASA Astrophysics Data System (ADS)
Brandt, Christoph; Otten, Jens; Kreitz, Christoph; Bibel, Wolfgang
In certain critical cases the data flow between business departments in banking organizations has to respect security policies known as Chinese Wall or Bell-La Padula. We show that these policies can be represented by formal requirements and constraints in first-order logic. By additionally providing a formal model for the flow of data between business departments we demonstrate how security policies can be applied to a concrete organizational setting and checked with a first-order theorem prover. Our approach can be applied without requiring a deep formal expertise and it therefore promises a high potential of usability in the business.
Hochmann, Jean-Rémy; Carey, Susan; Mehler, Jacques
2018-08-01
In two experiments, we assessed whether infants are able to learn rules predicated on two abstract relations linked by negation: same and different (not same). In an anticipatory looking paradigm, the relation between successive colored geometrical shapes predicted the location where a puppet would appear next. In Experiment 1, 7-month-olds learned and generalized a rule predicated on the relation same, but not a rule predicated on the relation different. Similarly, in Experiment 2, 12-month-olds learned a rule predicated on the relation same-shape, but not a rule predicated on the relation different-shape. Comparing our data with that from previous experiments in the speech domain, we found no effect of age, modality or rule complexity. We conclude that, in the first year of life, infants already possess a representation of the abstract relation same, which serves as input to a rule. In contrast, we find no evidence that they represent the relation different. Copyright © 2018 Elsevier B.V. All rights reserved.
Educational Software for First Order Logic Semantics in Introductory Logic Courses
ERIC Educational Resources Information Center
Mauco, María Virginia; Ferrante, Enzo; Felice, Laura
2014-01-01
Basic courses on logic are common in most computer science curricula. Students often have difficulties in handling formalisms and getting familiar with them. Educational software helps to motivate and improve the teaching-learning processes. Therefore, incorporating these kinds of tools becomes important, because they contribute to gaining…
Macfarlane, Donald
2016-07-01
Medical records often contain free text created by harried clinicians. Free text often contains errors which make it an unsuitable target for computerized data extraction. The cost of healthcare can be reduced by creating medical records that are fully computerized at their inception. We examine hypotheses that enable us to construct such records. We regard the text of the medical record as being an ordered collection of meaningful fragments. The intellectual content (or "lexeme") of each text fragment in the record is considered separately from the language that used to express it. We further consider that each lexeme exists as a combination of a lexeme query (defining the issue being addressed) and a lexeme response to that query. The medical record can then be perceived as a stream of these responses. The responses can be expressed in any style or language, including computer code. Examining medical records in this light gives rise to a number of observations and hypotheses. The physical location and nature of the medical episode (which we term "context") determines the general layout of the record. The order that lexeme-queries are addressed in within the record is highly consistent ("coherence"). Issues are only addressed if they are logically called-for by the context or by a previously-selected lexeme response ("predicance"), and only to a needed depth of detail ("level"). We hypothesize that all of the lexeme queries required to write any clinical notes can be stored in a large database ("lexicon") in coherence order, wherein each lexeme query is associated with its own collection of lexeme responses. We hypothesize that the issue a note-writer will need to address next is identifiable purely by using the rules of coherence, level and predicance. We have tested these hypotheses with a computer program which repeatedly offers the user a menu of lexeme responses with associated text. On selection, the program issues the text fragment, and its corresponding computer code, to output files. The program then uses coherence, predicance and level to navigate to the next appropriate lexeme query for presentation to the user. The net result is that the user creates a grammatically correct and completely computerized note at the time of its inception. The value of this approach and its practical implementation to create medical records are discussed. In our work so far, the hypotheses appear not to be false, but further testing is needed using a larger lexicon to establish their robustness in actual clinical practice. Copyright © 2016 Elsevier Ltd. All rights reserved.
Two Properties of the Intransitive Resultative Construction.
ERIC Educational Resources Information Center
Miyamoto, Yoichi
1997-01-01
The report of research on English grammar argues that the intransitive resultative construction requires head-movement of the secondary predicate to the main predicate in order to assign the theta-role to the postverbal NP in LF. Then, this construction is taken as an instance in which theta-role assignment is derivational, supporting the findings…
Cairelli, Michael J.; Miller, Christopher M.; Fiszman, Marcelo; Workman, T. Elizabeth; Rindflesch, Thomas C.
2013-01-01
Applying the principles of literature-based discovery (LBD), we elucidate the paradox that obesity is beneficial in critical care despite contributing to disease generally. Our approach enhances a previous extension to LBD, called “discovery browsing,” and is implemented using Semantic MEDLINE, which summarizes the results of a PubMed search into an interactive graph of semantic predications. The methodology allows a user to construct argumentation underpinning an answer to a biomedical question by engaging the user in an iterative process between system output and user knowledge. Components of the Semantic MEDLINE output graph identified as “interesting” by the user both contribute to subsequent searches and are constructed into a logical chain of relationships constituting an explanatory network in answer to the initial question. Based on this methodology we suggest that phthalates leached from plastic in critical care interventions activate PPAR gamma, which is anti-inflammatory and abundant in obese patients. PMID:24551329
Knowledge bases built on web languages from the point of view of predicate logics
NASA Astrophysics Data System (ADS)
Vajgl, Marek; Lukasová, Alena; Žáček, Martin
2017-06-01
The article undergoes evaluation of formal systems created on the base of web (ontology/concept) languages by simplifying the usual approach of knowledge representation within the FOPL, but sharing its expressiveness, semantic correct-ness, completeness and decidability. Evaluation of two of them - that one based on description logic and that one built on RDF model principles - identifies some of the lacks of those formal systems and presents, if possible, corrections of them. Possibilities to build an inference system capable to obtain new further knowledge over given knowledge bases including those describing domains by giant linked domain databases has been taken into account. Moreover, the directions towards simplifying FOPL language discussed here has been evaluated from the point of view of a possibility to become a web language for fulfilling an idea of semantic web.
The Role of Guidance in Computer-Based Problem Solving for the Development of Concepts of Logic.
ERIC Educational Resources Information Center
Eysink, Tessa H. S.; Dijkstra, Sanne; Kuper, Jan
2002-01-01
Describes a study at the University of Twente (Netherlands) that investigated the effect of two instructional variables, manipulation of objects and guidance, in learning to use the logical connective, conditional with a computer-based learning environment, Tarski's World, designed to teach first-order logic. Discusses results of…
What is in a contour map? A region-based logical formalization of contour semantics
Usery, E. Lynn; Hahmann, Torsten
2015-01-01
This paper analyses and formalizes contour semantics in a first-order logic ontology that forms the basis for enabling computational common sense reasoning about contour information. The elicited contour semantics comprises four key concepts – contour regions, contour lines, contour values, and contour sets – and their subclasses and associated relations, which are grounded in an existing qualitative spatial ontology. All concepts and relations are illustrated and motivated by physical-geographic features identifiable on topographic contour maps. The encoding of the semantics of contour concepts in first-order logic and a derived conceptual model as basis for an OWL ontology lay the foundation for fully automated, semantically-aware qualitative and quantitative reasoning about contours.
ERIC Educational Resources Information Center
Perikos, Isidoros; Grivokostopoulou, Foteini; Hatzilygeroudis, Ioannis
2017-01-01
Logic as a knowledge representation and reasoning language is a fundamental topic of an Artificial Intelligence (AI) course and includes a number of sub-topics. One of them, which brings difficulties to students to deal with, is converting natural language (NL) sentences into first-order logic (FOL) formulas. To assist students to overcome those…
Design and Application of Strategies/Tactics in Higher Order Logics
NASA Technical Reports Server (NTRS)
Archer, Myla (Editor); diVito, Ben (Editor); Munoz, Cesar (Editor)
2003-01-01
This Proceedings includes both a paper from the implementors of PVS providing guidance for PVS strategy writers and a tutorial on PVS strategy writing distilled from the experience of three PVS users who have written extensive sets of PVS user strategies. Following these are three full papers from the higher-order logic theorem proving community that discuss PVS strategies to enhance arithmetic and other interactive reasoning in PVS; implementing first-order tactics in higher-order provers; and a proposed technique for specifying small step semantics that can be used in multiple higher order logic theorem provers, with illustrations from both Coq and PVS. The Proceedings concludes with three position papers for a panel session that discuss three settings in which development of PVS strategies is worth while.
Spatial Soliton Interactions for Photonic Switching. Part I
2000-03-07
technique , a fully vectorial, first-order nonlinear wave equation that consistently includes terms two -orders beyond the slowly-varying amplitude , slowly...by using two tunable mode-locked Er-doped fiber lasers ," in Conference on Optical Fiber Communications, OSA Technical Digest Series, vol. 4, 1994...instead, based on optical logic gates. In addition, optical logic could be used for contention resolution, real-time encryption /decryption, and other
Insights into the concept of fish welfare.
Volpato, Gilson Luiz; Gonçalves-de-Freitas, Eliane; Fernandes-de-Castilho, Marisa
2007-05-04
Fish welfare issues are predicated on understanding whether fish are sentient beings. Therefore, we analyzed the logic of the methodologies used for studying this attribute. We conclude that empirical science is unable to prove or to disprove that fish are sentient beings. Thus, we propose a combined ethical-scientific approach for considering fish as sentient beings. The most difficult ongoing question is to determine which conditions fish prefer. Approaches to assess fish preferences should be rigorously and cautiously employed. In light of these considerations, attempts to establish physiological standards for fish welfare are discouraged, and a preference-based definition of fish welfare is proposed.
Temporal logics and real time expert systems.
Blom, J A
1996-10-01
This paper introduces temporal logics. Due to the eternal compromise between expressive adequacy and reasoning efficiency that must decided upon in any application, full (first order logic or modal logic based) temporal logics are frequently not suitable. This is especially true in real time expert systems, where a fixed (and usually small) response time must be guaranteed. One such expert system, Fagan's VM, is reviewed, and a delineation is given of how to formally describe and reason with time in medical protocols. It is shown that Petri net theory is a useful tool to check the correctness of formalised protocols.
Interpretation of IEEE-854 floating-point standard and definition in the HOL system
NASA Technical Reports Server (NTRS)
Carreno, Victor A.
1995-01-01
The ANSI/IEEE Standard 854-1987 for floating-point arithmetic is interpreted by converting the lexical descriptions in the standard into mathematical conditional descriptions organized in tables. The standard is represented in higher-order logic within the framework of the HOL (Higher Order Logic) system. The paper is divided in two parts with the first part the interpretation and the second part the description in HOL.
Research in mathematical theory of computation. [computer programming applications
NASA Technical Reports Server (NTRS)
Mccarthy, J.
1973-01-01
Research progress in the following areas is reviewed: (1) new version of computer program LCF (logic for computable functions) including a facility to search for proofs automatically; (2) the description of the language PASCAL in terms of both LCF and in first order logic; (3) discussion of LISP semantics in LCF and attempt to prove the correctness of the London compilers in a formal way; (4) design of both special purpose and domain independent proving procedures specifically program correctness in mind; (5) design of languages for describing such proof procedures; and (6) the embedding of ideas in the first order checker.
Reasoning with Vectors: A Continuous Model for Fast Robust Inference.
Widdows, Dominic; Cohen, Trevor
2015-10-01
This paper describes the use of continuous vector space models for reasoning with a formal knowledge base. The practical significance of these models is that they support fast, approximate but robust inference and hypothesis generation, which is complementary to the slow, exact, but sometimes brittle behavior of more traditional deduction engines such as theorem provers. The paper explains the way logical connectives can be used in semantic vector models, and summarizes the development of Predication-based Semantic Indexing, which involves the use of Vector Symbolic Architectures to represent the concepts and relationships from a knowledge base of subject-predicate-object triples. Experiments show that the use of continuous models for formal reasoning is not only possible, but already demonstrably effective for some recognized informatics tasks, and showing promise in other traditional problem areas. Examples described in this paper include: predicting new uses for existing drugs in biomedical informatics; removing unwanted meanings from search results in information retrieval and concept navigation; type-inference from attributes; comparing words based on their orthography; and representing tabular data, including modelling numerical values. The algorithms and techniques described in this paper are all publicly released and freely available in the Semantic Vectors open-source software package.
Reasoning with Vectors: A Continuous Model for Fast Robust Inference
Widdows, Dominic; Cohen, Trevor
2015-01-01
This paper describes the use of continuous vector space models for reasoning with a formal knowledge base. The practical significance of these models is that they support fast, approximate but robust inference and hypothesis generation, which is complementary to the slow, exact, but sometimes brittle behavior of more traditional deduction engines such as theorem provers. The paper explains the way logical connectives can be used in semantic vector models, and summarizes the development of Predication-based Semantic Indexing, which involves the use of Vector Symbolic Architectures to represent the concepts and relationships from a knowledge base of subject-predicate-object triples. Experiments show that the use of continuous models for formal reasoning is not only possible, but already demonstrably effective for some recognized informatics tasks, and showing promise in other traditional problem areas. Examples described in this paper include: predicting new uses for existing drugs in biomedical informatics; removing unwanted meanings from search results in information retrieval and concept navigation; type-inference from attributes; comparing words based on their orthography; and representing tabular data, including modelling numerical values. The algorithms and techniques described in this paper are all publicly released and freely available in the Semantic Vectors open-source software package.1 PMID:26582967
Learning, Realizability and Games in Classical Arithmetic
NASA Astrophysics Data System (ADS)
Aschieri, Federico
2010-12-01
In this dissertation we provide mathematical evidence that the concept of learning can be used to give a new and intuitive computational semantics of classical proofs in various fragments of Predicative Arithmetic. First, we extend Kreisel modified realizability to a classical fragment of first order Arithmetic, Heyting Arithmetic plus EM1 (Excluded middle axiom restricted to Sigma^0_1 formulas). We introduce a new realizability semantics we call "Interactive Learning-Based Realizability". Our realizers are self-correcting programs, which learn from their errors and evolve through time. Secondly, we extend the class of learning based realizers to a classical version PCFclass of PCF and, then, compare the resulting notion of realizability with Coquand game semantics and prove a full soundness and completeness result. In particular, we show there is a one-to-one correspondence between realizers and recursive winning strategies in the 1-Backtracking version of Tarski games. Third, we provide a complete and fully detailed constructive analysis of learning as it arises in learning based realizability for HA+EM1, Avigad's update procedures and epsilon substitution method for Peano Arithmetic PA. We present new constructive techniques to bound the length of learning processes and we apply them to reprove - by means of our theory - the classic result of Godel that provably total functions of PA can be represented in Godel's system T. Last, we give an axiomatization of the kind of learning that is needed to computationally interpret Predicative classical second order Arithmetic. Our work is an extension of Avigad's and generalizes the concept of update procedure to the transfinite case. Transfinite update procedures have to learn values of transfinite sequences of non computable functions in order to extract witnesses from classical proofs.
Jorge-Botana, Guillermo; Olmos, Ricardo; León, José Antonio
2009-11-01
There is currently a widespread interest in indexing and extracting taxonomic information from large text collections. An example is the automatic categorization of informally written medical or psychological diagnoses, followed by the extraction of epidemiological information or even terms and structures needed to formulate guiding questions as an heuristic tool for helping doctors. Vector space models have been successfully used to this end (Lee, Cimino, Zhu, Sable, Shanker, Ely & Yu, 2006; Pakhomov, Buntrock & Chute, 2006). In this study we use a computational model known as Latent Semantic Analysis (LSA) on a diagnostic corpus with the aim of retrieving definitions (in the form of lists of semantic neighbors) of common structures it contains (e.g. "storm phobia", "dog phobia") or less common structures that might be formed by logical combinations of categories and diagnostic symptoms (e.g. "gun personality" or "germ personality"). In the quest to bring definitions into line with the meaning of structures and make them in some way representative, various problems commonly arise while recovering content using vector space models. We propose some approaches which bypass these problems, such as Kintsch's (2001) predication algorithm and some corrections to the way lists of neighbors are obtained, which have already been tested on semantic spaces in a non-specific domain (Jorge-Botana, León, Olmos & Hassan-Montero, under review). The results support the idea that the predication algorithm may also be useful for extracting more precise meanings of certain structures from scientific corpora, and that the introduction of some corrections based on vector length may increases its efficiency on non-representative terms.
The Nature of Quantum Truth: Logic, Set Theory, & Mathematics in the Context of Quantum Theory
NASA Astrophysics Data System (ADS)
Frey, Kimberly
The purpose of this dissertation is to construct a radically new type of mathematics whose underlying logic differs from the ordinary classical logic used in standard mathematics, and which we feel may be more natural for applications in quantum mechanics. Specifically, we begin by constructing a first order quantum logic, the development of which closely parallels that of ordinary (classical) first order logic --- the essential differences are in the nature of the logical axioms, which, in our construction, are motivated by quantum theory. After showing that the axiomatic first order logic we develop is sound and complete (with respect to a particular class of models), this logic is then used as a foundation on which to build (axiomatic) mathematical systems --- and we refer to the resulting new mathematics as "quantum mathematics." As noted above, the hope is that this form of mathematics is more natural than classical mathematics for the description of quantum systems, and will enable us to address some foundational aspects of quantum theory which are still troublesome --- e.g. the measurement problem --- as well as possibly even inform our thinking about quantum gravity. After constructing the underlying logic, we investigate properties of several mathematical systems --- e.g. axiom systems for abstract algebras, group theory, linear algebra, etc. --- in the presence of this quantum logic. In the process, we demonstrate that the resulting quantum mathematical systems have some strange, but very interesting features, which indicates a richness in the structure of mathematics that is classically inaccessible. Moreover, some of these features do indeed suggest possible applications to foundational questions in quantum theory. We continue our investigation of quantum mathematics by constructing an axiomatic quantum set theory, which we show satisfies certain desirable criteria. Ultimately, we hope that such a set theory will lead to a foundation for quantum mathematics in a sense which parallels the foundational role of classical set theory in classical mathematics. One immediate application of the quantum set theory we develop is to provide a foundation on which to construct quantum natural numbers, which are the quantum analog of the classical counting numbers. It turns out that in a special class of models, there exists a 1-1 correspondence between the quantum natural numbers and bounded observables in quantum theory whose eigenvalues are (ordinary) natural numbers. This 1-1 correspondence is remarkably satisfying, and not only gives us great confidence in our quantum set theory, but indicates the naturalness of such models for quantum theory itself. We go on to develop a Peano-like arithmetic for these new "numbers," as well as consider some of its consequences. Finally, we conclude by summarizing our results, and discussing directions for future work.
Weighted Description Logics Preference Formulas for Multiattribute Negotiation
NASA Astrophysics Data System (ADS)
Ragone, Azzurra; di Noia, Tommaso; Donini, Francesco M.; di Sciascio, Eugenio; Wellman, Michael P.
We propose a framework to compute the utility of an agreement w.r.t a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas in a decidable fragment of First-order Logic and agreements expressed as a formula. We ground our framework in Description Logics (DL) endowed with disjunction, to be compliant with Semantic Web technologies. A logic based approach to preference representation allows, when a background knowledge base is exploited, to relax the often unrealistic assumption of additive independence among attributes. We provide suitable definitions of the problem and present algorithms to compute utility in our setting. We also validate our approach through an experimental evaluation.
Grabocka, Elda; Bar-Sagi, Dafna; Mishra, Bud
2016-01-01
Hypoxia in tumors signifies resistance to therapy. Despite a wealth of tumor histology data, including anti-pimonidazole staining, no current methods use these data to induce a quantitative characterization of chronic tumor hypoxia in time and space. We use image-processing algorithms to develop a set of candidate image features that can formulate just such a quantitative description of xenographed colorectal chronic tumor hypoxia. Two features in particular give low-variance measures of chronic hypoxia near a vessel: intensity sampling that extends radially away from approximated blood vessel centroids, and multithresholding to segment tumor tissue into normal, hypoxic, and necrotic regions. From these features we derive a spatiotemporal logical expression whose truth value depends on its predicate clauses that are grounded in this histological evidence. As an alternative to the spatiotemporal logical formulation, we also propose a way to formulate a linear regression function that uses all of the image features to learn what chronic hypoxia looks like, and then gives a quantitative similarity score once it is trained on a set of histology images. PMID:27093539
Efficient reordering of PROLOG programs
NASA Technical Reports Server (NTRS)
Gooley, Markian M.; Wah, Benjamin W.
1989-01-01
PROLOG programs are often inefficient: execution corresponds to a depth-first traversal of an AND/OR graph; traversing subgraphs in another order can be less expensive. It is shown how the reordering of clauses within PROLOG predicates, and especially of goals within clauses, can prevent unnecessary search. The characterization and detection of restrictions on reordering is discussed. A system of calling modes for PROLOG, geared to reordering, is proposed, and ways to infer them automatically are discussed. The information needed for safe reordering is summarized, and which types can be inferred automatically and which must be provided by the user are considered. An improved method for determining a good order for the goals of PROLOG clauses is presented and used as the basis for a reordering system.
A novel approach to describing and detecting performance anti-patterns
NASA Astrophysics Data System (ADS)
Sheng, Jinfang; Wang, Yihan; Hu, Peipei; Wang, Bin
2017-08-01
Anti-pattern, as an extension to pattern, describes a widely used poor solution which can bring negative influence to application systems. Aiming at the shortcomings of the existing anti-pattern descriptions, an anti-pattern description method based on first order predicate is proposed. This method synthesizes anti-pattern forms and symptoms, which makes the description more accurate and has good scalability and versatility as well. In order to improve the accuracy of anti-pattern detection, a Bayesian classification method is applied in validation for detection results, which can reduce false negatives and false positives of anti-pattern detection. Finally, the proposed approach in this paper is applied to a small e-commerce system, the feasibility and effectiveness of the approach is demonstrated further through experiments.
Earthquakes Magnitude Predication Using Artificial Neural Network in Northern Red Sea Area
NASA Astrophysics Data System (ADS)
Alarifi, A. S.; Alarifi, N. S.
2009-12-01
Earthquakes are natural hazards that do not happen very often, however they may cause huge losses in life and property. Early preparation for these hazards is a key factor to reduce their damage and consequence. Since early ages, people tried to predicate earthquakes using simple observations such as strange or a typical animal behavior. In this paper, we study data collected from existing earthquake catalogue to give better forecasting for future earthquakes. The 16000 events cover a time span of 1970 to 2009, the magnitude range from greater than 0 to less than 7.2 while the depth range from greater than 0 to less than 100km. We propose a new artificial intelligent predication system based on artificial neural network, which can be used to predicate the magnitude of future earthquakes in northern Red Sea area including the Sinai Peninsula, the Gulf of Aqaba, and the Gulf of Suez. We propose a feed forward new neural network model with multi-hidden layers to predicate earthquakes occurrences and magnitudes in northern Red Sea area. Although there are similar model that have been published before in different areas, to our best knowledge this is the first neural network model to predicate earthquake in northern Red Sea area. Furthermore, we present other forecasting methods such as moving average over different interval, normally distributed random predicator, and uniformly distributed random predicator. In addition, we present different statistical methods and data fitting such as linear, quadratic, and cubic regression. We present a details performance analyses of the proposed methods for different evaluation metrics. The results show that neural network model provides higher forecast accuracy than other proposed methods. The results show that neural network achieves an average absolute error of 2.6% while an average absolute error of 3.8%, 7.3% and 6.17% for moving average, linear regression and cubic regression, respectively. In this work, we show an analysis of earthquakes data in northern Red Sea area for different statistics parameters such as correlation, mean, standard deviation, and other. This analysis is to provide a deep understand of the Seismicity of the area, and existing patterns.
Interpreting Abstract Interpretations in Membership Equational Logic
NASA Technical Reports Server (NTRS)
Fischer, Bernd; Rosu, Grigore
2001-01-01
We present a logical framework in which abstract interpretations can be naturally specified and then verified. Our approach is based on membership equational logic which extends equational logics by membership axioms, asserting that a term has a certain sort. We represent an abstract interpretation as a membership equational logic specification, usually as an overloaded order-sorted signature with membership axioms. It turns out that, for any term, its least sort over this specification corresponds to its most concrete abstract value. Maude implements membership equational logic and provides mechanisms to calculate the least sort of a term efficiently. We first show how Maude can be used to get prototyping of abstract interpretations "for free." Building on the meta-logic facilities of Maude, we further develop a tool that automatically checks and abstract interpretation against a set of user-defined properties. This can be used to select an appropriate abstract interpretation, to characterize the specified loss of information during abstraction, and to compare different abstractions with each other.
ERIC Educational Resources Information Center
Speckman, McGlory
2016-01-01
Predicated on the principles of success and contextuality, this chapter shares an African perspective on a first-year adjustment programme, known as First-Year Village, including its potential and challenges in establishing it.
The emergence of embedded structure: insights from Kafr Qasem Sign Language
Kastner, Itamar; Meir, Irit; Sandler, Wendy; Dachkovsky, Svetlana
2014-01-01
This paper introduces data from Kafr Qasem Sign Language (KQSL), an as-yet undescribed sign language, and identifies the earliest indications of embedding in this young language. Using semantic and prosodic criteria, we identify predicates that form a constituent with a noun, functionally modifying it. We analyze these structures as instances of embedded predicates, exhibiting what can be regarded as very early stages in the development of subordinate constructions, and argue that these structures may bear directly on questions about the development of embedding and subordination in language in general. Deutscher (2009) argues persuasively that nominalization of a verb is the first step—and the crucial step—toward syntactic embedding. It has also been suggested that prosodic marking may precede syntactic marking of embedding (Mithun, 2009). However, the relevant data from the stage at which embedding first emerges have not previously been available. KQSL might be the missing piece of the puzzle: a language in which a noun can be modified by an additional predicate, forming a proposition within a proposition, sustained entirely by prosodic means. PMID:24917837
Logic integer programming models for signaling networks.
Haus, Utz-Uwe; Niermann, Kathrin; Truemper, Klaus; Weismantel, Robert
2009-05-01
We propose a static and a dynamic approach to model biological signaling networks, and show how each can be used to answer relevant biological questions. For this, we use the two different mathematical tools of Propositional Logic and Integer Programming. The power of discrete mathematics for handling qualitative as well as quantitative data has so far not been exploited in molecular biology, which is mostly driven by experimental research, relying on first-order or statistical models. The arising logic statements and integer programs are analyzed and can be solved with standard software. For a restricted class of problems the logic models reduce to a polynomial-time solvable satisfiability algorithm. Additionally, a more dynamic model enables enumeration of possible time resolutions in poly-logarithmic time. Computational experiments are included.
Web mining for topics defined by complex and precise predicates
NASA Astrophysics Data System (ADS)
Lee, Ching-Cheng; Sampathkumar, Sushma
2004-04-01
The enormous growth of the World Wide Web has made it important to perform resource discovery efficiently for any given topic. Several new techniques have been proposed in the recent years for this kind of topic specific web-mining, and among them a key new technique called focused crawling which is able to crawl topic-specific portions of the web without having to explore all pages. Most existing research on focused crawling considers a simple topic definition that typically consists of one or more keywords connected by an OR operator. However this kind of simple topic definition may result in too many irrelevant pages in which the same keyword appears in a wrong context. In this research we explore new strategies for crawling topic specific portions of the web using complex and precise predicates. A complex predicate will allow the user to precisely specify a topic using Boolean operators such as "AND", "OR" and "NOT". Our work will concentrate on defining a format to specify this kind of a complex topic definition and secondly on devising a crawl strategy to crawl the topic specific portions of the web defined by the complex predicate, efficiently and with minimal overhead. Our new crawl strategy will improve the performance of topic-specific web crawling by reducing the number of irrelevant pages crawled. In order to demonstrate the effectiveness of the above approach, we have built a complete focused crawler called "Eureka" with complex predicate support, and a search engine that indexes and supports end-user searches on the crawled pages.
A Framework for Building and Reasoning with Adaptive and Interoperable PMESII Models
2007-11-01
Description Logic SOA Service Oriented Architecture SPARQL Simple Protocol And RDF Query Language SQL Standard Query Language SROM Stability and...another by providing a more expressive ontological structure for one of the models, e.g., semantic networks can be mapped to first- order logical...Pellet is an open-source reasoner that works with OWL-DL. It accepts the SPARQL protocol and RDF query language ( SPARQL ) and provides a Java API to
Integrating a Hypernymic Proposition Interpreter into a Semantic Processor for Biomedical Texts
Fiszman, Marcelo; Rindflesch, Thomas C.; Kilicoglu, Halil
2003-01-01
Semantic processing provides the potential for producing high quality results in natural language processing (NLP) applications in the biomedical domain. In this paper, we address a specific semantic phenomenon, the hypernymic proposition, and concentrate on integrating the interpretation of such predications into a more general semantic processor in order to improve overall accuracy. A preliminary evaluation assesses the contribution of hypernymic propositions in providing more specific semantic predications and thus improving effectiveness in retrieving treatment propositions in MEDLINE abstracts. Finally, we discuss the generalization of this methodology to additional semantic propositions as well as other types of biomedical texts. PMID:14728170
NASA Astrophysics Data System (ADS)
Bristow, Quentin
1990-03-01
The occurrence rates of pulse strings, or sequences of pulses with interarrival times less than the resolving time of the pulse-height analysis system used to acquire spectra, are derived from theoretical considerations. Logic circuits were devised to make experimental measurements of multiple pulse string occurrence rates in the output from a scintillation detector over a wide range of count rates. Markov process theory was used to predict state transition rates in the logic circuits, enabling the experimental data to be checked rigorously for conformity with those predicted for a Poisson distribution. No fundamental discrepancies were observed. Monte Carlo simulations, incorporating criteria for pulse pileup inherent in the operation of modern analog to digital converters, were used to generate pileup spectra due to coincidences between two pulses (first order pileup) and three pulses (second order pileup) for different semi-Gaussian pulse shapes. Coincidences between pulses in a single channel produced a basic probability density function spectrum. The use of a flat spectrum showed the first order pileup distorted the spectrum to a linear ramp with a pileup tail. A correction algorithm was successfully applied to correct entire spectra (simulated and real) for first and second order pileups.
Kill the song—steal the show: what does distinguish predicative metaphors from decomposable idioms?
Caillies, Stéphanie; Declercq, Christelle
2011-06-01
This study examined the semantic processing difference between decomposable idioms and novel predicative metaphors. It was hypothesized that idiom comprehension results from the retrieval of a figurative meaning stored in memory, that metaphor comprehension requires a sense creation process and that this process difference affects the processing time of idiomatic and metaphoric expressions. In the first experiment, participants read sentences containing decomposable idioms, predicative metaphors or control expressions and performed a lexical decision task on figurative targets presented 0, 350, and 500 ms, or 750 after reading. Results demonstrated that idiomatic expressions were processed sooner than metaphoric ones. In the second experiment, participants were asked to assess the meaningfulness of idiomatic, metaphoric and literal expressions after reading a verb prime that belongs to the target phrase (identity priming). The results showed that verb identity priming was stronger for idiomatic expressions than for metaphor ones, indicating different mental representations.
Kang, Hyunchul
2015-01-01
We investigate the in-network processing of an iceberg join query in wireless sensor networks (WSNs). An iceberg join is a special type of join where only those joined tuples whose cardinality exceeds a certain threshold (called iceberg threshold) are qualified for the result. Processing such a join involves the value matching for the join predicate as well as the checking of the cardinality constraint for the iceberg threshold. In the previous scheme, the value matching is carried out as the main task for filtering non-joinable tuples while the iceberg threshold is treated as an additional constraint. We take an alternative approach, meeting the cardinality constraint first and matching values next. In this approach, with a logical fragmentation of the join operand relations on the aggregate counts of the joining attribute values, the optimal sequence of 2-way fragment semijoins is generated, where each fragment semijoin employs a Bloom filter as a synopsis of the joining attribute values. This sequence filters non-joinable tuples in an energy-efficient way in WSNs. Through implementation and a set of detailed experiments, we show that our alternative approach considerably outperforms the previous one. PMID:25774710
Dynamic Order Algebras as an Axiomatization of Modal and Tense Logics
NASA Astrophysics Data System (ADS)
Chajda, Ivan; Paseka, Jan
2015-12-01
The aim of the paper is to introduce and describe tense operators in every propositional logic which is axiomatized by means of an algebra whose underlying structure is a bounded poset or even a lattice. We introduce the operators G, H, P and F without regard what propositional connectives the logic includes. For this we use the axiomatization of universal quantifiers as a starting point and we modify these axioms for our reasons. At first, we show that the operators can be recognized as modal operators and we study the pairs ( P, G) as the so-called dynamic order pairs. Further, we get constructions of these operators in the corresponding algebra provided a time frame is given. Moreover, we solve the problem of finding a time frame in the case when the tense operators are given. In particular, any tense algebra is representable in its Dedekind-MacNeille completion. Our approach is fully general, we do not relay on the logic under consideration and hence it is applicable in all the up to now known cases.
Toward Ada Verification: A Collection of Relevant Topics
1986-06-01
presumably it is this- if there are no default values, a programming error which results in failure to initialize a variable is more likely to advertise ... disavantages tu using AVID. First, TDL is a more complicated interface than first-order logic (as used in the CSG). Second, AVID is unsupported and
Discovery of Predicate-Oriented Relations among Named Entities Extracted from Thai Texts
NASA Astrophysics Data System (ADS)
Tongtep, Nattapong; Theeramunkong, Thanaruk
Extracting named entities (NEs) and their relations is more difficult in Thai than in other languages due to several Thai specific characteristics, including no explicit boundaries for words, phrases and sentences; few case markers and modifier clues; high ambiguity in compound words and serial verbs; and flexible word orders. Unlike most previous works which focused on NE relations of specific actions, such as work_for, live_in, located_in, and kill, this paper proposes more general types of NE relations, called predicate-oriented relation (PoR), where an extracted action part (verb) is used as a core component to associate related named entities extracted from Thai Texts. Lacking a practical parser for the Thai language, we present three types of surface features, i.e. punctuation marks (such as token spaces), entity types and the number of entities and then apply five alternative commonly used learning schemes to investigate their performance on predicate-oriented relation extraction. The experimental results show that our approach achieves the F-measure of 97.76%, 99.19%, 95.00% and 93.50% on four different types of predicate-oriented relation (action-location, location-action, action-person and person-action) in crime-related news documents using a data set of 1,736 entity pairs. The effects of NE extraction techniques, feature sets and class unbalance on the performance of relation extraction are explored.
CAFE: Computer aided fabric evaluation
DOE Office of Scientific and Technical Information (OSTI.GOV)
Sims, J.E.
1994-05-06
With the intent of automating the inspection of color printed fabrics for defects, the Engineering Research Division of the Lawrence Livermore National Laboratory in addition with several other national labs, in conjunction with the textile industry has initiated the CAFE project. The projects objective is predicated on the development, implementation and testing of an algorithm for the inspection of color printed fabrics. We attempt to take advantage of the wide ranging applications possible with Computer Vision in order to achieve this. The first job of the algorithm is to teach the computer the {open_quote}correct{close_quote} repeat as the reference, tests themore » remaining repeats in the pattern. There are two different ways to go about doing the first job and with this paper we will describe both methods.« less
Hybrid ontology for semantic information retrieval model using keyword matching indexing system.
Uthayan, K R; Mala, G S Anandha
2015-01-01
Ontology is the process of growth and elucidation of concepts of an information domain being common for a group of users. Establishing ontology into information retrieval is a normal method to develop searching effects of relevant information users require. Keywords matching process with historical or information domain is significant in recent calculations for assisting the best match for specific input queries. This research presents a better querying mechanism for information retrieval which integrates the ontology queries with keyword search. The ontology-based query is changed into a primary order to predicate logic uncertainty which is used for routing the query to the appropriate servers. Matching algorithms characterize warm area of researches in computer science and artificial intelligence. In text matching, it is more dependable to study semantics model and query for conditions of semantic matching. This research develops the semantic matching results between input queries and information in ontology field. The contributed algorithm is a hybrid method that is based on matching extracted instances from the queries and information field. The queries and information domain is focused on semantic matching, to discover the best match and to progress the executive process. In conclusion, the hybrid ontology in semantic web is sufficient to retrieve the documents when compared to standard ontology.
Hybrid Ontology for Semantic Information Retrieval Model Using Keyword Matching Indexing System
Uthayan, K. R.; Anandha Mala, G. S.
2015-01-01
Ontology is the process of growth and elucidation of concepts of an information domain being common for a group of users. Establishing ontology into information retrieval is a normal method to develop searching effects of relevant information users require. Keywords matching process with historical or information domain is significant in recent calculations for assisting the best match for specific input queries. This research presents a better querying mechanism for information retrieval which integrates the ontology queries with keyword search. The ontology-based query is changed into a primary order to predicate logic uncertainty which is used for routing the query to the appropriate servers. Matching algorithms characterize warm area of researches in computer science and artificial intelligence. In text matching, it is more dependable to study semantics model and query for conditions of semantic matching. This research develops the semantic matching results between input queries and information in ontology field. The contributed algorithm is a hybrid method that is based on matching extracted instances from the queries and information field. The queries and information domain is focused on semantic matching, to discover the best match and to progress the executive process. In conclusion, the hybrid ontology in semantic web is sufficient to retrieve the documents when compared to standard ontology. PMID:25922851
Logical account of a terminological tool
NASA Astrophysics Data System (ADS)
Bresciani, Paolo
1991-03-01
YAK (Yet Another Krapfen) is a hybrid knowledge representation environment following the tradition of KL-ONE and KRYPTON. In its terminological box (TBOX) concepts and roles are described by means of a language called KFL that, even if inspired to FL-, captures a different set of descriptions, especially allowing the formulation of structured roles, that are aimed to be more adequate for the representational goal. KFL results to have a valid and complete calculus for the notion of subsumption, and a tractable algorithm that realize it is available. In the present paper it is shown how the semantics of a sufficiently significative subset of KFL can be described in terms of standard first order logic semantics. It is so possible to develop a notion of 'relation' between KFL and a full first order logic language formulated ad hoc and usable as formalization of an assertional box (ABOX). We then use this notion to justify the use of the terminological classification algorithm of the TBOX of YAK as part of the deduction machinery of the ABOX. In this way, the whole hybrid environment can take real and consistent advantages both from the TBOX and its tractable classification algorithm, and from the ABOX, and its wider expressive capability.
Reasoning by Augmenting a Description Logic Reasoner (Phase 1)
2006-04-28
procedures for the guarded fragment, a fragment of FOL that in- cludes many description logics [11]. The most widely known work in this area was by Hustadt ...transformed into a FO task that uses the theory. Unlike methods such as Hustadt and Schmidt’s functional translation, this does not result in a decision...Reasoning (KR 2000), pages 285–296, 2000. [26] U. Hustadt and R. A. Schmidt. MSPASS: Modal reasoning by translation and first-order resolution. In R
A Non-reductionist Approach to Trust
NASA Astrophysics Data System (ADS)
Castelfranchi, Cristiano; Falcone, Rino; Lorini, Emiliano
We develop in this chapter a conceptual and logical model of social trust. We first present a modal logic of mental attitudes and action in which the concepts of plausible belief, certain belief, and a possibility order over formulas can be characterized. Then, we apply the logic to the formalization of the truster's expectation about some fundamental properties of the trustee (trustee's opportunity to accomplish a given task, his skills, abilities, and willingness to perform a given action for the accomplishment of the task). A, part of this chapter is devoted to discuss and formalize some concepts related to trust such as distrust, mistrust, lack of trust, and delegation. Finally, a concept of comparative trust is presented.
Representational System Predicate Use and Convergence in Counseling: Gloria Revisited.
ERIC Educational Resources Information Center
Mercier, Mary Ann; Johnson, Marilyn
1984-01-01
Analayzed transcripts of Three Approaches to Psychotherapy (Shostrom, 1966) for counselor and client representational system predicate use. Although different patterns of predicate use emerged, only limited support for Neurolinguistic Programming theory was found. The findings of different patterns of predicate use were related to convergence and…
Polite Plurals and Predicate Agreement
ERIC Educational Resources Information Center
Comrie, Bernard
1975-01-01
Data from a number of language (Slavic, Romance, Modern Greek) concerning predicate agreement with the polite plural (semantically singular, but plural in surface structure) suggest that more verb-like predicates tend to agree with the surface subject, while more noun-like predicates tend to agree with the underlying subject. (Author/KM)
Being Something: Prospects for a Property-Based Approach to Predicative Quantification
ERIC Educational Resources Information Center
Rieppel, Michael Olivier
2013-01-01
Few questions concerning the character of our talk about the world are more basic than how predicates combine with names to form truth-evaluable sentences. One particularly intriguing fact that any account of predication needs to make room for is that natural language allows for quantification into predicate position, through constructions like…
Tool for a configurable integrated circuit that uses determination of dynamic power consumption
NASA Technical Reports Server (NTRS)
Davoodi, Azadeh (Inventor); French, Matthew C. (Inventor); Agarwal, Deepak (Inventor); Wang, Li (Inventor)
2011-01-01
A configurable logic tool that allows minimization of dynamic power within an FPGA design without changing user-entered specifications. The minimization of power may use minimized clock nets as a first order operation, and a second order operation that minimizes other factors, such as area of placement, area of clocks and/or slack.
The spatiotemporal order of signaling events unveils the logic of development signaling.
Zhu, Hao; Owen, Markus R; Mao, Yanlan
2016-08-01
Animals from worms and insects to birds and mammals show distinct body plans; however, the embryonic development of diverse body plans with tissues and organs within is controlled by a surprisingly few signaling pathways. It is well recognized that combinatorial use of and dynamic interactions among signaling pathways follow specific logic to control complex and accurate developmental signaling and patterning, but it remains elusive what such logic is, or even, what it looks like. We have developed a computational model for Drosophila eye development with innovated methods to reveal how interactions among multiple pathways control the dynamically generated hexagonal array of R8 cells. We obtained two novel findings. First, the coupling between the long-range inductive signals produced by the proneural Hh signaling and the short-range restrictive signals produced by the antineural Notch and EGFR signaling is essential for generating accurately spaced R8s. Second, the spatiotemporal orders of key signaling events reveal a robust pattern of lateral inhibition conducted by Ato-coordinated Notch and EGFR signaling to collectively determine R8 patterning. This pattern, stipulating the orders of signaling and comparable to the protocols of communication, may help decipher the well-appreciated but poorly defined logic of developmental signaling. The model is available upon request. hao.zhu@ymail.com Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press.
The spatiotemporal order of signaling events unveils the logic of development signaling
Zhu, Hao; Owen, Markus R.; Mao, Yanlan
2016-01-01
Motivation: Animals from worms and insects to birds and mammals show distinct body plans; however, the embryonic development of diverse body plans with tissues and organs within is controlled by a surprisingly few signaling pathways. It is well recognized that combinatorial use of and dynamic interactions among signaling pathways follow specific logic to control complex and accurate developmental signaling and patterning, but it remains elusive what such logic is, or even, what it looks like. Results: We have developed a computational model for Drosophila eye development with innovated methods to reveal how interactions among multiple pathways control the dynamically generated hexagonal array of R8 cells. We obtained two novel findings. First, the coupling between the long-range inductive signals produced by the proneural Hh signaling and the short-range restrictive signals produced by the antineural Notch and EGFR signaling is essential for generating accurately spaced R8s. Second, the spatiotemporal orders of key signaling events reveal a robust pattern of lateral inhibition conducted by Ato-coordinated Notch and EGFR signaling to collectively determine R8 patterning. This pattern, stipulating the orders of signaling and comparable to the protocols of communication, may help decipher the well-appreciated but poorly defined logic of developmental signaling. Availability and implementation: The model is available upon request. Contact: hao.zhu@ymail.com Supplementary information: Supplementary data are available at Bioinformatics online. PMID:27153573
NASA Astrophysics Data System (ADS)
Boubakir, A.; Boudjema, F.; Boubakir, C.
2008-06-01
This paper proposes an approach of hybrid control that is based on the concept of combining fuzzy logic and the methodology of sliding mode control (SMC). In the present works, a first-order nonlinear sliding surface is presented, on which the developed control law is based. Mathematical proof for the stability and convergence of the system is presented. In order to reduce the chattering in sliding mode control, a fixed boundary layer around the switch surface is used. Within the boundary layer, since the fuzzy logic control is applied, the chattering phenomenon, which is inherent in a sliding mode control, is avoided by smoothing the switch signal. Outside the boundary, the sliding mode control is applied to driving the system states into the boundary layer. Experimental studies carried out on a coupled Tanks system indicate that the proposed fuzzy sliding mode control (FSMC) is a good candidate for control applications.
Bio-logic analysis of injury biomarker patterns in human serum samples.
Zhou, Jian; Halámek, Jan; Bocharova, Vera; Wang, Joseph; Katz, Evgeny
2011-01-15
Digital biosensor systems analyzing biomarkers characteristic of liver injury (LI), soft tissue injury (STI) and abdominal trauma (ABT) were developed and optimized for their performance in serum solutions spiked with injury biomarkers in order to mimic real medical samples. The systems produced 'Alert'-type optical output signals in the form of "YES-NO" separated by a threshold value. The new approach aims at the reliable detection of injury biomarkers for making autonomous decisions towards timely therapeutic interventions, particularly in conditions when a hospital treatment is not possible. The enzyme-catalyzed reactions performing Boolean AND/NAND logic operations in the presence of different combinations of the injury biomarkers allowed high-fidelity biosensing. Robustness of the systems was confirmed by their operation in serum solutions, representing the first example of chemically performed logic analysis of biological fluids and a step closer towards practical biomedical applications of enzyme-logic bioassays. Copyright © 2010 Elsevier B.V. All rights reserved.
NASA Astrophysics Data System (ADS)
Liu, Tianqi; Yang, Zhenlei; Guo, Jinlong; Du, Guanghua; Tong, Teng; Wang, Xiaohui; Su, Hong; Liu, Wenjing; Liu, Jiande; Wang, Bin; Ye, Bing; Liu, Jie
2017-08-01
The heavy-ion imaging of single event upset (SEU) in a flash-based field programmable gate array (FPGA) device was carried out for the first time at Heavy Ion Research Facility in Lanzhou (HIRFL). The three shift register chains with separated input and output configurations in device under test (DUT) were used to identify the corresponding logical area rapidly once an upset occurred. The logic units in DUT were partly configured in order to distinguish the registers in SEU images. Based on the above settings, the partial architecture of shift register chains in DUT was imaged by employing the microbeam of 86Kr ion with energy of 25 MeV/u in air. The results showed that the physical distribution of registers in DUT had a high consistency with its logical arrangement by comparing SEU image with logic configuration in scanned area.
32 CFR 105.9 - Commander and management procedures.
Code of Federal Regulations, 2013 CFR
2013-07-01
... expedited transfer, the Service member must affirmatively change his or her reporting option to Unrestricted... replacement order. (ii) The issuing commander shall notify the appropriate civilian authorities of any change... command climate of sexual assault prevention predicated on mutual respect and trust, recognizes and...
32 CFR 105.9 - Commander and management procedures.
Code of Federal Regulations, 2014 CFR
2014-07-01
... expedited transfer, the Service member must affirmatively change his or her reporting option to Unrestricted... replacement order. (ii) The issuing commander shall notify the appropriate civilian authorities of any change... command climate of sexual assault prevention predicated on mutual respect and trust, recognizes and...
Image segmentation by hierarchial agglomeration of polygons using ecological statistics
Prasad, Lakshman; Swaminarayan, Sriram
2013-04-23
A method for rapid hierarchical image segmentation based on perceptually driven contour completion and scene statistics is disclosed. The method begins with an initial fine-scale segmentation of an image, such as obtained by perceptual completion of partial contours into polygonal regions using region-contour correspondences established by Delaunay triangulation of edge pixels as implemented in VISTA. The resulting polygons are analyzed with respect to their size and color/intensity distributions and the structural properties of their boundaries. Statistical estimates of granularity of size, similarity of color, texture, and saliency of intervening boundaries are computed and formulated into logical (Boolean) predicates. The combined satisfiability of these Boolean predicates by a pair of adjacent polygons at a given segmentation level qualifies them for merging into a larger polygon representing a coarser, larger-scale feature of the pixel image and collectively obtains the next level of polygonal segments in a hierarchy of fine-to-coarse segmentations. The iterative application of this process precipitates textured regions as polygons with highly convolved boundaries and helps distinguish them from objects which typically have more regular boundaries. The method yields a multiscale decomposition of an image into constituent features that enjoy a hierarchical relationship with features at finer and coarser scales. This provides a traversable graph structure from which feature content and context in terms of other features can be derived, aiding in automated image understanding tasks. The method disclosed is highly efficient and can be used to decompose and analyze large images.
Standard model of knowledge representation
NASA Astrophysics Data System (ADS)
Yin, Wensheng
2016-09-01
Knowledge representation is the core of artificial intelligence research. Knowledge representation methods include predicate logic, semantic network, computer programming language, database, mathematical model, graphics language, natural language, etc. To establish the intrinsic link between various knowledge representation methods, a unified knowledge representation model is necessary. According to ontology, system theory, and control theory, a standard model of knowledge representation that reflects the change of the objective world is proposed. The model is composed of input, processing, and output. This knowledge representation method is not a contradiction to the traditional knowledge representation method. It can express knowledge in terms of multivariate and multidimensional. It can also express process knowledge, and at the same time, it has a strong ability to solve problems. In addition, the standard model of knowledge representation provides a way to solve problems of non-precision and inconsistent knowledge.
Michalowski, Martin; Wilk, Szymon; Tan, Xing; Michalowski, Wojtek
2014-01-01
Clinical practice guidelines (CPGs) implement evidence-based medicine designed to help generate a therapy for a patient suffering from a single disease. When applied to a comorbid patient, the concurrent combination of treatment steps from multiple CPGs is susceptible to adverse interactions in the resulting combined therapy (i.e., a therapy established according to all considered CPGs). This inability to concurrently apply CPGs has been shown to be one of the key shortcomings of CPG uptake in a clinical setting1. Several research efforts are underway to address this issue such as the K4CARE2 and GuideLine INteraction Detection Assistant (GLINDA)3 projects and our previous research on applying constraint logic programming to developing a consistent combined therapy for a comorbid patient4. However, there is no generalized framework for mitigation that effectively captures general characteristics of the problem while handling nuances such as time and ordering requirements imposed by specific CPGs. In this paper we propose a first-order logic-based (FOL) approach for developing a generalized framework of mitigation. This approach uses a meta-algorithm and entailment properties to mitigate (i.e., identify and address) adverse interactions introduced by concurrently applied CPGs. We use an illustrative case study of a patient suffering from type 2 diabetes being treated for an onset of severe rheumatoid arthritis to show the expressiveness and robustness of our proposed FOL-based approach, and we discuss its appropriateness as the basis for the generalized theory.
Consistent detection of global predicates
NASA Technical Reports Server (NTRS)
Cooper, Robert; Marzullo, Keith
1991-01-01
A fundamental problem in debugging and monitoring is detecting whether the state of a system satisfies some predicate. If the system is distributed, then the resulting uncertainty in the state of the system makes such detection, in general, ill-defined. Three algorithms are presented for detecting global predicates in a well-defined way. These algorithms do so by interpreting predicates with respect to the communication that has occurred in the system.
Superposition-Based Analysis of First-Order Probabilistic Timed Automata
NASA Astrophysics Data System (ADS)
Fietzke, Arnaud; Hermanns, Holger; Weidenbach, Christoph
This paper discusses the analysis of first-order probabilistic timed automata (FPTA) by a combination of hierarchic first-order superposition-based theorem proving and probabilistic model checking. We develop the overall semantics of FPTAs and prove soundness and completeness of our method for reachability properties. Basically, we decompose FPTAs into their time plus first-order logic aspects on the one hand, and their probabilistic aspects on the other hand. Then we exploit the time plus first-order behavior by hierarchic superposition over linear arithmetic. The result of this analysis is the basis for the construction of a reachability equivalent (to the original FPTA) probabilistic timed automaton to which probabilistic model checking is finally applied. The hierarchic superposition calculus required for the analysis is sound and complete on the first-order formulas generated from FPTAs. It even works well in practice. We illustrate the potential behind it with a real-life DHCP protocol example, which we analyze by means of tool chain support.
Testing First-Order Logic Axioms in AutoCert
NASA Technical Reports Server (NTRS)
Ahn, Ki Yung; Denney, Ewen
2009-01-01
AutoCert [2] is a formal verification tool for machine generated code in safety critical domains, such as aerospace control code generated from MathWorks Real-Time Workshop. AutoCert uses Automated Theorem Provers (ATPs) [5] based on First-Order Logic (FOL) to formally verify safety and functional correctness properties of the code. These ATPs try to build proofs based on user provided domain-specific axioms, which can be arbitrary First-Order Formulas (FOFs). These axioms are the most crucial part of the trusted base, since proofs can be submitted to a proof checker removing the need to trust the prover and AutoCert itself plays the part of checking the code generator. However, formulating axioms correctly (i.e. precisely as the user had really intended) is non-trivial in practice. The challenge of axiomatization arise from several dimensions. First, the domain knowledge has its own complexity. AutoCert has been used to verify mathematical requirements on navigation software that carries out various geometric coordinate transformations involving matrices and quaternions. Axiomatic theories for such constructs are complex enough that mistakes are not uncommon. Second, adjusting axioms for ATPs can add even more complexity. The axioms frequently need to be modified in order to have them in a form suitable for use with ATPs. Such modifications tend to obscure the axioms further. Thirdly, speculating validity of the axioms from the output of existing ATPs is very hard since theorem provers typically do not give any examples or counterexamples.
Incremental Query Rewriting with Resolution
NASA Astrophysics Data System (ADS)
Riazanov, Alexandre; Aragão, Marcelo A. T.
We address the problem of semantic querying of relational databases (RDB) modulo knowledge bases using very expressive knowledge representation formalisms, such as full first-order logic or its various fragments. We propose to use a resolution-based first-order logic (FOL) reasoner for computing schematic answers to deductive queries, with the subsequent translation of these schematic answers to SQL queries which are evaluated using a conventional relational DBMS. We call our method incremental query rewriting, because an original semantic query is rewritten into a (potentially infinite) series of SQL queries. In this chapter, we outline the main idea of our technique - using abstractions of databases and constrained clauses for deriving schematic answers, and provide completeness and soundness proofs to justify the applicability of this technique to the case of resolution for FOL without equality. The proposed method can be directly used with regular RDBs, including legacy databases. Moreover, we propose it as a potential basis for an efficient Web-scale semantic search technology.
Expanding a First-Order Logic Mitigation Framework to Handle Multimorbid Patient Preferences
Michalowski, Martin; Wilk, Szymon; Rosu, Daniela; Kezadri, Mounira; Michalowski, Wojtek; Carrier, Marc
2015-01-01
The increasing prevalence of multimorbidity is a challenge for physicians who have to manage a constantly growing number of patients with simultaneous diseases. Adding to this challenge is the need to incorporate patient preferences as key components of the care process, thanks in part to the emergence of personalized and participatory medicine. In our previous work we proposed a framework employing first order logic to represent clinical practice guidelines (CPGs) and to mitigate possible adverse interactions when concurrently applying multiple CPGs to a multimorbid patient. In this paper, we describe extensions to our methodological framework that (1) broaden our definition of revision operators to support required and desired types of revisions defined in secondary knowledge sources, and (2) expand the mitigation algorithm to apply revisions based on their type. We illustrate the capabilities of the expanded framework using a clinical case study of a multimorbid patient with stable cardiac artery disease who suffers a sudden onset of deep vein thrombosis. PMID:26958226
DOT National Transportation Integrated Search
2012-12-01
The overall integrity of the plastic piping system is predicated on the long term strength : of its weakest link which often occurs at fitting and joint interfaces, e.g. electrofusion, : mechanical, heat fusion, etc. In order to maximize the overall ...
A path-oriented matrix-based knowledge representation system
NASA Technical Reports Server (NTRS)
Feyock, Stefan; Karamouzis, Stamos T.
1993-01-01
Experience has shown that designing a good representation is often the key to turning hard problems into simple ones. Most AI (Artificial Intelligence) search/representation techniques are oriented toward an infinite domain of objects and arbitrary relations among them. In reality much of what needs to be represented in AI can be expressed using a finite domain and unary or binary predicates. Well-known vector- and matrix-based representations can efficiently represent finite domains and unary/binary predicates, and allow effective extraction of path information by generalized transitive closure/path matrix computations. In order to avoid space limitations a set of abstract sparse matrix data types was developed along with a set of operations on them. This representation forms the basis of an intelligent information system for representing and manipulating relational data.
Faith in the algorithm, part 1: beyond the turing test
DOE Office of Scientific and Technical Information (OSTI.GOV)
Rodriguez, Marko A; Pepe, Alberto
2009-01-01
Since the Turing test was first proposed by Alan Turing in 1950, the goal of artificial intelligence has been predicated on the ability for computers to imitate human intelligence. However, the majority of uses for the computer can be said to fall outside the domain of human abilities and it is exactly outside of this domain where computers have demonstrated their greatest contribution. Another definition for artificial intelligence is one that is not predicated on human mimicry, but instead, on human amplification, where the algorithms that are best at accomplishing this are deemed the most intelligent. This article surveys variousmore » systems that augment human and social intelligence.« less
Formal specification and mechanical verification of SIFT - A fault-tolerant flight control system
NASA Technical Reports Server (NTRS)
Melliar-Smith, P. M.; Schwartz, R. L.
1982-01-01
The paper describes the methodology being employed to demonstrate rigorously that the SIFT (software-implemented fault-tolerant) computer meets its requirements. The methodology uses a hierarchy of design specifications, expressed in the mathematical domain of multisorted first-order predicate calculus. The most abstract of these, from which almost all details of mechanization have been removed, represents the requirements on the system for reliability and intended functionality. Successive specifications in the hierarchy add design and implementation detail until the PASCAL programs implementing the SIFT executive are reached. A formal proof that a SIFT system in a 'safe' state operates correctly despite the presence of arbitrary faults has been completed all the way from the most abstract specifications to the PASCAL program.
Why were Matrix Mechanics and Wave Mechanics considered equivalent?
NASA Astrophysics Data System (ADS)
Perovic, Slobodan
A recent rethinking of the early history of Quantum Mechanics deemed the late 1920s agreement on the equivalence of Matrix Mechanics and Wave Mechanics, prompted by Schrödinger's 1926 proof, a myth. Schrödinger supposedly failed to prove isomorphism, or even a weaker equivalence ("Schrödinger-equivalence") of the mathematical structures of the two theories; developments in the early 1930s, especially the work of mathematician von Neumann provided sound proof of mathematical equivalence. The alleged agreement about the Copenhagen Interpretation, predicated to a large extent on this equivalence, was deemed a myth as well. In response, I argue that Schrödinger's proof concerned primarily a domain-specific ontological equivalence, rather than the isomorphism or a weaker mathematical equivalence. It stemmed initially from the agreement of the eigenvalues of Wave Mechanics and energy-states of Bohr's Model that was discovered and published by Schrödinger in his first and second communications of 1926. Schrödinger demonstrated in this proof that the laws of motion arrived at by the method of Matrix Mechanics are satisfied by assigning the auxiliary role to eigenfunctions in the derivation of matrices (while he only outlined the reversed derivation of eigenfunctions from Matrix Mechanics, which was necessary for the proof of both isomorphism and Schrödinger-equivalence of the two theories). This result was intended to demonstrate the domain-specific ontological equivalence of Matrix Mechanics and Wave Mechanics, with respect to the domain of Bohr's atom. And although the mathematical equivalence of the theories did not seem out of the reach of existing theories and methods, Schrödinger never intended to fully explore such a possibility in his proof paper. In a further development of Quantum Mechanics, Bohr's complementarity and Copenhagen Interpretation captured a more substantial convergence of the subsequently revised (in light of the experimental results) Wave and Matrix Mechanics. I argue that both the equivalence and Copenhagen Interpretation can be deemed myths if one predicates the philosophical and historical analysis on a narrow model of physical theory which disregards its historical context, and focuses exclusively on its formal aspects and the exploration of the logical models supposedly implicit in it.
A framework for qualitative reasoning about solid objects
NASA Technical Reports Server (NTRS)
Davis, E.
1987-01-01
Predicting the behavior of a qualitatively described system of solid objects requires a combination of geometrical, temporal, and physical reasoning. Methods based upon formulating and solving differential equations are not adequate for robust prediction, since the behavior of a system over extended time may be much simpler than its behavior over local time. A first-order logic, in which one can state simple physical problems and derive their solution deductively, without recourse to solving the differential equations, is discussed. This logic is substantially more expressive and powerful than any previous AI representational system in this domain.
Digital Inverter Amine Sensing via Synergistic Responses by n and p Organic Semiconductors.
Tremblay, Noah J; Jung, Byung Jun; Breysse, Patrick; Katz, Howard E
2011-11-22
Chemiresistors and sensitive OFETs have been substantially developed as cheap, scalable, and versatile sensing platforms. While new materials are expanding OFET sensing capabilities, the device architectures have changed little. Here we report higher order logic circuits utilizing OFETs sensitive to amine vapors. The circuits depend on the synergistic responses of paired p- and n-channel organic semiconductors, including an unprecedented analyte-induced current increase by the n-channel semiconductor. This represents the first step towards 'intelligent sensors' that utilize analog signal changes in sensitive OFETs to produce direct digital readouts suitable for further logic operations.
Digital Inverter Amine Sensing via Synergistic Responses by n and p Organic Semiconductors
Tremblay, Noah J.; Jung, Byung Jun; Breysse, Patrick; Katz, Howard E.
2013-01-01
Chemiresistors and sensitive OFETs have been substantially developed as cheap, scalable, and versatile sensing platforms. While new materials are expanding OFET sensing capabilities, the device architectures have changed little. Here we report higher order logic circuits utilizing OFETs sensitive to amine vapors. The circuits depend on the synergistic responses of paired p- and n-channel organic semiconductors, including an unprecedented analyte-induced current increase by the n-channel semiconductor. This represents the first step towards ‘intelligent sensors’ that utilize analog signal changes in sensitive OFETs to produce direct digital readouts suitable for further logic operations. PMID:23754969
Evaluating Predicates over Encrypted Data
2008-10-01
Predicate encryption is a new encryption paradigm where the secret key owner can perform fine-grained access control over the encrypted data. In...particular, the secret key owner can generate a capability corresponding to a query predicate (e.g., whether an encrypted email contains the keyword
Matching therapists' predicates: an in vivo test of effectiveness.
Dowd, E T; Hingst, A G
1983-08-01
The theory of neurolinguistic programming predicts that a therapist's matching of a client's primary representational system, as expressed in the client's predicates, should result in increased therapist's rapport and social influence. This hypothesis was tested in an actual interview situation. Six relatively inexperienced therapists, two each in predicate matching, predicate mismatching, and predicate no-matching conditions, conducted a 30-min. interview with nine undergraduate student volunteers each, for a total of 54 subjects. After the appropriate interview condition was completed, subjects rated ther therapists on the Counselor Rating Form and the Counseling Evaluation Inventory. No significant differences among the three conditions on any of the measures were found. Results are compared with those of previous research on assessment and primary representational matching in analogue situations.
PredicT-ML: a tool for automating machine learning model building with big clinical data.
Luo, Gang
2016-01-01
Predictive modeling is fundamental to transforming large clinical data sets, or "big clinical data," into actionable knowledge for various healthcare applications. Machine learning is a major predictive modeling approach, but two barriers make its use in healthcare challenging. First, a machine learning tool user must choose an algorithm and assign one or more model parameters called hyper-parameters before model training. The algorithm and hyper-parameter values used typically impact model accuracy by over 40 %, but their selection requires many labor-intensive manual iterations that can be difficult even for computer scientists. Second, many clinical attributes are repeatedly recorded over time, requiring temporal aggregation before predictive modeling can be performed. Many labor-intensive manual iterations are required to identify a good pair of aggregation period and operator for each clinical attribute. Both barriers result in time and human resource bottlenecks, and preclude healthcare administrators and researchers from asking a series of what-if questions when probing opportunities to use predictive models to improve outcomes and reduce costs. This paper describes our design of and vision for PredicT-ML (prediction tool using machine learning), a software system that aims to overcome these barriers and automate machine learning model building with big clinical data. The paper presents the detailed design of PredicT-ML. PredicT-ML will open the use of big clinical data to thousands of healthcare administrators and researchers and increase the ability to advance clinical research and improve healthcare.
Bayne, Jay S
2008-06-01
In support of a generalization of systems theory, this paper introduces a new approach in modeling complex distributed systems. It offers an analytic framework for describing the behavior of interactive cyberphysical systems (CPSs), which are networked stationary or mobile information systems responsible for the real-time governance of physical processes whose behaviors unfold in cyberspace. The framework is predicated on a cyberspace-time reference model comprising three spatial dimensions plus time. The spatial domains include geospatial, infospatial, and sociospatial references, the latter describing relationships among sovereign enterprises (rational agents) that choose voluntarily to organize and interoperate for individual and mutual benefit through geospatial (physical) and infospatial (logical) transactions. Of particular relevance to CPSs are notions of timeliness and value, particularly as they relate to the real-time governance of physical processes and engagements with other cooperating CPS. Our overarching interest, as with celestial mechanics, is in the formation and evolution of clusters of cyberspatial objects and the federated systems they form.
Lenin: An Activist Burdened by a Passivist Philosophy.
ERIC Educational Resources Information Center
Johnson, Karen S.
The paper discusses Lenin's attempts to alleviate discrepancies between Marxist philosophy and his own personal activist creed by, first, introducing Hegelian logic into dialectical materialism and, second, by creating an ideology of organizational activity. Lenin the man is examined in order to understand his interpretation of Marx and the gap…
Yoshihara, Motojiro; Yoshihara, Motoyuki
In this article, we describe an incorrect use of logic which involves the careless application of the 'necessary and sufficient' condition originally used in formal logic. This logical fallacy is causing frequent confusion in current biology, especially in neuroscience. In order to clarify this problem, we first dissect the structure of this incorrect logic (which we refer to as 'misapplied-N&S') to show how necessity and sufficiency in misapplied-N&S are not matching each other. Potential pitfalls of utilizing misapplied-N&S are exemplified by cases such as the discrediting of command neurons and other potentially key neurons, the distorting of truth in optogenetic studies, and the wrongful justification of studies with little meaning. In particular, the use of the word 'sufficient' in optogenetics tends to generate misunderstandings by opening up multiple interpretations. To avoid the confusion caused by the misleading logic, we now recommend using 'indispensable and inducing' instead of using 'necessary and sufficient.' However, we ultimately recommend fully articulating the limits of what our experiments suggest, not relying on such simple phrases. Only after this problem is fully understood and more rigorous language is demanded, can we finally interpret experimental results in an accurate way.
Method, apparatus and system for managing queue operations of a test bench environment
Ostler, Farrell Lynn
2016-07-19
Techniques and mechanisms for performing dequeue operations for agents of a test bench environment. In an embodiment, a first group of agents are each allocated a respective ripe reservation and a second set of agents are each allocated a respective unripe reservation. Over time, queue management logic allocates respective reservations to agents and variously changes one or more such reservations from unripe to ripe. In another embodiment, an order of servicing agents allocated unripe reservations is based on relative priorities of the unripe reservations with respect to one another. An order of servicing agents allocated ripe reservations is on a first come, first served basis.
The First Amendment and the Fourth Estate: The Law of Mass Media. Fourth Edition.
ERIC Educational Resources Information Center
Carter, T. Barton; And Others
Predicated on the belief that communications students are capable of understanding communications law and the processes that created it, this book examines U.S. Supreme Court opinions on the First Amendment. The book addresses the following topics: 1) the American legal system and freedom of expression (in introductory chapters); 2) defamation; 3)…
Reports 5. The Yugoslav Serbo-Croatian-English Contrastive Project.
ERIC Educational Resources Information Center
Filipovic, Rudolf, Ed.
The fifth volume of this series contains ten articles dealing with various aspects of Serbo-Croatian-English contrastive analysis. They are: "On the Word Order of Subject and Predicate in English and Serbo-Croatian from the Point of View of Functional Sentence Perspective," by Ljiljana Bibovic; "The English Personal Pronouns and Their…
On the "Give" and "Take" between Event Apprehension and Utterance Formulation
ERIC Educational Resources Information Center
Gleitman, Lila R.; January, David; Nappa, Rebecca; Trueswell, John C.
2007-01-01
Two experiments are reported that examine how manipulations of visual attention affect speakers' linguistic choices regarding word order, verb use and syntactic structure when describing simple pictured scenes. Experiment 1 presented participants with scenes designed to elicit the use of a perspective predicate ("The man chases the dog/The dog…
ERIC Educational Resources Information Center
Fortunato-Tavares, Talita; de Andrade, Claudia R. F.; Befi-Lopes, Debora M.; Hestvik, Arild; Epstein, Baila; Tornyova, Lidiya; Schwartz, Richard G.
2012-01-01
Purpose: In this study, the authors examined the comprehension of sentences with predicates and reflexives that are linked to a nonadjacent noun as a test of the hierarchical ordering deficit (HOD) hypothesis. That hypothesis and more modern versions posit that children with specific language impairment (SLI) have difficulty in establishing…
Neurolinguistic Programming: The Impact of Imagery Tasks on Sensory Predicate Usage.
ERIC Educational Resources Information Center
Graunke, Bruce; Roberts, T. Kevin
1985-01-01
Investigated the impact of varied imagining tasks on individuals' use of sensory predicates. Results demonstrated that subjects were able to vary their type of sensory predicates according to the task demands or situational context. Findings are incongruent with Bandler and Grinder's (1979) conceptualization of representational systems.…
The Grammar of Mental Predicates in Japanese.
ERIC Educational Resources Information Center
Onishi, Masayuki
1997-01-01
Examines Japanese equivalents of the six mental predicates defined as semantic universals in Natural Semantic Metalanguage theory, with special attention to syntax and semantics of complementation types. It is shown that each primitive predicate has a specific set of syntactic frames for expressing primitive meaning and that extended meanings that…
Federal Register 2010, 2011, 2012, 2013, 2014
2012-03-19
... component of stock-option orders. The Exchange will route orders to the broker- dealers using routing logic... Exchange's routing logic will only route orders to the broker-dealers with whom they have agreements. In...
Federal Register 2010, 2011, 2012, 2013, 2014
2013-08-27
... may apply anti-internalization logic to all quotes/orders entered through a particular MPID, or to all... then appended. In other words, the logic may be applied on an MPID-by-MPID, or on a port-by-port basis.\\3\\ Currently, two forms of anti-internalization logic may be applied: (i) if quotes/orders are...
Multi-class Mode of Action Classification of Toxic Compounds Using Logic Based Kernel Methods.
Lodhi, Huma; Muggleton, Stephen; Sternberg, Mike J E
2010-09-17
Toxicity prediction is essential for drug design and development of effective therapeutics. In this paper we present an in silico strategy, to identify the mode of action of toxic compounds, that is based on the use of a novel logic based kernel method. The technique uses support vector machines in conjunction with the kernels constructed from first order rules induced by an Inductive Logic Programming system. It constructs multi-class models by using a divide and conquer reduction strategy that splits multi-classes into binary groups and solves each individual problem recursively hence generating an underlying decision list structure. In order to evaluate the effectiveness of the approach for chemoinformatics problems like predictive toxicology, we apply it to toxicity classification in aquatic systems. The method is used to identify and classify 442 compounds with respect to the mode of action. The experimental results show that the technique successfully classifies toxic compounds and can be useful in assessing environmental risks. Experimental comparison of the performance of the proposed multi-class scheme with the standard multi-class Inductive Logic Programming algorithm and multi-class Support Vector Machine yields statistically significant results and demonstrates the potential power and benefits of the approach in identifying compounds of various toxic mechanisms. Copyright © 2010 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
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.
Holakooie, Mohammad Hosein; Ojaghi, Mansour; Taheri, Asghar
2016-01-01
This paper investigates sensorless indirect field oriented control (IFOC) of SLIM with full-order Luenberger observer. The dynamic equations of SLIM are first elaborated to draw full-order Luenberger observer with some simplifying assumption. The observer gain matrix is derived from conventional procedure so that observer poles are proportional to SLIM poles to ensure the stability of system for wide range of linear speed. The operation of observer is significantly impressed by adaptive scheme. A fuzzy logic control (FLC) is proposed as adaptive scheme to estimate linear speed using speed tuning signal. The parameters of FLC are tuned using an off-line method through chaotic optimization algorithm (COA). The performance of the proposed observer is verified by both numerical simulation and real-time hardware-in-the-loop (HIL) implementation. Moreover, a detailed comparative study among proposed and other speed observers is obtained under different operation conditions. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.
Higher Education and Ethical Value
ERIC Educational Resources Information Center
Lee, Jeong-Kyu
2017-01-01
The purpose of this study is to explore the importance of ethical value in higher education as well as the relevance between ethical value and higher education. In order to examine the study logically, three research questions are addressed: First, what is value, ethical value, and Asiatic ethical value? Second, for whom and what is higher…
Derivation of sorting programs
NASA Technical Reports Server (NTRS)
Varghese, Joseph; Loganantharaj, Rasiah
1990-01-01
Program synthesis for critical applications has become a viable alternative to program verification. Nested resolution and its extension are used to synthesize a set of sorting programs from their first order logic specifications. A set of sorting programs, such as, naive sort, merge sort, and insertion sort, were successfully synthesized starting from the same set of specifications.
Microsurgery Training for the Twenty-First Century
Myers, Simon Richard; Froschauer, Stefan; Akelina, Yelena; Tos, Pierluigi; Kim, Jeong Tae
2013-01-01
Current educational interventions and training courses in microsurgery are often predicated on theories of skill acquisition and development that follow a 'practice makes perfect' model. Given the changing landscape of surgical training and advances in educational theories related to skill development, research is needed to assess current training tools in microsurgery education and devise alternative methods that would enhance training. Simulation is an increasingly important tool for educators because, whilst facilitating improved technical proficiency, it provides a way to reduce risks to both trainees and patients. The International Microsurgery Simulation Society has been founded in 2012 in order to consolidate the global effort in promoting excellence in microsurgical training. The society's aim to achieve standarisation of microsurgical training worldwide could be realised through the development of evidence based educational interventions and sharing best practices. PMID:23898422
ERIC Educational Resources Information Center
Nakamura, Kanae
2009-01-01
While the predicate-final structure of the Japanese language has been considered one of the main causes of its late projectability (Tanaka, 1999), this study demonstrates that the final predicate component of a "turn constructional unit" (TCU) furnishes a useful resource for conversational participants to negotiate various aspects of interaction.…
Eco-logical successes : third edition, September 2012
DOT National Transportation Integrated Search
2012-09-01
Eco-Logical: An Ecosystem Approach to Developing Infrastructure Projects outlines an ecosystem-scale approach to prioritizing, developing, and delivering infrastructure projects. Eco-Logical emphasizes interagency collaboration in order to create inf...
Cormier, Kearsy
2013-01-01
British Sign Language (BSL) signers use a variety of structures, such as constructed action (CA), depicting constructions (DCs), or lexical verbs, to represent action and other verbal meanings. This study examines the use of these verbal predicate structures and their gestural counterparts, both separately and simultaneously, in narratives by deaf children with various levels of exposure to BSL (ages 5;1 to 7;5) and deaf adult native BSL signers. Results reveal that all groups used the same types of predicative structures, including children with minimal BSL exposure. However, adults used CA, DCs, and/or lexical signs simultaneously more frequently than children. These results suggest that simultaneous use of CA with lexical and depicting predicates is more complex than the use of these predicate structures alone and thus may take deaf children more time to master. PMID:23670881
Detection of global state predicates
NASA Technical Reports Server (NTRS)
Marzullo, Keith; Neiger, Gil
1991-01-01
The problem addressed here arises in the context of Meta: how can a set of processes monitor the state of a distributed application in a consistent manner? For example, consider the simple distributed application as shown here. Each of the three processes in the application has a light, and the control processes would each like to take an action when some specified subset of the lights are on. The application processes are instrumented with stubs that determine when the process turns its lights on or off. This information is disseminated to the control processes, each of which then determines when its condition of interest is met. Meta is built on top of the ISIS toolkit, and so we first built the sensor dissemination mechanism using atomic broadcast. Atomic broadcast guarantees that all recipients receive the messages in the same order and that this order is consistent with causality. Unfortunately, the control processes are somewhat limited in what they can deduce when they find that their condition of interest holds.
Siordia, Carlos
2016-06-01
An individual's ability to live independently is commonly measured in health research interested in identifying risk factors associated with disablement processes. In order to inform clinical practice, population research has attempted to identify the contraction of "lived-space" by using various survey instruments. Studies assessing habitual movements over the environment with the Life-Space Assessment (LSA) survey instrument should carefully consider how the LSA Composite Score (LSA-CS) is computed. Until now, no publication has carefully delineated the assumptions guiding the internal logic used in the computation of the LSA-CS. Because the internal logic of the LSA may need further justification, a non-data-editing scoring algorithm should be considered. Compute LSA-CS by only using non-edited data. Paper first delineates the logic guiding the algorithm used in the formation of the LSA-CS and explains how the scoring creates and changes participant responses when they conflict with its internal logic. An easy-to-use SAS® 9.3 program for estimating a Non-Data-Edited LSA-CS (NDE-LSA-CS) is also presented. Researchers interested in assessing lived-space should carefully consider if the internal logic of the LSA-CS is warranted. Clinicians should know it is important to understand the strengths and weaknesses of outcome measures used when deciding on whether to apply the results of research to direct clinical practice. © The Author(s) 2015.
ERIC Educational Resources Information Center
Elich, Matthew; And Others
1985-01-01
Tested Bandler and Grinder's proposal that eye movement direction and spoken predicates are indicative of sensory modality of imagery. Subjects reported images in the three modes, but no relation between imagery and eye movements or predicates was found. Visual images were most vivid and often reported. Most subjects rated themselves as visual,…
Inverting the pyramid of needs: Positive psychology's new order for labor success.
Cabanas, Edgar; Sánchez-González, José-Carlos
2016-05-01
Positive psychologists claim to have demonstrated a causal relationship between happiness and life success, with the former accounting for why people usually end up better off in life than others, especially at workplace. In this paper we will analyse the role that happiness-based repertoires and techniques provided by positive psychologists are playing in the current labor sphere. Positive psychologists’ repertoires and techniques do not only meet the emerging demands derived from the changes in the notions of “work” and “worker” in the last decades, but also introduce a whole new logic in the construction of professional workers’ subjectivity, according to which happiness becomes a necessary psychological state that workers must first achieve and develop in order to attain job success at work. This emerging logic does not only circumscribe to the labor sphere, but also reflects a broader cultural and economic phenomenon.
Pass-transistor very large scale integration
NASA Technical Reports Server (NTRS)
Maki, Gary K. (Inventor); Bhatia, Prakash R. (Inventor)
2004-01-01
Logic elements are provided that permit reductions in layout size and avoidance of hazards. Such logic elements may be included in libraries of logic cells. A logical function to be implemented by the logic element is decomposed about logical variables to identify factors corresponding to combinations of the logical variables and their complements. A pass transistor network is provided for implementing the pass network function in accordance with this decomposition. The pass transistor network includes ordered arrangements of pass transistors that correspond to the combinations of variables and complements resulting from the logical decomposition. The logic elements may act as selection circuits and be integrated with memory and buffer elements.
The Cultural Politics of Language in Sudan: Against the Racialising Logic of Language Rights
ERIC Educational Resources Information Center
Abdelhay, Ashraf; Eljak, Nada; Mugaddam, AbdelRahim; Makoni, Sinfree
2017-01-01
The sociolinguistic repertoires of individuals in Sudan are products of institutionalised orders of normalisation. The visibility of language in popular and official discourses in Sudan is always linked with wider cultural and political projects. This paper intends to engage with and explicate this observation by, first, examining how the dominant…
ERIC Educational Resources Information Center
Goldberg, Adele; Suppes, Patrick
An interactive computer-assisted system for teaching elementary logic is described, which was designed to handle formalizations of first-order theories suitable for presentation in a computer-assisted instruction environment. The system provides tools with which the user can develop and then study a nonlogical axiomatic theory along whatever lines…
Fuzzy logic controller for the LOLA AO tip-tilt corrector system
NASA Astrophysics Data System (ADS)
Sotelo, Pablo D.; Flores, Ruben; Garfias, Fernando; Cuevas, Salvador
1998-09-01
At the INSTITUTO DE ASTRONOMIA we developed an adaptive optics system for the correction of the two first orders of the Zernike polynomials measuring the image controid. Here we discus the two system modalities based in two different control strategies and we present simulations comparing the systems. For the classic control system we present telescope results.
Primitive Concepts of Number and the Developing Human Brain
ERIC Educational Resources Information Center
Kersey, Alyssa J.; Cantlon, Jessica F.
2017-01-01
Counting is an evolutionarily recent cultural invention of the human species. In order for humans to have conceived of counting in the first place, certain representational and logical abilities must have already been in place. The focus of this article is the origins and nature of those fundamental mechanisms that promoted the emergence of the…
N Channel JFET Based Digital Logic Gate Structure
NASA Technical Reports Server (NTRS)
Krasowski, Michael J (Inventor)
2013-01-01
An apparatus is provided that includes a first field effect transistor with a source tied to zero volts and a drain tied to voltage drain drain (Vdd) through a first resistor. The apparatus also includes a first node configured to tie a second resistor to a third resistor and connect to an input of a gate of the first field effect transistor in order for the first field effect transistor to receive a signal. The apparatus also includes a second field effect transistor configured as a unity gain buffer having a drain tied to Vdd and an uncommitted source.
ERIC Educational Resources Information Center
Oladele, O. I.; Adekoya, A. E.
2006-01-01
This paper examines the implications of farmers' propensity to discontinue the adoption of agricultural technologies in southwestern Nigeria. This is predicated on the fact that extension education process should be proactive in addressing farmers in order to sustain the adoption process. Empirical studies looking at diffusion processes from an…
1988-01-01
A Generator for Natural Language Interfaces," Computational Linguistis. Vol. 11, Number 4, October-December, 1985. pp. 219-242. de Joia , A. and...employ in order to communicate to their intended audience. Production, therefore, encompasses issues of deciding what is pertinent as well as de ...rhetorical predicates; design of a system motivated by the desire for domain and language independency, semantic connection of the generation system
Cohen, Trevor; Schvaneveldt, Roger W; Rindflesch, Thomas C
2009-11-14
Corpus-derived distributional models of semantic distance between terms have proved useful in a number of applications. For both theoretical and practical reasons, it is desirable to extend these models to encode discrete concepts and the ways in which they are related to one another. In this paper, we present a novel vector space model that encodes semantic predications derived from MEDLINE by the SemRep system into a compact spatial representation. The associations captured by this method are of a different and complementary nature to those derived by traditional vector space models, and the encoding of predication types presents new possibilities for knowledge discovery and information retrieval.
Improving ontology matching with propagation strategy and user feedback
NASA Astrophysics Data System (ADS)
Li, Chunhua; Cui, Zhiming; Zhao, Pengpeng; Wu, Jian; Xin, Jie; He, Tianxu
2015-07-01
Markov logic networks which unify probabilistic graphical model and first-order logic provide an excellent framework for ontology matching. The existing approach requires a threshold to produce matching candidates and use a small set of constraints acting as filter to select the final alignments. We introduce novel match propagation strategy to model the influences between potential entity mappings across ontologies, which can help to identify the correct correspondences and produce missed correspondences. The estimation of appropriate threshold is a difficult task. We propose an interactive method for threshold selection through which we obtain an additional measurable improvement. Running experiments on a public dataset has demonstrated the effectiveness of proposed approach in terms of the quality of result alignment.
Formal Specifications for an Electrical Power Grid System Stability and Reliability
2015-09-01
expressed in this thesis are those of the author and do not reflect the official policy or position of the Department of Defense or the U.S. Government. IRB...analyze the power grid system requirements and express the critical runtime behavior using first-order logic. First, we identify observable...Verification System, and Type systems to name a few [5]. Theorem proving’s specification dimension is dependent on the expressive power of the formal
Multiscale calculations of thermoelectric properties of n-type Mg2Si1-xSnx solid solutions
NASA Astrophysics Data System (ADS)
Tan, X. J.; Liu, W.; Liu, H. J.; Shi, J.; Tang, X. F.; Uher, C.
2012-05-01
The band structure of Mg2Si1-xSnx solid solutions with 0.250 ⩽ x ⩽ 0.875 is calculated using the first-principles pseudopotential method. It is found that the low-lying light and heavy conduction bands converge and the effective mass reaches a maximum value near x = 0.625. Using the semiclassical Boltzmann transport theory and relaxation-time approximation, we find that the system with x = 0.625 exhibits both higher Seebeck coefficient and higher electrical conductivity than other solid solutions at intermediate temperatures. By fitting first-principles total energy calculations, a modified Morse potential is constructed, which is used to predicate the lattice thermal conductivity via equilibrium molecular dynamics simulations. Due to relatively higher power factor and lower thermal conductivity, the Mg2Si0.375Sn0.625 is found to exhibit enhanced thermoelectric performance at 800 K, and additional Sb doping is considered in order to make a better comparison with experiment results.
Sansavini, Alessandra; Bello, Arianna; Guarini, Annalisa; Savini, Silvia; Alessandroni, Rosina; Faldella, Giacomo; Caselli, Cristina
2015-01-01
Extremely low gestational age (ELGA, GA<28 weeks) preterm children are at high risk for linguistic impairments; however, their lexical comprehension and production as well as lexical categories in their early language acquisition have not been specifically examined via direct tools. Our study examines lexical comprehension and production as well as gestural production in ELGA children by focusing on noun and predicate acquisition. Forty monolingual ELGA children (mean GA of 26.7 weeks) and 40 full-term (FT) children were assessed at two years of corrected chronological age (CCA) using a test of noun and predicate comprehension and production (PiNG) and the Italian MB-CDI. Noun comprehension and production were delayed in ELGA compared with FT children, as documented by the low number of correct responses and the large number of errors, i.e., incorrect responses and no-response items, and by the types of incorrect responses, i.e., fewer semantically related responses, in noun production. Regarding predicate comprehension and production, a higher frequency of no responses was reported by ELGA children and these children also presented a lower frequency of bimodal spoken-gestural responses in predicate production than FT children. A delayed vocabulary size as demonstrated by the MB-CDI, was exhibited by one-fourth of the ELGA children, who were also unable to complete the predicate subtest. These findings highlight that noun comprehension and production are delayed in ELGA children at two years of CCA and are the most important indexes for the direct evaluation of their lexical abilities and delay. The types of incorrect responses and bimodal spoken-gestural responses were proven to be useful indexes for evaluating the noun and predicate level of acquisition and to plan early focused interventions. After reading this manuscript, the reader will understand (a) the differences in noun and predicate comprehension and production between ELGA and FT children and the indexes of lexical delays exhibited by ELGA children at 2;0 (CCA); (b) the relevance of evaluating errors (incorrect response and no response), the types of incorrect responses (semantically related and unrelated) and the modality of the responses (unimodal spoken and bimodal spoken-gestural) in noun and predicate production to understand the difficulties experienced by ELGA children in representing and expressing meanings; and (c) the need to plan specific interventions to support spoken and gestural modalities in lexical comprehension and production in ELGA children by focusing on noun and predicate acquisition. Copyright © 2015 Elsevier Inc. All rights reserved.
ERIC Educational Resources Information Center
Perpiñán, Silvia
2014-01-01
This study analyses the expression of locative and existential predicates elicited through an oral production task in the speech of two groups of learners of Spanish as a second language (L2) (first language English, n = 18; first language Moroccan Arabic, n = 14), and a native control group (n = 18). A total of 25,000 words were analysed, with…
The Temporal Logic of the Tower Chief System
NASA Technical Reports Server (NTRS)
Hazelton, Lyman R., Jr.
1990-01-01
The purpose is to describe the logic used in the reasoning scheme employed in the Tower Chief system, a runway configuration management system. First, a review of classical logic is given. Defensible logics, truth maintenance, default logic, temporally dependent propositions, and resource allocation and planning are discussed.
tOWL: a temporal Web Ontology Language.
Milea, Viorel; Frasincar, Flavius; Kaymak, Uzay
2012-02-01
Through its interoperability and reasoning capabilities, the Semantic Web opens a realm of possibilities for developing intelligent systems on the Web. The Web Ontology Language (OWL) is the most expressive standard language for modeling ontologies, the cornerstone of the Semantic Web. However, up until now, no standard way of expressing time and time-dependent information in OWL has been provided. In this paper, we present a temporal extension of the very expressive fragment SHIN(D) of the OWL Description Logic language, resulting in the temporal OWL language. Through a layered approach, we introduce three extensions: 1) concrete domains, which allow the representation of restrictions using concrete domain binary predicates; 2) temporal representation , which introduces time points, relations between time points, intervals, and Allen's 13 interval relations into the language; and 3) timeslices/fluents, which implement a perdurantist view on individuals and allow for the representation of complex temporal aspects, such as process state transitions. We illustrate the expressiveness of the newly introduced language by using an example from the financial domain.
Knowledge-Intensive, Interactive and Efficient Relational Pattern Learning
2006-09-01
insightful comments. References 1. E. Alphonse and C. Rouveirol. Lazy propositionalisation for relational learning. In H. W., editor, 14th European...their atom-and-bond structures. Some other work, especially on propositionalization of First Order Logic (FOL) ( Alphonse and Rouveirol 2000), has been...Applications of Artificial Intelligence Conference (IAAI-04), page To Appear, 2004. E. Alphonse and C. Rouveirol. Lazy propositionalisation for
Promoting Graphical Thinking: Using Temperature and a Graphing Calculator to Teach Kinetics Concepts
ERIC Educational Resources Information Center
Cortes-Figueroa, Jose E.; Moore-Russo, Deborah A.
2004-01-01
A combination of graphical thinking with chemical and physical theories in the classroom is encouraged by using the Calculator-Based Laboratory System (CBL) with a temperature sensor and graphing calculator. The theory of first-order kinetics is logically explained with the aid of the cooling or heating of the metal bead of the CBL's temperature…
Carrault, G; Cordier, M-O; Quiniou, R; Wang, F
2003-07-01
This paper proposes a novel approach to cardiac arrhythmia recognition from electrocardiograms (ECGs). ECGs record the electrical activity of the heart and are used to diagnose many heart disorders. The numerical ECG is first temporally abstracted into series of time-stamped events. Temporal abstraction makes use of artificial neural networks to extract interesting waves and their features from the input signals. A temporal reasoner called a chronicle recogniser processes such series in order to discover temporal patterns called chronicles which can be related to cardiac arrhythmias. Generally, it is difficult to elicit an accurate set of chronicles from a doctor. Thus, we propose to learn automatically from symbolic ECG examples the chronicles discriminating the arrhythmias belonging to some specific subset. Since temporal relationships are of major importance, inductive logic programming (ILP) is the tool of choice as it enables first-order relational learning. The approach has been evaluated on real ECGs taken from the MIT-BIH database. The performance of the different modules as well as the efficiency of the whole system is presented. The results are rather good and demonstrate that integrating numerical techniques for low level perception and symbolic techniques for high level classification is very valuable.
Lexical development of noun and predicate comprehension and production in isiZulu
Ahmed, Saaliha
2016-01-01
This study seeks to investigate the development of noun and predicate comprehension and production in isiZulu-speaking children between the ages of 25 and 36 months. It compares lexical comprehension and production in isiZulu, using an Italian developed and validated vocabulary assessment tool: The Picture Naming Game (PiNG) developed by Bello, Giannantoni, Pettenati, Stefanini and Caselli (2012). The PiNG tool includes four subtests, one each for subnoun comprehension (NC), noun production (NP), predicate comprehension (PC), and predicate production (PP). Children are shown these lexical items and then asked to show comprehension and produce certain lexical items. After adaptation into the South African context, the adapted version of PiNG was used to directly assess the lexical development of isiZulu with the three main objectives to (1) test the efficiency of the adaptation of a vocabulary tool to measure isiZulu comprehension and production development, (2) test previous findings done in many cross-linguistic comparisons that have found that both comprehension and production performance increase with age for a lesser-studied language, and (3) present our findings around the comprehension and production of the linguistic categories of nouns and predicates. An analysis of the results reported in this study show an age effect throughout the entire sample. Across all the age groups, the comprehension of the noun and predicate subtests was better performed than the production of noun and predicate subtests. With regard to lexical items, the responses of children showed an influence of various factors, including the late acquisition of items, possible problems with stimuli presented to them, and the possible input received by the children from their home environment. PMID:27542416
Lexical development of noun and predicate comprehension and production in isiZulu.
Nicolas, Ramona Kunene; Ahmed, Saaliha
2016-07-28
This study seeks to investigate the development of noun and predicate comprehension and production in isiZulu-speaking children between the ages of 25 and 36 months. It compares lexical comprehension and production in isiZulu, using an Italian developed and validated vocabulary assessment tool: The Picture Naming Game (PiNG) developed by Bello, Giannantoni, Pettenati, Stefanini and Caselli (2012). The PiNG tool includes four subtests, one each for subnoun comprehension (NC), noun production (NP), predicate comprehension (PC), and predicate production (PP). Children are shown these lexical items and then asked to show comprehension and produce certain lexical items. After adaptation into the South African context, the adapted version of PiNG was used to directly assess the lexical development of isiZulu with the three main objectives to (1) test the efficiency of the adaptation of a vocabulary tool to measure isiZulu comprehension and production development, (2) test previous findings done in many cross-linguistic comparisons that have found that both comprehension and production performance increase with age for a lesser-studied language, and (3) present our findings around the comprehension and production of the linguistic categories of nouns and predicates. An analysis of the results reported in this study show an age effect throughout the entire sample. Across all the age groups, the comprehension of the noun and predicate subtests was better performed than the production of noun and predicate subtests. With regard to lexical items, the responses of children showed an influence of various factors, including the late acquisition of items, possible problems with stimuli presented to them, and the possible input received by the children from their home environment.
ERIC Educational Resources Information Center
Jevsikova, Tatjana; Berniukevicius, Andrius; Kurilovas, Eugenijus
2017-01-01
The paper is aimed to present a methodology of learning personalisation based on applying Resource Description Framework (RDF) standard model. Research results are two-fold: first, the results of systematic literature review on Linked Data, RDF "subject-predicate-object" triples, and Web Ontology Language (OWL) application in education…
Pedicularis and Castilleja are natural hosts of Cronartium ribicola in North America: A first report
Geral I. McDonald; Bryce A. Richardson; Paul J. Zambino; Ned B. Klopfenstein; Mee-Sook Kim
2006-01-01
White pine blister rust disease, caused by the introduced pathogen Cronartium ribicola, has severely disrupted five-needled pine ecosystems in North America. A 100-year effort to manage this disease was predicated in part on the premise that the pathogen utilizes only species of Ribes (Grossulariaceae) as...
Spectrophotometry of Artemisia tridentata to quantitatively determine subspecies
Bryce A. Richardson; Alicia A. Boyd; Tanner Tobiasson; Matthew J. Germino
2018-01-01
Ecological restoration is predicated on our abilities to discern plant taxa. Taxonomic identification is a first step in ensuring that plants are appropriately adapted to the site. An example of the need to identify taxonomic differences comes from big sagebrush (Artemisia tridentata). This species is composed of three predominant subspecies occupying distinct...
Chinese Passives: Transformational or Lexical?
ERIC Educational Resources Information Center
Zhang, Jiuwu; Wen, Xiaohong
Analysis of Chinese passive constructions indicates two types. The first is a verbal or syntactic passive because it is derived through a transformational rule. The second is a lexical passive that has certain properties in common with the predicate adjectives in both Chinese and English and is derived through the semantic function and in lexical…
Getting Personal in Academic Discourse: Why It Works.
ERIC Educational Resources Information Center
Peterson, Linda H.
There is virtue in the movement recently begun within academic discourse that moves personal expression into professional writing. But before academics can understand why it works, they must first acknowledge that at times it does not work. A case in point would be Jane Tompkins' essay, "Me and My Shadow," which is predicated on a…
Using Ontologies to Formalize Services Specifications in Multi-Agent Systems
NASA Technical Reports Server (NTRS)
Breitman, Karin Koogan; Filho, Aluizio Haendchen; Haeusler, Edward Hermann
2004-01-01
One key issue in multi-agent systems (MAS) is their ability to interact and exchange information autonomously across applications. To secure agent interoperability, designers must rely on a communication protocol that allows software agents to exchange meaningful information. In this paper we propose using ontologies as such communication protocol. Ontologies capture the semantics of the operations and services provided by agents, allowing interoperability and information exchange in a MAS. Ontologies are a formal, machine processable, representation that allows to capture the semantics of a domain and, to derive meaningful information by way of logical inference. In our proposal we use a formal knowledge representation language (OWL) that translates into Description Logics (a subset of first order logic), thus eliminating ambiguities and providing a solid base for machine based inference. The main contribution of this approach is to make the requirements explicit, centralize the specification in a single document (the ontology itself), at the same that it provides a formal, unambiguous representation that can be processed by automated inference machines.
Modular Knowledge Representation and Reasoning in the Semantic Web
NASA Astrophysics Data System (ADS)
Serafini, Luciano; Homola, Martin
Construction of modular ontologies by combining different modules is becoming a necessity in ontology engineering in order to cope with the increasing complexity of the ontologies and the domains they represent. The modular ontology approach takes inspiration from software engineering, where modularization is a widely acknowledged feature. Distributed reasoning is the other side of the coin of modular ontologies: given an ontology comprising of a set of modules, it is desired to perform reasoning by combination of multiple reasoning processes performed locally on each of the modules. In the last ten years, a number of approaches for combining logics has been developed in order to formalize modular ontologies. In this chapter, we survey and compare the main formalisms for modular ontologies and distributed reasoning in the Semantic Web. We select four formalisms build on formal logical grounds of Description Logics: Distributed Description Logics, ℰ-connections, Package-based Description Logics and Integrated Distributed Description Logics. We concentrate on expressivity and distinctive modeling features of each framework. We also discuss reasoning capabilities of each framework.
Pattern formation, logistics, and maximum path probability
NASA Astrophysics Data System (ADS)
Kirkaldy, J. S.
1985-05-01
The concept of pattern formation, which to current researchers is a synonym for self-organization, carries the connotation of deductive logic together with the process of spontaneous inference. Defining a pattern as an equivalence relation on a set of thermodynamic objects, we establish that a large class of irreversible pattern-forming systems, evolving along idealized quasisteady paths, approaches the stable steady state as a mapping upon the formal deductive imperatives of a propositional function calculus. In the preamble the classical reversible thermodynamics of composite systems is analyzed as an externally manipulated system of space partitioning and classification based on ideal enclosures and diaphragms. The diaphragms have discrete classification capabilities which are designated in relation to conserved quantities by descriptors such as impervious, diathermal, and adiabatic. Differentiability in the continuum thermodynamic calculus is invoked as equivalent to analyticity and consistency in the underlying class or sentential calculus. The seat of inference, however, rests with the thermodynamicist. In the transition to an irreversible pattern-forming system the defined nature of the composite reservoirs remains, but a given diaphragm is replaced by a pattern-forming system which by its nature is a spontaneously evolving volume partitioner and classifier of invariants. The seat of volition or inference for the classification system is thus transferred from the experimenter or theoretician to the diaphragm, and with it the full deductive facility. The equivalence relations or partitions associated with the emerging patterns may thus be associated with theorems of the natural pattern-forming calculus. The entropy function, together with its derivatives, is the vehicle which relates the logistics of reservoirs and diaphragms to the analog logistics of the continuum. Maximum path probability or second-order differentiability of the entropy in isolation are sufficiently strong interpretations of the second law of thermodynamics to define the approach to and the nature of patterned stable steady states. For many pattern-forming systems these principles define quantifiable stable states as maxima or minima (or both) in the dissipation. An elementary statistical-mechanical proof is offered. To turn the argument full circle, the transformations of the partitions and classes which are predicated upon such minimax entropic paths can through digital modeling be directly identified with the syntactic and inferential elements of deductive logic. It follows therefore that all self-organizing or pattern-forming systems which possess stable steady states approach these states according to the imperatives of formal logic, the optimum pattern with its rich endowment of equivalence relations representing the central theorem of the associated calculus. Logic is thus ``the stuff of the universe,'' and biological evolution with its culmination in the human brain is the most significant example of all the irreversible pattern-forming processes. We thus conclude with a few remarks on the relevance of the contribution to the theory of evolution and to research on artificial intelligence.
Ocean feature recognition using genetic algorithms with fuzzy fitness functions (GA/F3)
NASA Technical Reports Server (NTRS)
Ankenbrandt, C. A.; Buckles, B. P.; Petry, F. E.; Lybanon, M.
1990-01-01
A model for genetic algorithms with semantic nets is derived for which the relationships between concepts is depicted as a semantic net. An organism represents the manner in which objects in a scene are attached to concepts in the net. Predicates between object pairs are continuous valued truth functions in the form of an inverse exponential function (e sub beta lxl). 1:n relationships are combined via the fuzzy OR (Max (...)). Finally, predicates between pairs of concepts are resolved by taking the average of the combined predicate values of the objects attached to the concept at the tail of the arc representing the predicate in the semantic net. The method is illustrated by applying it to the identification of oceanic features in the North Atlantic.
Design and optimization of liquid core optical ring resonator for refractive index sensing.
Lin, Nai; Jiang, Lan; Wang, Sumei; Xiao, Hai; Lu, Yongfeng; Tsai, Hai-Lung
2011-07-10
This study performs a detailed theoretical analysis of refractive index (RI) sensors based on whispering gallery modes (WGMs) in liquid core optical ring resonators (LCORRs). Both TE- and TM-polarized WGMs of various orders are considered. The analysis shows that WGMs of higher orders need thicker walls to achieve a near-zero thermal drift, but WGMs of different orders exhibit a similar RI sensing performance at the thermostable wall thicknesses. The RI detection limit is very low at the thermostable thickness. The theoretical predications should provide a general guidance in the development of LCORR-based thermostable RI sensors. © 2011 Optical Society of America
2011-01-01
Background Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequence alignments (MSA), including all positions. However, when we deal with proteins in the "twilight zone" we can observe that only some segments of sequences (motifs) are conserved. We introduce a novel logical representation that allows us to represent physico-chemical properties of sequences, conserved amino acid positions and conserved physico-chemical positions in the MSA. From this, Inductive Logic Programming (ILP) finds the most frequent patterns (motifs) and uses them to train propositional models, such as decision trees and support vector machines (SVM). Results We use the SCOP database to perform our experiments by evaluating protein recognition within the same superfamily. Our results show that our methodology when using SVM performs significantly better than some of the state of the art methods, and comparable to other. However, our method provides a comprehensible set of logical rules that can help to understand what determines a protein function. Conclusions The strategy of selecting only the most frequent patterns is effective for the remote homology detection. This is possible through a suitable first-order logical representation of homologous properties, and through a set of frequent patterns, found by an ILP system, that summarizes essential features of protein functions. PMID:21429187
Bernardes, Juliana S; Carbone, Alessandra; Zaverucha, Gerson
2011-03-23
Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequence alignments (MSA), including all positions. However, when we deal with proteins in the "twilight zone" we can observe that only some segments of sequences (motifs) are conserved. We introduce a novel logical representation that allows us to represent physico-chemical properties of sequences, conserved amino acid positions and conserved physico-chemical positions in the MSA. From this, Inductive Logic Programming (ILP) finds the most frequent patterns (motifs) and uses them to train propositional models, such as decision trees and support vector machines (SVM). We use the SCOP database to perform our experiments by evaluating protein recognition within the same superfamily. Our results show that our methodology when using SVM performs significantly better than some of the state of the art methods, and comparable to other. However, our method provides a comprehensible set of logical rules that can help to understand what determines a protein function. The strategy of selecting only the most frequent patterns is effective for the remote homology detection. This is possible through a suitable first-order logical representation of homologous properties, and through a set of frequent patterns, found by an ILP system, that summarizes essential features of protein functions.
A Multimedia Database Management System Supporting Contents Search in Media Data
1989-03-01
predicates: car (x), manufacturer (x, Horch ), year-built (x, 1922) to designate that the car was manufactured by Horch in the year 1922. The use of the name...manufacturer (imagel, x, " Horch "). year-built (imagel, x, 1922). query(I) :- car (I, Z), manufacturer (I, Z, " Horch "). ?- query(Image). yes. Image = image... Horch ) : imageJ 1, imageJ2, etc. In certain cases a predicate may generate entries in more than one list. For example, if the predicate of action
The LATL as locus of composition: MEG evidence from English and Arabic.
Westerlund, Masha; Kastner, Itamar; Al Kaabi, Meera; Pylkkänen, Liina
2015-02-01
Neurolinguistic investigations into the processing of structured sentences as well as simple adjective-noun phrases point to the left anterior temporal lobe (LATL) as a leading candidate for basic linguistic composition. Here, we characterized the combinatory profile of the LATL over a variety of syntactic and semantic environments, and across two languages, English and Arabic. The contribution of the LATL was investigated across two types of composition: the optional modification of a predicate (modification) and the satisfaction of a predicate's argument position (argument saturation). Target words were presented during MEG recordings, either in combinatory contexts (e.g. "eats meat") or in non-combinatory contexts (preceded by an unpronounceable consonant string, e.g. "xqkr meat"). Across both languages, the LATL showed increased responses to words in combinatory contexts, an effect that was robust to composition type and word order. Together with related findings, these results solidify the role of the LATL in basic semantic composition. Copyright © 2014 Elsevier Inc. All rights reserved.
Changing the Order of Newton's Laws--Why & How the Third Law Should Be First
ERIC Educational Resources Information Center
Stocklmayer, Sue; Rayner, John P.; Gore, Michael M.
2012-01-01
Newton's laws are difficult both for teachers and students at all levels. This is still the case despite a long history of critique of the laws as presented in the classroom. For example, more than 50 years ago Eisenbud and Weinstock proposed reformulations of the laws that put them on a sounder, more logically consistent base than is presented in…
Automating Access Control Logics in Simple Type Theory with LEO-II
NASA Astrophysics Data System (ADS)
Benzmüller, Christoph
Garg and Abadi recently proved that prominent access control logics can be translated in a sound and complete way into modal logic S4. We have previously outlined how normal multimodal logics, including monomodal logics K and S4, can be embedded in simple type theory and we have demonstrated that the higher-order theorem prover LEO-II can automate reasoning in and about them. In this paper we combine these results and describe a sound (and complete) embedding of different access control logics in simple type theory. Employing this framework we show that the off the shelf theorem prover LEO-II can be applied to automate reasoning in and about prominent access control logics.
Model-based reconfiguration: Diagnosis and recovery
NASA Technical Reports Server (NTRS)
Crow, Judy; Rushby, John
1994-01-01
We extend Reiter's general theory of model-based diagnosis to a theory of fault detection, identification, and reconfiguration (FDIR). The generality of Reiter's theory readily supports an extension in which the problem of reconfiguration is viewed as a close analog of the problem of diagnosis. Using a reconfiguration predicate 'rcfg' analogous to the abnormality predicate 'ab,' we derive a strategy for reconfiguration by transforming the corresponding strategy for diagnosis. There are two obvious benefits of this approach: algorithms for diagnosis can be exploited as algorithms for reconfiguration and we have a theoretical framework for an integrated approach to FDIR. As a first step toward realizing these benefits we show that a class of diagnosis engines can be used for reconfiguration and we discuss algorithms for integrated FDIR. We argue that integrating recovery and diagnosis is an essential next step if this technology is to be useful for practical applications.
Mercury Shopping Cart Interface
NASA Technical Reports Server (NTRS)
Pfister, Robin; McMahon, Joe
2006-01-01
Mercury Shopping Cart Interface (MSCI) is a reusable component of the Power User Interface 5.0 (PUI) program described in another article. MSCI is a means of encapsulating the logic and information needed to describe an orderable item consistent with Mercury Shopping Cart service protocol. Designed to be used with Web-browser software, MSCI generates Hypertext Markup Language (HTML) pages on which ordering information can be entered. MSCI comprises two types of Practical Extraction and Report Language (PERL) modules: template modules and shopping-cart logic modules. Template modules generate HTML pages for entering the required ordering details and enable submission of the order via a Hypertext Transfer Protocol (HTTP) post. Shopping cart modules encapsulate the logic and data needed to describe an individual orderable item to the Mercury Shopping Cart service. These modules evaluate information entered by the user to determine whether it is sufficient for the Shopping Cart service to process the order. Once an order has been passed from MSCI to a deployed Mercury Shopping Cart server, there is no further interaction with the user.
Lattice Theory, Measures and Probability
NASA Astrophysics Data System (ADS)
Knuth, Kevin H.
2007-11-01
In this tutorial, I will discuss the concepts behind generalizing ordering to measuring and apply these ideas to the derivation of probability theory. The fundamental concept is that anything that can be ordered can be measured. Since we are in the business of making statements about the world around us, we focus on ordering logical statements according to implication. This results in a Boolean lattice, which is related to the fact that the corresponding logical operations form a Boolean algebra. The concept of logical implication can be generalized to degrees of implication by generalizing the zeta function of the lattice. The rules of probability theory arise naturally as a set of constraint equations. Through this construction we are able to neatly connect the concepts of order, structure, algebra, and calculus. The meaning of probability is inherited from the meaning of the ordering relation, implication, rather than being imposed in an ad hoc manner at the start.
Long-term risk analysis associated with nuclear waste disposal in space
NASA Technical Reports Server (NTRS)
Friedlander, A. L.; Davis, D. R.
1979-01-01
An assessment and verification of previous analytic results on the long term risk of earth reentry for hazardous payloads is presented. The two areas were studied: (1) stability of nominal, near-circular storage orbits in the regions between Venus and earth and between earth and Mars, and (2) probability of earth reentry for off-nominal planet-crossing orbits resulting from deployment system failures. In the first area, numerical integrations of the equations of motion are compared with stability predications based on secular perturbation theory. The agreement is good in terms of the heliocentric distances covered and the general behavior of the orbital history, although certain near-resonance situations can lead to difficulty. In the second area, a Monte Carlo simulation of orbital evolution is used and the results compared with Opik's analytic theory of planetary encounters and collision statistics, with data verified to within a close order-of-magnitude.
On the Indirect Object in English.
ERIC Educational Resources Information Center
DeArmond, Richard C.
The aim of this paper is to determine whether the first predicate noun (NP) after the verb in sentences such as "Kelly gave Rose a piano" is the direct object or the indirect object in the surface structure of English. An analysis reveals that the direct object in English is not marked by its position immediately after a (transitive)…
2002-05-24
contrast to the Exdrone is the more conventional, and more Spartan, Pointer UAV. Designed by Paul McCready, PhD., the engineer who designed the “ Gossamer ... Albatross ”, the first human powered aircraft to cross the English Channel, the Pointer UAV’s design reflects an engineering philosophy predicated on
Course Preparation Assignments: A Strategy for Creating Discussion-Based Courses
ERIC Educational Resources Information Center
Yamane, David
2006-01-01
Although many of us would like to get beyond lecturing, we often lack concrete strategies for doing so, particularly in our larger classes. This paper suggests one such strategy for creating a discussion-based course. The success of such a course is predicated on students reading and thinking about the course material (receiving "first exposure")…
Parallel logic gates in synthetic gene networks induced by non-Gaussian noise.
Xu, Yong; Jin, Xiaoqin; Zhang, Huiqing
2013-11-01
The recent idea of logical stochastic resonance is verified in synthetic gene networks induced by non-Gaussian noise. We realize the switching between two kinds of logic gates under optimal moderate noise intensity by varying two different tunable parameters in a single gene network. Furthermore, in order to obtain more logic operations, thus providing additional information processing capacity, we obtain in a two-dimensional toggle switch model two complementary logic gates and realize the transformation between two logic gates via the methods of changing different parameters. These simulated results contribute to improve the computational power and functionality of the networks.
On the Use of CAD-Native Predicates and Geometry in Surface Meshing
NASA Technical Reports Server (NTRS)
Aftosmis, M. J.
1999-01-01
Several paradigms for accessing computer-aided design (CAD) geometry during surface meshing for computational fluid dynamics are discussed. File translation, inconsistent geometry engines, and nonnative point construction are all identified as sources of nonrobustness. The paper argues in favor of accessing CAD parts and assemblies in their native format, without translation, and for the use of CAD-native predicates and constructors in surface mesh generation. The discussion also emphasizes the importance of examining the computational requirements for exact evaluation of triangulation predicates during surface meshing.
Identifying logical planes formed of compute nodes of a subcommunicator in a parallel computer
DOE Office of Scientific and Technical Information (OSTI.GOV)
Davis, Kristan D.; Faraj, Daniel
In a parallel computer, a plurality of logical planes formed of compute nodes of a subcommunicator may be identified by: for each compute node of the subcommunicator and for a number of dimensions beginning with a first dimension: establishing, by a plane building node, in a positive direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in a positive direction of a second dimension, where the second dimension is orthogonal to the first dimension; and establishing, by the plane building node, in a negative direction of the first dimension,more » all logical planes that include the plane building node and compute nodes of the subcommunicator in the positive direction of the second dimension.« less
Borse, N N; Hyder, A A; Bishai, D; Baker, T; Arifeen, S E
2011-11-01
Childhood drowning is a major public health problem that has been neglected in many low- and middle-income countries. In Matlab, rural Bangladesh, more than 40% of child deaths aged 1-4 years are due to drowning. The main objective of this paper was to develop and evaluate a childhood drowning risk prediction index. A literature review was carried out to document risk factors identified for childhood drowning in Bangladesh. The Newacheck model for special health care needs for children was adapted and applied to construct a childhood drowning risk index called "Potential Risk Estimation Drowning Index for Children" (PREDIC). Finally, the proposed PREDIC Index was applied to childhood drowning deaths and compared with the comparison group from children living in Matlab, Bangladesh. This pilot study used t-tests and Receiver Operating Characteristic (ROC) curve to analyze the results. The PREDIC index was applied to 302 drowning deaths and 624 children 0-4 years old living in Matlab. The results of t-test indicate that the drowned children had a statistically (t=-8.58, p=0.0001) significant higher mean PREDIC score (6.01) than those in comparison group (5.26). Drowning cases had a PREDIC score of 6 or more for 68% of the children however, the comparison group had 43% of the children with score of 6 or more which was statistically significant (t=-7.36, p<0.001). The area under the curve for the Receiver Operating Characteristic curve was 0.662. Index score construction was scientifically plausible; and the index is relatively complete, fairly accurate, and practical. The risk index can help identify and target high risk children with drowning prevention programs. PREDIC index needs to be further tested for its accuracy, feasibility and effectiveness in drowning risk reduction in Bangladesh and other countries. Copyright © 2011 Elsevier Ltd. All rights reserved.
Minimum energy dissipation required for a logically irreversible operation
NASA Astrophysics Data System (ADS)
Takeuchi, Naoki; Yoshikawa, Nobuyuki
2018-01-01
According to Landauer's principle, the minimum heat emission required for computing is linked to logical entropy, or logical reversibility. The validity of Landauer's principle has been investigated for several decades and was finally demonstrated in recent experiments by showing that the minimum heat emission is associated with the reduction in logical entropy during a logically irreversible operation. Although the relationship between minimum heat emission and logical reversibility is being revealed, it is not clear how much free energy is required to be dissipated for a logically irreversible operation. In the present study, in order to reveal the connection between logical reversibility and free energy dissipation, we numerically demonstrated logically irreversible protocols using adiabatic superconductor logic. The calculation results of work during the protocol showed that, while the minimum heat emission conforms to Landauer's principle, the free energy dissipation can be arbitrarily reduced by performing the protocol quasistatically. The above results show that logical reversibility is not associated with thermodynamic reversibility, and that heat is not only emitted from logic devices but also absorbed by logic devices. We also formulated the heat emission from adiabatic superconductor logic during a logically irreversible operation at a finite operation speed.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Chang, P.Y.; Hao, E.; Patt, Y.
Conditional branches incur a severe performance penalty in wide-issue, deeply pipelined processors. Speculative execution and predicated execution are two mechanisms that have been proposed for reducing this penalty. Speculative execution can completely eliminate the penalty associated with a particular branch, but requires accurate branch prediction to be effective. Predicated execution does not require accurate branch prediction to eliminate the branch penalty, but is not applicable to all branches and can increase the latencies within the program. This paper examines the performance benefit of using both mechanisms to reduce the branch execution penalty. Predicated execution is used to handle the hard-to-protectmore » branches and speculative execution is used to handle the remaining branches. The hard-to-predict branches within the program are determined by profiling. We show that this approach can significantly reduce the branch execution penalty suffered by wide-issue processors.« less
Control logic to track the outputs of a command generator or randomly forced target
NASA Technical Reports Server (NTRS)
Trankle, T. L.; Bryson, A. E., Jr.
1977-01-01
A procedure is presented for synthesizing time-invariant control logic to cause the outputs of a linear plant to track the outputs of an unforced (or randomly forced) linear dynamic system. The control logic uses feed-forward of the reference system state variables and feedback of the plant state variables. The feed-forward gains are obtained from the solution of a linear algebraic matrix equation of the Liapunov type. The feedback gains are the usual regulator gains, determined to stabilize (or augment the stability of) the plant, possibly including integral control. The method is applied here to the design of control logic for a second-order servomechanism to follow a linearly increasing (ramp) signal, an unstable third-order system with two controls to track two separate ramp signals, and a sixth-order system with two controls to track a constant signal and an exponentially decreasing signal (aircraft landing-flare or glide-slope-capture with constant velocity).
A Rule-Based System Implementing a Method for Translating FOL Formulas into NL Sentences
NASA Astrophysics Data System (ADS)
Mpagouli, Aikaterini; Hatzilygeroudis, Ioannis
In this paper, we mainly present the implementation of a system that translates first order logic (FOL) formulas into natural language (NL) sentences. The motivation comes from an intelligent tutoring system teaching logic as a knowledge representation language, where it is used as a means for feedback to the students-users. FOL to NL conversion is achieved by using a rule-based approach, where we exploit the pattern matching capabilities of rules. So, the system consists of rule-based modules corresponding to the phases of our translation methodology. Facts are used in a lexicon providing lexical and grammatical information that helps in producing the NL sentences. The whole system is implemented in Jess, a java-implemented rule-based programming tool. Experimental results confirm the success of our choices.
NASA Astrophysics Data System (ADS)
Schäfer, Andreas; Holz, Jan; Leonhardt, Thiemo; Schroeder, Ulrik; Brauner, Philipp; Ziefle, Martina
2013-06-01
In this study, we address the problem of low retention and high dropout rates of computer science university students in early semesters of the studies. Complex and high abstract mathematical learning materials have been identified as one reason for the dropout rate. In order to support the understanding and practicing of core mathematical concepts, we developed a game-based multitouch learning environment in which the need for a suitable learning environment for mathematical logic was combined with the ability to train cooperation and collaboration in a learning scenario. As application domain, the field of mathematical logic had been chosen. The development process was accomplished along three steps: First, ethnographic interviews were run with 12 students of computer science revealing typical problems with mathematical logic. Second, a multitouch learning environment was developed. The game consists of multiple learning and playing modes in which teams of students can collaborate or compete against each other. Finally, a twofold evaluation of the environment was carried out (user study and cognitive walk-through). Overall, the evaluation showed that the game environment was easy to use and rated as helpful: The chosen approach of a multiplayer game supporting competition, collaboration, and cooperation is perceived as motivating and "fun."
Learning with touchscreen devices: game strategies to improve geometric thinking
NASA Astrophysics Data System (ADS)
Soldano, Carlotta; Arzarello, Ferdinando
2016-03-01
The aim of this paper is to reflect on the importance of the students' game-strategic thinking during the development of mathematical activities. In particular, we hypothesise that this type of thinking helps students in the construction of logical links between concepts during the "argumentation phase" of the proving process. The theoretical background of our study lies in the works of J. Hintikka, a Finnish logician, who developed a new type of logic, based on game theory, called the logic of inquiry. In order to experiment with this new approach to the teaching and learning of mathematics, we have prepared five game-activities based on geometric theorems in which two players play against each other in a multi-touch dynamic geometric environment (DGE). In this paper, we present the design of the first game-activity and the relationship between it and the logic of inquiry. Then, adopting the theoretical framework of the instrumental genesis by Vérillon and Rabardel (EJPE 10: 77-101, 1995), we will present and analyse significant actions and dialogues developed by students while they are solving the game. We focus on the presence of a particular way of playing the game introduced by the students, the "reflected game", and highlight its functions for the development of the task.
ERIC Educational Resources Information Center
Seltman, Muriel; Seltman, P. E. J.
1978-01-01
The authors stress the importance of bringing together the causal logic of history and the formal logic of mathematics in order to humanize mathematics and make it more accessible. An example of such treatment is given in a discussion of the centrality of Euclid and the Euclidean system to mathematics development. (MN)
ERIC Educational Resources Information Center
Martin, Ian; Carey, John
2014-01-01
A logic model was developed based on an analysis of the 2012 American School Counselor Association (ASCA) National Model in order to provide direction for program evaluation initiatives. The logic model identified three outcomes (increased student achievement/gap reduction, increased school counseling program resources, and systemic change and…
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 Astrophysics Data System (ADS)
D'Souza, Noel Michael
Nanomagnetic logic, incorporating logic bits in the magnetization orientations of single-domain nanomagnets, has garnered attention as an alternative to transistor-based logic due to its non-volatility and unprecedented energy-efficiency. The energy efficiency of this scheme is determined by the method used to flip the magnetization orientations of the nanomagnets in response to one or more inputs and produce the desired output. Unfortunately, the large dissipative losses that occur when nanomagnets are switched with a magnetic field or spin-transfer-torque inhibit the promised energy-efficiency. Another technique offering superior energy efficiency, "straintronics", involves the application of a voltage to a piezoelectric layer to generate a strain which is transferred to an elastically coupled magnetrostrictive layer, causing magnetization rotation. The functionality of this scheme can be enhanced further by introducing magnetocrystalline anisotropy in the magnetostrictive layer, thereby generating four stable magnetization states (instead of the two stable directions produced by shape anisotropy in ellipsoidal nanomagnets). Numerical simulations were performed to implement a low-power universal logic gate (NOR) using such 4-state magnetostrictive/piezoelectric nanomagnets (Ni/PZT) by clocking the piezoelectric layer with a small electrostatic potential (˜0.2 V) to switch the magnetization of the magnetic layer. Unidirectional and reliable logic propagation in this system was also demonstrated theoretically. Besides doubling the logic density (4-state versus 2-state) for logic applications, these four-state nanomagnets can be exploited for higher order applications such as image reconstruction and recognition in the presence of noise, associative memory and neuromorphic computing. Experimental work in strain-based switching has been limited to magnets that are multi-domain or magnets where strain moves domain walls. In this work, we also demonstrate strain-based switching in 2-state single-domain ellipsoidal magnetostrictive nanomagnets of lateral dimensions ˜200 nm fabricated on a piezoelectric substrate (PMN-PT) and studied using Magnetic Force Microscopy (MFM). A nanomagnetic Boolean NOT gate and unidirectional bit information propagation through a finite chain of dipole-coupled nanomagnets are also shown through strain-based "clocking". This is the first experimental demonstration of strain-based switching in nanomagnets and clocking of nanomagnetic logic (Boolean NOT gate), as well as logic propagation in an array of nanomagnets.
NASA Astrophysics Data System (ADS)
de Carvalho, Fábio Romeu; Abe, Jair Minoro
2010-11-01
Two recent non-classical logics have been used to make decision: fuzzy logic and paraconsistent annotated evidential logic Et. In this paper we present a simplified version of the fuzzy decision method and its comparison with the paraconsistent one. Paraconsistent annotated evidential logic Et, introduced by Da Costa, Vago and Subrahmanian (1991), is capable of handling uncertain and contradictory data without becoming trivial. It has been used in many applications such as information technology, robotics, artificial intelligence, production engineering, decision making etc. Intuitively, one Et logic formula is type p(a, b), in which a and b belong to [0, 1] (real interval) and represent respectively the degree of favorable evidence (or degree of belief) and the degree of contrary evidence (or degree of disbelief) found in p. The set of all pairs (a; b), called annotations, when plotted, form the Cartesian Unitary Square (CUS). This set, containing a similar order relation of real number, comprises a network, called lattice of the annotations. Fuzzy logic was introduced by Zadeh (1965). It tries to systematize the knowledge study, searching mainly to study the fuzzy knowledge (you don't know what it means) and distinguish it from the imprecise one (you know what it means, but you don't know its exact value). This logic is similar to paraconsistent annotated one, since it attributes a numeric value (only one, not two values) to each proposition (then we can say that it is an one-valued logic). This number translates the intensity (the degree) with which the preposition is true. Let's X a set and A, a subset of X, identified by the function f(x). For each element x∈X, you have y = f(x)∈[0, 1]. The number y is called degree of pertinence of x in A. Decision making theories based on these logics have shown to be powerful in many aspects regarding more traditional methods, like the one based on Statistics. In this paper we present a first study for a simplified version of decision making theory based on Fuzzy Logic (SVMFD) and a comparison with the Paraconsistent Decision Method (PDM) based on Paraconsistent Annotated Evidential Logic Eτ, already presented and summarized in this paper. An example showing the two methods is presented in the paper, as well as a comparison between them.
Making Bullying Prevention a Priority in Finnish Schools: The KiVa Antibullying Program
ERIC Educational Resources Information Center
Salmivalli, Christina; Poskiparta, Elisa
2012-01-01
The KiVa antibullying program has been widely implemented in Finnish comprehensive schools since 2009. The program is predicated on the idea that a positive change in the behaviors of classmates can reduce the rewards gained by the perpetrators of bullying and consequently their motivation to bully in the first place. KiVa involves both universal…
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.
Image/video understanding systems based on network-symbolic models
NASA Astrophysics Data System (ADS)
Kuvich, Gary
2004-03-01
Vision is a part of a larger information system that converts visual information into knowledge structures. These structures drive vision process, resolve ambiguity and uncertainty via feedback projections, and provide image understanding that is an interpretation of visual information in terms of such knowledge models. Computer simulation models are built on the basis of graphs/networks. The ability of human brain to emulate similar graph/network models is found. Symbols, predicates and grammars naturally emerge in such networks, and logic is simply a way of restructuring such models. Brain analyzes an image as a graph-type relational structure created via multilevel hierarchical compression of visual information. Primary areas provide active fusion of image features on a spatial grid-like structure, where nodes are cortical columns. Spatial logic and topology naturally present in such structures. Mid-level vision processes like perceptual grouping, separation of figure from ground, are special kinds of network transformations. They convert primary image structure into the set of more abstract ones, which represent objects and visual scene, making them easy for analysis by higher-level knowledge structures. Higher-level vision phenomena are results of such analysis. Composition of network-symbolic models combines learning, classification, and analogy together with higher-level model-based reasoning into a single framework, and it works similar to frames and agents. Computational intelligence methods transform images into model-based knowledge representation. Based on such principles, an Image/Video Understanding system can convert images into the knowledge models, and resolve uncertainty and ambiguity. This allows creating intelligent computer vision systems for design and manufacturing.
Cochran, Susan A.; Roberts, Lucile M.; Evans, Kevin R.
2002-01-01
This guidebook was compiled with the express purpose of describing the general geology of Moloka'i and those locations with significance to the U.S. Geological Survey's study of Moloka'i's coral reef, a part of the U.S. Department of Interior's 'Protecting the Nation's Reefs' program. The first portion of the guidebook describes the island and gives the historical background. Fieldtrip stop locations are listed in a logical driving order, essentially from west to east. This order may be changed, or stops deleted, depending on time and scheduling of an individual fieldtrip.
Logic models as a tool for sexual violence prevention program development.
Hawkins, Stephanie R; Clinton-Sherrod, A Monique; Irvin, Neil; Hart, Laurie; Russell, Sarah Jane
2009-01-01
Sexual violence is a growing public health problem, and there is an urgent need to develop sexual violence prevention programs. Logic models have emerged as a vital tool in program development. The Centers for Disease Control and Prevention funded an empowerment evaluation designed to work with programs focused on the prevention of first-time male perpetration of sexual violence, and it included as one of its goals, the development of program logic models. Two case studies are presented that describe how significant positive changes can be made to programs as a result of their developing logic models that accurately describe desired outcomes. The first case study describes how the logic model development process made an organization aware of the importance of a program's environmental context for program success; the second case study demonstrates how developing a program logic model can elucidate gaps in organizational programming and suggest ways to close those gaps.
Fuzzy branching temporal logic.
Moon, Seong-ick; Lee, Kwang H; Lee, Doheon
2004-04-01
Intelligent systems require a systematic way to represent and handle temporal information containing uncertainty. In particular, a logical framework is needed that can represent uncertain temporal information and its relationships with logical formulae. Fuzzy linear temporal logic (FLTL), a generalization of propositional linear temporal logic (PLTL) with fuzzy temporal events and fuzzy temporal states defined on a linear time model, was previously proposed for this purpose. However, many systems are best represented by branching time models in which each state can have more than one possible future path. In this paper, fuzzy branching temporal logic (FBTL) is proposed to address this problem. FBTL adopts and generalizes concurrent tree logic (CTL*), which is a classical branching temporal logic. The temporal model of FBTL is capable of representing fuzzy temporal events and fuzzy temporal states, and the order relation among them is represented as a directed graph. The utility of FBTL is demonstrated using a fuzzy job shop scheduling problem as an example.
Regulatory issues relating to therapies for periodontal regeneration.
Singleton, D G; Torres-Cabassa, A
1997-03-01
The Food and Drug Administration (FDA) has regulated medical devices since May 1976, when the Medical Device Amendments were enacted. The clinical trial requirements for the marketing of periodontal regeneration devices have been dependent, in part, on the degree of their similarity to devices marketed prior to the legislative enactment date in terms of materials, indication statements, and labeling claims. Nonresorbable barriers were allowed to be marketed based on their equivalence to devices marketed prior to the enactment date based on biocompatability and clinical trial data under the premarket notification requirements section of the law. Bone filling materials such as hydroxyapatite were first marketed based on the finding of equivalence to predicate devices. Newer technologies such as bioabsorbable barriers have also been reviewed under the premarket notification provisions of the law, but manufacturers have been required to provide more extensive safety and effectiveness data to establish equivalence to pre-Amendments devices. Data to answer questions related to the potential toxicity of breakdown products, period of absorption, and ultimate clinical effectiveness needed to be answered prior to marketing. New devices that incorporate technologies that are not substantially equivalent to predicate devices must proceed through the premarket approval route to marketing. For new devices considered a potential significant risk to the patient population, clinical trials are conducted via the investigational device exemption (IDE) requirements that specify the means by which trials will proceed in order to protect the rights of patients. New devices of organic origin, such as bone morphogenic protein, have followed the premarket approval route with IDE requirements instituted as a condition for their path to the marketplace. Issues associated with immediate and long-term contact including potential toxicity, tumorigenicity, and sensitization need to be addressed with appropriate animal models.
Group Solutions, Too! More Cooperative Logic Activities for Grades K-4. Teacher's Guide. LHS GEMS.
ERIC Educational Resources Information Center
Goodman, Jan M.; Kopp, Jaine
There is evidence that structured cooperative logic is an effective way to introduce or reinforce mathematics concepts, explore thinking processes basic to both math and science, and develop the important social skills of cooperative problem-solving. This book contains a number of cooperative logic activities for grades K-4 in order to improve…
Federal Register 2010, 2011, 2012, 2013, 2014
2013-07-08
... maintains logical ports for order entry (FIX, HP-API), drop copies (DROP), EdgeRisk and market data (collectively, ``Direct Logical Ports'').\\4\\ In SR-EDGX-2012-36, the Exchange reduced the number of free Direct... 33871 (June 5, 2013) (SR-EDGX-2013-18) (adding EdgeRisk ports to the list of logical ports offered by...
Federal Register 2010, 2011, 2012, 2013, 2014
2013-07-08
... maintains logical ports for order entry (FIX, HP-API), drop copies (DROP), EdgeRisk and market data (collectively, ``Direct Logical Ports'').\\4\\ In SR-EDGA-2012-37, the Exchange reduced the number of free Direct... 30, 2013) 78 FR 33880 (June 5, 2013) (SR-EDGA-2013-14) (adding EdgeRisk ports to the list of logical...
Federal Register 2010, 2011, 2012, 2013, 2014
2012-05-22
... SECURITIES AND EXCHANGE COMMISSION [File No. 500-1] Alderox, Inc., Applied Solar, Inc., Artes Medical, Inc., AskMeNow, Inc., Blink Logic Inc., and Convergence Ethanol, Inc.; Order of Suspension of... Blink Logic Inc. because it has not filed any periodic reports since the period ended June 30, 2009. It...
Method and apparatus for controlling multiple motors
Jones, Rollin G.; Kortegaard, Bert L.; Jones, David F.
1987-01-01
A method and apparatus are provided for simultaneously controlling a plurality of stepper motors. Addressing circuitry generates address data for each motor in a periodic address sequence. Memory circuits respond to the address data for each motor by accessing a corresponding memory location containing a first operational data set functionally related to a direction for moving the motor, speed data, and rate of speed change. First logic circuits respond to the first data set to generate a motor step command. Second logic circuits respond to the command from the first logic circuits to generate a third data set for replacing the first data set in memory with a current operational motor status, which becomes the first data set when the motor is next addressed.
PREDICE score as a predictor of 90 days mortality in patients with heart failure
NASA Astrophysics Data System (ADS)
Purba, D. P. S.; Hasan, R.
2018-03-01
Hospitalization in chronic heart failure patients associated with high mortality and morbidity rate. The 90 days post-discharge period following hospitalization in heart failure patients is known as the vulnerable phase, it carries the high risk of poor outcomes. Identification of high-risk individuals by using prognostic evaluation was intended to do a closer follow up and more intensive to decreasing the morbidity and mortality rate of heart failure.To determine whether PREDICE score could predict mortality within 90 days in patients with heart failure, an observational cohort study in patients with heart failure who were hospitalized due to worsening chronic heart failure. Patients were in following-up for up to 90 days after initial evaluation with the primary endpoint is death.We found a difference of the significantstatistical between PREDICE score in survival and mortality group (p=0.001) of 84% (95% CI: 60.9% - 97.4%).In conclusion, PREDICE score has a good ability to predict mortality within 90 days in patients with heart failure.
Highs and Lows in English Attachment.
Grillo, Nino; Costa, João; Fernandes, Bruno; Santi, Andrea
2015-11-01
Grillo and Costa (2014) claim that Relative-Clause attachment ambiguity resolution is largely dependent on whether or not a Pseudo-Relative interpretation is available. Data from Italian, and other languages allowing Pseudo-Relatives, support this hypothesis. Pseudo-Relative availability, however, covaries with the semantics of the main predicate (e.g., perceptual vs. stative). Experiment 1 assesses whether this predicate distinction alone can account for prior attachment results by testing it with a language that disallows Pseudo-Relatives (i.e. English). Low Attachment was found independent of Predicate-Type. Predicate-Type did however have a minor modulatory role. Experiment 2 shows that English, traditionally classified as a Low Attachment language, can demonstrate High Attachment with sentences globally ambiguous between a Small-Clause and a reduced Relative-Clause interpretation. These results support a grammatical account of previous effects and provide novel evidence for the parser's preference of a Small-Clause over a Restrictive interpretation, crosslinguistically. Copyright © 2015 Elsevier B.V. All rights reserved.
Childrens Hospital Integrated Patient Electronic Record System Continuation (CHIPERS)
2015-12-01
of our interactive BPAs and order set technology. The Cumberland Group has been the primary consulting group assisting the entire inpatient and...to allow for continued BPA development and iteration during the upgrade period, while also effecting a seamless transition of BPA and order set...clinical decision support system. Our BPA logic includes: Severe Sepsis Alert Logic Summary: Age + Temperature + White Blood Cell and (lethargy or
MIDDLE NORTH Series Pre-DICE THROW I, II and DICE THROW Test Execution Report
1978-04-01
THROW 1 1- 14 1-10 Site Layout, 5 -Ton Events, Pre-DICE THROW I 1-16 1-11 Test Bed Layout - Pre-DICE THROW I 1-17 1-12 Airblast Gages and Instrumentation...111- 14 0-15 List of Tables (Cont’d) Table Page 3-3 Stacking Data 111-19 -22 3-4 Charge Weights 111-23 3- 5 ANFO Charge Summiary 111-23 3-6 Power...described in Table 1-1 and in Figures 1- 5 and 1-6 (these were detonated on 30 April, 14 May and 31 May 1975). Figures 1-7 and 1-8 show photographs of the ANFO
Predicate Adjective Usage in Standard Russian.
ERIC Educational Resources Information Center
Benson, Morton
1959-01-01
This paper describes predicate adjective usage in modern standard Russian using a corpus of written Russian derived from "Pravda" (neutral literary style) and "Krokodil" (conversational material). The short, long nominative, and instrumental forms are examined in relation to the type of adjective, copulative verb, sentence subject, and other…
Argument Structure of Tsou: Simplex and Complex Predicates
ERIC Educational Resources Information Center
Lin, Gujing
2010-01-01
This thesis investigates the argument structure of Tsou, a Formosan language within the Austronesian family. The investigation studies both simplex and complex predicates as well as describes the valency groupings and alignment patterns emerging from various clausal configurations. Assuming the stance that language description should respect…
ERIC Educational Resources Information Center
Wright, Pamela S.
This paper examines several previously-unexplained aspects of verbal morphology and syntax in Madija, an Arauan languages spoken in Peru and Brazil. These include the distribution of an auxiliary verb that occurs with some predicates but not with others and the factors that determine the choice among three different affixes marking third person…
Multi-fingered haptic palpation utilizing granular jamming stiffness feedback actuators
NASA Astrophysics Data System (ADS)
Li, Min; Ranzani, Tommaso; Sareh, Sina; Seneviratne, Lakmal D.; Dasgupta, Prokar; Wurdemann, Helge A.; Althoefer, Kaspar
2014-09-01
This paper describes a multi-fingered haptic palpation method using stiffness feedback actuators for simulating tissue palpation procedures in traditional and in robot-assisted minimally invasive surgery. Soft tissue stiffness is simulated by changing the stiffness property of the actuator during palpation. For the first time, granular jamming and pneumatic air actuation are combined to realize stiffness modulation. The stiffness feedback actuator is validated by stiffness measurements in indentation tests and through stiffness discrimination based on a user study. According to the indentation test results, the introduction of a pneumatic chamber to granular jamming can amplify the stiffness variation range and reduce hysteresis of the actuator. The advantage of multi-fingered palpation using the proposed actuators is proven by the comparison of the results of the stiffness discrimination performance using two-fingered (sensitivity: 82.2%, specificity: 88.9%, positive predicative value: 80.0%, accuracy: 85.4%, time: 4.84 s) and single-fingered (sensitivity: 76.4%, specificity: 85.7%, positive predicative value: 75.3%, accuracy: 81.8%, time: 7.48 s) stiffness feedback.
Predicate calculus, artificial intelligence, and workers' compensation.
Harber, P; McCoy, J M
1989-05-01
Application of principles of predicate calculus (PC) and artificial intelligence (AI) search methods to occupational medicine can meet several goals. First, they can improve understanding of the diagnostic process and recognition of the sources of uncertainty in knowledge and in case specific information. Second, PC provides a rational means of resolving differences in conclusion based upon the same premises. Third, understanding of these principles allows separation of knowledge (facts) from the process by which they are used and therefore facilitates development of AI-based expert systems. Application of PC to recognizing causation of pulmonary fibrosis is demonstrated in this paper, providing a method that can be generalized to other problems in occupational medicine. Application of PC and understanding of AI search routines may be particularly applicable to workers' compensation where explicit statement of rational and inferential process is necessary. This approach is useful in the diagnosis of occupational lung disease and may be particularly valuable in workers' compensation considerations, wherein explicit statement of rationale is needed.
Aota, Takumi; Wada, Hideo; Fujimoto, Naoki; Sugimoto, Kazushi; Yamashita, Yoshiki; Matsumoto, Takeshi; Ohishi, Kohshi; Suzuki, Kei; Imai, Hiroshi; Kawasugi, Kazuo; Madoiwa, Seiji; Asakura, Hidesaku; Katayama, Naoyuki
2016-11-01
We evaluated the modified diagnostic criteria for disseminated intravascular coagulation (DIC), which was published by the Japanese Society of Thrombosis and Hemostasis (JSTH), in 274 suspected DIC patients with hematopoietic injury. The diagnoses of the patients were as follows: DIC (n=125); pre-DIC (n=42) and non-DIC (n=107). The efficacy of the diagnostic criteria for DIC was evaluated using a receiver operating characteristic (ROC) analysis. The area under the curve (ARC) and odd's ratio for the global coagulation test (GCT) scores in the diagnosis of "DIC" were high, while those for the diagnosis of "DIC and pre-DIC" were low, suggesting that the addition of antithrombin (AT) and soluble fibrin (SF)/thrombin antithrobin complex (TAT) was required to diagnose "DIC and pre-DIC". Although the addition of the AT and SF/TAT values to the GCT did not increase its ability to predict a poor outcome, the JSTH's modified diagnostic criteria scores were correlated with the odds ratio for death. The JSTH's modified diagnostic criteria for DIC, which included the GCT score, and the AT, and TAT/SF values, were useful for diagnosing DIC and pre-DIC, and predicting a poor outcome. Copyright © 2016 Elsevier Ltd. All rights reserved.
NASA Astrophysics Data System (ADS)
Milic, Vladimir; Kasac, Josip; Novakovic, Branko
2015-10-01
This paper is concerned with ?-gain optimisation of input-affine nonlinear systems controlled by analytic fuzzy logic system. Unlike the conventional fuzzy-based strategies, the non-conventional analytic fuzzy control method does not require an explicit fuzzy rule base. As the first contribution of this paper, we prove, by using the Stone-Weierstrass theorem, that the proposed fuzzy system without rule base is universal approximator. The second contribution of this paper is an algorithm for solving a finite-horizon minimax problem for ?-gain optimisation. The proposed algorithm consists of recursive chain rule for first- and second-order derivatives, Newton's method, multi-step Adams method and automatic differentiation. Finally, the results of this paper are evaluated on a second-order nonlinear system.
Martin, A.D.
1986-05-09
Method and apparatus are provided for generating an output pulse following a trigger pulse at a time delay interval preset with a resolution which is high relative to a low resolution available from supplied clock pulses. A first lumped constant delay provides a first output signal at predetermined interpolation intervals corresponding to the desired high resolution time interval. Latching circuits latch the high resolution data to form a first synchronizing data set. A selected time interval has been preset to internal counters and corrected for circuit propagation delay times having the same order of magnitude as the desired high resolution. Internal system clock pulses count down the counters to generate an internal pulse delayed by an internal which is functionally related to the preset time interval. A second LCD corrects the internal signal with the high resolution time delay. A second internal pulse is then applied to a third LCD to generate a second set of synchronizing data which is complementary with the first set of synchronizing data for presentation to logic circuits. The logic circuits further delay the internal output signal with the internal pulses. The final delayed output signal thereafter enables the output pulse generator to produce the desired output pulse at the preset time delay interval following input of the trigger pulse.
Ordering Traces Logically to Identify Lateness in Message Passing Programs
Isaacs, Katherine E.; Gamblin, Todd; Bhatele, Abhinav; ...
2015-03-30
Event traces are valuable for understanding the behavior of parallel programs. However, automatically analyzing a large parallel trace is difficult, especially without a specific objective. We aid this endeavor by extracting a trace's logical structure, an ordering of trace events derived from happened-before relationships, while taking into account developer intent. Using this structure, we can calculate an operation's delay relative to its peers on other processes. The logical structure also serves as a platform for comparing and clustering processes as well as highlighting communication patterns in a trace visualization. We present an algorithm for determining this idealized logical structure frommore » traces of message passing programs, and we develop metrics to quantify delays and differences among processes. We implement our techniques in Ravel, a parallel trace visualization tool that displays both logical and physical timelines. Rather than showing the duration of each operation, we display where delays begin and end, and how they propagate. As a result, we apply our approach to the traces of several message passing applications, demonstrating the accuracy of our extracted structure and its utility in analyzing these codes.« less
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.
Yoon, Doe Hyun; Muralimanohar, Naveen; Chang, Jichuan; Ranganthan, Parthasarathy
2017-09-26
A disclosed example method involves performing simultaneous data accesses on at least first and second independently selectable logical sub-ranks to access first data via a wide internal data bus in a memory device. The memory device includes a translation buffer chip, memory chips in independently selectable logical sub-ranks, a narrow external data bus to connect the translation buffer chip to a memory controller, and the wide internal data bus between the translation buffer chip and the memory chips. A data access is performed on only the first independently selectable logical sub-rank to access second data via the wide internal data bus. The example method also involves locating a first portion of the first data, a second portion of the first data, and the second data on the narrow external data bus during separate data transfers.
Cross Currents: Communication/Language/Cross-Cultural Skills. Volume 6, Number 2.
ERIC Educational Resources Information Center
Gutow, Howard, Ed.
1979-01-01
This issue of "Cross Currents" includes the following articles: "An Experience with CLL" by Earl Stevick; "Accuracy vs. Fluency in the English Language Classroom" by Kenton Sutherland; "Predicate Markers: A New Look at the English Predicate System" by Phillip L. Knowles; "'Let Your TV do the Talking':…
Agreement Reflexes of Emerging Optionality in Heritage Speaker Spanish
ERIC Educational Resources Information Center
Pascual Cabo, Diego
2013-01-01
This study contributes to current trends of heritage speaker (HS) acquisition research by examining the syntax of psych-predicates in HS Spanish. Broadly defined, psych-predicates communicate states of emotions (e.g., to love) and have traditionally been categorized as belonging to one of three classes: class I--"temere" "to…
Morphosyntax of Complex Predicates in South Caucasian Languages
ERIC Educational Resources Information Center
Lomashvili, Leila
2010-01-01
The argument structure of complex predicates such as causatives and applicatives is closely associated with the functional heads that introduce core and non-core arguments: Voice, causative and applicative. These elements merge in a sentence structure at various cycles of derivation and take complements whose "size" accounts for the meaning and…
Neuro-Linguistic Programming, Matching Sensory Predicates, and Rapport.
ERIC Educational Resources Information Center
Schmedlen, George W.; And Others
A key task for the therapist in psychotherapy is to build trust and rapport with the client. Neuro-Linguistic Programming (NLP) practitioners believe that matching the sensory modality (representational system) of a client's predicates (verbs, adverbs, and adjectives) improves rapport. In this study, 16 volunteer subjects participated in two…
The Role of Working Memory in Metaphor Production and Comprehension
ERIC Educational Resources Information Center
Chiappe, Dan L.; Chiappe, Penny
2007-01-01
The following tested Kintsch's [Kintsch, W. (2000). "Metaphor comprehension: a computational theory." "Psychonomic Bulletin & Review," 7, 257-266 and Kintsch, W. (2001). "Predication." "Cognitive Science," 25, 173-202] Predication Model, which predicts that working memory capacity is an important factor in metaphor processing. In support of his…
Control and Restructuring at the Syntax-Semantics Interface
ERIC Educational Resources Information Center
Grano, Thomas Angelo
2012-01-01
Landau (2000) distinguishes between P(artial) C(ontrol) and E(xhaustive) C(ontrol): PC predicates like hope admit a subset relation between controller and controllee (e.g., "Kim hoped to gather at noon." [controllee = Kim and contextually salient others]); EC predicates like "try" do not (*"Kim tried to gather at…
Le Predicat Adjectif en Esperanto (The Predicate Adjective in Esperanto)
ERIC Educational Resources Information Center
Lo Jocomo, Francois
1977-01-01
A study of the predicate adjective in Esperanto based on the opposition established between the complementary classifications, monemes and words. Because morphological complications do not exist in Esperanto, study of the two classifications could proceed to the benefit of the study of other languages. (Text is in French.) (AMH)
A motion-constraint logic for moving-base simulators based on variable filter parameters
NASA Technical Reports Server (NTRS)
Miller, G. K., Jr.
1974-01-01
A motion-constraint logic for moving-base simulators has been developed that is a modification to the linear second-order filters generally employed in conventional constraints. In the modified constraint logic, the filter parameters are not constant but vary with the instantaneous motion-base position to increase the constraint as the system approaches the positional limits. With the modified constraint logic, accelerations larger than originally expected are limited while conventional linear filters would result in automatic shutdown of the motion base. In addition, the modified washout logic has frequency-response characteristics that are an improvement over conventional linear filters with braking for low-frequency pilot inputs. During simulated landing approaches of an externally blown flap short take-off and landing (STOL) transport using decoupled longitudinal controls, the pilots were unable to detect much difference between the modified constraint logic and the logic based on linear filters with braking.
The universal numbers. From Biology to Physics.
Marchal, Bruno
2015-12-01
I will explain how the mathematicians have discovered the universal numbers, or abstract computer, and I will explain some abstract biology, mainly self-reproduction and embryogenesis. Then I will explain how and why, and in which sense, some of those numbers can dream and why their dreams can glue together and must, when we assume computationalism in cognitive science, generate a phenomenological physics, as part of a larger phenomenological theology (in the sense of the greek theologians). The title should have been "From Biology to Physics, through the Phenomenological Theology of the Universal Numbers", if that was not too long for a title. The theology will consist mainly, like in some (neo)platonist greek-indian-chinese tradition, in the truth about numbers' relative relations, with each others, and with themselves. The main difference between Aristotle and Plato is that Aristotle (especially in its common and modern christian interpretation) makes reality WYSIWYG (What you see is what you get: reality is what we observe, measure, i.e. the natural material physical science) where for Plato and the (rational) mystics, what we see might be only the shadow or the border of something else, which might be non physical (mathematical, arithmetical, theological, …). Since Gödel, we know that Truth, even just the Arithmetical Truth, is vastly bigger than what the machine can rationally justify. Yet, with Church's thesis, and the mechanizability of the diagonalizations involved, machines can apprehend this and can justify their limitations, and get some sense of what might be true beyond what they can prove or justify rationally. Indeed, the incompleteness phenomenon introduces a gap between what is provable by some machine and what is true about that machine, and, as Gödel saw already in 1931, the existence of that gap is accessible to the machine itself, once it is has enough provability abilities. Incompleteness separates truth and provable, and machines can justify this in some way. More importantly incompleteness entails the distinction between many intensional variants of provability. For example, the absence of reflexion (beweisbar(⌜A⌝) → A with beweisbar being Gödel's provability predicate) makes it impossible for the machine's provability to obey the axioms usually taken for a theory of knowledge. The most important consequence of this in the machine's possible phenomenology is that it provides sense, indeed arithmetical sense, to intensional variants of provability, like the logics of provability-and-truth, which at the propositional level can be mirrored by the logic of provable-and-true statements (beweisbar(⌜A⌝) ∧ A). It is incompleteness which makes this logic different from the logic of provability. Other variants, like provable-and-consistent, or provable-and-consistent-and-true, appears in the same way, and inherits the incompleteness splitting, unlike beweisbar(⌜A⌝) ∧ A. I will recall thought experience which motivates the use of those intensional variants to associate a knower and an observer in some canonical way to the machines or the numbers. We will in this way get an abstract and phenomenological theology of a machine M through the true logics of their true self-referential abilities (even if not provable, or knowable, by the machine itself), in those different intensional senses. Cognitive science and theoretical physics motivate the study of those logics with the arithmetical interpretation of the atomic sentences restricted to the "verifiable" (Σ1) sentences, which is the way to study the theology of the computationalist machine. This provides a logic of the observable, as expected by the Universal Dovetailer Argument, which will be recalled briefly, and which can lead to a comparison of the machine's logic of physics with the empirical logic of the physicists (like quantum logic). This leads also to a series of open problems. Copyright © 2015 Elsevier Ltd. All rights reserved.
The neural correlates of belief-bias inhibition: the impact of logic training.
Luo, Junlong; Tang, Xiaochen; Zhang, Entao; Stupple, Edward J N
2014-12-01
Functional Magnetic Resonance Imaging (fMRI) was used to investigate the brain activity associated with response change in a belief bias paradigm before and after logic training. Participants completed two sets of belief biased reasoning tasks. In the first set they were instructed to respond based on their empirical beliefs, and in the second - following logic training - they were instructed to respond logically. The comparison between conflict problems in the second scan versus in the first scan revealed differing activation for the left inferior frontal gyrus, left middle frontal gyrus, cerebellum, and precuneus. The scan was time locked to the presentation of the minor premise, and thus demonstrated effects of belief-logic conflict on neural activation earlier in the time course than has previously been shown in fMRI. These data, moreover, indicated that logical training results in changes in brain activity associated with cognitive control processing. Copyright © 2014 Elsevier B.V. All rights reserved.
NASA Astrophysics Data System (ADS)
Lu, Bin; Cheng, Xiaomin; Feng, Jinlong; Guan, Xiawei; Miao, Xiangshui
2016-07-01
Nonvolatile memory devices or circuits that can implement both storage and calculation are a crucial requirement for the efficiency improvement of modern computer. In this work, we realize logic functions by using [GeTe/Sb2Te3]n super lattice phase change memory (PCM) cell in which higher threshold voltage is needed for phase change with a magnetic field applied. First, the [GeTe/Sb2Te3]n super lattice cells were fabricated and the R-V curve was measured. Then we designed the logic circuits with the super lattice PCM cell verified by HSPICE simulation and experiments. Seven basic logic functions are first demonstrated in this letter; then several multi-input logic gates are presented. The proposed logic devices offer the advantages of simple structures and low power consumption, indicating that the super lattice PCM has the potential in the future nonvolatile central processing unit design, facilitating the development of massive parallel computing architecture.
NASA Astrophysics Data System (ADS)
Salehi-Fashami, M.; Al-Rashid, M.; Sun, Wei-Yang; Nordeen, P.; Bandyopadhyay, S.; Chavez, A. C.; Carman, G. P.; Atulasimha, J.
2016-10-01
Nanomagnetic logic has emerged as a potential replacement for traditional Complementary Metal Oxide Semiconductor (CMOS) based logic because of superior energy-efficiency (Salahuddin and Datta 2007 Appl. Phys. Lett. 90 093503, Cowburn and Welland 2000 Science 287 1466-68). One implementation of nanomagnetic logic employs shape-anisotropic (e.g. elliptical) ferromagnets (with two stable magnetization orientations) as binary switches that rely on dipole-dipole interaction to communicate binary information (Cowburn and Welland 2000 Science 287 1466-8, Csaba et al 2002 IEEE Trans. Nanotechnol. 1 209-13, Carlton et al 2008 Nano Lett. 8 4173-8, Atulasimha and Bandyopadhyay 2010 Appl. Phys. Lett. 97 173105, Roy et al 2011 Appl. Phys. Lett. 99 063108, Fashami et al 2011 Nanotechnology 22 155201, Tiercelin et al 2011 Appl. Phys. Lett. 99 , Alam et al 2010 IEEE Trans. Nanotechnol. 9 348-51 and Bhowmik et al 2013 Nat. Nanotechnol. 9 59-63). Normally, circular nanomagnets are incompatible with this approach since they lack distinct stable in-plane magnetization orientations to encode bits. However, circular magnetoelastic nanomagnets can be made bi-stable with a voltage induced anisotropic strain, which provides two significant advantages for nanomagnetic logic applications. First, the shape-anisotropy energy barrier is eliminated which reduces the amount of energy required to reorient the magnetization. Second, the in-plane size can be reduced (˜20 nm) which was previously not possible due to thermal stability issues. In circular magnetoelastic nanomagnets, a voltage induced strain stabilizes the magnetization even at this size overcoming the thermal stability issue. In this paper, we analytically demonstrate the feasibility of a binary ‘logic wire’ implemented with an array of circular nanomagnets that are clocked with voltage-induced strain applied by an underlying piezoelectric substrate. This leads to an energy-efficient logic paradigm orders of magnitude superior to existing CMOS-based logic that is scalable to dimensions substantially smaller than those for existing nanomagnetic logic approaches. The analytical approach is validated with experimental measurements conducted on dipole coupled Nickel (Ni) nanodots fabricated on a PMN-PT (Lead Magnesium Niobate-Lead Titanate) sample.
NASA Astrophysics Data System (ADS)
Ripamonti, Francesco; Resta, Ferruccio; Vivani, Andrea
2015-04-01
The aim of this paper is to present two control logics and an attitude estimator for UAV stabilization and remote piloting, that are as robust as possible to physical parameters variation and to other external disturbances. Moreover, they need to be implemented on low-cost micro-controllers, in order to be attractive for commercial drones. As an example, possible applications of the two switching control logics could be area surveillance and facial recognition by means of a camera mounted on the drone: the high computational speed logic is used to reach the target, when the high-stability one is activated, in order to complete the recognition tasks.
Reilly, Jamie; Peelle, Jonathan E; Garcia, Amanda; Crutch, Sebastian J
2016-08-01
Biological plausibility is an essential constraint for any viable model of semantic memory. Yet, we have only the most rudimentary understanding of how the human brain conducts abstract symbolic transformations that underlie word and object meaning. Neuroscience has evolved a sophisticated arsenal of techniques for elucidating the architecture of conceptual representation. Nevertheless, theoretical convergence remains elusive. Here we describe several contrastive approaches to the organization of semantic knowledge, and in turn we offer our own perspective on two recurring questions in semantic memory research: (1) to what extent are conceptual representations mediated by sensorimotor knowledge (i.e., to what degree is semantic memory embodied)? (2) How might an embodied semantic system represent abstract concepts such as modularity, symbol, or proposition? To address these questions, we review the merits of sensorimotor (i.e., embodied) and amodal (i.e., disembodied) semantic theories and address the neurobiological constraints underlying each. We conclude that the shortcomings of both perspectives in their extreme forms necessitate a hybrid middle ground. We accordingly propose the Dynamic Multilevel Reactivation Framework-an integrative model predicated upon flexible interplay between sensorimotor and amodal symbolic representations mediated by multiple cortical hubs. We discuss applications of the dynamic multilevel reactivation framework to abstract and concrete concept representation and describe how a multidimensional conceptual topography based on emotion, sensation, and magnitude can successfully frame a semantic space containing meanings for both abstract and concrete words. The consideration of 'abstract conceptual features' does not diminish the role of logical and/or executive processing in activating, manipulating and using information stored in conceptual representations. Rather, it proposes that the materials upon which these processes operate necessarily combine pure sensorimotor information and higher-order cognitive dimensions involved in symbolic representation.
Multiagent data warehousing and multiagent data mining for cerebrum/cerebellum modeling
NASA Astrophysics Data System (ADS)
Zhang, Wen-Ran
2002-03-01
An algorithm named Neighbor-Miner is outlined for multiagent data warehousing and multiagent data mining. The algorithm is defined in an evolving dynamic environment with autonomous or semiautonomous agents. Instead of mining frequent itemsets from customer transactions, the new algorithm discovers new agents and mining agent associations in first-order logic from agent attributes and actions. While the Apriori algorithm uses frequency as a priory threshold, the new algorithm uses agent similarity as priory knowledge. The concept of agent similarity leads to the notions of agent cuboid, orthogonal multiagent data warehousing (MADWH), and multiagent data mining (MADM). Based on agent similarities and action similarities, Neighbor-Miner is proposed and illustrated in a MADWH/MADM approach to cerebrum/cerebellum modeling. It is shown that (1) semiautonomous neurofuzzy agents can be identified for uniped locomotion and gymnastic training based on attribute relevance analysis; (2) new agents can be discovered and agent cuboids can be dynamically constructed in an orthogonal MADWH, which resembles an evolving cerebrum/cerebellum system; and (3) dynamic motion laws can be discovered as association rules in first order logic. Although examples in legged robot gymnastics are used to illustrate the basic ideas, the new approach is generally suitable for a broad category of data mining tasks where knowledge can be discovered collectively by a set of agents from a geographically or geometrically distributed but relevant environment, especially in scientific and engineering data environments.
Paraconsistent Annotated Logic in Viability Analysis: an Approach to Product Launching
NASA Astrophysics Data System (ADS)
Romeu de Carvalho, Fábio; Brunstein, Israel; Abe, Jair Minoro
2004-08-01
In this paper we present an application of the Para-analyzer, a logical analyzer based on the Paraconsistent Annotated Logic Pτ, introduced by Da Silva Filho and Abe in the decision-making systems. An example is analyzed in detail showing how uncertainty, inconsistency and paracompleteness can be elegantly handled with this logical system. As application for the Para-analyzer in decision-making, we developed the BAM — Baricenter Analysis Method. In order to make the presentation easier, we present the BAM applied in the viability analysis of product launching. Some of the techniques of Paraconsistent Annotated Logic have been applied in Artificial Intelligence, Robotics, Information Technolgy (Computer Sciences), etc..
Evaluating pharmacy leader development through the seven action logics.
Philip, Achsah; Desai, Avani; Nguyen, Phouc Anne; Birney, Patrick; Colavecchia, Anthony; Karralli, Rusol; Smith, Lindsey; Lorimer, Dirk; Burgess, Gwen; Munch, Kyle; Daniel, Nelvin; Lionetti, Jason; Garey, Kevin W
2016-01-15
Pharmacy leader development over time was analyzed using the seven action logics. As part of an ongoing leadership seminar series, students were required to select a visionary pharmacy leader and conduct a structured interview to evaluate pharmacy leaders' action logics. A standardized questionnaire comprising 13 questions was created by the class. Questions addressed leadership qualities during the leaders' early years, education years, and work years. Transcripts were then coded by two separate trained investigators based on the leader's stage of life to provide a score for each action logic individually over time. Kappa coefficient was used to evaluate interrater agreement. A total of 14 leaders were interviewed. All leaders were currently employed and had won national awards for their contributions to pharmacy practice. Overall, there was 82% agreement between the two evaluators' scores for the various characteristics. Action logics changed based on the leaders' life stage. Using aggregate data from all leader interviews, a progression from lower-order action logics (opportunist, diplomat, expert) to higher-order action logics (strategist, alchemist) was found. Ten leaders (71%) were diplomats during their early years. Six leaders (43%) were experts during their education years, and 4 (29%) were strategists or alchemists. During the third life stage analyzed (the work years), 6 leaders (43%) were strategists, and 2 were alchemists. During their work years, all leaders had a percentage of their answers coded as alchemist (range, 5-22%). Throughout their professional careers, pharmacy leaders continually develop skills through formal education and mentorship that follow action logics. Copyright © 2016 by the American Society of Health-System Pharmacists, Inc. All rights reserved.
Array processor architecture connection network
NASA Technical Reports Server (NTRS)
Barnes, George H. (Inventor); Lundstrom, Stephen F. (Inventor); Shafer, Philip E. (Inventor)
1982-01-01
A connection network is disclosed for use between a parallel array of processors and a parallel array of memory modules for establishing non-conflicting data communications paths between requested memory modules and requesting processors. The connection network includes a plurality of switching elements interposed between the processor array and the memory modules array in an Omega networking architecture. Each switching element includes a first and a second processor side port, a first and a second memory module side port, and control logic circuitry for providing data connections between the first and second processor ports and the first and second memory module ports. The control logic circuitry includes strobe logic for examining data arriving at the first and the second processor ports to indicate when the data arriving is requesting data from a requesting processor to a requested memory module. Further, connection circuitry is associated with the strobe logic for examining requesting data arriving at the first and the second processor ports for providing a data connection therefrom to the first and the second memory module ports in response thereto when the data connection so provided does not conflict with a pre-established data connection currently in use.
Homegrown violent extremists: A seemingly undetectable threat
DOE Office of Scientific and Technical Information (OSTI.GOV)
Crawford, Justin
With today’s unlimited and instantaneous communication, it is easy for a United States citizen to easily connect with anyone in the world. There are many positives to this; however, the unintended consequences include vulnerable people being influenced by radical ideologies. This is evident with the increase in homegrown violent extremists (HVE).The challenge for law enforcement is how to work with constitutional constraints that require a criminal predicate to be present in order to allow intelligence teams to continue collecting information in a permanent file.
Extracting hidden messages in steganographic images
Quach, Tu-Thach
2014-07-17
The eventual goal of steganalytic forensic is to extract the hidden messages embedded in steganographic images. A promising technique that addresses this problem partially is steganographic payload location, an approach to reveal the message bits, but not their logical order. It works by finding modified pixels, or residuals, as an artifact of the embedding process. This technique is successful against simple least-significant bit steganography and group-parity steganography. The actual messages, however, remain hidden as no logical order can be inferred from the located payload. This paper establishes an important result addressing this shortcoming: we show that the expected mean residualsmore » contain enough information to logically order the located payload provided that the size of the payload in each stego image is not fixed. The located payload can be ordered as prescribed by the mean residuals to obtain the hidden messages without knowledge of the embedding key, exposing the vulnerability of these embedding algorithms. We provide experimental results to support our analysis.« less
In-situ Geochronology on the Mars 2020 Rover with KArLE (The Potassium-Argon Laser Experiment)
NASA Technical Reports Server (NTRS)
Cohen, Barbara A.; Li, Z. -H.; Miller, J. S.; Devismes, D.; Swindle, T. D.; Schwenzer, S. P.; Kelley, S. P.; Zacny, K. A.; Roark, S. E.; Hardaway, L. R.;
2014-01-01
A successful Mars exploration program has revealed chapters of Mars history, but in this book, the pages are ripped out of the binding and scattered across the surface. An examination of each page reveals interesting information, but there is no way to read the book in a logical order. Geochronology is the tool that puts page number onto the individual pages, and allows the book of Martian history to be read in its proper order. The KArLE experiment performs the first dedicated in situ geochronology investigation on Mars, bringing clarity to Mars 2020 samples and context to its landing site.
Micro-mechanical resonators for dynamically reconfigurable reduced voltage logic gates
NASA Astrophysics Data System (ADS)
Chappanda, K. N.; Ilyas, S.; Younis, M. I.
2018-05-01
Due to the limitations of transistor-based logic devices such as their poor performance at elevated temperature, alternative computing methods are being actively investigated. In this work, we present electromechanical logic gates using electrostatically coupled in-plane micro-cantilever resonators operated at modest vacuum conditions of 5 Torr. Operating in the first resonant mode, we demonstrate 2-bit XOR, 2- and 3-bit AND, 2- and 3-bit NOR, and 1-bit NOT gates; all condensed in the same device. Through the designed electrostatic coupling, the required voltage for the logic gates is reduced by 80%, along with the reduction in the number of electrical interconnects and devices per logic operation (contrary to transistors). The device is dynamically reconfigurable between any logic gates in real time without the need for any change in the electrical interconnects and the drive circuit. By operating in the first two resonant vibration modes, we demonstrate mechanical logic gates consisting of two 2-bit AND and two 2-bit XOR gates. The device is tested at elevated temperatures and is shown to be functional as a logic gate up to 150 °C. Also, the device has high reliability with demonstrated lifetime greater than 5 × 1012 oscillations.
Demaria, T P; Kassinove, H; Dill, C A
1989-01-01
A test consistency and confirmatory factor analyses were performed on the Survey of Personal Beliefs, a new measure of irrational thinking based on rational-emotive personality theory. The survey, which was logically derived, includes a general rationality factor and subscales measuring five hypothesized core categories of irrational beliefs. Subjects included a nonclinical sample of 130 men and 150 women, with a mean age of 46. Results indicated that the Survey of Personal Beliefs had satisfactory total and scale reliability. The confirmatory analyses supported a higher order factor model including 5 first-order factors ( awfulizing, self-directed shoulds, other-directed shoulds, low frustration tolerance, and self-worth) and 1 second-order or general factor.
Effect of Counselor Predicate Matching on Perceived Social Influence and Client Satisfaction.
ERIC Educational Resources Information Center
Dowd, E. Thomas; Pety, John
1982-01-01
Hypothesized that counselors would be rated higher on social influence, client satisfaction, and willingness to see the counselor when they matched client predicates than when they mismatched. Results indicated that knowledge of a client's primary representational system may be of help in increasing a counselor's social influence. (RC)
Kill the Song--Steal the Show: What Does Distinguish Predicative Metaphors from Decomposable Idioms?
ERIC Educational Resources Information Center
Caillies, Stephanie; Declercq, Christelle
2011-01-01
This study examined the semantic processing difference between decomposable idioms and novel predicative metaphors. It was hypothesized that idiom comprehension results from the retrieval of a figurative meaning stored in memory, that metaphor comprehension requires a sense creation process and that this process difference affects the processing…
Lexical, Syntactic, and Semantic-Geometric Factors in the Acquisition of Motion Predicates
ERIC Educational Resources Information Center
Skordos, Dimitrios; Papafragou, Anna
2014-01-01
We report a study that explored the mechanisms used in hypothesizing meanings for novel motion predicates (verbs and prepositions) cross-linguistically. Motion stimuli were presented to English- and Greek-speaking adults and preschoolers accompanied by (a) a novel intransitive verb, (b) a novel transitive verb, (c) a novel transitive preposition,…
Design of an iterative auto-tuning algorithm for a fuzzy PID controller
NASA Astrophysics Data System (ADS)
Saeed, Bakhtiar I.; Mehrdadi, B.
2012-05-01
Since the first application of fuzzy logic in the field of control engineering, it has been extensively employed in controlling a wide range of applications. The human knowledge on controlling complex and non-linear processes can be incorporated into a controller in the form of linguistic terms. However, with the lack of analytical design study it is becoming more difficult to auto-tune controller parameters. Fuzzy logic controller has several parameters that can be adjusted, such as: membership functions, rule-base and scaling gains. Furthermore, it is not always easy to find the relation between the type of membership functions or rule-base and the controller performance. This study proposes a new systematic auto-tuning algorithm to fine tune fuzzy logic controller gains. A fuzzy PID controller is proposed and applied to several second order systems. The relationship between the closed-loop response and the controller parameters is analysed to devise an auto-tuning method. The results show that the proposed method is highly effective and produces zero overshoot with enhanced transient response. In addition, the robustness of the controller is investigated in the case of parameter changes and the results show a satisfactory performance.
An autonomous satellite architecture integrating deliberative reasoning and behavioural intelligence
NASA Technical Reports Server (NTRS)
Lindley, Craig A.
1993-01-01
This paper describes a method for the design of autonomous spacecraft, based upon behavioral approaches to intelligent robotics. First, a number of previous spacecraft automation projects are reviewed. A methodology for the design of autonomous spacecraft is then presented, drawing upon both the European Space Agency technological center (ESTEC) automation and robotics methodology and the subsumption architecture for autonomous robots. A layered competency model for autonomous orbital spacecraft is proposed. A simple example of low level competencies and their interaction is presented in order to illustrate the methodology. Finally, the general principles adopted for the control hardware design of the AUSTRALIS-1 spacecraft are described. This system will provide an orbital experimental platform for spacecraft autonomy studies, supporting the exploration of different logical control models, different computational metaphors within the behavioral control framework, and different mappings from the logical control model to its physical implementation.
Art of reading a journal article: Methodically and effectively
Subramanyam, RV
2013-01-01
Background: Reading scientific literature is mandatory for researchers and clinicians. With an overflow of medical and dental journals, it is essential to develop a method to choose and read the right articles. Objective: To outline a logical and orderly approach to reading a scientific manuscript. By breaking down the task into smaller, step-by-step components, one should be able to attain the skills to read a scientific article with ease. Methods: The reader should begin by reading the title, abstract and conclusions first. If a decision is made to read the entire article, the key elements of the article can be perused in a systematic manner effectively and efficiently. A cogent and organized method is presented to read articles published in scientific journals. Conclusion: One can read and appreciate a scientific manuscript if a systematic approach is followed in a simple and logical manner. PMID:23798833
DOE Office of Scientific and Technical Information (OSTI.GOV)
J. E. Lawson, R. Marsala, S. Ramakrishnan, X. Zhao, P. Sichta
In order to provide improved and expanded experimental capabilities, the existing Transrex power supplies at PPPL are to be upgraded and modernized. Each of the 39 power supplies consists of two six pulse silicon controlled rectifier sections forming a twelve pulse power supply. The first modification is to split each supply into two independent six pulse supplies by replacing the existing obsolete twelve pulse firing generator with two commercially available six pulse firing generators. The second change replaces the existing control link with a faster system, with greater capacity, which will allow for independent control of all 78 power supplymore » sections. The third change replaces the existing Computer Automated Measurement and Control (CAMAC) based fault detector with an Experimental Physics and Industrial Control System (EPICS) compatible unit, eliminating the obsolete CAMAC modules. Finally the remaining relay logic and interfaces to the "Hardwired Control System" will be replaces with a Programmable Logic Controller (PLC).« less
DOE Office of Scientific and Technical Information (OSTI.GOV)
Davis, Kristan D.; Faraj, Daniel A.
In a parallel computer, a plurality of logical planes formed of compute nodes of a subcommunicator may be identified by: for each compute node of the subcommunicator and for a number of dimensions beginning with a first dimension: establishing, by a plane building node, in a positive direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in a positive direction of a second dimension, where the second dimension is orthogonal to the first dimension; and establishing, by the plane building node, in a negative direction of the first dimension,more » all logical planes that include the plane building node and compute nodes of the subcommunicator in the positive direction of the second dimension.« less
Voltage controlled spintronic devices for logic applications
You, Chun-Yeol; Bader, Samuel D.
2001-01-01
A reprogrammable logic gate comprising first and second voltage-controlled rotation transistors. Each transistor comprises three ferromagnetic layers with a spacer and insulating layer between the first and second ferromagnetic layers and an additional insulating layer between the second and third ferromagnetic layers. The third ferromagnetic layer of each transistor is connected to each other, and a constant external voltage source is applied to the second ferromagnetic layer of the first transistor. As input voltages are applied to the first ferromagnetic layer of each transistor, the relative directions of magnetization of the ferromagnetic layers and the magnitude of the external voltage determines the output voltage of the gate. By altering these parameters, the logic gate is capable of behaving as AND, OR, NAND, or NOR gates.
Magnon-based logic in a multi-terminal YIG/Pt nanostructure
DOE Office of Scientific and Technical Information (OSTI.GOV)
Ganzhorn, Kathrin, E-mail: kathrin.ganzhorn@wmi.badw.de; Klingler, Stefan; Wimmer, Tobias
2016-07-11
Boolean logic is the foundation of modern digital information processing. Recently, there has been a growing interest in phenomena based on pure spin currents, which allows to move from charge to spin based logic gates. We study a proof-of-principle logic device based on the ferrimagnetic insulator Yttrium Iron Garnet, with Pt strips acting as injectors and detectors for non-equilibrium magnons. We experimentally observe incoherent superposition of magnons generated by different injectors. This allows to implement a fully functional majority gate, enabling multiple logic operations (AND and OR) in one and the same device. Clocking frequencies of the order of severalmore » GHz and straightforward down-scaling make our device promising for applications.« less
Locatum Structures and the Acquisition of Telicity
ERIC Educational Resources Information Center
Hodgson, Miren
2010-01-01
This article presents a study of a between-subjects design experiment on the comprehension of telicity in simple telic predicates (e.g., "John filled the bucket") and locatum predicates (e.g., "the water filled the bucket") in L1 Spanish. Weist, Wysocka, and Lyytinen (1991) for English and Finnish, and Van Hout (1997, 1998b) for English and Dutch…
Focus, Presupposition and Light Predicate Raising in East and Southeast Asia.
ERIC Educational Resources Information Center
Simpson, Andrew
2001-01-01
Provides an account of a distributional patterning found with certain modal verbs in a number of SVO languages of Southeast Asia, the occurrence of a particular alethic modal in predicate-final position. Describes the paradigm and how it's arguably the result of borrowing and transfer among the various languages. Its relevance for Cinque's defence…
ERIC Educational Resources Information Center
Pourciau, Bruce
2018-01-01
In a first proof-oriented mathematics course, students will often ask questions--for example, "What is this problem asking me to do?" or "What would a proof of this even look like"--that have more to do with logic than mathematics. The logical structure of a proof is a dance involving those basic logical forms--such as "p…
Integrated all-optical logic discriminators based on plasmonic bandgap engineering
Lu, Cuicui; Hu, Xiaoyong; Yang, Hong; Gong, Qihuang
2013-01-01
Optical computing uses photons as information carriers, opening up the possibility for ultrahigh-speed and ultrawide-band information processing. Integrated all-optical logic devices are indispensible core components of optical computing systems. However, up to now, little experimental progress has been made in nanoscale all-optical logic discriminators, which have the function of discriminating and encoding incident light signals according to wavelength. Here, we report a strategy to realize a nanoscale all-optical logic discriminator based on plasmonic bandgap engineering in a planar plasmonic microstructure. Light signals falling within different operating wavelength ranges are differentiated and endowed with different logic state encodings. Compared with values previously reported, the operating bandwidth is enlarged by one order of magnitude. Also the SPP light source is integrated with the logic device while retaining its ultracompact size. This opens up a way to construct on-chip all-optical information processors and artificial intelligence systems. PMID:24071647
NASA Astrophysics Data System (ADS)
Hashemi, H.; Tax, D. M. J.; Duin, R. P. W.; Javaherian, A.; de Groot, P.
2008-11-01
Seismic object detection is a relatively new field in which 3-D bodies are visualized and spatial relationships between objects of different origins are studied in order to extract geologic information. In this paper, we propose a method for finding an optimal classifier with the help of a statistical feature ranking technique and combining different classifiers. The method, which has general applicability, is demonstrated here on a gas chimney detection problem. First, we evaluate a set of input seismic attributes extracted at locations labeled by a human expert using regularized discriminant analysis (RDA). In order to find the RDA score for each seismic attribute, forward and backward search strategies are used. Subsequently, two non-linear classifiers: multilayer perceptron (MLP) and support vector classifier (SVC) are run on the ranked seismic attributes. Finally, to capitalize on the intrinsic differences between both classifiers, the MLP and SVC results are combined using logical rules of maximum, minimum and mean. The proposed method optimizes the ranked feature space size and yields the lowest classification error in the final combined result. We will show that the logical minimum reveals gas chimneys that exhibit both the softness of MLP and the resolution of SVC classifiers.
Ordering the Senses in a Monolingual Dictionary Entry.
ERIC Educational Resources Information Center
Gold, David L.
1986-01-01
Reviews issues to be considered in determining the order of meanings for a lexeme in a dictionary entry and compares techniques for deciding order. Types of ordering include importance, frequency, logical ordering, dominant meaning, syntactic, and historical. (MSE)
Fan, Daoqing; Zhu, Xiaoqing; Dong, Shaojun; Wang, Erkang
2017-07-05
DNA is believed to be a promising candidate for molecular logic computation, and the fluorogenic/colorimetric substrates of G-quadruplex DNAzyme (G4zyme) are broadly used as label-free output reporters of DNA logic circuits. Herein, for the first time, tyramine-HCl (a fluorogenic substrate of G4zyme) is applied to DNA logic computation and a series of label-free DNA-input logic gates, including elementary AND, OR, and INHIBIT logic gates, as well as a two to one encoder, are constructed. Furthermore, a DNA caliper that can measure the base number of target DNA as low as three bases is also fabricated. This DNA caliper can also perform concatenated AND-AND logic computation to fulfil the requirements of sophisticated logic computing. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.
Constructing a logical, regular axis topology from an irregular topology
Faraj, Daniel A.
2014-07-22
Constructing a logical regular topology from an irregular topology including, for each axial dimension and recursively, for each compute node in a subcommunicator until returning to a first node: adding to a logical line of the axial dimension a neighbor specified in a nearest neighbor list; calling the added compute node; determining, by the called node, whether any neighbor in the node's nearest neighbor list is available to add to the logical line; if a neighbor in the called compute node's nearest neighbor list is available to add to the logical line, adding, by the called compute node to the logical line, any neighbor in the called compute node's nearest neighbor list for the axial dimension not already added to the logical line; and, if no neighbor in the called compute node's nearest neighbor list is available to add to the logical line, returning to the calling compute node.
Constructing a logical, regular axis topology from an irregular topology
Faraj, Daniel A.
2014-07-01
Constructing a logical regular topology from an irregular topology including, for each axial dimension and recursively, for each compute node in a subcommunicator until returning to a first node: adding to a logical line of the axial dimension a neighbor specified in a nearest neighbor list; calling the added compute node; determining, by the called node, whether any neighbor in the node's nearest neighbor list is available to add to the logical line; if a neighbor in the called compute node's nearest neighbor list is available to add to the logical line, adding, by the called compute node to the logical line, any neighbor in the called compute node's nearest neighbor list for the axial dimension not already added to the logical line; and, if no neighbor in the called compute node's nearest neighbor list is available to add to the logical line, returning to the calling compute node.
Value innovation: the strategic logic of high growth.
Kim, W C; Mauborgne, R
1997-01-01
Why are some companies able to sustain high growth in revenues and profits--and others are not? To answer that question, the authors, both of INSEAD, spent five years studying more than 30 companies around the world. They found that the difference between the high-growth companies and their less successful competitors was in each group's assumptions about strategy. Managers of the less successful companies followed conventional strategic logic. Managers of the high-growth companies followed what the authors call the logic of value innovation. Conventional strategic logic and value innovation differ along the basic dimensions of strategy. Many companies take their industry's conditions as given; value innovators don't. Many companies let competitors set the parameters of their strategic thinking; value innovators do not use rivals as benchmarks. Rather than focus on the differences among customers, value innovators look for what customers value in common. Rather than view opportunities through the lens of existing assets and capabilities, value innovators ask, What if we start anew? The authors tell the story of the French hotelier Accor, which discarded the notion of what a hotel is supposed to look like in order to offer what most customers want: a good night's sleep at a low price. And Virgin Atlantic challenged industry conventions by eliminating first-class service and channeling savings into innovations for business-class passengers. Those companies didn't set out to build advantages over the competition, but they ended up achieving the greatest competitive advantages.
Trimming a hazard logic tree with a new model-order-reduction technique
Porter, Keith; Field, Edward; Milner, Kevin R
2017-01-01
The size of the logic tree within the Uniform California Earthquake Rupture Forecast Version 3, Time-Dependent (UCERF3-TD) model can challenge risk analyses of large portfolios. An insurer or catastrophe risk modeler concerned with losses to a California portfolio might have to evaluate a portfolio 57,600 times to estimate risk in light of the hazard possibility space. Which branches of the logic tree matter most, and which can one ignore? We employed two model-order-reduction techniques to simplify the model. We sought a subset of parameters that must vary, and the specific fixed values for the remaining parameters, to produce approximately the same loss distribution as the original model. The techniques are (1) a tornado-diagram approach we employed previously for UCERF2, and (2) an apparently novel probabilistic sensitivity approach that seems better suited to functions of nominal random variables. The new approach produces a reduced-order model with only 60 of the original 57,600 leaves. One can use the results to reduce computational effort in loss analyses by orders of magnitude.
Predicate Oriented Pattern Analysis for Biomedical Knowledge Discovery
Shen, Feichen; Liu, Hongfang; Sohn, Sunghwan; Larson, David W.; Lee, Yugyung
2017-01-01
In the current biomedical data movement, numerous efforts have been made to convert and normalize a large number of traditional structured and unstructured data (e.g., EHRs, reports) to semi-structured data (e.g., RDF, OWL). With the increasing number of semi-structured data coming into the biomedical community, data integration and knowledge discovery from heterogeneous domains become important research problem. In the application level, detection of related concepts among medical ontologies is an important goal of life science research. It is more crucial to figure out how different concepts are related within a single ontology or across multiple ontologies by analysing predicates in different knowledge bases. However, the world today is one of information explosion, and it is extremely difficult for biomedical researchers to find existing or potential predicates to perform linking among cross domain concepts without any support from schema pattern analysis. Therefore, there is a need for a mechanism to do predicate oriented pattern analysis to partition heterogeneous ontologies into closer small topics and do query generation to discover cross domain knowledge from each topic. In this paper, we present such a model that predicates oriented pattern analysis based on their close relationship and generates a similarity matrix. Based on this similarity matrix, we apply an innovated unsupervised learning algorithm to partition large data sets into smaller and closer topics and generate meaningful queries to fully discover knowledge over a set of interlinked data sources. We have implemented a prototype system named BmQGen and evaluate the proposed model with colorectal surgical cohort from the Mayo Clinic. PMID:28983419
Glencross, Deborah K; Janossy, George; Coetzee, Lindi M; Lawrie, Denise; Aggett, Hazel M; Scott, Lesley E; Sanne, Ian; McIntyre, James A; Stevens, Wendy
2008-01-01
In order to expand the treatment of human immunodeficiency virus-1 (HIV) infected patients in Africa, millions will require cost-effective CD4 counts. Supporting laboratories therefore, need to move away from crisis management and haphazard practices to organized pathology services. The authors reviewed the performance of the simplified single platform (SP) PanLeucogated (PLG) CD4 methodology, introduced into 52 laboratories across the South African National Health Laboratory Service (SA-NHLS), with a proactive approach to training, internal quality control (IQC), and external quality assessment (EQA). Two-color flow cytometry for SP PLG (CD4/CD45) was combined with the sample-by-sample bead-count-rate (BCR) IQC for bead pipetting. PLG + BCR was validated versus conventional predicate SP and dual-platform (DP) 4-color flow cytometric methods used in the first world-on 1181 samples from 250 HIV+ patients followed longitudinally on anti-retroviral therapy (ART). EQA (accuracy) was performed through the United Kingdom National External Quality Assessment Scheme (UK-NEQAS). Further EQA was performed across the 52 SA-NHLS SP-PLG laboratories participating on the CD4 African Regional External Quality Assessment Scheme (AFREQAS), to assess both accuracy and/precision between NHLS PLG laboratories. There was virtually no bias noted between SP PLG and SP predicate methods. On DP, bias and variability increased but the errors introduced were minor without affecting CD4-related clinical decisions. The simpler 2-color PLG was less expensive with additional advantages: CD4+ T-cells were discriminated from monocytes without a need for CD3-staining, and the training was faster and easier for the trainees and trainers alike. The accuracy of SP-PLG was satisfactory: all PLG results submitted to the UK NEQAS were within +/-1 Trimmed Standard Deviation (SD) of the UK NEQAS CD4 Pool Trimmed Mean. Further, on the CD4 AFREQAS, the SA-NHLS laboratories using SP-PLG + BCR showed better precision (mean %CV = 7.2%) than the CD4 methods employed in other laboratories in Africa (mean %CV = 10.7%) or on other continents (mean %CV = 12.9%). PLG + BCR accommodated high workloads, exceeding 3,000 tests/laboratory/month, with capacity for further growth around 10% per month across the SA-NHLS. The superior performance of PLG + BCR over other methods has been demonstrated. In resource-conscious countries, where large-scale ART is being introduced, flow-cytometry using PLG + BCR can make a significant impact-due to simpler operation, easier training, stricter quality assurance, and better cost-efficiency. These cost-effective flow methods can legitimately replace the more cumbersome predicate technology of the first world for ART monitoring whilst accommodating an ever-expanding national ART program and consequent extremely high workloads reached country-wide. Copyright 2008 Clinical Cytometry Society.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Tang, Jason D.; Schroeppel, Richard Crabtree; Robertson, Perry J.
With the build-out of large transport networks utilizing optical technologies, more and more capacity is being made available. Innovations in Dense Wave Division Multiplexing (DWDM) and the elimination of optical-electrical-optical conversions have brought on advances in communication speeds as we move into 10 Gigabit Ethernet and above. Of course, there is a need to encrypt data on these optical links as the data traverses public and private network backbones. Unfortunately, as the communications infrastructure becomes increasingly optical, advances in encryption (done electronically) have failed to keep up. This project examines the use of optical logic for implementing encryption in themore » photonic domain to achieve the requisite encryption rates. This paper documents the innovations and advances of work first detailed in 'Photonic Encryption using All Optical Logic,' [1]. A discussion of underlying concepts can be found in SAND2003-4474. In order to realize photonic encryption designs, technology developed for electrical logic circuits must be translated to the photonic regime. This paper examines S-SEED devices and how discrete logic elements can be interconnected and cascaded to form an optical circuit. Because there is no known software that can model these devices at a circuit level, the functionality of S-SEED devices in an optical circuit was modeled in PSpice. PSpice allows modeling of the macro characteristics of the devices in context of a logic element as opposed to device level computational modeling. By representing light intensity as voltage, 'black box' models are generated that accurately represent the intensity response and logic levels in both technologies. By modeling the behavior at the systems level, one can incorporate systems design tools and a simulation environment to aid in the overall functional design. Each black box model takes certain parameters (reflectance, intensity, input response), and models the optical ripple and time delay characteristics. These 'black box' models are interconnected and cascaded in an encrypting/scrambling algorithm based on a study of candidate encryption algorithms. Demonstration circuits show how these logic elements can be used to form NAND, NOR, and XOR functions. This paper also presents functional analysis of a serial, low gate count demonstration algorithm suitable for scrambling/encryption using S-SEED devices.« less
Young Children's Sensitivity to New and Given Information when Answering Predicate-Focus Questions
ERIC Educational Resources Information Center
Salomo, Dorothe; Lieven, Elena; Tomasello, Michael
2010-01-01
In two studies we investigated 2-year-old children's answers to predicate-focus questions depending on the preceding context. Children were presented with a successive series of short video clips showing transitive actions (e.g., frog washing duck) in which either the action (action-new) or the patient (patient-new) was the changing, and therefore…
ERIC Educational Resources Information Center
Deutsch, Avital; Dank, Maya
2011-01-01
A common characteristic of subject-predicate agreement errors (usually termed attraction errors) in complex noun phrases is an asymmetrical pattern of error distribution, depending on the inflectional state of the nouns comprising the complex noun phrase. That is, attraction is most likely to occur when the head noun is the morphologically…
The History of Predicative Possession in Slavic: Internal Development vs. Language Contact
ERIC Educational Resources Information Center
McAnallen, Julia
2011-01-01
The languages of the world encode possession in a variety of ways. In Slavic languages, possession on the level of the clause, or predicative possession, is represented by two main encoding strategies. Most Slavic languages, including those in the West and South Slavic sub-groupings, use a "have" verb comparable to English have and German "haben."…
The Writing of Expository Texts in Early Grades: What Predicative Analysis Teaches Us
ERIC Educational Resources Information Center
Gagnon, Renee; Ziarko, Helene
2012-01-01
This paper presents the results of a predicative analysis led on comparison and problem-solution texts produced by pupils of the second and third grades of primary school following a set of reading and writing instructional activities. The production of those texts is of a special challenge to the young writers because of the cognitive and…
Tableau Calculus for the Logic of Comparative Similarity over Arbitrary Distance Spaces
NASA Astrophysics Data System (ADS)
Alenda, Régis; Olivetti, Nicola
The logic CSL (first introduced by Sheremet, Tishkovsky, Wolter and Zakharyaschev in 2005) allows one to reason about distance comparison and similarity comparison within a modal language. The logic can express assertions of the kind "A is closer/more similar to B than to C" and has a natural application to spatial reasoning, as well as to reasoning about concept similarity in ontologies. The semantics of CSL is defined in terms of models based on different classes of distance spaces and it generalizes the logic S4 u of topological spaces. In this paper we consider CSL defined over arbitrary distance spaces. The logic comprises a binary modality to represent comparative similarity and a unary modality to express the existence of the minimum of a set of distances. We first show that the semantics of CSL can be equivalently defined in terms of preferential models. As a consequence we obtain the finite model property of the logic with respect to its preferential semantic, a property that does not hold with respect to the original distance-space semantics. Next we present an analytic tableau calculus based on its preferential semantics. The calculus provides a decision procedure for the logic, its termination is obtained by imposing suitable blocking restrictions.
"Hence"--An Iconoclastic Study of Logic, Language and Argumentation.
ERIC Educational Resources Information Center
Van der Auwera, Johan
An analysis of the role of the word "hence" and its near-synonyms examines the relationship between logic as a science, as a natural language, and as argumentation. The analysis is done in the context of elementary propositional logic. The first section is a limited discussion of the standard logician's treatment relegating "hence" to the realm of…
15 CFR 971.501 - Resource assessment, recovery plan, and logical mining unit.
Code of Federal Regulations, 2014 CFR
2014-01-01
... 15 Commerce and Foreign Trade 3 2014-01-01 2014-01-01 false Resource assessment, recovery plan... COMMERCIAL RECOVERY PERMITS Resource Development § 971.501 Resource assessment, recovery plan, and logical... relation to the applicant's production requirements, operating period, and recovery efficiency in order to...
15 CFR 971.501 - Resource assessment, recovery plan, and logical mining unit.
Code of Federal Regulations, 2011 CFR
2011-01-01
... 15 Commerce and Foreign Trade 3 2011-01-01 2011-01-01 false Resource assessment, recovery plan... COMMERCIAL RECOVERY PERMITS Resource Development § 971.501 Resource assessment, recovery plan, and logical... relation to the applicant's production requirements, operating period, and recovery efficiency in order to...
15 CFR 971.501 - Resource assessment, recovery plan, and logical mining unit.
Code of Federal Regulations, 2012 CFR
2012-01-01
... 15 Commerce and Foreign Trade 3 2012-01-01 2012-01-01 false Resource assessment, recovery plan... COMMERCIAL RECOVERY PERMITS Resource Development § 971.501 Resource assessment, recovery plan, and logical... relation to the applicant's production requirements, operating period, and recovery efficiency in order to...
15 CFR 971.501 - Resource assessment, recovery plan, and logical mining unit.
Code of Federal Regulations, 2013 CFR
2013-01-01
... 15 Commerce and Foreign Trade 3 2013-01-01 2013-01-01 false Resource assessment, recovery plan... COMMERCIAL RECOVERY PERMITS Resource Development § 971.501 Resource assessment, recovery plan, and logical... relation to the applicant's production requirements, operating period, and recovery efficiency in order to...
Automatic Abstraction in Planning
NASA Technical Reports Server (NTRS)
Christensen, J.
1991-01-01
Traditionally, abstraction in planning has been accomplished by either state abstraction or operator abstraction, neither of which has been fully automatic. We present a new method, predicate relaxation, for automatically performing state abstraction. PABLO, a nonlinear hierarchical planner, implements predicate relaxation. Theoretical, as well as empirical results are presented which demonstrate the potential advantages of using predicate relaxation in planning. We also present a new definition of hierarchical operators that allows us to guarantee a limited form of completeness. This new definition is shown to be, in some ways, more flexible than previous definitions of hierarchical operators. Finally, a Classical Truth Criterion is presented that is proven to be sound and complete for a planning formalism that is general enough to include most classical planning formalisms that are based on the STRIPS assumption.
Predicting recycling behaviour: Comparison of a linear regression model and a fuzzy logic model.
Vesely, Stepan; Klöckner, Christian A; Dohnal, Mirko
2016-03-01
In this paper we demonstrate that fuzzy logic can provide a better tool for predicting recycling behaviour than the customarily used linear regression. To show this, we take a set of empirical data on recycling behaviour (N=664), which we randomly divide into two halves. The first half is used to estimate a linear regression model of recycling behaviour, and to develop a fuzzy logic model of recycling behaviour. As the first comparison, the fit of both models to the data included in estimation of the models (N=332) is evaluated. As the second comparison, predictive accuracy of both models for "new" cases (hold-out data not included in building the models, N=332) is assessed. In both cases, the fuzzy logic model significantly outperforms the regression model in terms of fit. To conclude, when accurate predictions of recycling and possibly other environmental behaviours are needed, fuzzy logic modelling seems to be a promising technique. Copyright © 2015 Elsevier Ltd. All rights reserved.
Recent Trends in Spintronics-Based Nanomagnetic Logic
NASA Astrophysics Data System (ADS)
Das, Jayita; Alam, Syed M.; Bhanja, Sanjukta
2014-09-01
With the growing concerns of standby power in sub-100-nm CMOS technologies, alternative computing techniques and memory technologies are explored. Spin transfer torque magnetoresistive RAM (STT-MRAM) is one such nonvolatile memory relying on magnetic tunnel junctions (MTJs) to store information. It uses spin transfer torque to write information and magnetoresistance to read information. In 2012, Everspin Technologies, Inc. commercialized the first 64Mbit Spin Torque MRAM. On the computing end, nanomagnetic logic (NML) is a promising technique with zero leakage and high data retention. In 2000, Cowburn and Welland first demonstrated its potential in logic and information propagation through magnetostatic interaction in a chain of single domain circular nanomagnetic dots of Supermalloy (Ni80Fe14Mo5X1, X is other metals). In 2006, Imre et al. demonstrated wires and majority gates followed by coplanar cross wire systems demonstration in 2010 by Pulecio et al. Since 2004 researchers have also investigated the potential of MTJs in logic. More recently with dipolar coupling between MTJs demonstrated in 2012, logic-in-memory architecture with STT-MRAM have been investigated. The architecture borrows the computing concept from NML and read and write style from MRAM. The architecture can switch its operation between logic and memory modes with clock as classifier. Further through logic partitioning between MTJ and CMOS plane, a significant performance boost has been observed in basic computing blocks within the architecture. In this work, we have explored the developments in NML, in MTJs and more recent developments in hybrid MTJ/CMOS logic-in-memory architecture and its unique logic partitioning capability.
Simulating an Exploding Fission-Bomb Core
NASA Astrophysics Data System (ADS)
Reed, Cameron
2016-03-01
A time-dependent desktop-computer simulation of the core of an exploding fission bomb (nuclear weapon) has been developed. The simulation models a core comprising a mixture of two isotopes: a fissile one (such as U-235) and an inert one (such as U-238) that captures neutrons and removes them from circulation. The user sets the enrichment percentage and scattering and fission cross-sections of the fissile isotope, the capture cross-section of the inert isotope, the number of neutrons liberated per fission, the number of ``initiator'' neutrons, the radius of the core, and the neutron-reflection efficiency of a surrounding tamper. The simulation, which is predicated on ordinary kinematics, follows the three-dimensional motions and fates of neutrons as they travel through the core. Limitations of time and computer memory render it impossible to model a real-life core, but results of numerous runs clearly demonstrate the existence of a critical mass for a given set of parameters and the dramatic effects of enrichment and tamper efficiency on the growth (or decay) of the neutron population. The logic of the simulation will be described and results of typical runs will be presented and discussed.
Monitoring Agents for Assisting NASA Engineers with Shuttle Ground Processing
NASA Technical Reports Server (NTRS)
Semmel, Glenn S.; Davis, Steven R.; Leucht, Kurt W.; Rowe, Danil A.; Smith, Kevin E.; Boeloeni, Ladislau
2005-01-01
The Spaceport Processing Systems Branch at NASA Kennedy Space Center has designed, developed, and deployed a rule-based agent to monitor the Space Shuttle's ground processing telemetry stream. The NASA Engineering Shuttle Telemetry Agent increases situational awareness for system and hardware engineers during ground processing of the Shuttle's subsystems. The agent provides autonomous monitoring of the telemetry stream and automatically alerts system engineers when user defined conditions are satisfied. Efficiency and safety are improved through increased automation. Sandia National Labs' Java Expert System Shell is employed as the agent's rule engine. The shell's predicate logic lends itself well to capturing the heuristics and specifying the engineering rules within this domain. The declarative paradigm of the rule-based agent yields a highly modular and scalable design spanning multiple subsystems of the Shuttle. Several hundred monitoring rules have been written thus far with corresponding notifications sent to Shuttle engineers. This chapter discusses the rule-based telemetry agent used for Space Shuttle ground processing. We present the problem domain along with design and development considerations such as information modeling, knowledge capture, and the deployment of the product. We also present ongoing work with other condition monitoring agents.
Constraint processing in our extensible language for cooperative imaging system
NASA Astrophysics Data System (ADS)
Aoki, Minoru; Murao, Yo; Enomoto, Hajime
1996-02-01
The extensible WELL (Window-based elaboration language) has been developed using the concept of common platform, where both client and server can communicate with each other with support from a communication manager. This extensible language is based on an object oriented design by introducing constraint processing. Any kind of services including imaging in the extensible language is controlled by the constraints. Interactive functions between client and server are extended by introducing agent functions including a request-respond relation. Necessary service integrations are satisfied with some cooperative processes using constraints. Constraints are treated similarly to data, because the system should have flexibilities in the execution of many kinds of services. The similar control process is defined by using intentional logic. There are two kinds of constraints, temporal and modal constraints. Rendering the constraints, the predicate format as the relation between attribute values can be a warrant for entities' validity as data. As an imaging example, a processing procedure of interaction between multiple objects is shown as an image application for the extensible system. This paper describes how the procedure proceeds in the system, and that how the constraints work for generating moving pictures.
Bit storage and bit flip operations in an electromechanical oscillator.
Mahboob, I; Yamaguchi, H
2008-05-01
The Parametron was first proposed as a logic-processing system almost 50 years ago. In this approach the two stable phases of an excited harmonic oscillator provide the basis for logic operations. Computer architectures based on LC oscillators were developed for this approach, but high power consumption and difficulties with integration meant that the Parametron was rendered obsolete by the transistor. Here we propose an approach to mechanical logic based on nanoelectromechanical systems that is a variation on the Parametron architecture and, as a first step towards a possible nanomechanical computer, we demonstrate both bit storage and bit flip operations.
NASA Astrophysics Data System (ADS)
Boudjema, Zinelaabidine; Taleb, Rachid; Bounadja, Elhadj
2017-02-01
Traditional filed oriented control strategy including proportional-integral (PI) regulator for the speed drive of the doubly fed induction motor (DFIM) have some drawbacks such as parameter tuning complications, mediocre dynamic performances and reduced robustness. Therefore, based on the analysis of the mathematical model of a DFIM supplied by two five-level SVPWM inverters, this paper proposes a new robust control scheme based on super twisting sliding mode and fuzzy logic. The conventional sliding mode control (SMC) has vast chattering effect on the electromagnetic torque developed by the DFIM. In order to resolve this problem, a second order sliding mode technique based on super twisting algorithm and fuzzy logic functions is employed. The validity of the employed approach was tested by using Matlab/Simulink software. Interesting simulation results were obtained and remarkable advantages of the proposed control scheme were exposed including simple design of the control system, reduced chattering as well as the other advantages.
NASA Astrophysics Data System (ADS)
Madjid, F. Hadi; Myers, John M.
2016-10-01
The world runs on networks over which signals communicate sequences of symbols, e.g. numerals. Examining both engineered and natural communications networks reveals an unsuspected order that depends on contact with an unpredictable entity. This order has three roots. The first is a proof within quantum theory that no evidence can ever determine its explanation, so that an agent choosing an explanation must do so unpredictably. The second root is the showing that clocks that step computers do not "tell time" but serve as self-adjusting symbol-handling agents that regulate "logically synchronized" motion in response to unpredictable disturbances. Such a clock-agent has a certain independence as well as the capacity to communicate via unpredictable symbols with other clock-agents and to adjust its own tick rate in response to that communication. The third root is the noticing of unpredictable symbol exchange in natural systems, including the transmission of symbols found in molecular biology. We introduce a symbol-handling agent as a role played in some cases by a person, for example a physicist who chooses an explanation of given experimental outcomes, and in other cases by some other biological entity, and in still other cases by an inanimate device, such as a computer-based detector used in physical measurements. While we forbear to try to explain the propensity of agents at all levels from cells to civilizations to form and operate networks of logically synchronized symbol-handling agents, we point to this propensity as an overlooked cosmic order, an order structured by the unpredictability ensuing from the proof. Appreciating the cosmic order leads to a conception of agency that replaces volition by unpredictability and reconceives the notion of objectivity in a way that makes a place for agency in the world as described by physics. Some specific implications for physics are outlined.
Purification of Logic-Qubit Entanglement.
Zhou, Lan; Sheng, Yu-Bo
2016-07-05
Recently, the logic-qubit entanglement shows its potential application in future quantum communication and quantum network. However, the entanglement will suffer from the noise and decoherence. In this paper, we will investigate the first entanglement purification protocol for logic-qubit entanglement. We show that both the bit-flip error and phase-flip error in logic-qubit entanglement can be well purified. Moreover, the bit-flip error in physical-qubit entanglement can be completely corrected. The phase-flip in physical-qubit entanglement error equals to the bit-flip error in logic-qubit entanglement, which can also be purified. This entanglement purification protocol may provide some potential applications in future quantum communication and quantum network.
A new classification of glaucomas
Bordeianu, Constantin-Dan
2014-01-01
Purpose To suggest a new glaucoma classification that is pathogenic, etiologic, and clinical. Methods After discussing the logical pathway used in criteria selection, the paper presents the new classification and compares it with the classification currently in use, that is, the one issued by the European Glaucoma Society in 2008. Results The paper proves that the new classification is clear (being based on a coherent and consistently followed set of criteria), is comprehensive (framing all forms of glaucoma), and helps in understanding the sickness understanding (in that it uses a logical framing system). The great advantage is that it facilitates therapeutic decision making in that it offers direct therapeutic suggestions and avoids errors leading to disasters. Moreover, the scheme remains open to any new development. Conclusion The suggested classification is a pathogenic, etiologic, and clinical classification that fulfills the conditions of an ideal classification. The suggested classification is the first classification in which the main criterion is consistently used for the first 5 to 7 crossings until its differentiation capabilities are exhausted. Then, secondary criteria (etiologic and clinical) pick up the relay until each form finds its logical place in the scheme. In order to avoid unclear aspects, the genetic criterion is no longer used, being replaced by age, one of the clinical criteria. The suggested classification brings only benefits to all categories of ophthalmologists: the beginners will have a tool to better understand the sickness and to ease their decision making, whereas the experienced doctors will have their practice simplified. For all doctors, errors leading to therapeutic disasters will be less likely to happen. Finally, researchers will have the object of their work gathered in the group of glaucoma with unknown or uncertain pathogenesis, whereas the results of their work will easily find a logical place in the scheme, as the suggested classification remains open to any new development. PMID:25246759
Method and apparatus for characterizing propagation delays of integrated circuit devices
NASA Technical Reports Server (NTRS)
Blaes, Brent R. (Inventor); Buehler, Martin G. (Inventor)
1987-01-01
Propagation delay of a signal through a channel is measured by cyclically generating a first step-wave signal for transmission through the channel to a two-input logic element and a second step-wave signal with a controlled delay to the second input terminal of the logic element. The logic element determines which signal is present first at its input terminals and stores a binary signal indicative of that determination for control of the delay of the second signal which is advanced or retarded for the next cycle until both the propagation delayed first step-wave signal and the control delayed step-wave signal are coincident. The propagation delay of the channel is then determined by measuring the time between the first and second step-wave signals out of the controlled step-wave signal generator.
Comparing Zeeman qubits to hyperfine qubits in the context of the surface code: +174Yb and +171Yb
NASA Astrophysics Data System (ADS)
Brown, Natalie C.; Brown, Kenneth R.
2018-05-01
Many systems used for quantum computing possess additional states beyond those defining the qubit. Leakage out of the qubit subspace must be considered when designing quantum error correction codes. Here we consider trapped ion qubits manipulated by Raman transitions. Zeeman qubits do not suffer from leakage errors but are sensitive to magnetic fields to first order. Hyperfine qubits can be encoded in clock states that are insensitive to magnetic fields to first order, but spontaneous scattering during the Raman transition can lead to leakage. Here we compare a Zeeman qubit (+174Yb) to a hyperfine qubit (+171Yb) in the context of the surface code. We find that the number of physical qubits required to reach a specific logical qubit error can be reduced by using +174Yb if the magnetic field can be stabilized with fluctuations smaller than 10 μ G .
Procedural and Logic Programming: A Comparison.
ERIC Educational Resources Information Center
Watkins, Will; And Others
1988-01-01
Examines the similarities and fundamental differences between procedural programing and logic programing by comparing LogoWriter and PROLOG. Suggests that PROLOG may be a good first programing language for students to learn. (MVL)
Riesco, Adrián; Santos-Buitrago, Beatriz; De Las Rivas, Javier; Knapp, Merrill; Talcott, Carolyn
2017-01-01
In biological systems, pathways define complex interaction networks where multiple molecular elements are involved in a series of controlled reactions producing responses to specific biomolecular signals. These biosystems are dynamic and there is a need for mathematical and computational methods able to analyze the symbolic elements and the interactions between them and produce adequate readouts of such systems. In this work, we use rewriting logic to analyze the cellular signaling of epidermal growth factor (EGF) and its cell surface receptor (EGFR) in order to induce cellular proliferation. Signaling is initiated by binding the ligand protein EGF to the membrane-bound receptor EGFR so as to trigger a reactions path which have several linked elements through the cell from the membrane till the nucleus. We present two different types of search for analyzing the EGF/proliferation system with the help of Pathway Logic tool, which provides a knowledge-based development environment to carry out the modeling of the signaling. The first one is a standard (forward) search. The second one is a novel approach based on narrowing, which allows us to trace backwards the causes of a given final state. The analysis allows the identification of critical elements that have to be activated to provoke proliferation. PMID:28191459
Toshiba General Hospital PACS for routine in- and outpatient clinics
NASA Astrophysics Data System (ADS)
Toshimitsu, Akihiro; Okazaki, Nobuo; Kura, Hiroyuki; Nishihara, Eitaro; Tsubura, Shinichi
1996-05-01
The Toshiba General Hospital introduced a departmental RIS/PACS (Radiology Information System/Picture Archiving and Communication System) in the radiology department in May, 1993. It has been used routinely since that time. In order to provide efficient means for clinicians to find and read many images, the system has been expanded to the neurosurgery and urology clinics and wards since May, 1995, and five image referring workstations now provide digital images to clinicians. In this paper we discuss an algorithm for image migration, one of the key issues to accomplish the expansion to outpatient clinics successfully, and propose the WYWIWYG (what you want is what you get) image transfer logic. This is the logic used to transfer images that physicians require refer without increasing the traffic between the image server and referring workstations. We accomplish the WYWIWYG logic by prioritizing exams the physicians have not yet viewed and by finding historical exams according to the modality, anatomy, and marking. Clinicians gave us comments from their first use of the system and suggested that the PACS enables clinicians to review images more efficiently compared to a film-based system. Our experience suggests that it is a key to the effective application of PACS in outpatient clinics to incorporate consideration patterns of clinicians on the migration algorithm.
Riesco, Adrián; Santos-Buitrago, Beatriz; De Las Rivas, Javier; Knapp, Merrill; Santos-García, Gustavo; Talcott, Carolyn
2017-01-01
In biological systems, pathways define complex interaction networks where multiple molecular elements are involved in a series of controlled reactions producing responses to specific biomolecular signals. These biosystems are dynamic and there is a need for mathematical and computational methods able to analyze the symbolic elements and the interactions between them and produce adequate readouts of such systems. In this work, we use rewriting logic to analyze the cellular signaling of epidermal growth factor (EGF) and its cell surface receptor (EGFR) in order to induce cellular proliferation. Signaling is initiated by binding the ligand protein EGF to the membrane-bound receptor EGFR so as to trigger a reactions path which have several linked elements through the cell from the membrane till the nucleus. We present two different types of search for analyzing the EGF/proliferation system with the help of Pathway Logic tool, which provides a knowledge-based development environment to carry out the modeling of the signaling. The first one is a standard (forward) search. The second one is a novel approach based on narrowing , which allows us to trace backwards the causes of a given final state. The analysis allows the identification of critical elements that have to be activated to provoke proliferation.
Swimming Between: An Examination of the Inherent Complexity within Social Justice
ERIC Educational Resources Information Center
Aguilar, Israel; Nelson, Sarah; Niño, Juan Manuel
2016-01-01
Classrooms tend to be absolute spaces, places where fluidity is rejected and nearly everything--from people, to ideas, to practices and policies--is viewed and organized through binary logic. Because binary logic is implicitly accepted as the natural order in schools and the structures resulting from it are highly unmalleable, individuals who…
Moral Reasoning: Its Relation to Logical Thinking and Role-Taking.
ERIC Educational Resources Information Center
Smith, Marion E.
1978-01-01
In a sample of 100 children, aged 8-14, there was a clear association between consolidated concrete operational thinking and Kohlberg's Stage 2 moral reasoning, and some evidence that, in order of development, logical thinking precedes role-taking, which precedes moral reasoning, at corresponding levels of conceptual complexity. (Author/SJL)
Comparison of students' foodservice satisfaction between Korea and US
Jeong, Eunkyung; Chun, Youngah; Joo, Nami
2013-01-01
This study analyzes important factors of foodservice in school through comparison of students' satisfaction of using foodservice in Korea and US in order to meet students' expectations. The survey was composed of 4 categories including menu, service, hygiene, and facility and it was carried out in both countries to evaluate satisfaction. First, comparison of satisfaction between two countries was made using t-test. Secondly, multiple regression was performed to identify factors affecting satisfaction. As a result Korean students were more satisfied than American students in all aspects. However, regardless of nationality, the top three factors affecting the students' satisfaction were the same. The predictors were food taste (Korean 0.375 and American 0.350), menu variety (Korean 0.305 and American 0.278), and service line (Korean 0.226 and American 0.192). Despite the similarity of the predicators, it can be concluded that the difference in satisfaction level between the two nationscan be explained by the approaches to create comfortable and acceptable changes in schools' foodservice. Korea has been increasing the foodservice quality based on their objectives to provide students comfortable and positive environment when eating nutritious meals. However, US have made their main objectives on making changes to decrease youth obesity. Foodservice improvements according to continuous evaluations and surveys are necessary in order to increase students' satisfaction. PMID:23422683
NASA Astrophysics Data System (ADS)
Li, Guoqiang; Qian, Feng
2001-11-01
We present, for the first time to our knowledge, a generalized lookahead logic algorithm for number conversion from signed-digit to complement representation. By properly encoding the signed-digits, all the operations are performed by binary logic, and unified logical expressions can be obtained for conversion from modified-signed- digit (MSD) to 2's complement, trinary signed-digit (TSD) to 3's complement, and quarternary signed-digit (QSD) to 4's complement. For optical implementation, a parallel logical array module using an electron-trapping device is employed and experimental results are shown. This optical module is suitable for implementing complex logic functions in the form of the sum of the product. The algorithm and architecture are compatible with a general-purpose optoelectronic computing system.
Failure Control Techniques for the SSME
NASA Technical Reports Server (NTRS)
Taniguchi, M. H.
1987-01-01
Since ground testing of the Space Shuttle Main Engine (SSME) began in 1975, the detection of engine anomalies and the prevention of major damage have been achieved by a multi-faceted detection/shutdown system. The system continues the monitoring task today and consists of the following: sensors, automatic redline and other limit logic, redundant sensors and controller voting logic, conditional decision logic, and human monitoring. Typically, on the order of 300 to 500 measurements are sensed and recorded for each test, while on the order of 100 are used for control and monitoring. Despite extensive monitoring by the current detection system, twenty-seven (27) major incidents have occurred. This number would appear insignificant compared with over 1200 hot-fire tests which have taken place since 1976. However, the number suggests the requirement for and future benefits of a more advanced failure detection system.
DOE Office of Scientific and Technical Information (OSTI.GOV)
McCune, W.; Shumsky, O.
2000-02-04
IVY is a verified theorem prover for first-order logic with equality. It is coded in ACL2, and it makes calls to the theorem prover Otter to search for proofs and to the program MACE to search for countermodels. Verifications of Otter and MACE are not practical because they are coded in C. Instead, Otter and MACE give detailed proofs and models that are checked by verified ACL2 programs. In addition, the initial conversion to clause form is done by verified ACL2 code. The verification is done with respect to finite interpretations.
Objective analysis of observational data from the FGGE observing systems
NASA Technical Reports Server (NTRS)
Baker, W.; Edelmann, D.; Iredell, M.; Han, D.; Jakkempudi, S.
1981-01-01
An objective analysis procedure for updating the GLAS second and fourth order general atmospheric circulation models using observational data from the first GARP global experiment is described. The objective analysis procedure is based on a successive corrections method and the model is updated in a data assimilation cycle. Preparation of the observational data for analysis and the objective analysis scheme are described. The organization of the program and description of the required data sets are presented. The program logic and detailed descriptions of each subroutine are given.
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.
Spatial Soliton Interactions for Photonic Switching. Part I
2000-03-07
solitons in geometries that allow for logically-complete, cascadable logic gates with fanout and level restoration. Detailed modeling will assist in...presented in Chapter 5. The first section covers the basic soliton interaction geometries useful for three-terminal, restoring logic, noting that the...collision and dragging geometries using orthogonally polarized solitons, which are of the general class of angular deflection gates, provide the best
Risk-Based Prioritization of Research for Aviation Security Using Logic-Evolved Decision Analysis
NASA Technical Reports Server (NTRS)
Eisenhawer, S. W.; Bott, T. F.; Sorokach, M. R.; Jones, F. P.; Foggia, J. R.
2004-01-01
The National Aeronautics and Space Administration is developing advanced technologies to reduce terrorist risk for the air transportation system. Decision support tools are needed to help allocate assets to the most promising research. An approach to rank ordering technologies (using logic-evolved decision analysis), with risk reduction as the metric, is presented. The development of a spanning set of scenarios using a logic-gate tree is described. Baseline risk for these scenarios is evaluated with an approximate reasoning model. Illustrative risk and risk reduction results are presented.
Eight-Channel Digital Signal Processor and Universal Trigger Module
NASA Astrophysics Data System (ADS)
Skulski, Wojtek; Wolfs, Frank
2003-04-01
A 10-bit, 8-channel, 40 megasamples per second digital signal processor and waveform digitizer DDC-8 (nicknamed Universal Trigger Module) is presented. The digitizer features 8 analog inputs, 1 analog output for a reconstructed analog waveform, 16 NIM logic inputs, 8 NIM logic outputs, and a pool of 16 TTL logic lines which can be individually configured as either inputs or outputs. The first application of this device is to enhance the present trigger electronics for PHOBOS at RHIC. The status of the development and the first results are presented. Possible applications of the new device are discussed. Supported by the NSF grant PHY-0072204.
Purification of Logic-Qubit Entanglement
Zhou, Lan; Sheng, Yu-Bo
2016-01-01
Recently, the logic-qubit entanglement shows its potential application in future quantum communication and quantum network. However, the entanglement will suffer from the noise and decoherence. In this paper, we will investigate the first entanglement purification protocol for logic-qubit entanglement. We show that both the bit-flip error and phase-flip error in logic-qubit entanglement can be well purified. Moreover, the bit-flip error in physical-qubit entanglement can be completely corrected. The phase-flip in physical-qubit entanglement error equals to the bit-flip error in logic-qubit entanglement, which can also be purified. This entanglement purification protocol may provide some potential applications in future quantum communication and quantum network. PMID:27377165
Using Histories to Implement Atomic Objects
NASA Technical Reports Server (NTRS)
Ng, Pui
1987-01-01
In this paper we describe an approach of implementing atomicity. Atomicity requires that computations appear to be all-or-nothing and executed in a serialization order. The approach we describe has three characteristics. First, it utilizes the semantics of an application to improve concurrency. Second, it reduces the complexity of application-dependent synchronization code by analyzing the process of writing it. In fact, the process can be automated with logic programming. Third, our approach hides the protocol used to arrive at a serialization order from the applications. As a result, different protocols can be used without affecting the applications. Our approach uses a history tree abstraction. The history tree captures the ordering relationship among concurrent computations. By determining what types of computations exist in the history tree and their parameters, a computation can determine whether it can proceed.
Optimal tracking and second order sliding power control of the DFIG wind turbine
NASA Astrophysics Data System (ADS)
Abdeddaim, S.; Betka, A.; Charrouf, O.
2017-02-01
In the present paper, an optimal operation of a grid-connected variable speed wind turbine equipped with a Doubly Fed Induction Generator (DFIG) is presented. The proposed cascaded nonlinear controller is designed to perform two main objectives. In the outer loop, a maximum power point tracking (MPPT) algorithm based on fuzzy logic theory is designed to permanently extract the optimal aerodynamic energy, whereas in the inner loop, a second order sliding mode control (2-SM) is applied to achieve smooth regulation of both stator active and reactive powers quantities. The obtained simulation results show a permanent track of the MPP point regardless of the turbine power-speed slope moreover the proposed sliding mode control strategy presents attractive features such as chattering-free, compared to the conventional first order sliding technique (1-SM).
FPGA-based gating and logic for multichannel single photon counting
DOE Office of Scientific and Technical Information (OSTI.GOV)
Pooser, Raphael C; Earl, Dennis Duncan; Evans, Philip G
2012-01-01
We present results characterizing multichannel InGaAs single photon detectors utilizing gated passive quenching circuits (GPQC), self-differencing techniques, and field programmable gate array (FPGA)-based logic for both diode gating and coincidence counting. Utilizing FPGAs for the diode gating frontend and the logic counting backend has the advantage of low cost compared to custom built logic circuits and current off-the-shelf detector technology. Further, FPGA logic counters have been shown to work well in quantum key distribution (QKD) test beds. Our setup combines multiple independent detector channels in a reconfigurable manner via an FPGA backend and post processing in order to perform coincidencemore » measurements between any two or more detector channels simultaneously. Using this method, states from a multi-photon polarization entangled source are detected and characterized via coincidence counting on the FPGA. Photons detection events are also processed by the quantum information toolkit for application testing (QITKAT)« less
A new approach of active compliance control via fuzzy logic control for multifingered robot hand
NASA Astrophysics Data System (ADS)
Jamil, M. F. A.; Jalani, J.; Ahmad, A.
2016-07-01
Safety is a vital issue in Human-Robot Interaction (HRI). In order to guarantee safety in HRI, a model reference impedance control can be a very useful approach introducing a compliant control. In particular, this paper establishes a fuzzy logic compliance control (i.e. active compliance control) to reduce impact and forces during physical interaction between humans/objects and robots. Exploiting a virtual mass-spring-damper system allows us to determine a desired compliant level by understanding the behavior of the model reference impedance control. The performance of fuzzy logic compliant control is tested in simulation for a robotic hand known as the RED Hand. The results show that the fuzzy logic is a feasible control approach, particularly to control position and to provide compliant control. In addition, the fuzzy logic control allows us to simplify the controller design process (i.e. avoid complex computation) when dealing with nonlinearities and uncertainties.
Cascaded spintronic logic with low-dimensional carbon
NASA Astrophysics Data System (ADS)
Friedman, Joseph S.; Girdhar, Anuj; Gelfand, Ryan M.; Memik, Gokhan; Mohseni, Hooman; Taflove, Allen; Wessels, Bruce W.; Leburton, Jean-Pierre; Sahakian, Alan V.
2017-06-01
Remarkable breakthroughs have established the functionality of graphene and carbon nanotube transistors as replacements to silicon in conventional computing structures, and numerous spintronic logic gates have been presented. However, an efficient cascaded logic structure that exploits electron spin has not yet been demonstrated. In this work, we introduce and analyse a cascaded spintronic computing system composed solely of low-dimensional carbon materials. We propose a spintronic switch based on the recent discovery of negative magnetoresistance in graphene nanoribbons, and demonstrate its feasibility through tight-binding calculations of the band structure. Covalently connected carbon nanotubes create magnetic fields through graphene nanoribbons, cascading logic gates through incoherent spintronic switching. The exceptional material properties of carbon materials permit Terahertz operation and two orders of magnitude decrease in power-delay product compared to cutting-edge microprocessors. We hope to inspire the fabrication of these cascaded logic circuits to stimulate a transformative generation of energy-efficient computing.
Direct microscopic image and measurement of the atomization process of a port fuel injector
NASA Astrophysics Data System (ADS)
Esmail, Mohamed; Kawahara, Nobuyuki; Tomita, Eiji; Sumida, Mamoru
2010-07-01
The main objective of this study is to observe and investigate the phenomena of atomization, i.e. the fuel break-up process very close to the nozzle exit of a practical port fuel injector (PFI). In order to achieve this objective, direct microscopic images of the atomization process were obtained using an ultra-high-speed video camera that could record 102 frames at rates of up to 1 Mfps, coupled with a long-distance microscope and Barlow lens. The experiments were carried out using a PFI in a closed chamber at atmospheric pressure. Time-series images of the spray behaviour were obtained with a high temporal resolution using backlighting. The direct microscopic images of a liquid column break-up were compared with experimental results from laser-induced exciplex fluorescence (LIEF), and the wavelength obtained from the experimental results compared with that predicated from the Kelvin-Helmholtz break-up model. The droplet size diameters from a ligament break-up were compared with results predicated from Weber's analysis. Furthermore, experimental results of the mean droplet diameter from a direct microscopic image were compared with the results obtained from phase Doppler anemometry (PDA) experimental results. Three conclusions were obtained from this study. The atomization processes and detailed characterizations of the break-up of a liquid column were identified; the direct microscopic image results were in good agreement with the results obtained from LIEF, experimental results of the wavelength were in good agreement with those from the Kelvin-Helmholtz break-up model. The break-up process of liquid ligaments into droplets was investigated, and Weber's analysis of the predicated droplet diameter from ligament break-up was found to be applicable only at larger wavelengths. Finally, the direct microscopic image method and PDA method give qualitatively similar trends for droplet size distribution and quantitatively similar values of Sauter mean diameter.
Modal control of a plate using a fuzzy logic controller
NASA Astrophysics Data System (ADS)
Sharma, Manu; Singh, S. P.; Sachdeva, B. L.
2007-08-01
This paper presents fuzzy logic based independent modal space control (IMSC) and fuzzy logic based modified independent modal space control (MIMSC) of vibration. The rule base of the controller consists of nine rules, which have been derived based upon simple human reasoning. Input to the controller consists of the first two modal displacements and velocities of the structure and the output of the controller is the modal force to be applied by the actuator. Fuzzy logic is used in such a way that the actuator is never called to apply effort which is beyond safe limits and also the operator is saved from calculating control gains. The proposed fuzzy controller is experimentally tested for active vibration control of a cantilevered plate. A piezoelectric patch is used as a sensor to sense vibrations of the plate and another piezoelectric patch is used as an actuator to control vibrations of the plate. For analytical formulation, a finite element method based upon Hamilton's principle is used to model the plate. For experimentation, the first two modes of the plate are observed using a Kalman observer. Real-time experiments are performed to control the first mode, the second mode and both modes simultaneously. Experiments are also performed to control the first mode by IMSC, the second mode by IMSC and both modes simultaneously by MIMSC. It is found that for the same decibel reduction in the first mode, the voltage applied by the fuzzy logic based controller is less than that applied by IMSC. While controlling the second mode by IMSC, a considerable amount of spillover is observed in the first mode and region just after the second mode, whereas while controlling the second mode by fuzzy logic, spillover effects are much smaller. While controlling two modes simultaneously, with a single sensor/actuator pair, appreciable resonance control is observed both with fuzzy logic based MIMSC as well as with direct MIMSC, but there is a considerable amount of spillover in the off-resonance region. This may be due to the sub-optimal location and/or an insufficient number of actuators. So, another smart plate with two piezoelectric actuators and one piezoelectric sensor is considered. Piezoelectric patches are fixed in an area where modal strains are high. With this configuration of the smart plate, experiments are conducted to control the first three modes of the plate and it is found that spillover effects are greatly reduced.
False alarm recognition in hyperspectral gas plume identification
Conger, James L [San Ramon, CA; Lawson, Janice K [Tracy, CA; Aimonetti, William D [Livermore, CA
2011-03-29
According to one embodiment, a method for analyzing hyperspectral data includes collecting first hyperspectral data of a scene using a hyperspectral imager during a no-gas period and analyzing the first hyperspectral data using one or more gas plume detection logics. The gas plume detection logic is executed using a low detection threshold, and detects each occurrence of an observed hyperspectral signature. The method also includes generating a histogram for all occurrences of each observed hyperspectral signature which is detected using the gas plume detection logic, and determining a probability of false alarm (PFA) for all occurrences of each observed hyperspectral signature based on the histogram. Possibly at some other time, the method includes collecting second hyperspectral data, and analyzing the second hyperspectral data using the one or more gas plume detection logics and the PFA to determine if any gas is present. Other systems and methods are also included.
Multi-valued logic gates based on ballistic transport in quantum point contacts.
Seo, M; Hong, C; Lee, S-Y; Choi, H K; Kim, N; Chung, Y; Umansky, V; Mahalu, D
2014-01-22
Multi-valued logic gates, which can handle quaternary numbers as inputs, are developed by exploiting the ballistic transport properties of quantum point contacts in series. The principle of a logic gate that finds the minimum of two quaternary number inputs is demonstrated. The device is scalable to allow multiple inputs, which makes it possible to find the minimum of multiple inputs in a single gate operation. Also, the principle of a half-adder for quaternary number inputs is demonstrated. First, an adder that adds up two quaternary numbers and outputs the sum of inputs is demonstrated. Second, a device to express the sum of the adder into two quaternary digits [Carry (first digit) and Sum (second digit)] is demonstrated. All the logic gates presented in this paper can in principle be extended to allow decimal number inputs with high quality QPCs.
Interferometric architectures based All-Optical logic design methods and their implementations
NASA Astrophysics Data System (ADS)
Singh, Karamdeep; Kaur, Gurmeet
2015-06-01
All-Optical Signal Processing is an emerging technology which can avoid costly Optical-electronic-optical (O-E-O) conversions which are usually compulsory in traditional Electronic Signal Processing systems, thus greatly enhancing operating bit rate with some added advantages such as electro-magnetic interference immunity and low power consumption etc. In order to implement complex signal processing tasks All-Optical logic gates are required as backbone elements. This review describes the advances in the field of All-Optical logic design methods based on interferometric architectures such as Mach-Zehnder Interferometer (MZI), Sagnac Interferometers and Ultrafast Non-Linear Interferometer (UNI). All-Optical logic implementations for realization of arithmetic and signal processing applications based on each interferometric arrangement are also presented in a categorized manner.
Goals for Long-Range Research in Information Science.
ERIC Educational Resources Information Center
Pearson, Charls
In order to discuss the research goals of information science (IS), both its logical and its specific nature must be determined. Peircean logical analysis shows that IS may be classified in three parts: pure science, applied science, and technology. The deficiency in the present state of the art is in the pure science, or theoretical portion, of…
Federal Register 2010, 2011, 2012, 2013, 2014
2013-07-01
... data (``Logical Ports''). Each Logical Port is assigned an access gateway that performs order... Change to Offer and Establish Fees for a New Exchange Service, EdgeRisk Gateways June 25, 2013. Pursuant... Exchange has designated the proposed rule change as it pertains to the fees for EdgeRisk Gateway SM (the...
Federal Register 2010, 2011, 2012, 2013, 2014
2013-07-01
... data (``Logical Ports''). Each Logical Port is assigned an access gateway that performs order... Change to Offer and Establish Fees for a New Exchange Service, EdgeRisk Gateways June 25, 2013. Pursuant... Exchange has designated the proposed rule change as it pertains to the fees for EdgeRisk Gateway\\SM\\ (the...
Fuzzy forecasting based on fuzzy-trend logical relationship groups.
Chen, Shyi-Ming; Wang, Nai-Yi
2010-10-01
In this paper, we present a new method to predict the Taiwan Stock Exchange Capitalization Weighted Stock Index (TAIEX) based on fuzzy-trend logical relationship groups (FTLRGs). The proposed method divides fuzzy logical relationships into FTLRGs based on the trend of adjacent fuzzy sets appearing in the antecedents of fuzzy logical relationships. First, we apply an automatic clustering algorithm to cluster the historical data into intervals of different lengths. Then, we define fuzzy sets based on these intervals of different lengths. Then, the historical data are fuzzified into fuzzy sets to derive fuzzy logical relationships. Then, we divide the fuzzy logical relationships into FTLRGs for forecasting the TAIEX. Moreover, we also apply the proposed method to forecast the enrollments and the inventory demand, respectively. The experimental results show that the proposed method gets higher average forecasting accuracy rates than the existing methods.
A m-ary linear feedback shift register with binary logic
NASA Technical Reports Server (NTRS)
Perlman, M. (Inventor)
1973-01-01
A family of m-ary linear feedback shift registers with binary logic is disclosed. Each m-ary linear feedback shift register with binary logic generates a binary representation of a nonbinary recurring sequence, producible with a m-ary linear feedback shift register without binary logic in which m is greater than 2. The state table of a m-ary linear feedback shift register without binary logic, utilizing sum modulo m feedback, is first tubulated for a given initial state. The entries in the state table are coded in binary and the binary entries are used to set the initial states of the stages of a plurality of binary shift registers. A single feedback logic unit is employed which provides a separate feedback binary digit to each binary register as a function of the states of corresponding stages of the binary registers.
High resolution digital delay timer
Martin, Albert D.
1988-01-01
Method and apparatus are provided for generating an output pulse following a trigger pulse at a time delay interval preset with a resolution which is high relative to a low resolution available from supplied clock pulses. A first lumped constant delay (20) provides a first output signal (24) at predetermined interpolation intervals corresponding to the desired high resolution time interval. Latching circuits (26, 28) latch the high resolution data (24) to form a first synchronizing data set (60). A selected time interval has been preset to internal counters (142, 146, 154) and corrected for circuit propagation delay times having the same order of magnitude as the desired high resolution. Internal system clock pulses (32, 34) count down the counters to generate an internal pulse delayed by an interval which is functionally related to the preset time interval. A second LCD (184) corrects the internal signal with the high resolution time delay. A second internal pulse is then applied to a third LCD (74) to generate a second set of synchronizing data (76) which is complementary with the first set of synchronizing data (60) for presentation to logic circuits (64). The logic circuits (64) further delay the internal output signal (72) to obtain a proper phase relationship of an output signal (80) with the internal pulses (32, 34). The final delayed output signal (80) thereafter enables the output pulse generator (82) to produce the desired output pulse (84) at the preset time delay interval following input of the trigger pulse (10, 12).
Falomir, Zoe; Kluth, Thomas
2017-06-24
The challenge of describing 3D real scenes is tackled in this paper using qualitative spatial descriptors. A key point to study is which qualitative descriptors to use and how these qualitative descriptors must be organized to produce a suitable cognitive explanation. In order to find answers, a survey test was carried out with human participants which openly described a scene containing some pieces of furniture. The data obtained in this survey are analysed, and taking this into account, the QSn3D computational approach was developed which uses a XBox 360 Kinect to obtain 3D data from a real indoor scene. Object features are computed on these 3D data to identify objects in indoor scenes. The object orientation is computed, and qualitative spatial relations between the objects are extracted. These qualitative spatial relations are the input to a grammar which applies saliency rules obtained from the survey study and generates cognitive natural language descriptions of scenes. Moreover, these qualitative descriptors can be expressed as first-order logical facts in Prolog for further reasoning. Finally, a validation study is carried out to test whether the descriptions provided by QSn3D approach are human readable. The obtained results show that their acceptability is higher than 82%.
NASA Astrophysics Data System (ADS)
Yang, Qingchun; Wang, Hongxin; Chetehouna, Khaled; Gascoin, Nicolas
2017-01-01
The supersonic combustion ramjet (scramjet) engine remains the most promising airbreathing engine cycle for hypersonic flight, particularly the high-performance dual-mode scramjet in the range of flight Mach number from 4 to 7, because it can operates under different combustion modes. Isolator is a very key component of the dual-mode scramjet engine. In this paper, nonlinear characteristics of combustion mode transition is theoretically analyzed. The discontinuous sudden changes of static pressure and Mach number are obtained as the mode transition occurs, which emphasizing the importance of predication and control of combustion modes. In this paper, a predication model of different combustion modes is developed based on these these nonlinear features in the isolator flow field. it can provide a valuable reference for control system design of the scramjet-powered aerospace vehicle.
Fortunato-Tavares, Talita; de Andrade, Claudia R. F.; Befi-Lopes, Debora M.; Hestvik, Arild; Epstein, Baila; Tornyova, Lidiya; Schwartz, Richard G.
2013-01-01
Purpose In this study, the authors examined the comprehension of sentences with predicates and reflexives that are linked to a nonadjacent noun as a test of the hierarchical ordering deficit (HOD) hypothesis. That hypothesis and more modern versions posit that children with specific language impairment (SLI) have difficulty in establishing nonadjacent (hierarchical) relations among elements of a sentence. The authors also tested whether additional working memory demands in constructions containing reflexives affected the extent to which children with SLI incorrectly structure sentences as indicated by their picture-pointing comprehension responses. Method Sixteen Brazilian Portuguese-speaking children (8;4–l 0;6 [years;months]) with SLI and 16 children with typical language development (TLD) matched for age (±3 months), gender, and socioeconomic status participated in 2 experiments (predicate and reflexive interpretation). In the reflexive experiment, the authors also manipulated working memory demands. Each experiment involved a 4-choice picture selection sentence comprehension task. Results Children with SLI were significantly less accurate on all conditions. Both groups made more hierarchical syntactic construction errors in the long working memory condition than in the short working memory condition. Conclusion The HOD hypothesis was not confirmed. For both groups, syntactic factors (structural assignment) were more vulnerable than lexical factors (prepositions) to working memory effects in sentence miscomprehension. PMID:22232402
Model Adaptation in Parametric Space for POD-Galerkin Models
NASA Astrophysics Data System (ADS)
Gao, Haotian; Wei, Mingjun
2017-11-01
The development of low-order POD-Galerkin models is largely motivated by the expectation to use the model developed with a set of parameters at their native values to predict the dynamic behaviors of the same system under different parametric values, in other words, a successful model adaptation in parametric space. However, most of time, even small deviation of parameters from their original value may lead to large deviation or unstable results. It has been shown that adding more information (e.g. a steady state, mean value of a different unsteady state, or an entire different set of POD modes) may improve the prediction of flow with other parametric states. For a simple case of the flow passing a fixed cylinder, an orthogonal mean mode at a different Reynolds number may stabilize the POD-Galerkin model when Reynolds number is changed. For a more complicated case of the flow passing an oscillatory cylinder, a global POD-Galerkin model is first applied to handle the moving boundaries, then more information (e.g. more POD modes) is required to predicate the flow under different oscillatory frequencies. Supported by ARL.
Software Safety Assurance of Programmable Logic
NASA Technical Reports Server (NTRS)
Berens, Kalynnda
2002-01-01
Programmable Logic (PLC, FPGA, ASIC) devices are hybrids - hardware devices that are designed and programmed like software. As such, they fall in an assurance gray area. Programmable Logic is usually tested and verified as hardware, and the software aspects are ignored, potentially leading to safety or mission success concerns. The objective of this proposal is to first determine where and how Programmable Logic (PL) is used within NASA and document the current methods of assurance. Once that is known, raise awareness of the PL software aspects within the NASA engineering community and provide guidance for the use and assurance of PL form a software perspective.
High performance static latches with complete single event upset immunity
Corbett, Wayne T.; Weaver, Harry T.
1994-01-01
An asymmetric response latch providing immunity to single event upset without loss of speed. The latch has cross-coupled inverters having a hardened logic state and a soft state, wherein the logic state of the first inverter can only be changed when the voltage on the coupling node of that inverter is low and the logic state of the second inverter can only be changed when the coupling of that inverter is high. One of more of the asymmetric response latches may be configured into a memory cell having complete immunity, which protects information rather than logic states.
Wu, Cuichen; Wan, Shuo; Hou, Weijia; Zhang, Liqin; Xu, Jiehua; Cui, Cheng; Wang, Yanyue; Hu, Jun; Tan, Weihong
2015-03-04
Nucleic acid-based logic devices were first introduced in 1994. Since then, science has seen the emergence of new logic systems for mimicking mathematical functions, diagnosing disease and even imitating biological systems. The unique features of nucleic acids, such as facile and high-throughput synthesis, Watson-Crick complementary base pairing, and predictable structures, together with the aid of programming design, have led to the widespread applications of nucleic acids (NA) for logic gate and computing in biotechnology and biomedicine. In this feature article, the development of in vitro NA logic systems will be discussed, as well as the expansion of such systems using various input molecules for potential cellular, or even in vivo, applications.
Wu, Cuichen; Wan, Shuo; Hou, Weijia; Zhang, Liqin; Xu, Jiehua; Cui, Cheng; Wang, Yanyue; Hu, Jun
2015-01-01
Nucleic acid-based logic devices were first introduced in 1994. Since then, science has seen the emergence of new logic systems for mimicking mathematical functions, diagnosing disease and even imitating biological systems. The unique features of nucleic acids, such as facile and high-throughput synthesis, Watson-Crick complementary base pairing, and predictable structures, together with the aid of programming design, have led to the widespread applications of nucleic acids (NA) for logic gating and computing in biotechnology and biomedicine. In this feature article, the development of in vitro NA logic systems will be discussed, as well as the expansion of such systems using various input molecules for potential cellular, or even in vivo, applications. PMID:25597946
NASA Astrophysics Data System (ADS)
Yamada, Katsuhiko; Jikuya, Ichiro
2014-09-01
Singularity analysis and the steering logic of pyramid-type single gimbal control moment gyros are studied. First, a new concept of directional passability in a specified direction is introduced to investigate the structure of an elliptic singular surface. The differences between passability and directional passability are discussed in detail and are visualized for 0H, 2H, and 4H singular surfaces. Second, quadratic steering logic (QSL), a new steering logic for passing the singular surface, is investigated. The algorithm is based on the quadratic constrained quadratic optimization problem and is reduced to the Newton method by using Gröbner bases. The proposed steering logic is demonstrated through numerical simulations for both constant torque maneuvering examples and attitude control examples.
Cybernetic systems based on inductive logic
NASA Astrophysics Data System (ADS)
Fry, Robert L.
2001-05-01
Recent work in the area of inductive logic suggests that cybernetics might be quantified and reduced to engineering practice. If so, then there are considerable implications for engineering, science, and other fields. This paper attempts to capture the essential ideas of cybernetics cast in the light of inductive logic. The described inductive logic extends conventional logic by adding a conjugate logical domain of questions to the logical domain of assertions intrinsic to Boolean Algebra with which most are familiar. This was first posited and developed by Richard Cox. Interestingly enough, these two logical domains, one of questions and the other of assertions, only exist relative to one another with each possessing natural measures of entropy and probability, respectively. Examples are given that highlight the utility of cybernetic approaches to neuroscience, algorithm design, system engineering, and the design and understanding of defensive and offensive systems. For example, the application of cybernetic approaches to defense systems suggests that these systems possess a wavefunction which like quantum mechanics, collapses when we ``look'' through the eyes of the system sensors such as radars and optical sensors. .
NASA Technical Reports Server (NTRS)
Abihana, Osama A.; Gonzalez, Oscar R.
1993-01-01
The main objectives of our research are to present a self-contained overview of fuzzy sets and fuzzy logic, develop a methodology for control system design using fuzzy logic controllers, and to design and implement a fuzzy logic controller for a real system. We first present the fundamental concepts of fuzzy sets and fuzzy logic. Fuzzy sets and basic fuzzy operations are defined. In addition, for control systems, it is important to understand the concepts of linguistic values, term sets, fuzzy rule base, inference methods, and defuzzification methods. Second, we introduce a four-step fuzzy logic control system design procedure. The design procedure is illustrated via four examples, showing the capabilities and robustness of fuzzy logic control systems. This is followed by a tuning procedure that we developed from our design experience. Third, we present two Lyapunov based techniques for stability analysis. Finally, we present our design and implementation of a fuzzy logic controller for a linear actuator to be used to control the direction of the Free Flight Rotorcraft Research Vehicle at LaRC.
LOGIC OF CONTROLLED THRESHOLD DEVICES.
The synthesis of threshold logic circuits from several points of view is presented. The first approach is applicable to resistor-transistor networks...in which the outputs are tied to a common collector resistor. In general, fewer threshold logic gates than NOR gates connected to a common collector...network to realize a specified function such that the failure of any but the output gate can be compensated for by a change in the threshold level (and
Nott, Pauline; Cowan, Robert; Brown, P Margaret; Wigglesworth, Gillian
2009-10-01
Lexical content is commonly understood to refer to the various categories of words that children produce and has been studied extensively in children with normal hearing. Unlike the hearing child, however, little is known about the word categories that make up the first lexicon of children with hearing loss (HL). Knowledge of the first lexicon is increasingly important, as infants with HL are now being detected through universal newborn hearing screening programs and fitted with hearing aids and cochlear implants in before 12 months of age. For these children, emergence of the first spoken words is a major milestone eagerly awaited by parents and one of the first verbal language goals of teachers and therapists working with such children. The purpose of this study was to evaluate the lexical content of the first 50 and 100 words produced by children with HL and to contrast this with that of a group of hearing children. Lexical content was compared in two groups of children: one group composed of 24 participants with severe profound or profound HL and a second group composed of 16 participants with normal hearing. Twenty-three participants in the HL group were fitted with a cochlear implant and one with bilateral hearing aids. All were "switched on" or fitted before 30 months of age. The Diary of Early Language (Di-EL) was used to collect a 100-word lexicon from each participant. All single word and frozen phrase data from each child's Di-EL were allocated to 1 of 15 word types grouped into four word categories (noun, predicate, grammatical, and paralexical), and the results were compared for both groups. The hearing and HL groups showed similar distributions of word categories, with nouns constituting the largest portion of the lexicon followed by predicates and paralexicals. Grammaticals made up the smallest portion of the lexicon. However, several significant differences were evident between the two groups. In both the 50- and 100-word lexicons, the hearing group used proportionately more nouns, fewer predicates, more common nouns, and fewer onomatopoeic words compared with the HL group. Further, more participants in the hearing group used grammatical word types other than adverbs (including pronouns) compared with the HL group. Overall, lexical content of the HL group was similar to that of the hearing group for both the 50- and 100-word lexicons, although some differences in proportional use were noted across word categories and types. It is suggested that differences in the quantity and diversity of language experienced by children with normal hearing compared with those with HL, together with differences in the input they receive, might in part explain these differences. The effect of quality of speech input and therapy method on the emerging lexicon and subsequent language development will be particularly important in informing appropriate intervention strategies for children with HL.
Intelligent machines in the twenty-first century: foundations of inference and inquiry.
Knuth, Kevin H
2003-12-15
The last century saw the application of Boolean algebra to the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines, in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. Recent advances in our understanding of the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we recently identified the algebra of questions as the free distributive algebra, which will now allow us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper, we examine the foundations of inference and inquiry. We begin with a history of inferential reasoning, highlighting key concepts that have led to the automation of inference in modern machine-learning systems. We then discuss the foundations of inference in more detail using a modern viewpoint that relies on the mathematics of partially ordered sets and the scaffolding of lattice theory. This new viewpoint allows us to develop the logic of inquiry and introduce a measure describing the relevance of a proposed question to an unresolved issue. Last, we will demonstrate the automation of inference, and discuss how this new logic of inquiry will enable intelligent machines to ask questions. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them not only to make inferences from data, but also to decide which question to ask, which experiment to perform, or which measurement to take given what they have learned and what they are designed to understand.
Intelligent machines in the twenty-first century: foundations of inference and inquiry
NASA Technical Reports Server (NTRS)
Knuth, Kevin H.
2003-01-01
The last century saw the application of Boolean algebra to the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines, in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. Recent advances in our understanding of the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we recently identified the algebra of questions as the free distributive algebra, which will now allow us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper, we examine the foundations of inference and inquiry. We begin with a history of inferential reasoning, highlighting key concepts that have led to the automation of inference in modern machine-learning systems. We then discuss the foundations of inference in more detail using a modern viewpoint that relies on the mathematics of partially ordered sets and the scaffolding of lattice theory. This new viewpoint allows us to develop the logic of inquiry and introduce a measure describing the relevance of a proposed question to an unresolved issue. Last, we will demonstrate the automation of inference, and discuss how this new logic of inquiry will enable intelligent machines to ask questions. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them not only to make inferences from data, but also to decide which question to ask, which experiment to perform, or which measurement to take given what they have learned and what they are designed to understand.
ERIC Educational Resources Information Center
Le, Nguyen-Thinh; Menzel, Wolfgang
2009-01-01
In this paper, we introduce logic programming as a domain that exhibits some characteristics of being ill-defined. In order to diagnose student errors in such a domain, we need a means to hypothesise the student's intention, that is the strategy underlying her solution. This is achieved by weighting constraints, so that hypotheses about solution…
ERIC Educational Resources Information Center
Oldroyd, Betty K.; Schroder, J. J.
1982-01-01
Reviews the advantages and disadvantages of different types of term combination using the positional logic capability of online information retrieval systems and describes a study in which searches for material on "microwave integrated circuits" were conducted in order to find the most economical way of generating the most relevant…
Logic as Marr's Computational Level: Four Case Studies.
Baggio, Giosuè; van Lambalgen, Michiel; Hagoort, Peter
2015-04-01
We sketch four applications of Marr's levels-of-analysis methodology to the relations between logic and experimental data in the cognitive neuroscience of language and reasoning. The first part of the paper illustrates the explanatory power of computational level theories based on logic. We show that a Bayesian treatment of the suppression task in reasoning with conditionals is ruled out by EEG data, supporting instead an analysis based on defeasible logic. Further, we describe how results from an EEG study on temporal prepositions can be reanalyzed using formal semantics, addressing a potential confound. The second part of the article demonstrates the predictive power of logical theories drawing on EEG data on processing progressive constructions and on behavioral data on conditional reasoning in people with autism. Logical theories can constrain processing hypotheses all the way down to neurophysiology, and conversely neuroscience data can guide the selection of alternative computational level models of cognition. Copyright © 2014 Cognitive Science Society, Inc.
Millimeter wave attenuation prediction using a piecewise uniform rain rate model
NASA Technical Reports Server (NTRS)
Persinger, R. R.; Stutzman, W. L.; Bostian, C. W.; Castle, R. E., Jr.
1980-01-01
A piecewise uniform rain rate distribution model is introduced as a quasi-physical model of real rain along earth-space millimeter wave propagation paths. It permits calculation of the total attenuation from specific attenuation in a simple fashion. The model predications are verified by comparison with direct attenuation measurements for several frequencies, elevation angles, and locations. Also, coupled with the Rice-Holmberg rain rate model, attenuation statistics are predicated from rainfall accumulation data.
Design of a Ferroelectric Programmable Logic Gate Array
NASA Technical Reports Server (NTRS)
MacLeod, Todd C.; Ho, Fat Duen
2003-01-01
A programmable logic gate array has been designed utilizing ferroelectric field effect transistors. The design has only a small number of gates, but this could be scaled up to a more useful size. Using FFET's in a logic array gives several advantages. First, it allows real-time programmability to the array to give high speed reconfiguration. It also allows the array to be configured nearly an unlimited number of times, unlike a FLASH FPGA. Finally, the Ferroelectric Programmable Logic Gate Array (FPLGA) can be implemented using a smaller number of transistors because of the inherent logic characteristics of an FFET. The device was only designed and modeled using Spice models of the circuit, including the FFET. The actual device was not produced. The design consists of a small array of NAND and NOR logic gates. Other gates could easily be produced. They are linked by FFET's that control the logic flow. Timing and logic tables have been produced showing the array can produce a variety of logic combinations at a real time usable speed. This device could be a prototype for a device that could be put into imbedded systems that need the high speed of hardware implementation of logic and the complexity to need to change the logic algorithm. Because of the non-volatile nature of the FFET, it would also be useful in situations that needed to program a logic array once and use it repeatedly after the power has been shut off.
Pedagogy of the logic model: teaching undergraduates to work together to change their communities.
Zimmerman, Lindsey; Kamal, Zohra; Kim, Hannah
2013-01-01
Undergraduate community psychology courses can empower students to address challenging problems in their local communities. Creating a logic model is an experiential way to learn course concepts by "doing." Throughout the semester, students work with peers to define a problem, develop an intervention, and plan an evaluation focused on an issue of concern to them. This report provides an overview of how to organize a community psychology course around the creation of a logic model in order for students to develop this applied skill. Two undergraduate student authors report on their experience with the logic model assignment, describing the community problem they chose to address, what they learned from the assignment, what they found challenging, and what they are doing now in their communities based on what they learned.
NASA Astrophysics Data System (ADS)
Chen, Chunfeng; Liu, Hua; Fan, Ge
2005-02-01
In this paper we consider the problem of designing a network of optical cross-connects(OXCs) to provide end-to-end lightpath services to label switched routers (LSRs). Like some previous work, we select the number of OXCs as our objective. Compared with the previous studies, we take into account the fault-tolerant characteristic of logical topology. First of all, using a Prufer number randomly generated, we generate a tree. By adding some edges to the tree, we can obtain a physical topology which consists of a certain number of OXCs and fiber links connecting OXCs. It is notable that we for the first time limit the number of layers of the tree produced according to the method mentioned above. Then we design the logical topologies based on the physical topologies mentioned above. In principle, we will select the shortest path in addition to some consideration on the load balancing of links and the limitation owing to the SRLG. Notably, we implement the routing algorithm for the nodes in increasing order of the degree of the nodes. With regarding to the problem of the wavelength assignment, we adopt the heuristic algorithm of the graph coloring commonly used. It is clear our problem is computationally intractable especially when the scale of the network is large. We adopt the taboo search algorithm to find the near optimal solution to our objective. We present numerical results for up to 1000 LSRs and for a wide range of system parameters such as the number of wavelengths supported by each fiber link and traffic. The results indicate that it is possible to build large-scale optical networks with rich connectivity in a cost-effective manner, using relatively few but properly dimensioned OXCs.
Questions for Assessing Higher-Order Cognitive Skills: It's Not Just Bloom’s
Lemons, Paula P.; Lemons, J. Derrick
2013-01-01
We present an exploratory study of biologists’ ideas about higher-order cognition questions. We documented the conversations of biologists who were writing and reviewing a set of higher-order cognition questions. Using a qualitative approach, we identified the themes of these conversations. Biologists in our study used Bloom's Taxonomy to logically analyze questions. However, biologists were also concerned with question difficulty, the length of time required for students to address questions, and students’ experience with questions. Finally, some biologists demonstrated an assumption that questions should have one correct answer, not multiple reasonable solutions; this assumption undermined their comfort with some higher-order cognition questions. We generated a framework for further research that provides an interpretation of participants’ ideas about higher-order questions and a model of the relationships among these ideas. Two hypotheses emerge from this framework. First, we propose that biologists look for ways to measure difficulty when writing higher-order questions. Second, we propose that biologists’ assumptions about the role of questions in student learning strongly influence the types of higher-order questions they write. PMID:23463228
Robust control with structured perturbations
NASA Technical Reports Server (NTRS)
Keel, Leehyun
1988-01-01
Two important problems in the area of control systems design and analysis are discussed. The first is the robust stability using characteristic polynomial, which is treated first in characteristic polynomial coefficient space with respect to perturbations in the coefficients of the characteristic polynomial, and then for a control system containing perturbed parameters in the transfer function description of the plant. In coefficient space, a simple expression is first given for the l(sup 2) stability margin for both monic and non-monic cases. Following this, a method is extended to reveal much larger stability region. This result has been extended to the parameter space so that one can determine the stability margin, in terms of ranges of parameter variations, of the closed loop system when the nominal stabilizing controller is given. The stability margin can be enlarged by a choice of better stabilizing controller. The second problem describes the lower order stabilization problem, the motivation of the problem is as follows. Even though the wide range of stabilizing controller design methodologies is available in both the state space and transfer function domains, all of these methods produce unnecessarily high order controllers. In practice, the stabilization is only one of many requirements to be satisfied. Therefore, if the order of a stabilizing controller is excessively high, one can normally expect to have a even higher order controller on the completion of design such as inclusion of dynamic response requirements, etc. Therefore, it is reasonable to have a lowest possible order stabilizing controller first and then adjust the controller to meet additional requirements. The algorithm for designing a lower order stabilizing controller is given. The algorithm does not necessarily produce the minimum order controller; however, the algorithm is theoretically logical and some simulation results show that the algorithm works in general.
Evaluation of machine learning algorithms for improved risk assessment for Down's syndrome.
Koivu, Aki; Korpimäki, Teemu; Kivelä, Petri; Pahikkala, Tapio; Sairanen, Mikko
2018-05-04
Prenatal screening generates a great amount of data that is used for predicting risk of various disorders. Prenatal risk assessment is based on multiple clinical variables and overall performance is defined by how well the risk algorithm is optimized for the population in question. This article evaluates machine learning algorithms to improve performance of first trimester screening of Down syndrome. Machine learning algorithms pose an adaptive alternative to develop better risk assessment models using the existing clinical variables. Two real-world data sets were used to experiment with multiple classification algorithms. Implemented models were tested with a third, real-world, data set and performance was compared to a predicate method, a commercial risk assessment software. Best performing deep neural network model gave an area under the curve of 0.96 and detection rate of 78% with 1% false positive rate with the test data. Support vector machine model gave area under the curve of 0.95 and detection rate of 61% with 1% false positive rate with the same test data. When compared with the predicate method, the best support vector machine model was slightly inferior, but an optimized deep neural network model was able to give higher detection rates with same false positive rate or similar detection rate but with markedly lower false positive rate. This finding could further improve the first trimester screening for Down syndrome, by using existing clinical variables and a large training data derived from a specific population. Copyright © 2018 Elsevier Ltd. All rights reserved.
Doherty, Cailbhe; Bleakley, Chris; Hertel, Jay; Caulfield, Brian; Ryan, John; Delahunt, Eamonn
2016-04-01
Impairments in motor control may predicate the paradigm of chronic ankle instability (CAI) that can develop in the year after an acute lateral ankle sprain (LAS) injury. No prospective analysis is currently available identifying the mechanisms by which these impairments develop and contribute to long-term outcome after LAS. To identify the motor control deficits predicating CAI outcome after a first-time LAS injury. Cohort study (diagnosis); Level of evidence, 2. Eighty-two individuals were recruited after sustaining a first-time LAS injury. Several biomechanical analyses were performed for these individuals, who completed 5 movement tasks at 3 time points: (1) 2 weeks, (2) 6 months, and (3) 12 months after LAS occurrence. A logistic regression analysis of several "salient" biomechanical parameters identified from the movement tasks, in addition to scores from the Cumberland Ankle Instability Tool and the Foot and Ankle Ability Measure (FAAM) recorded at the 2-week and 6-month time points, were used as predictors of 12-month outcome. At the 2-week time point, an inability to complete 2 of the movement tasks (a single-leg drop landing and a drop vertical jump) was predictive of CAI outcome and correctly classified 67.6% of cases (sensitivity, 83%; specificity, 55%; P = .004). At the 6-month time point, several deficits exhibited by the CAI group during 1 of the movement tasks (reach distances and sagittal plane joint positions at the hip, knee and ankle during the posterior reach directions of the Star Excursion Balance Test) and their scores on the activities of daily living subscale of the FAAM were predictive of outcome and correctly classified 84.8% of cases (sensitivity, 75%; specificity, 91%; P < .001). An inability to complete jumping and landing tasks within 2 weeks of a first-time LAS and poorer dynamic postural control and lower self-reported function 6 months after a first-time LAS were predictive of eventual CAI outcome. © 2016 The Author(s).
Logic, History, and the Chemistry Textbook: I. Does Chemistry Have a Logical Structure?
ERIC Educational Resources Information Center
Jensen, William B.
1998-01-01
Presents the first of three invited keynote lectures from the 1995 conference of the New England Association of Chemistry Teachers. Discusses the relevance of the history of chemistry to the teaching of chemistry. Contains 27 references. (DDR)
A reconfigurable NAND/NOR genetic logic gate
2012-01-01
Background Engineering genetic Boolean logic circuits is a major research theme of synthetic biology. By altering or introducing connections between genetic components, novel regulatory networks are built in order to mimic the behaviour of electronic devices such as logic gates. While electronics is a highly standardized science, genetic logic is still in its infancy, with few agreed standards. In this paper we focus on the interpretation of logical values in terms of molecular concentrations. Results We describe the results of computational investigations of a novel circuit that is able to trigger specific differential responses depending on the input standard used. The circuit can therefore be dynamically reconfigured (without modification) to serve as both a NAND/NOR logic gate. This multi-functional behaviour is achieved by a) varying the meanings of inputs, and b) using branch predictions (as in computer science) to display a constrained output. A thorough computational study is performed, which provides valuable insights for the future laboratory validation. The simulations focus on both single-cell and population behaviours. The latter give particular insights into the spatial behaviour of our engineered cells on a surface with a non-homogeneous distribution of inputs. Conclusions We present a dynamically-reconfigurable NAND/NOR genetic logic circuit that can be switched between modes of operation via a simple shift in input signal concentration. The circuit addresses important issues in genetic logic that will have significance for more complex synthetic biology applications. PMID:22989145
A reconfigurable NAND/NOR genetic logic gate.
Goñi-Moreno, Angel; Amos, Martyn
2012-09-18
Engineering genetic Boolean logic circuits is a major research theme of synthetic biology. By altering or introducing connections between genetic components, novel regulatory networks are built in order to mimic the behaviour of electronic devices such as logic gates. While electronics is a highly standardized science, genetic logic is still in its infancy, with few agreed standards. In this paper we focus on the interpretation of logical values in terms of molecular concentrations. We describe the results of computational investigations of a novel circuit that is able to trigger specific differential responses depending on the input standard used. The circuit can therefore be dynamically reconfigured (without modification) to serve as both a NAND/NOR logic gate. This multi-functional behaviour is achieved by a) varying the meanings of inputs, and b) using branch predictions (as in computer science) to display a constrained output. A thorough computational study is performed, which provides valuable insights for the future laboratory validation. The simulations focus on both single-cell and population behaviours. The latter give particular insights into the spatial behaviour of our engineered cells on a surface with a non-homogeneous distribution of inputs. We present a dynamically-reconfigurable NAND/NOR genetic logic circuit that can be switched between modes of operation via a simple shift in input signal concentration. The circuit addresses important issues in genetic logic that will have significance for more complex synthetic biology applications.
Continuous variables logic via coupled automata using a DNAzyme cascade with feedback.
Lilienthal, S; Klein, M; Orbach, R; Willner, I; Remacle, F; Levine, R D
2017-03-01
The concentration of molecules can be changed by chemical reactions and thereby offer a continuous readout. Yet computer architecture is cast in textbooks in terms of binary valued, Boolean variables. To enable reactive chemical systems to compute we show how, using the Cox interpretation of probability theory, one can transcribe the equations of chemical kinetics as a sequence of coupled logic gates operating on continuous variables. It is discussed how the distinct chemical identity of a molecule allows us to create a common language for chemical kinetics and Boolean logic. Specifically, the logic AND operation is shown to be equivalent to a bimolecular process. The logic XOR operation represents chemical processes that take place concurrently. The values of the rate constants enter the logic scheme as inputs. By designing a reaction scheme with a feedback we endow the logic gates with a built in memory because their output then depends on the input and also on the present state of the system. Technically such a logic machine is an automaton. We report an experimental realization of three such coupled automata using a DNAzyme multilayer signaling cascade. A simple model verifies analytically that our experimental scheme provides an integrator generating a power series that is third order in time. The model identifies two parameters that govern the kinetics and shows how the initial concentrations of the substrates are the coefficients in the power series.
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
Test functions for three-dimensional control-volume mixed finite-element methods on irregular grids
Naff, R.L.; Russell, T.F.; Wilson, J.D.; ,; ,; ,; ,; ,
2000-01-01
Numerical methods based on unstructured grids, with irregular cells, usually require discrete shape functions to approximate the distribution of quantities across cells. For control-volume mixed finite-element methods, vector shape functions are used to approximate the distribution of velocities across cells and vector test functions are used to minimize the error associated with the numerical approximation scheme. For a logically cubic mesh, the lowest-order shape functions are chosen in a natural way to conserve intercell fluxes that vary linearly in logical space. Vector test functions, while somewhat restricted by the mapping into the logical reference cube, admit a wider class of possibilities. Ideally, an error minimization procedure to select the test function from an acceptable class of candidates would be the best procedure. Lacking such a procedure, we first investigate the effect of possible test functions on the pressure distribution over the control volume; specifically, we look for test functions that allow for the elimination of intermediate pressures on cell faces. From these results, we select three forms for the test function for use in a control-volume mixed method code and subject them to an error analysis for different forms of grid irregularity; errors are reported in terms of the discrete L2 norm of the velocity error. Of these three forms, one appears to produce optimal results for most forms of grid irregularity.
Anatomy of Strategy: Fighting for the Future Through Narrative, Logic and Grammar
2012-05-17
community effort. The theory here advanced is heavily influenced by the strategic thought of John Boyd, the idea of relative advantage developed by...logic and rules as grammar. Developing these ideas leads to an anatomy of strategy. This, in turn, paves the way to developing three forms of...strategyless” NSS: Strategy is built upon a logic encoded within a narrative.1 This first attempt to develop a theory of strategy formation was heavily
NASA Astrophysics Data System (ADS)
Wan, Danny; Manfrini, Mauricio; Vaysset, Adrien; Souriau, Laurent; Wouters, Lennaert; Thiam, Arame; Raymenants, Eline; Sayan, Safak; Jussot, Julien; Swerts, Johan; Couet, Sebastien; Rassoul, Nouredine; Babaei Gavan, Khashayar; Paredis, Kristof; Huyghebaert, Cedric; Ercken, Monique; Wilson, Christopher J.; Mocuta, Dan; Radu, Iuliana P.
2018-04-01
Magnetic tunnel junctions (MTJs) interconnected via a continuous ferromagnetic free layer were fabricated for spin torque majority gate (STMG) logic. The MTJs are biased independently and show magnetoelectric response under spin transfer torque. The electrical control of these devices paves the way to future spin logic devices based on domain wall (DW) motion. In particular, it is a significant step towards the realization of a majority gate. To our knowledge, this is the first fabrication of a cross-shaped free layer shared by several perpendicular MTJs. The fabrication process can be generalized to any geometry and any number of MTJs. Thus, this framework can be applied to other spin logic concepts based on magnetic interconnect. Moreover, it allows exploration of spin dynamics for logic applications.
NASA Technical Reports Server (NTRS)
Sultan, Labib; Janabi, Talib
1992-01-01
This paper analyses the internal operation of fuzzy logic controllers as referenced to the human cognitive tasks of control and decision making. Two goals are targeted. The first goal focuses on the cognitive interpretation of the mechanisms employed in the current design of fuzzy logic controllers. This analysis helps to create a ground to explore the potential of enhancing the functional intelligence of fuzzy controllers. The second goal is to outline the features of a new class of fuzzy controllers, the Clearness Transformation Fuzzy Logic Controller (CT-FLC), whereby some new concepts are advanced to qualify fuzzy controllers as 'cognitive devices' rather than 'expert system devices'. The operation of the CT-FLC, as a fuzzy pattern processing controller, is explored, simulated, and evaluated.
High performance static latches with complete single event upset immunity
Corbett, W.T.; Weaver, H.T.
1994-04-26
An asymmetric response latch providing immunity to single event upset without loss of speed is described. The latch has cross-coupled inverters having a hardened logic state and a soft state, wherein the logic state of the first inverter can only be changed when the voltage on the coupling node of that inverter is low and the logic state of the second inverter can only be changed when the coupling of that inverter is high. One of more of the asymmetric response latches may be configured into a memory cell having complete immunity, which protects information rather than logic states. 5 figures.
A multi-agent architecture for geosimulation of moving agents
NASA Astrophysics Data System (ADS)
Vahidnia, Mohammad H.; Alesheikh, Ali A.; Alavipanah, Seyed Kazem
2015-10-01
In this paper, a novel architecture is proposed in which an axiomatic derivation system in the form of first-order logic facilitates declarative explanation and spatial reasoning. Simulation of environmental perception and interaction between autonomous agents is designed with a geographic belief-desire-intention and a request-inform-query model. The architecture has a complementary quantitative component that supports collaborative planning based on the concept of equilibrium and game theory. This new architecture presents a departure from current best practices geographic agent-based modelling. Implementation tasks are discussed in some detail, as well as scenarios for fleet management and disaster management.
Testing and operating a multiprocessor chip with processor redundancy
Bellofatto, Ralph E; Douskey, Steven M; Haring, Rudolf A; McManus, Moyra K; Ohmacht, Martin; Schmunkamp, Dietmar; Sugavanam, Krishnan; Weatherford, Bryan J
2014-10-21
A system and method for improving the yield rate of a multiprocessor semiconductor chip that includes primary processor cores and one or more redundant processor cores. A first tester conducts a first test on one or more processor cores, and encodes results of the first test in an on-chip non-volatile memory. A second tester conducts a second test on the processor cores, and encodes results of the second test in an external non-volatile storage device. An override bit of a multiplexer is set if a processor core fails the second test. In response to the override bit, the multiplexer selects a physical-to-logical mapping of processor IDs according to one of: the encoded results in the memory device or the encoded results in the external storage device. On-chip logic configures the processor cores according to the selected physical-to-logical mapping.
Fuzzy set methods for object recognition in space applications
NASA Technical Reports Server (NTRS)
Keller, James M.
1991-01-01
During the reporting period, the development of the theory and application of methodologies for decision making under uncertainty was addressed. Two subreports are included; the first on properties of general hybrid operators, while the second considers some new research on generalized threshold logic units. In the first part, the properties of the additive gamma-model, where the intersection part is first considered to be the product of the input values and the union part is obtained by an extension of De Morgan's law to fuzzy sets, is explored. Then the Yager's class of union and intersection is used in the additive gamma-model. The inputs are weighted to some power that represents their importance and thus their contribution to the compensation process. In the second part, the extension of binary logic synthesis methods to multiple valued logic synthesis methods to enable the synthesis of decision networks when the input/output variables are not binary is discussed.
The probability heuristics model of syllogistic reasoning.
Chater, N; Oaksford, M
1999-03-01
A probability heuristic model (PHM) for syllogistic reasoning is proposed. An informational ordering over quantified statements suggests simple probability based heuristics for syllogistic reasoning. The most important is the "min-heuristic": choose the type of the least informative premise as the type of the conclusion. The rationality of this heuristic is confirmed by an analysis of the probabilistic validity of syllogistic reasoning which treats logical inference as a limiting case of probabilistic inference. A meta-analysis of past experiments reveals close fits with PHM. PHM also compares favorably with alternative accounts, including mental logics, mental models, and deduction as verbal reasoning. Crucially, PHM extends naturally to generalized quantifiers, such as Most and Few, which have not been characterized logically and are, consequently, beyond the scope of current mental logic and mental model theories. Two experiments confirm the novel predictions of PHM when generalized quantifiers are used in syllogistic arguments. PHM suggests that syllogistic reasoning performance may be determined by simple but rational informational strategies justified by probability theory rather than by logic. Copyright 1999 Academic Press.
Segmentation method of eye region based on fuzzy logic system for classifying open and closed eyes
NASA Astrophysics Data System (ADS)
Kim, Ki Wan; Lee, Won Oh; Kim, Yeong Gon; Hong, Hyung Gil; Lee, Eui Chul; Park, Kang Ryoung
2015-03-01
The classification of eye openness and closure has been researched in various fields, e.g., driver drowsiness detection, physiological status analysis, and eye fatigue measurement. For a classification with high accuracy, accurate segmentation of the eye region is required. Most previous research used the segmentation method by image binarization on the basis that the eyeball is darker than skin, but the performance of this approach is frequently affected by thick eyelashes or shadows around the eye. Thus, we propose a fuzzy-based method for classifying eye openness and closure. First, the proposed method uses I and K color information from the HSI and CMYK color spaces, respectively, for eye segmentation. Second, the eye region is binarized using the fuzzy logic system based on I and K inputs, which is less affected by eyelashes and shadows around the eye. The combined image of I and K pixels is obtained through the fuzzy logic system. Third, in order to reflect the effect by all the inference values on calculating the output score of the fuzzy system, we use the revised weighted average method, where all the rectangular regions by all the inference values are considered for calculating the output score. Fourth, the classification of eye openness or closure is successfully made by the proposed fuzzy-based method with eye images of low resolution which are captured in the environment of people watching TV at a distance. By using the fuzzy logic system, our method does not require the additional procedure of training irrespective of the chosen database. Experimental results with two databases of eye images show that our method is superior to previous approaches.
Pechenick, Dov A.; Payne, Joshua L.; Moore, Jason H.
2011-01-01
Gene regulatory networks (GRNs) drive the cellular processes that sustain life. To do so reliably, GRNs must be robust to perturbations, such as gene deletion and the addition or removal of regulatory interactions. GRNs must also be robust to genetic changes in regulatory regions that define the logic of signal-integration, as these changes can affect how specific combinations of regulatory signals are mapped to particular gene expression states. Previous theoretical analyses have demonstrated that the robustness of a GRN is influenced by its underlying topological properties, such as degree distribution and modularity. Another important topological property is assortativity, which measures the propensity with which nodes of similar connectivity are connected to one another. How assortativity influences the robustness of the signal-integration logic of GRNs remains an open question. Here, we use computational models of GRNs to investigate this relationship. We separately consider each of the three dynamical regimes of this model for a variety of degree distributions. We find that in the chaotic regime, robustness exhibits a pronounced increase as assortativity becomes more positive, while in the critical and ordered regimes, robustness is generally less sensitive to changes in assortativity. We attribute the increased robustness to a decrease in the duration of the gene expression pattern, which is caused by a reduction in the average size of a GRN’s in-components. This study provides the first direct evidence that assortativity influences the robustness of the signal-integration logic of computational models of GRNs, illuminates a mechanistic explanation for this influence, and furthers our understanding of the relationship between topology and robustness in complex biological systems. PMID:22155134
ERIC Educational Resources Information Center
Kanno, Atsushi
1989-01-01
The study was designed to investigate the learning processes in discrimination shift learning, in terms of developmental views of "logical manipulation by classification." Tasks comparing sizes of intradimensional value-classes and comparing sizes of interdimensional value-classes were devised in order to measure subjects' levels of…
Wang, Feifan; Gong, Zibo; Hu, Xiaoyong; Yang, Xiaoyu; Yang, Hong; Gong, Qihuang
2016-01-01
The nanoscale chip-integrated all-optical logic parity checker is an essential core component for optical computing systems and ultrahigh-speed ultrawide-band information processing chips. Unfortunately, little experimental progress has been made in development of these devices to date because of material bottleneck limitations and a lack of effective realization mechanisms. Here, we report a simple and efficient strategy for direct realization of nanoscale chip-integrated all-optical logic parity checkers in integrated plasmonic circuits in the optical communication range. The proposed parity checker consists of two-level cascaded exclusive-OR (XOR) logic gates that are realized based on the linear interference of surface plasmon polaritons propagating in the plasmonic waveguides. The parity of the number of logic 1s in the incident four-bit logic signals is determined, and the output signal is given the logic state 0 for even parity (and 1 for odd parity). Compared with previous reports, the overall device feature size is reduced by more than two orders of magnitude, while ultralow energy consumption is maintained. This work raises the possibility of realization of large-scale integrated information processing chips based on integrated plasmonic circuits, and also provides a way to overcome the intrinsic limitations of serious surface plasmon polariton losses for on-chip integration applications. PMID:27073154
Wang, Feifan; Gong, Zibo; Hu, Xiaoyong; Yang, Xiaoyu; Yang, Hong; Gong, Qihuang
2016-04-13
The nanoscale chip-integrated all-optical logic parity checker is an essential core component for optical computing systems and ultrahigh-speed ultrawide-band information processing chips. Unfortunately, little experimental progress has been made in development of these devices to date because of material bottleneck limitations and a lack of effective realization mechanisms. Here, we report a simple and efficient strategy for direct realization of nanoscale chip-integrated all-optical logic parity checkers in integrated plasmonic circuits in the optical communication range. The proposed parity checker consists of two-level cascaded exclusive-OR (XOR) logic gates that are realized based on the linear interference of surface plasmon polaritons propagating in the plasmonic waveguides. The parity of the number of logic 1s in the incident four-bit logic signals is determined, and the output signal is given the logic state 0 for even parity (and 1 for odd parity). Compared with previous reports, the overall device feature size is reduced by more than two orders of magnitude, while ultralow energy consumption is maintained. This work raises the possibility of realization of large-scale integrated information processing chips based on integrated plasmonic circuits, and also provides a way to overcome the intrinsic limitations of serious surface plasmon polariton losses for on-chip integration applications.
Social is special: A normative framework for teaching with and learning from evaluative feedback.
Ho, Mark K; MacGlashan, James; Littman, Michael L; Cushman, Fiery
2017-10-01
Humans often attempt to influence one another's behavior using rewards and punishments. How does this work? Psychologists have often assumed that "evaluative feedback" influences behavior via standard learning mechanisms that learn from environmental contingencies. On this view, teaching with evaluative feedback involves leveraging learning systems designed to maximize an organism's positive outcomes. Yet, despite its parsimony, programs of research predicated on this assumption, such as ones in developmental psychology, animal behavior, and human-robot interaction, have had limited success. We offer an explanation by analyzing the logic of evaluative feedback and show that specialized learning mechanisms are uniquely favored in the case of evaluative feedback from a social partner. Specifically, evaluative feedback works best when it is treated as communicating information about the value of an action rather than as a form of reward to be maximized. This account suggests that human learning from evaluative feedback depends on inferences about communicative intent, goals and other mental states-much like learning from other sources, such as demonstration, observation and instruction. Because these abilities are especially developed in humans, the present account also explains why evaluative feedback is far more widespread in humans than non-human animals. Copyright © 2017 Elsevier B.V. All rights reserved.
CASTRO: A NEW COMPRESSIBLE ASTROPHYSICAL SOLVER. II. GRAY RADIATION HYDRODYNAMICS
DOE Office of Scientific and Technical Information (OSTI.GOV)
Zhang, W.; Almgren, A.; Bell, J.
We describe the development of a flux-limited gray radiation solver for the compressible astrophysics code, CASTRO. CASTRO uses an Eulerian grid with block-structured adaptive mesh refinement based on a nested hierarchy of logically rectangular variable-sized grids with simultaneous refinement in both space and time. The gray radiation solver is based on a mixed-frame formulation of radiation hydrodynamics. In our approach, the system is split into two parts, one part that couples the radiation and fluid in a hyperbolic subsystem, and another parabolic part that evolves radiation diffusion and source-sink terms. The hyperbolic subsystem is solved explicitly with a high-order Godunovmore » scheme, whereas the parabolic part is solved implicitly with a first-order backward Euler method.« less
NASA Astrophysics Data System (ADS)
Ramli, Nazirah; Mutalib, Siti Musleha Ab; Mohamad, Daud
2017-08-01
Fuzzy time series forecasting model has been proposed since 1993 to cater for data in linguistic values. Many improvement and modification have been made to the model such as enhancement on the length of interval and types of fuzzy logical relation. However, most of the improvement models represent the linguistic term in the form of discrete fuzzy sets. In this paper, fuzzy time series model with data in the form of trapezoidal fuzzy numbers and natural partitioning length approach is introduced for predicting the unemployment rate. Two types of fuzzy relations are used in this study which are first order and second order fuzzy relation. This proposed model can produce the forecasted values under different degree of confidence.
Lu, Jiao Yang; Zhang, Xin Xing; Huang, Wei Tao; Zhu, Qiu Yan; Ding, Xue Zhi; Xia, Li Qiu; Luo, Hong Qun; Li, Nian Bing
2017-09-19
The most serious and yet unsolved problems of molecular logic computing consist in how to connect molecular events in complex systems into a usable device with specific functions and how to selectively control branchy logic processes from the cascading logic systems. This report demonstrates that a Boolean logic tree is utilized to organize and connect "plug and play" chemical events DNA, nanomaterials, organic dye, biomolecule, and denaturant for developing the dual-signal electrochemical evolution aptasensor system with good resettability for amplification detection of thrombin, controllable and selectable three-state logic computation, and keypad lock security operation. The aptasensor system combines the merits of DNA-functionalized nanoamplification architecture and simple dual-signal electroactive dye brilliant cresyl blue for sensitive and selective detection of thrombin with a wide linear response range of 0.02-100 nM and a detection limit of 1.92 pM. By using these aforementioned chemical events as inputs and the differential pulse voltammetry current changes at different voltages as dual outputs, a resettable three-input biomolecular keypad lock based on sequential logic is established. Moreover, the first example of controllable and selectable three-state molecular logic computation with active-high and active-low logic functions can be implemented and allows the output ports to assume a high impediment or nothing (Z) state in addition to the 0 and 1 logic levels, effectively controlling subsequent branchy logic computation processes. Our approach is helpful in developing the advanced controllable and selectable logic computing and sensing system in large-scale integration circuits for application in biomedical engineering, intelligent sensing, and control.
Graphene-based aptamer logic gates and their application to multiplex detection.
Wang, Li; Zhu, Jinbo; Han, Lei; Jin, Lihua; Zhu, Chengzhou; Wang, Erkang; Dong, Shaojun
2012-08-28
In this work, a GO/aptamer system was constructed to create multiplex logic operations and enable sensing of multiplex targets. 6-Carboxyfluorescein (FAM)-labeled adenosine triphosphate binding aptamer (ABA) and FAM-labeled thrombin binding aptamer (TBA) were first adsorbed onto graphene oxide (GO) to form a GO/aptamer complex, leading to the quenching of the fluorescence of FAM. We demonstrated that the unique GO/aptamer interaction and the specific aptamer-target recognition in the target/GO/aptamer system were programmable and could be utilized to regulate the fluorescence of FAM via OR and INHIBIT logic gates. The fluorescence changed according to different input combinations, and the integration of OR and INHIBIT logic gates provided an interesting approach for logic sensing applications where multiple target molecules were present. High-throughput fluorescence imagings that enabled the simultaneous processing of many samples by using the combinatorial logic gates were realized. The developed logic gates may find applications in further development of DNA circuits and advanced sensors for the identification of multiple targets in complex chemical environments.
Neural networks and logical reasoning systems: a translation table.
Martins, J; Mendes, R V
2001-04-01
A correspondence is established between the basic elements of logic reasoning systems (knowledge bases, rules, inference and queries) and the structure and dynamical evolution laws of neural networks. The correspondence is pictured as a translation dictionary which might allow to go back and forth between symbolic and network formulations, a desirable step in learning-oriented systems and multicomputer networks. In the framework of Horn clause logics, it is found that atomic propositions with n arguments correspond to nodes with nth order synapses, rules to synaptic intensity constraints, forward chaining to synaptic dynamics and queries either to simple node activation or to a query tensor dynamics.
1982-11-03
define the maximum count for the pattern defined by the first 3 bits. Since there are 11 bits involved it is possible to define patterns up to 2048 ...applied to the UUT directly through the driver for any count up to 2048 . Any one of the 7 clocks may be selected under program control and applied to any...one ievel for the driver ( VDI ), the logic zero level for the driver (VDO), the logic one level for the receiver (VRl), and the logic zero level for the
Realization of a quantum Hamiltonian Boolean logic gate on the Si(001):H surface.
Kolmer, Marek; Zuzak, Rafal; Dridi, Ghassen; Godlewski, Szymon; Joachim, Christian; Szymonski, Marek
2015-08-07
The design and construction of the first prototypical QHC (Quantum Hamiltonian Computing) atomic scale Boolean logic gate is reported using scanning tunnelling microscope (STM) tip-induced atom manipulation on an Si(001):H surface. The NOR/OR gate truth table was confirmed by dI/dU STS (Scanning Tunnelling Spectroscopy) tracking how the surface states of the QHC quantum circuit on the Si(001):H surface are shifted according to the input logical status.
Rossi, Sandrine; Cassotti, Mathieu; Moutier, Sylvain; Delcroix, Nicolas; Houdé, Olivier
2015-01-01
Reasoners make systematic logical errors by giving heuristic responses that reflect deviations from the logical norm. Influential studies have suggested first that our reasoning is often biased because we minimize cognitive effort to surpass a cognitive conflict between heuristic response from system 1 and analytic response from system 2 thinking. Additionally, cognitive control processes might be necessary to inhibit system 1 responses to activate a system 2 response. Previous studies have shown a significant effect of executive learning (EL) on adults who have transferred knowledge acquired on the Wason selection task (WST) to another isomorphic task, the rule falsification task (RFT). The original paradigm consisted of teaching participants to inhibit a classical matching heuristic that sufficed the first problem and led to significant EL transfer on the second problem. Interestingly, the reasoning tasks differed in inhibiting-heuristic metacognitive cost. Success on the WST requires half-suppression of the matching elements. In contrast, the RFT necessitates a global rejection of the matching elements for a correct answer. Therefore, metacognitive learning difficulty most likely differs depending on whether one uses the first or second task during the learning phase. We aimed to investigate this difficulty and various matching-bias inhibition effects in a new (reversed) paradigm. In this case, the transfer effect from the RFT to the WST could be more difficult because the reasoner learns to reject all matching elements in the first task. We observed that the EL leads to a significant reduction in matching selections on the WST without increasing logical performances. Interestingly, the acquired metacognitive knowledge was too "strictly" transferred and discouraged matching rather than encouraging logic. This finding underlines the complexity of learning transfer and adds new evidence to the pedagogy of reasoning.
Rossi, Sandrine; Cassotti, Mathieu; Moutier, Sylvain; Delcroix, Nicolas; Houdé, Olivier
2015-01-01
Reasoners make systematic logical errors by giving heuristic responses that reflect deviations from the logical norm. Influential studies have suggested first that our reasoning is often biased because we minimize cognitive effort to surpass a cognitive conflict between heuristic response from system 1 and analytic response from system 2 thinking. Additionally, cognitive control processes might be necessary to inhibit system 1 responses to activate a system 2 response. Previous studies have shown a significant effect of executive learning (EL) on adults who have transferred knowledge acquired on the Wason selection task (WST) to another isomorphic task, the rule falsification task (RFT). The original paradigm consisted of teaching participants to inhibit a classical matching heuristic that sufficed the first problem and led to significant EL transfer on the second problem. Interestingly, the reasoning tasks differed in inhibiting-heuristic metacognitive cost. Success on the WST requires half-suppression of the matching elements. In contrast, the RFT necessitates a global rejection of the matching elements for a correct answer. Therefore, metacognitive learning difficulty most likely differs depending on whether one uses the first or second task during the learning phase. We aimed to investigate this difficulty and various matching-bias inhibition effects in a new (reversed) paradigm. In this case, the transfer effect from the RFT to the WST could be more difficult because the reasoner learns to reject all matching elements in the first task. We observed that the EL leads to a significant reduction in matching selections on the WST without increasing logical performances. Interestingly, the acquired metacognitive knowledge was too “strictly” transferred and discouraged matching rather than encouraging logic. This finding underlines the complexity of learning transfer and adds new evidence to the pedagogy of reasoning. PMID:25849555
Slobogin, Christopher
2015-01-01
A number of laws that are associated with deprivations of liberty, including the insanity defense, civil commitment, guardianship of the person and numerous competency doctrines in the criminal context, require proof of mental disability as a predicate. The Convention on the Rights of Persons With Disabilities commands signatory states to eliminate that predicate. Summarizing principles set out in my book Minding Justice: Laws That Deprive People With Mental Disability of Life and Liberty, I explain how this seemingly radical stance can be implemented. Specifically, this article proposes adoption of an "integrationist defense" in the criminal context, an "undeterrability requirement" when the state seeks preventive detention outside of the criminal process, and a "basic rationality and self-regard test" for incompetency determinations. None of these proposals requires proof of a mental disorder as a predicate condition. Copyright © 2015 Elsevier Ltd. All rights reserved.
Automated extraction of family history information from clinical notes.
Bill, Robert; Pakhomov, Serguei; Chen, Elizabeth S; Winden, Tamara J; Carter, Elizabeth W; Melton, Genevieve B
2014-01-01
Despite increased functionality for obtaining family history in a structured format within electronic health record systems, clinical notes often still contain this information. We developed and evaluated an Unstructured Information Management Application (UIMA)-based natural language processing (NLP) module for automated extraction of family history information with functionality for identifying statements, observations (e.g., disease or procedure), relative or side of family with attributes (i.e., vital status, age of diagnosis, certainty, and negation), and predication ("indicator phrases"), the latter of which was used to establish relationships between observations and family member. The family history NLP system demonstrated F-scores of 66.9, 92.4, 82.9, 57.3, 97.7, and 61.9 for detection of family history statements, family member identification, observation identification, negation identification, vital status, and overall extraction of the predications between family members and observations, respectively. While the system performed well for detection of family history statements and predication constituents, further work is needed to improve extraction of certainty and temporal modifications.
Automated Extraction of Family History Information from Clinical Notes
Bill, Robert; Pakhomov, Serguei; Chen, Elizabeth S.; Winden, Tamara J.; Carter, Elizabeth W.; Melton, Genevieve B.
2014-01-01
Despite increased functionality for obtaining family history in a structured format within electronic health record systems, clinical notes often still contain this information. We developed and evaluated an Unstructured Information Management Application (UIMA)-based natural language processing (NLP) module for automated extraction of family history information with functionality for identifying statements, observations (e.g., disease or procedure), relative or side of family with attributes (i.e., vital status, age of diagnosis, certainty, and negation), and predication (“indicator phrases”), the latter of which was used to establish relationships between observations and family member. The family history NLP system demonstrated F-scores of 66.9, 92.4, 82.9, 57.3, 97.7, and 61.9 for detection of family history statements, family member identification, observation identification, negation identification, vital status, and overall extraction of the predications between family members and observations, respectively. While the system performed well for detection of family history statements and predication constituents, further work is needed to improve extraction of certainty and temporal modifications. PMID:25954443
DOE Office of Scientific and Technical Information (OSTI.GOV)
Cole, Jacqueline M.; Lin, Tze-Chia; Edwards, Alison J.
2015-03-04
DAST (4-dimethylamino-N-methyl-4-stilbazolium tosylate) is the most commercially successful organic nonlinear optical (NLO) material for frequency-doubling, integrated optics, and THz wave applications. Its success is predicated on its high optical nonlinearity with concurrent sufficient thermal stability. Many chemical derivatives of DAST have therefore been developed to optimize their properties; yet, to date, none have surpassed the overall superiority of DAST for NLO photonic applications. This is perhaps because DAST is an ionic salt wherein its NLO-active cation is influenced by multiple types of subtle intermolecular forces that are hard to quantify, thus, making difficult the molecular engineering of better functioning DASTmore » derivatives. Here, we establish a model parameter, ηinter, that isolates the influence of intermolecular interactions on second-order optical nonlinearity in DAST and its derivatives, using second-harmonic generation (SHG) as a qualifier; by systematically mapping intercorrelations of all possible pairs of intermolecular interactions to ηinter, we uncover a relationship between concerted intermolecular interactions and SHG output. This correlation reveals that a sixfold gain in the intrinsic second-order NLO performance of DAST is possible, by eliminating the identified interactions. This prediction offers the first opportunity to systematically design next-generation DAST-based photonic device nanotechnology to realize such a prospect.« less
Modeling and formal representation of geospatial knowledge for the Geospatial Semantic Web
NASA Astrophysics Data System (ADS)
Huang, Hong; Gong, Jianya
2008-12-01
GML can only achieve geospatial interoperation at syntactic level. However, it is necessary to resolve difference of spatial cognition in the first place in most occasions, so ontology was introduced to describe geospatial information and services. But it is obviously difficult and improper to let users to find, match and compose services, especially in some occasions there are complicated business logics. Currently, with the gradual introduction of Semantic Web technology (e.g., OWL, SWRL), the focus of the interoperation of geospatial information has shifted from syntactic level to Semantic and even automatic, intelligent level. In this way, Geospatial Semantic Web (GSM) can be put forward as an augmentation to the Semantic Web that additionally includes geospatial abstractions as well as related reasoning, representation and query mechanisms. To advance the implementation of GSM, we first attempt to construct the mechanism of modeling and formal representation of geospatial knowledge, which are also two mostly foundational phases in knowledge engineering (KE). Our attitude in this paper is quite pragmatical: we argue that geospatial context is a formal model of the discriminate environment characters of geospatial knowledge, and the derivation, understanding and using of geospatial knowledge are located in geospatial context. Therefore, first, we put forward a primitive hierarchy of geospatial knowledge referencing first order logic, formal ontologies, rules and GML. Second, a metamodel of geospatial context is proposed and we use the modeling methods and representation languages of formal ontologies to process geospatial context. Thirdly, we extend Web Process Service (WPS) to be compatible with local DLL for geoprocessing and possess inference capability based on OWL.
Etzler, Frank M; Madden, Michael
2014-08-15
To investigate the correlation of scores on the Test of Logical Thinking (TOLT) with first-year pharmacy students' performance in selected courses. The TOLT was administered to 130 first-year pharmacy students. The examination was administered during the first quarter in a single session. The TOLT scores correlated with grades earned in Pharmaceutical Calculations, Physical Pharmacy, and Basic Pharmacokinetics courses. Performance on the TOLT has been correlated to performance in courses that required the ability to use quantitative reasoning to complete required tasks. In the future, it may be possible to recommend remediation, retention, and/or admission based in part on the results from the TOLT.
Properties of inductive reasoning.
Heit, E
2000-12-01
This paper reviews the main psychological phenomena of inductive reasoning, covering 25 years of experimental and model-based research, in particular addressing four questions. First, what makes a case or event generalizable to other cases? Second, what makes a set of cases generalizable? Third, what makes a property or predicate projectable? Fourth, how do psychological models of induction address these results? The key results in inductive reasoning are outlined, and several recent models, including a new Bayesian account, are evaluated with respect to these results. In addition, future directions for experimental and model-based work are proposed.
NASA Technical Reports Server (NTRS)
Pryor, Richard Lee (Inventor)
1977-01-01
A line driver including a pair of complementary transistors having their conduction paths serially connected between an operating and a reference potential and their bases connected through a first switch to a signal input terminal. A second switch is connected between the common base connection and the common connection of the conduction paths. With the second switch open and the first closed, an output voltage, responsive to the input signal, corresponding to first or second binary values is obtained. When the second switch is closed and the first opened, the transistor pair is turned off, disconnecting the line driver from its load, thereby providing tri-state logic operation.
NASA Astrophysics Data System (ADS)
Niestegge, Gerd
2014-09-01
In quantum mechanics, the selfadjoint Hilbert space operators play a triple role as observables, generators of the dynamical groups and statistical operators defining the mixed states. One might expect that this is typical of Hilbert space quantum mechanics, but it is not. The same triple role occurs for the elements of a certain ordered Banach space in a much more general theory based upon quantum logics and a conditional probability calculus (which is a quantum logical model of the Lueders-von Neumann measurement process). It is shown how positive groups, automorphism groups, Lie algebras and statistical operators emerge from one major postulate - the non-existence of third-order interference (third-order interference and its impossibility in quantum mechanics were discovered by R. Sorkin in 1994). This again underlines the power of the combination of the conditional probability calculus with the postulate that there is no third-order interference. In two earlier papers, its impact on contextuality and nonlocality had already been revealed.
Toward Question-Asking Machines: The Logic of Questions and the Inquiry Calculus
NASA Technical Reports Server (NTRS)
Knuth,Kevin H.
2005-01-01
For over a century, the study of logic has focused on the algebra of logical statements. This work, first performed by George Boole, has led to the development of modern computers, and was shown by Richard T. Cox to be the foundation of Bayesian inference. Meanwhile the logic of questions has been much neglected. For our computing machines to be truly intelligent, they need to be able to ask relevant questions. In this paper I will show how the Boolean lattice of logical statements gives rise to the free distributive lattice of questions thus defining their algebra. Furthermore, there exists a quantity analogous to probability, called relevance, which quantifies the degree to which one question answers another. I will show that relevance is not only a natural generalization of information theory, but also forms its foundation.
Spin wave based parallel logic operations for binary data coded with domain walls
DOE Office of Scientific and Technical Information (OSTI.GOV)
Urazuka, Y.; Oyabu, S.; Chen, H.
2014-05-07
We numerically investigate the feasibility of spin wave (SW) based parallel logic operations, where the phase of SW packet (SWP) is exploited as a state variable and the phase shift caused by the interaction with domain wall (DW) is utilized as a logic inversion functionality. A designed functional element consists of parallel ferromagnetic nanowires (6 nm-thick, 36 nm-width, 5120 nm-length, and 200 nm separation) with the perpendicular magnetization and sub-μm scale overlaid conductors. The logic outputs for binary data, coded with the existence (“1”) or absence (“0”) of the DW, are inductively read out from interferometric aspect of the superposed SWPs, one of themmore » propagating through the stored data area. A practical exclusive-or operation, based on 2π periodicity in the phase logic, is demonstrated for the individual nanowire with an order of different output voltage V{sub out}, depending on the logic output for the stored data. The inductive output from the two nanowires exhibits well defined three different signal levels, corresponding to the information distance (Hamming distance) between 2-bit data stored in the multiple nanowires.« less
Fresch, Barbara; Bocquel, Juanita; Hiluf, Dawit; Rogge, Sven; Levine, Raphael D; Remacle, Françoise
2017-07-05
To realize low-power, compact logic circuits, one can explore parallel operation on single nanoscale devices. An added incentive is to use multivalued (as distinct from Boolean) logic. Here, we theoretically demonstrate that the computation of all the possible outputs of a multivariate, multivalued logic function can be implemented in parallel by electrical addressing of a molecule made up of three interacting dopant atoms embedded in Si. The electronic states of the dopant molecule are addressed by pulsing a gate voltage. By simulating the time evolution of the non stationary electronic density built by the gate voltage, we show that one can implement a molecular decision tree that provides in parallel all the outputs for all the inputs of the multivariate, multivalued logic function. The outputs are encoded in the populations and in the bond orders of the dopant molecule, which can be measured using an STM tip. We show that the implementation of the molecular logic tree is equivalent to a spectral function decomposition. The function that is evaluated can be field-programmed by changing the time profile of the pulsed gate voltage. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.
Compact universal logic gates realized using quantization of current in nanodevices.
Zhang, Wancheng; Wu, Nan-Jian; Yang, Fuhua
2007-12-12
This paper proposes novel universal logic gates using the current quantization characteristics of nanodevices. In nanodevices like the electron waveguide (EW) and single-electron (SE) turnstile, the channel current is a staircase quantized function of its control voltage. We use this unique characteristic to compactly realize Boolean functions. First we present the concept of the periodic-threshold threshold logic gate (PTTG), and we build a compact PTTG using EW and SE turnstiles. We show that an arbitrary three-input Boolean function can be realized with a single PTTG, and an arbitrary four-input Boolean function can be realized by using two PTTGs. We then use one PTTG to build a universal programmable two-input logic gate which can be used to realize all two-input Boolean functions. We also build a programmable three-input logic gate by using one PTTG. Compared with linear threshold logic gates, with the PTTG one can build digital circuits more compactly. The proposed PTTGs are promising for future smart nanoscale digital system use.
NASA Technical Reports Server (NTRS)
Krasowski, Michael J. (Inventor); Prokop, Norman F. (Inventor)
2017-01-01
A current source logic gate with depletion mode field effect transistor ("FET") transistors and resistors may include a current source, a current steering switch input stage, and a resistor divider level shifting output stage. The current source may include a transistor and a current source resistor. The current steering switch input stage may include a transistor to steer current to set an output stage bias point depending on an input logic signal state. The resistor divider level shifting output stage may include a first resistor and a second resistor to set the output stage point and produce valid output logic signal states. The transistor of the current steering switch input stage may function as a switch to provide at least two operating points.
Multi-enzyme logic network architectures for assessing injuries: digital processing of biomarkers.
Halámek, Jan; Bocharova, Vera; Chinnapareddy, Soujanya; Windmiller, Joshua Ray; Strack, Guinevere; Chuang, Min-Chieh; Zhou, Jian; Santhosh, Padmanabhan; Ramirez, Gabriela V; Arugula, Mary A; Wang, Joseph; Katz, Evgeny
2010-12-01
A multi-enzyme biocatalytic cascade processing simultaneously five biomarkers characteristic of traumatic brain injury (TBI) and soft tissue injury (STI) was developed. The system operates as a digital biosensor based on concerted function of 8 Boolean AND logic gates, resulting in the decision about the physiological conditions based on the logic analysis of complex patterns of the biomarkers. The system represents the first example of a multi-step/multi-enzyme biosensor with the built-in logic for the analysis of complex combinations of biochemical inputs. The approach is based on recent advances in enzyme-based biocomputing systems and the present paper demonstrates the potential applicability of biocomputing for developing novel digital biosensor networks.
2006-09-01
Each of these layers will be described in more detail to include relevant technologies ( Java , PDA, Hibernate , and PostgreSQL) used to implement...Logic Layer -Object-Relational Mapper ( Hibernate ) Data 35 capable in order to interface with Java applications. Based on meeting the selection...further discussed. Query List Application Logic Layer HibernateApache - Java Servlet - Hibernate Interface -OR Mapper -RDBMS Interface
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…
No-Fail Software Gifts for Kids.
ERIC Educational Resources Information Center
Buckleitner, Warren
1996-01-01
Reviews children's software packages: (1) "Fun 'N Games"--nonviolent games and activities; (2) "Putt-Putt Saves the Zoo"--matching, logic games, and animal facts; (3) "Big Job"--12 logic games with video from job sites; (4) "JumpStart First Grade"--15 activities introducing typical school lessons; and (5) "Read, Write, & Type!"--progressively…
Competitive Arenas and Schools' Logics of Action: A European Comparison
ERIC Educational Resources Information Center
van Zanten, Agnes
2009-01-01
This article analyses the impact of competitive arenas on schools' logics of action in six local European contexts (London, Paris, Lille, Charleroi, Budapest and Lisbon). It first examines how competitive processes affect different schools' activities (recruitment, provision of options, promotion, tracking, provision for children with special…
Separating Item and Order Information through Process Dissociation
ERIC Educational Resources Information Center
Nairne, James S.; Kelley, Matthew R.
2004-01-01
In the present paper, we develop and apply a technique, based on the logic of process dissociation, for obtaining numerical estimates of item and order information. Certain variables, such as phonological similarity, are widely believed to produce dissociative effects on item and order retention. However, such beliefs rest on the questionable…
Marmarelis, Vasilis Z.; Zanos, Theodoros P.; Berger, Theodore W.
2010-01-01
This paper presents a new modeling approach for neural systems with point-process (spike) inputs and outputs that utilizes Boolean operators (i.e. modulo 2 multiplication and addition that correspond to the logical AND and OR operations respectively, as well as the AND_NOT logical operation representing inhibitory effects). The form of the employed mathematical models is akin to a “Boolean-Volterra” model that contains the product terms of all relevant input lags in a hierarchical order, where terms of order higher than first represent nonlinear interactions among the various lagged values of each input point-process or among lagged values of various inputs (if multiple inputs exist) as they reflect on the output. The coefficients of this Boolean-Volterra model are also binary variables that indicate the presence or absence of the respective term in each specific model/system. Simulations are used to explore the properties of such models and the feasibility of their accurate estimation from short data-records in the presence of noise (i.e. spurious spikes). The results demonstrate the feasibility of obtaining reliable estimates of such models, with excitatory and inhibitory terms, in the presence of considerable noise (spurious spikes) in the outputs and/or the inputs in a computationally efficient manner. A pilot application of this approach to an actual neural system is presented in the companion paper (Part II). PMID:19517238
Research on the Wire Network Signal Prediction Based on the Improved NNARX Model
NASA Astrophysics Data System (ADS)
Zhang, Zipeng; Fan, Tao; Wang, Shuqing
It is difficult to obtain accurately the wire net signal of power system's high voltage power transmission lines in the process of monitoring and repairing. In order to solve this problem, the signal measured in remote substation or laboratory is employed to make multipoint prediction to gain the needed data. But, the obtained power grid frequency signal is delay. In order to solve the problem, an improved NNARX network which can predict frequency signal based on multi-point data collected by remote substation PMU is describes in this paper. As the error curved surface of the NNARX network is more complicated, this paper uses L-M algorithm to train the network. The result of the simulation shows that the NNARX network has preferable predication performance which provides accurate real time data for field testing and maintenance.
Involving Users to Improve the Collaborative Logical Framework
2014-01-01
In order to support collaboration in web-based learning, there is a need for an intelligent support that facilitates its management during the design, development, and analysis of the collaborative learning experience and supports both students and instructors. At aDeNu research group we have proposed the Collaborative Logical Framework (CLF) to create effective scenarios that support learning through interaction, exploration, discussion, and collaborative knowledge construction. This approach draws on artificial intelligence techniques to support and foster an effective involvement of students to collaborate. At the same time, the instructors' workload is reduced as some of their tasks—especially those related to the monitoring of the students behavior—are automated. After introducing the CLF approach, in this paper, we present two formative evaluations with users carried out to improve the design of this collaborative tool and thus enrich the personalized support provided. In the first one, we analyze, following the layered evaluation approach, the results of an observational study with 56 participants. In the second one, we tested the infrastructure to gather emotional data when carrying out another observational study with 17 participants. PMID:24592196
Traffic signal design and simulation for vulnerable road users safety and bus preemption
DOE Office of Scientific and Technical Information (OSTI.GOV)
Lo, Shih-Ching; Huang, Hsieh-Chu
Mostly, pedestrian car accidents occurred at a signalized interaction is because pedestrians cannot across the intersection safely within the green light. From the viewpoint of pedestrian, there might have two reasons. The first one is pedestrians cannot speed up to across the intersection, such as the elders. The other reason is pedestrians do not sense that the signal phase is going to change and their right-of-way is going to be lost. Developing signal logic to protect pedestrian, who is crossing an intersection is the first purpose of this study. In addition, to improve the reliability and reduce delay of publicmore » transportation service is the second purpose. Therefore, bus preemption is also considered in the designed signal logic. In this study, the traffic data of the intersection of Chong-Qing North Road and Min-Zu West Road, Taipei, Taiwan, is employed to calibrate and validate the signal logic by simulation. VISSIM 5.20, which is a microscopic traffic simulation software, is employed to simulate the signal logic. From the simulated results, the signal logic presented in this study can protect pedestrians crossing the intersection successfully. The design of bus preemption can reduce the average delay. However, the pedestrian safety and bus preemption signal will influence the average delay of cars largely. Thus, whether applying the pedestrian safety and bus preemption signal logic to an intersection or not should be evaluated carefully.« less
Memory hierarchy using row-based compression
Loh, Gabriel H.; O'Connor, James M.
2016-10-25
A system includes a first memory and a device coupleable to the first memory. The device includes a second memory to cache data from the first memory. The second memory includes a plurality of rows, each row including a corresponding set of compressed data blocks of non-uniform sizes and a corresponding set of tag blocks. Each tag block represents a corresponding compressed data block of the row. The device further includes decompression logic to decompress data blocks accessed from the second memory. The device further includes compression logic to compress data blocks to be stored in the second memory.
Collective communications apparatus and method for parallel systems
DOE Office of Scientific and Technical Information (OSTI.GOV)
Knies, Allan D.; Keppel, David Pardo; Woo, Dong Hyuk
A collective communication apparatus and method for parallel computing systems. For example, one embodiment of an apparatus comprises a plurality of processor elements (PEs); collective interconnect logic to dynamically form a virtual collective interconnect (VCI) between the PEs at runtime without global communication among all of the PEs, the VCI defining a logical topology between the PEs in which each PE is directly communicatively coupled to a only a subset of the remaining PEs; and execution logic to execute collective operations across the PEs, wherein one or more of the PEs receive first results from a first portion of themore » subset of the remaining PEs, perform a portion of the collective operations, and provide second results to a second portion of the subset of the remaining PEs.« less
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.
Multi-port, optically addressed RAM
NASA Technical Reports Server (NTRS)
Johnston, Alan R. (Inventor); Nixon, Robert H. (Inventor); Bergman, Larry A. (Inventor); Esener, Sadik (Inventor)
1989-01-01
A random access memory addressing system utilizing optical links between memory and the read/write logic circuits comprises addressing circuits including a plurality of light signal sources, a plurality of optical gates including optical detectors associated with the memory cells, and a holographic optical element adapted to reflect and direct the light signals to the desired memory cell locations. More particularly, it is a multi-port, binary computer memory for interfacing with a plurality of computers. There are a plurality of storage cells for containing bits of binary information, the storage cells being disposed at the intersections of a plurality of row conductors and a plurality of column conductors. There is interfacing logic for receiving information from the computers directing access to ones of the storage cells. There are first light sources associated with the interfacing logic for transmitting a first light beam with the access information modulated thereon. First light detectors are associated with the storage cells for receiving the first light beam, for generating an electrical signal containing the access information, and for conducting the electrical signal to the one of the storage cells to which it is directed. There are holographic optical elements for reflecting the first light beam from the first light sources to the first light detectors.
Lin, Xiaodong; Liu, Yaqing; Deng, Jiankang; Lyu, Yanlong; Qian, Pengcheng; Li, Yunfei; Wang, Shuo
2018-02-21
The integration of multiple DNA logic gates on a universal platform to implement advance logic functions is a critical challenge for DNA computing. Herein, a straightforward and powerful strategy in which a guanine-rich DNA sequence lighting up a silver nanocluster and fluorophore was developed to construct a library of logic gates on a simple DNA-templated silver nanoclusters (DNA-AgNCs) platform. This library included basic logic gates, YES, AND, OR, INHIBIT, and XOR, which were further integrated into complex logic circuits to implement diverse advanced arithmetic/non-arithmetic functions including half-adder, half-subtractor, multiplexer, and demultiplexer. Under UV irradiation, all the logic functions could be instantly visualized, confirming an excellent repeatability. The logic operations were entirely based on DNA hybridization in an enzyme-free and label-free condition, avoiding waste accumulation and reducing cost consumption. Interestingly, a DNA-AgNCs-based multiplexer was, for the first time, used as an intelligent biosensor to identify pathogenic genes, E. coli and S. aureus genes, with a high sensitivity. The investigation provides a prototype for the wireless integration of multiple devices on even the simplest single-strand DNA platform to perform diverse complex functions in a straightforward and cost-effective way.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Lan, Jin; Yu, Weichao; Wu, Ruqian
A diode, a device allowing unidirectional signal transmission, is a fundamental element of logic structures, and it lies at the heart of modern information systems. The spin wave or magnon, representing a collective quasiparticle excitation of the magnetic order in magnetic materials, is a promising candidate for an information carrier for the next-generation energy-saving technologies. Here, we propose a scalable and reprogrammable pure spin-wave logic hardware architecture using domain walls and surface anisotropy stripes as waveguides on a single magnetic wafer. We demonstrate theoretically the design principle of the simplest logic component, a spin-wave diode, utilizing the chiral bound statesmore » in a magnetic domain wall with a Dzyaloshinskii-Moriya interaction, and confirm its performance through micromagnetic simulations. As a result, these findings open a new vista for realizing different types of pure spin-wave logic components and finally achieving an energy-efficient and hardware-reprogrammable spin-wave computer.« less
Motivation for DOC III: 64-bit digital optical computer
NASA Astrophysics Data System (ADS)
Guilfoyle, Peter S.
1991-09-01
This paper suggests a new class of digital logic. OptiComp has focused on a digital optical logic family in order to capitalize on the inherent benefits of optical computing, which include (1) high FAN-IN and FAN-OUT, (2) low power consumption, (3) high noise margin, (4) high algorithmic efficiency using 'smart' interconnects, (5) free space leverage of GIBP (gate interconnect bandwidth product). Other well-known secondary advantages of optical logic include (but are not limited to) zero capacitive loading of signals at a detector, zero cross-talk between signals, zero signal dispersion, minimal clock skew (a few picoseconds or less in an imaging system). The primary focus of this paper is to demonstrate how each of the five advantages can be used to leverage other logic family performance such as GaAs; the secondary attributes will be discussed only in the context of introducing the DOC III architecture.
Motivation for DOC III: 64-bit digital optical computer
NASA Astrophysics Data System (ADS)
Guilfoyle, Peter S.
1991-09-01
The objective of this paper is to motivate a new class of digital logic. OptiComp has focused on a digital optical logic family in order to capitalize on the inherent benefits of optical computing, which include: (1) high FAN-IN and FAN-OUT, (2) low power consumption, (3) high noise margin, (4) high algorithmic efficiency using 'smart' interconnects, (5) free space leverage of GIBP (gate interconnect bandwidth product). Other well-known secondary advantages of optical logic include (but are not limited to): zero capacitive loading of signals at a detector, zero cross-talk between signals, zero signal dispersion, and minimal clock skew (a few picoseconds or less in an imaging system). The primary focus of this paper is on demonstrating how each of the five advantages can be used to leverage other logic family performance such as GaAs; the secondary attributes will be discussed only in the context of introducing the DOC III architecture.
NASA Technical Reports Server (NTRS)
Trotter, J. D.
1982-01-01
The Mosaic Transistor Array is an extension of the STAR system developed by NASA which has dedicated field cells designed to be specifically used in semicustom microprocessor applications. The Sandia radiation hard bulk CMOS process is utilized in order to satisfy the requirements of space flights. A design philosophy is developed which utilizes the strengths and recognizes the weaknesses of the Sandia process. A style of circuitry is developed which incorporates the low power and high drive capability of CMOS. In addition the density achieved is better than that for classic CMOS, although not as good as for NMOS. The basic logic functions for a data path are designed with compatible interface to the STAR grid system. In this manner either random logic or PLA type structures can be utilized for the control logic.
Lan, Jin; Yu, Weichao; Wu, Ruqian; ...
2015-12-28
A diode, a device allowing unidirectional signal transmission, is a fundamental element of logic structures, and it lies at the heart of modern information systems. The spin wave or magnon, representing a collective quasiparticle excitation of the magnetic order in magnetic materials, is a promising candidate for an information carrier for the next-generation energy-saving technologies. Here, we propose a scalable and reprogrammable pure spin-wave logic hardware architecture using domain walls and surface anisotropy stripes as waveguides on a single magnetic wafer. We demonstrate theoretically the design principle of the simplest logic component, a spin-wave diode, utilizing the chiral bound statesmore » in a magnetic domain wall with a Dzyaloshinskii-Moriya interaction, and confirm its performance through micromagnetic simulations. As a result, these findings open a new vista for realizing different types of pure spin-wave logic components and finally achieving an energy-efficient and hardware-reprogrammable spin-wave computer.« less
Estimating Single-Event Logic Cross Sections in Advanced Technologies
NASA Astrophysics Data System (ADS)
Harrington, R. C.; Kauppila, J. S.; Warren, K. M.; Chen, Y. P.; Maharrey, J. A.; Haeffner, T. D.; Loveless, T. D.; Bhuva, B. L.; Bounasser, M.; Lilja, K.; Massengill, L. W.
2017-08-01
Reliable estimation of logic single-event upset (SEU) cross section is becoming increasingly important for predicting the overall soft error rate. As technology scales and single-event transient (SET) pulse widths shrink to widths on the order of the setup-and-hold time of flip-flops, the probability of latching an SET as an SEU must be reevaluated. In this paper, previous assumptions about the relationship of SET pulsewidth to the probability of latching an SET are reconsidered and a model for transient latching probability has been developed for advanced technologies. A method using the improved transient latching probability and SET data is used to predict logic SEU cross section. The presented model has been used to estimate combinational logic SEU cross sections in 32-nm partially depleted silicon-on-insulator (SOI) technology given experimental heavy-ion SET data. Experimental SEU data show good agreement with the model presented in this paper.
Superconducting flux flow digital circuits
DOE Office of Scientific and Technical Information (OSTI.GOV)
Martens, J.S.; Zipperian, T.E.; Hietala, V.M.
1993-03-01
The authors have developed a family of digital logic circuits based on superconducting flux flow transistors that show high speed, reasonable signal levels, large fan-out, and large noise margins. The circuits are made from high-temperature superconductors (HTS) and have been shown to operate at over 90 K. NOR gates have been demonstrated with fan-outs of more than 5 and fully loaded switching times less than a fixture-limited 50 ps. Ring-oscillator data suggest inverter delay times of about 40ps when using a 3-[mu]m linewidths. Simple flip-flops have also been demonstrated showing large noise margins, response times of less than 30 ps,more » and static power dissipation on the order of 30 nW. Among other uses, this logic family is appropriate as an interface between logic families such as single flux quantum and conventional semiconductor logic.« less
Reconfigurable Complementary Logic Circuits with Ambipolar Organic Transistors
Yoo, Hocheon; Ghittorelli, Matteo; Smits, Edsger C. P.; Gelinck, Gerwin H.; Lee, Han-Koo; Torricelli, Fabrizio; Kim, Jae-Joon
2016-01-01
Ambipolar organic electronics offer great potential for simple and low-cost fabrication of complementary logic circuits on large-area and mechanically flexible substrates. Ambipolar transistors are ideal candidates for the simple and low-cost development of complementary logic circuits since they can operate as n-type and p-type transistors. Nevertheless, the experimental demonstration of ambipolar organic complementary circuits is limited to inverters. The control of the transistor polarity is crucial for proper circuit operation. Novel gating techniques enable to control the transistor polarity but result in dramatically reduced performances. Here we show high-performance non-planar ambipolar organic transistors with electrical control of the polarity and orders of magnitude higher performances with respect to state-of-art split-gate ambipolar transistors. Electrically reconfigurable complementary logic gates based on ambipolar organic transistors are experimentally demonstrated, thus opening up new opportunities for ambipolar organic complementary electronics. PMID:27762321
Reconfigurable Complementary Logic Circuits with Ambipolar Organic Transistors.
Yoo, Hocheon; Ghittorelli, Matteo; Smits, Edsger C P; Gelinck, Gerwin H; Lee, Han-Koo; Torricelli, Fabrizio; Kim, Jae-Joon
2016-10-20
Ambipolar organic electronics offer great potential for simple and low-cost fabrication of complementary logic circuits on large-area and mechanically flexible substrates. Ambipolar transistors are ideal candidates for the simple and low-cost development of complementary logic circuits since they can operate as n-type and p-type transistors. Nevertheless, the experimental demonstration of ambipolar organic complementary circuits is limited to inverters. The control of the transistor polarity is crucial for proper circuit operation. Novel gating techniques enable to control the transistor polarity but result in dramatically reduced performances. Here we show high-performance non-planar ambipolar organic transistors with electrical control of the polarity and orders of magnitude higher performances with respect to state-of-art split-gate ambipolar transistors. Electrically reconfigurable complementary logic gates based on ambipolar organic transistors are experimentally demonstrated, thus opening up new opportunities for ambipolar organic complementary electronics.
Langer, Erika M; Gifford, Allen L; Chan, Kee
2011-01-01
Objective Logic models have been used to evaluate policy programs, plan projects, and allocate resources. Logic Modeling for policy analysis has been used rarely in health services research but can be helpful in evaluating the content and rationale of health policies. Comparative Logic Modeling is used here on human immunodeficiency virus (HIV) policy statements from the Department of Veterans Affairs (VA) and Centers for Disease Control and Prevention (CDC). We created visual representations of proposed HIV screening policy components in order to evaluate their structural logic and research-based justifications. Data Sources and Study Design We performed content analysis of VA and CDC HIV testing policy documents in a retrospective case study. Data Collection Using comparative Logic Modeling, we examined the content and primary sources of policy statements by the VA and CDC. We then quantified evidence-based causal inferences within each statement. Principal Findings VA HIV testing policy structure largely replicated that of the CDC guidelines. Despite similar design choices, chosen research citations did not overlap. The agencies used evidence to emphasize different components of the policies. Conclusion Comparative Logic Modeling can be used by health services researchers and policy analysts more generally to evaluate structural differences in health policies and to analyze research-based rationales used by policy makers. PMID:21689094
Kinematic parameters of signed verbs.
Malaia, Evie; Wilbur, Ronnie B; Milkovic, Marina
2013-10-01
Sign language users recruit physical properties of visual motion to convey linguistic information. Research on American Sign Language (ASL) indicates that signers systematically use kinematic features (e.g., velocity, deceleration) of dominant hand motion for distinguishing specific semantic properties of verb classes in production ( Malaia & Wilbur, 2012a) and process these distinctions as part of the phonological structure of these verb classes in comprehension ( Malaia, Ranaweera, Wilbur, & Talavage, 2012). These studies are driven by the event visibility hypothesis by Wilbur (2003), who proposed that such use of kinematic features should be universal to sign language (SL) by the grammaticalization of physics and geometry for linguistic purposes. In a prior motion capture study, Malaia and Wilbur (2012a) lent support for the event visibility hypothesis in ASL, but there has not been quantitative data from other SLs to test the generalization to other languages. The authors investigated the kinematic parameters of predicates in Croatian Sign Language ( Hrvatskom Znakovnom Jeziku [HZJ]). Kinematic features of verb signs were affected both by event structure of the predicate (semantics) and phrase position within the sentence (prosody). The data demonstrate that kinematic features of motion in HZJ verb signs are recruited to convey morphological and prosodic information. This is the first crosslinguistic motion capture confirmation that specific kinematic properties of articulator motion are grammaticalized in other SLs to express linguistic features.
Nuclear power and probabilistic safety assessment (PSA): past through future applications
NASA Astrophysics Data System (ADS)
Stamatelatos, M. G.; Moieni, P.; Everline, C. J.
1995-03-01
Nuclear power reactor safety in the United States is about to enter a new era -- an era of risk- based management and risk-based regulation. First, there was the age of `prescribed safety assessment,' during which a series of design-basis accidents in eight categories of severity, or classes, were postulated and analyzed. Toward the end of that era, it was recognized that `Class 9,' or `beyond design basis,' accidents would need special attention because of the potentially severe health and financial consequences of these accidents. The accident at Three Mile Island showed that sequences of low-consequence, high-frequency events and human errors can be much more risk dominant than the Class 9 accidents. A different form of safety assessment, PSA, emerged and began to gain ground against the deterministic safety establishment. Eventually, this led to the current regulatory requirements for individual plant examinations (IPEs). The IPEs can serve as a basis for risk-based regulation and management, a concept that may ultimately transform the U.S. regulatory process from its traditional deterministic foundations to a process predicated upon PSA. Beyond the possibility of a regulatory environment predicated upon PSA lies the possibility of using PSA as the foundation for managing daily nuclear power plant operations.
A few categories of electromagnetic field problems treated through Fuzzy Logic
NASA Astrophysics Data System (ADS)
Lolea, M. S.; Dzitac, S.
2018-01-01
The paper deals with the problems of fuzzy logic applied in the field of electromagnetism. In the first part, there are presented some theoretical aspects regarding the characteristics and the application of the fuzzy logic in the general case. Are presented then, some categories of electromagnetic field problems treated by fuzzy logic. The accent is on the effects of exposure to the electromagnetic field on the human body. For this approach is dedicated a paragraph at the end of the paper. There is an application on how to treat by fuzzy logic the effects of electric field exposure. For this purpose, the fuzzy toolbox existing in the Matlab software and the results of some electric field strength measurements into a power substation are used. The results of the study and its conclusions are analyzed and exposed at the end of the paper.
Fuzzy logic feedback control for fed-batch enzymatic hydrolysis of lignocellulosic biomass.
Tai, Chao; Voltan, Diego S; Keshwani, Deepak R; Meyer, George E; Kuhar, Pankaj S
2016-06-01
A fuzzy logic feedback control system was developed for process monitoring and feeding control in fed-batch enzymatic hydrolysis of a lignocellulosic biomass, dilute acid-pretreated corn stover. Digested glucose from hydrolysis reaction was assigned as input while doser feeding time and speed of pretreated biomass were responses from fuzzy logic control system. Membership functions for these three variables and rule-base were created based on batch hydrolysis data. The system response was first tested in LabVIEW environment then the performance was evaluated through real-time hydrolysis reaction. The feeding operations were determined timely by fuzzy logic control system and efficient responses were shown to plateau phases during hydrolysis. Feeding of proper amount of cellulose and maintaining solids content was well balanced. Fuzzy logic proved to be a robust and effective online feeding control tool for fed-batch enzymatic hydrolysis.
Low-Level Space Optimization of an AES Implementation for a Bit-Serial Fully Pipelined Architecture
NASA Astrophysics Data System (ADS)
Weber, Raphael; Rettberg, Achim
A previously developed AES (Advanced Encryption Standard) implementation is optimized and described in this paper. The special architecture for which this implementation is targeted comprises synchronous and systematic bit-serial processing without a central controlling instance. In order to shrink the design in terms of logic utilization we deeply analyzed the architecture and the AES implementation to identify the most costly logic elements. We propose to merge certain parts of the logic to achieve better area efficiency. The approach was integrated into an existing synthesis tool which we used to produce synthesizable VHDL code. For testing purposes, we simulated the generated VHDL code and ran tests on an FPGA board.
SIMOS feasibility report, task 4 : sign inventory management and ordering system
DOT National Transportation Integrated Search
1997-12-01
The Sign Inventory Management and Ordering System (SIMOS) design is a merger of existing manually maintained information management systems married to PennDOT's GIS and department-wide mainframe database to form a logical connection for enhanced sign...
The Balanced Cross-Layer Design Routing Algorithm in Wireless Sensor Networks Using Fuzzy Logic.
Li, Ning; Martínez, José-Fernán; Hernández Díaz, Vicente
2015-08-10
Recently, the cross-layer design for the wireless sensor network communication protocol has become more and more important and popular. Considering the disadvantages of the traditional cross-layer routing algorithms, in this paper we propose a new fuzzy logic-based routing algorithm, named the Balanced Cross-layer Fuzzy Logic (BCFL) routing algorithm. In BCFL, we use the cross-layer parameters' dispersion as the fuzzy logic inference system inputs. Moreover, we give each cross-layer parameter a dynamic weight according the value of the dispersion. For getting a balanced solution, the parameter whose dispersion is large will have small weight, and vice versa. In order to compare it with the traditional cross-layer routing algorithms, BCFL is evaluated through extensive simulations. The simulation results show that the new routing algorithm can handle the multiple constraints without increasing the complexity of the algorithm and can achieve the most balanced performance on selecting the next hop relay node. Moreover, the Balanced Cross-layer Fuzzy Logic routing algorithm can adapt to the dynamic changing of the network conditions and topology effectively.
The Balanced Cross-Layer Design Routing Algorithm in Wireless Sensor Networks Using Fuzzy Logic
Li, Ning; Martínez, José-Fernán; Díaz, Vicente Hernández
2015-01-01
Recently, the cross-layer design for the wireless sensor network communication protocol has become more and more important and popular. Considering the disadvantages of the traditional cross-layer routing algorithms, in this paper we propose a new fuzzy logic-based routing algorithm, named the Balanced Cross-layer Fuzzy Logic (BCFL) routing algorithm. In BCFL, we use the cross-layer parameters’ dispersion as the fuzzy logic inference system inputs. Moreover, we give each cross-layer parameter a dynamic weight according the value of the dispersion. For getting a balanced solution, the parameter whose dispersion is large will have small weight, and vice versa. In order to compare it with the traditional cross-layer routing algorithms, BCFL is evaluated through extensive simulations. The simulation results show that the new routing algorithm can handle the multiple constraints without increasing the complexity of the algorithm and can achieve the most balanced performance on selecting the next hop relay node. Moreover, the Balanced Cross-layer Fuzzy Logic routing algorithm can adapt to the dynamic changing of the network conditions and topology effectively. PMID:26266412
Detection of epistatic effects with logic regression and a classical linear regression model.
Malina, Magdalena; Ickstadt, Katja; Schwender, Holger; Posch, Martin; Bogdan, Małgorzata
2014-02-01
To locate multiple interacting quantitative trait loci (QTL) influencing a trait of interest within experimental populations, usually methods as the Cockerham's model are applied. Within this framework, interactions are understood as the part of the joined effect of several genes which cannot be explained as the sum of their additive effects. However, if a change in the phenotype (as disease) is caused by Boolean combinations of genotypes of several QTLs, this Cockerham's approach is often not capable to identify them properly. To detect such interactions more efficiently, we propose a logic regression framework. Even though with the logic regression approach a larger number of models has to be considered (requiring more stringent multiple testing correction) the efficient representation of higher order logic interactions in logic regression models leads to a significant increase of power to detect such interactions as compared to a Cockerham's approach. The increase in power is demonstrated analytically for a simple two-way interaction model and illustrated in more complex settings with simulation study and real data analysis.
de Chantal, Pier-Luc; Markovits, Henry
2017-02-01
There is little consensus about the nature of logical reasoning and, equally important, about how it develops. To address this, we looked at the early origins of deductive reasoning in preschool children. We examined the contribution of two factors to the reasoning ability of very young children: inhibitory capacity and the capacity to generate alternative ideas. In a first study, a total of 32 preschool children were all given generation, inhibition, and logical reasoning measures. Logical reasoning was measured using knowledge-based premises such as "All dogs have legs," and two different inferences: modus ponens and affirmation of the consequent. Results revealed that correctly reasoning with both inferences is not related to the measure of inhibition, but is rather related to the capacity to generate alternative ideas. In a second study, 32 preschool children were given either the generation or the inhibition task before the logical reasoning measure. Results showed that receiving the generation task beforehand significantly improved logical reasoning compared to the inhibition task given beforehand. Overall, these results provide evidence for the greater importance of idea generation in the early development of logical reasoning.
ERIC Educational Resources Information Center
Beauvois, Jean-Leon; Depret, Eric
2008-01-01
We focus on three aspects of the articles of Reyna, of Perry, Stupnisky, Daniels and Haynes, and of Murdock, Beauchamp and Hinton. The first aspect is the logic of causal chain, a logic that we differentiate from a more deterministic approach. The second one is the mode of corrective action (attribution retraining) that is planned for students,…
DOT National Transportation Integrated Search
2009-10-31
This report provides a summary of a 1.5-day peer exchange convened with select recipients of FHWA's first Eco-Logical grant. The purpose of the exchange, which was held in Austin, TX, in July 2009, was to allow grant recipients the opportunity to sha...
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…
Programmable bioelectronics in a stimuli-encoded 3D graphene interface
NASA Astrophysics Data System (ADS)
Parlak, Onur; Beyazit, Selim; Tse-Sum-Bui, Bernadette; Haupt, Karsten; Turner, Anthony P. F.; Tiwari, Ashutosh
2016-05-01
The ability to program and mimic the dynamic microenvironment of living organisms is a crucial step towards the engineering of advanced bioelectronics. Here, we report for the first time a design for programmable bioelectronics, with `built-in' switchable and tunable bio-catalytic performance that responds simultaneously to appropriate stimuli. The designed bio-electrodes comprise light and temperature responsive compartments, which allow the building of Boolean logic gates (i.e. ``OR'' and ``AND'') based on enzymatic communications to deliver logic operations.The ability to program and mimic the dynamic microenvironment of living organisms is a crucial step towards the engineering of advanced bioelectronics. Here, we report for the first time a design for programmable bioelectronics, with `built-in' switchable and tunable bio-catalytic performance that responds simultaneously to appropriate stimuli. The designed bio-electrodes comprise light and temperature responsive compartments, which allow the building of Boolean logic gates (i.e. ``OR'' and ``AND'') based on enzymatic communications to deliver logic operations. Electronic supplementary information (ESI) available. See DOI: 10.1039/c6nr02355j
Families of Graph Algorithms: SSSP Case Study
DOE Office of Scientific and Technical Information (OSTI.GOV)
Kanewala Appuhamilage, Thejaka Amila Jay; Zalewski, Marcin J.; Lumsdaine, Andrew
2017-08-28
Single-Source Shortest Paths (SSSP) is a well-studied graph problem. Examples of SSSP algorithms include the original Dijkstra’s algorithm and the parallel Δ-stepping and KLA-SSSP algorithms. In this paper, we use a novel Abstract Graph Machine (AGM) model to show that all these algorithms share a common logic and differ from one another by the order in which they perform work. We use the AGM model to thoroughly analyze the family of algorithms that arises from the common logic. We start with the basic algorithm without any ordering (Chaotic), and then we derive the existing and new algorithms by methodically exploringmore » semantic and spatial ordering of work. Our experimental results show that new derived algorithms show better performance than the existing distributed memory parallel algorithms, especially at higher scales.« less
PASBio: predicate-argument structures for event extraction in molecular biology
Wattarujeekrit, Tuangthong; Shah, Parantu K; Collier, Nigel
2004-01-01
Background The exploitation of information extraction (IE), a technology aiming to provide instances of structured representations from free-form text, has been rapidly growing within the molecular biology (MB) research community to keep track of the latest results reported in literature. IE systems have traditionally used shallow syntactic patterns for matching facts in sentences but such approaches appear inadequate to achieve high accuracy in MB event extraction due to complex sentence structure. A consensus in the IE community is emerging on the necessity for exploiting deeper knowledge structures such as through the relations between a verb and its arguments shown by predicate-argument structure (PAS). PAS is of interest as structures typically correspond to events of interest and their participating entities. For this to be realized within IE a key knowledge component is the definition of PAS frames. PAS frames for non-technical domains such as newswire are already being constructed in several projects such as PropBank, VerbNet, and FrameNet. Knowledge from PAS should enable more accurate applications in several areas where sentence understanding is required like machine translation and text summarization. In this article, we explore the need to adapt PAS for the MB domain and specify PAS frames to support IE, as well as outlining the major issues that require consideration in their construction. Results We introduce PASBio by extending a model based on PropBank to the MB domain. The hypothesis we explore is that PAS holds the key for understanding relationships describing the roles of genes and gene products in mediating their biological functions. We chose predicates describing gene expression, molecular interactions and signal transduction events with the aim of covering a number of research areas in MB. Analysis was performed on sentences containing a set of verbal predicates from MEDLINE and full text journals. Results confirm the necessity to analyze PAS specifically for MB domain. Conclusions At present PASBio contains the analyzed PAS of over 30 verbs, publicly available on the Internet for use in advanced applications. In the future we aim to expand the knowledge base to cover more verbs and the nominal form of each predicate. PMID:15494078
Neither logical empiricism nor vitalism, but organicism: what the philosophy of biology was.
Nicholson, Daniel J; Gawne, Richard
2015-12-01
Philosophy of biology is often said to have emerged in the last third of the twentieth century. Prior to this time, it has been alleged that the only authors who engaged philosophically with the life sciences were either logical empiricists who sought to impose the explanatory ideals of the physical sciences onto biology, or vitalists who invoked mystical agencies in an attempt to ward off the threat of physicochemical reduction. These schools paid little attention to actual biological science, and as a result philosophy of biology languished in a state of futility for much of the twentieth century. The situation, we are told, only began to change in the late 1960s and early 1970s, when a new generation of researchers began to focus on problems internal to biology, leading to the consolidation of the discipline. In this paper we challenge this widely accepted narrative of the history of philosophy of biology. We do so by arguing that the most important tradition within early twentieth-century philosophy of biology was neither logical empiricism nor vitalism, but the organicist movement that flourished between the First and Second World Wars. We show that the organicist corpus is thematically and methodologically continuous with the contemporary literature in order to discredit the view that early work in the philosophy of biology was unproductive, and we emphasize the desirability of integrating the historical and contemporary conversations into a single, unified discourse.
Fuzzy-based simulation of real color blindness.
Lee, Jinmi; dos Santos, Wellington P
2010-01-01
About 8% of men are affected by color blindness. That population is at a disadvantage since they cannot perceive a substantial amount of the visual information. This work presents two computational tools developed to assist color blind people. The first one tests color blindness and assess its severity. The second tool is based on Fuzzy Logic, and implements a method proposed to simulate real red and green color blindness in order to generate synthetic cases of color vision disturbance in a statistically significant amount. Our purpose is to develop correction tools and obtain a deeper understanding of the accessibility problems faced by people with chromatic visual impairment.
A semigroup approach to the strong ergodic theorem of the multistate stable population process.
Inaba, H
1988-01-01
"In this paper we first formulate the dynamics of multistate stable population processes as a partial differential equation. Next, we rewrite this equation as an abstract differential equation in a Banach space, and solve it by using the theory of strongly continuous semigroups of bounded linear operators. Subsequently, we investigate the asymptotic behavior of this semigroup to show the strong ergodic theorem which states that there exists a stable distribution independent of the initial distribution. Finally, we introduce the dual problem in order to obtain a logical definition for the reproductive value and we discuss its applications." (SUMMARY IN FRE) excerpt
Combinatorial explosion in model gene networks
NASA Astrophysics Data System (ADS)
Edwards, R.; Glass, L.
2000-09-01
The explosive growth in knowledge of the genome of humans and other organisms leaves open the question of how the functioning of genes in interacting networks is coordinated for orderly activity. One approach to this problem is to study mathematical properties of abstract network models that capture the logical structures of gene networks. The principal issue is to understand how particular patterns of activity can result from particular network structures, and what types of behavior are possible. We study idealized models in which the logical structure of the network is explicitly represented by Boolean functions that can be represented by directed graphs on n-cubes, but which are continuous in time and described by differential equations, rather than being updated synchronously via a discrete clock. The equations are piecewise linear, which allows significant analysis and facilitates rapid integration along trajectories. We first give a combinatorial solution to the question of how many distinct logical structures exist for n-dimensional networks, showing that the number increases very rapidly with n. We then outline analytic methods that can be used to establish the existence, stability and periods of periodic orbits corresponding to particular cycles on the n-cube. We use these methods to confirm the existence of limit cycles discovered in a sample of a million randomly generated structures of networks of 4 genes. Even with only 4 genes, at least several hundred different patterns of stable periodic behavior are possible, many of them surprisingly complex. We discuss ways of further classifying these periodic behaviors, showing that small mutations (reversal of one or a few edges on the n-cube) need not destroy the stability of a limit cycle. Although these networks are very simple as models of gene networks, their mathematical transparency reveals relationships between structure and behavior, they suggest that the possibilities for orderly dynamics in such networks are extremely rich and they offer novel ways to think about how mutations can alter dynamics.
Combinatorial explosion in model gene networks.
Edwards, R.; Glass, L.
2000-09-01
The explosive growth in knowledge of the genome of humans and other organisms leaves open the question of how the functioning of genes in interacting networks is coordinated for orderly activity. One approach to this problem is to study mathematical properties of abstract network models that capture the logical structures of gene networks. The principal issue is to understand how particular patterns of activity can result from particular network structures, and what types of behavior are possible. We study idealized models in which the logical structure of the network is explicitly represented by Boolean functions that can be represented by directed graphs on n-cubes, but which are continuous in time and described by differential equations, rather than being updated synchronously via a discrete clock. The equations are piecewise linear, which allows significant analysis and facilitates rapid integration along trajectories. We first give a combinatorial solution to the question of how many distinct logical structures exist for n-dimensional networks, showing that the number increases very rapidly with n. We then outline analytic methods that can be used to establish the existence, stability and periods of periodic orbits corresponding to particular cycles on the n-cube. We use these methods to confirm the existence of limit cycles discovered in a sample of a million randomly generated structures of networks of 4 genes. Even with only 4 genes, at least several hundred different patterns of stable periodic behavior are possible, many of them surprisingly complex. We discuss ways of further classifying these periodic behaviors, showing that small mutations (reversal of one or a few edges on the n-cube) need not destroy the stability of a limit cycle. Although these networks are very simple as models of gene networks, their mathematical transparency reveals relationships between structure and behavior, they suggest that the possibilities for orderly dynamics in such networks are extremely rich and they offer novel ways to think about how mutations can alter dynamics. (c) 2000 American Institute of Physics.
South African Student Constructed Indlebe Radio Telescope
NASA Astrophysics Data System (ADS)
McGruder, Charles H.; MacPherson, Stuart; Janse Van Vuuren, Gary Peter
2017-01-01
The Indlebe Radio Telescope (IRT) is a small transit telescope with a 5 m diameter parabolic reflector working at 21 cm. It was completely constructed by South African (SA) students from the Durban University of Technology (DUT), where it is located. First light occurred on 28 July 2008, when the galactic center, Sagittarius A, was detected. As a contribution to the International Year of Astronomy in 2009, staff members in the Department of Electronic Engineering at DUT in 2006 decided to have their students create a fully functional radio telescope by 2009. The specific project aims are to provide a visible project that could generate interest in science and technology in high school students and to provide a real world system for research in radio astronomy in general and an optimization of low noise radio frequency receiver systems in particular. These aims must be understood in terms of the SA’s government interests in radio astronomy. SA is a partner in the Square Kilometer Array (SKA) project, has constructed the Karoo Array Telescope (KAT) and MeerKat, which is the largest and most sensitive radio telescope in the southern hemisphere. SA and its partners in Africa are investing in the construction of the African Very Long Baseline Interferometry Network (AVN), an array of radio telescopes throughout Africa as an extension of the existing global Very Long Baseline Interferometry Network (VLBI). These projects will allow SA to make significant contributions to astronomy and enable astronomy to contribute to the scientific education and development goals of the country. The IRT sees on a daily basis the transit of Sag A. The transit time is influenced by precession, nutation, polar motion, aberration, celestial pole offset, proper motion, length of the terrestrial day and variable ionospheric refraction. Of these eight factors six are either predictable or measureable. To date neither celestial pole offset nor variable ionospheric refraction are predicable. Currently, we are comparing the observed transit times of Sag A with the calculable predications in order to obtain information over these two factors, with a view to better understanding them.
The forgotten grammatical category: Adjective use in agrammatic aphasia
Meltzer-Asscher, Aya; Thompson, Cynthia K.
2014-01-01
Background In contrast to nouns and verbs, the use of adjectives in agrammatic aphasia has not been systematically studied. However, because of the linguistic and psycholinguistic attributes of adjectives, some of which overlap with nouns and some with verbs, analysis of adjective production is important for testing theories of word class production deficits in agrammatism. Aims The objective of the current study was to compare adjective use in agrammatic and healthy individuals, focusing on three factors: overall adjective production rate, production of predicative and attributive adjectives, and production of adjectives with complex argument structure. Method & Procedures Narratives elicited from 14 agrammatic and 14 control participants were coded for open class grammatical category production (i.e., nouns, verbs, adjectives), with each adjective also coded for its syntactic environment (attributive/predicative) and argument structure. Outcomes & Results Overall, agrammatic speakers used adjectives in proportions similar to that of cognitively healthy speakers. However, they exhibited a greater proportion of predicative adjectives and a lesser proportion of attributive adjectives, compared to controls. Additionally, agrammatic participants produced adjectives with less complex argument structure than controls. Conclusions The overall normal-like frequency of adjectives produced by agrammatic speakers suggests that agrammatism does not involve an inherent difficulty with adjectives as a word class or with predication, or that it entails a deficit in processing low imageability words. However, agrammatic individuals’ reduced production of attributive adjectives and adjectives with complements extends previous findings of an adjunction deficit and of impairment in complex argument structure processing, respectively, to the adjectival domain. The results suggest that these deficits are not tied to a specific grammatical category. PMID:24882945
The forgotten grammatical category: Adjective use in agrammatic aphasia.
Meltzer-Asscher, Aya; Thompson, Cynthia K
2014-07-01
In contrast to nouns and verbs, the use of adjectives in agrammatic aphasia has not been systematically studied. However, because of the linguistic and psycholinguistic attributes of adjectives, some of which overlap with nouns and some with verbs, analysis of adjective production is important for testing theories of word class production deficits in agrammatism. The objective of the current study was to compare adjective use in agrammatic and healthy individuals, focusing on three factors: overall adjective production rate, production of predicative and attributive adjectives, and production of adjectives with complex argument structure. Narratives elicited from 14 agrammatic and 14 control participants were coded for open class grammatical category production (i.e., nouns, verbs, adjectives), with each adjective also coded for its syntactic environment (attributive/predicative) and argument structure. Overall, agrammatic speakers used adjectives in proportions similar to that of cognitively healthy speakers. However, they exhibited a greater proportion of predicative adjectives and a lesser proportion of attributive adjectives, compared to controls. Additionally, agrammatic participants produced adjectives with less complex argument structure than controls. The overall normal-like frequency of adjectives produced by agrammatic speakers suggests that agrammatism does not involve an inherent difficulty with adjectives as a word class or with predication, or that it entails a deficit in processing low imageability words. However, agrammatic individuals' reduced production of attributive adjectives and adjectives with complements extends previous findings of an adjunction deficit and of impairment in complex argument structure processing, respectively, to the adjectival domain. The results suggest that these deficits are not tied to a specific grammatical category.
Point model equations for neutron correlation counting: Extension of Böhnel's equations to any order
Favalli, Andrea; Croft, Stephen; Santi, Peter
2015-06-15
Various methods of autocorrelation neutron analysis may be used to extract information about a measurement item containing spontaneously fissioning material. The two predominant approaches being the time correlation analysis (that make use of a coincidence gate) methods of multiplicity shift register logic and Feynman sampling. The common feature is that the correlated nature of the pulse train can be described by a vector of reduced factorial multiplet rates. We call these singlets, doublets, triplets etc. Within the point reactor model the multiplet rates may be related to the properties of the item, the parameters of the detector, and basic nuclearmore » data constants by a series of coupled algebraic equations – the so called point model equations. Solving, or inverting, the point model equations using experimental calibration model parameters is how assays of unknown items is performed. Currently only the first three multiplets are routinely used. In this work we develop the point model equations to higher order multiplets using the probability generating functions approach combined with the general derivative chain rule, the so called Faà di Bruno Formula. Explicit expression up to 5th order are provided, as well the general iterative formula to calculate any order. This study represents the first necessary step towards determining if higher order multiplets can add value to nondestructive measurement practice for nuclear materials control and accountancy.« less
Effect of temperature on kinetics of biogas production from macroalgae.
Membere, Edward; Sallis, Paul
2018-05-08
An assessment was carried out on the effect of temperature on the anaerobic digestion of Laminaria digitata biomass, in batch reactors (25, 35, 45 and 55 °C) with a hydraulic retention time of 40 days. The first order, modified Gompertz and logistics models were used to obtain the kinetic parameters of the biogas production process. Results indicate the chemical composition of the algae substrate could be written as C 316 H 613 O 289 N 13 S 1 , with a theoretical methane yield of 336 ± 0.86 L CH 4 kg VS -1 . Experimental methane yield obtained from the reactors for 25, 35, 45, and 55 °C were 318 ± 1.58, 293 ± 1.11, 271 ± 0.98 and 352 ± 0.63 mL CH 4 /gVS respectively. Their R 2 > 0.90 indicate both models fits well for predicating kinetics of methane production. The lowest k h (0.31), high biodegradability index (0.96) and lag time (9.3-11.7 days) were obtained for 55 °C. Copyright © 2018 Elsevier Ltd. All rights reserved.
Lilienthal, S.; Klein, M.; Orbach, R.; Willner, I.; Remacle, F.
2017-01-01
The concentration of molecules can be changed by chemical reactions and thereby offer a continuous readout. Yet computer architecture is cast in textbooks in terms of binary valued, Boolean variables. To enable reactive chemical systems to compute we show how, using the Cox interpretation of probability theory, one can transcribe the equations of chemical kinetics as a sequence of coupled logic gates operating on continuous variables. It is discussed how the distinct chemical identity of a molecule allows us to create a common language for chemical kinetics and Boolean logic. Specifically, the logic AND operation is shown to be equivalent to a bimolecular process. The logic XOR operation represents chemical processes that take place concurrently. The values of the rate constants enter the logic scheme as inputs. By designing a reaction scheme with a feedback we endow the logic gates with a built in memory because their output then depends on the input and also on the present state of the system. Technically such a logic machine is an automaton. We report an experimental realization of three such coupled automata using a DNAzyme multilayer signaling cascade. A simple model verifies analytically that our experimental scheme provides an integrator generating a power series that is third order in time. The model identifies two parameters that govern the kinetics and shows how the initial concentrations of the substrates are the coefficients in the power series. PMID:28507669
76 FR 70653 - Performance Measurement
Federal Register 2010, 2011, 2012, 2013, 2014
2011-11-15
... Regulations as follows: PART 3055--SERVICE PERFORMANCE AND CUSTOMER SATISFACTION REPORTING 0 1. The authority... entered into the National Customer Management System (NCMS). NCMS manages SFS inventory, general ledger, order history, and customer accounts. A measurement ends when the order is logically closed out in the...
Distributed neural representations of logical arguments in school-age children
Mathieu, Romain; Booth, James R.; Prado, Jérôme
2016-01-01
Children’s understanding of linear-order (e.g., Dan is taller than Lisa, Lisa is taller than Jess) and set-inclusion (i.e., All tulips are flowers, All flowers are plants) relationships is critical for the acquisition of deductive reasoning, i.e., the ability to reach logically valid conclusions from given premises. Behavioral and neuroimaging studies in adults suggest processing differences between these relations: While arguments that involve linear-orders may be preferentially associated with spatial processing, arguments that involve set-inclusions may be preferentially associated with verbal processing. In the present study, we used functional magnetic resonance imaging (fMRI) to investigate whether these processing differences appear during the period of elementary school in development. Consistent with previous studies in adults, we found that arguments that involve linear-order and set-inclusion relationships preferentially involve spatial and verbal brain mechanisms (respectively) in school-age children (9 to 14 year olds). Because this neural sensitivity was not related to age, it likely emerges before the period of elementary education. However, the period of elementary education might play an important role in shaping the neural processing of logical reasoning, as indicated by developmental changes in frontal and parietal regions that were dependent upon the type of relation. PMID:25355487
Exploring telicity and transitivity in primordial thought language and body boundary imagery.
Cariola, Laura A
2014-12-01
Linguistics research on 'unconscious knowledge' related to the right brain-hemisphere represents a shift from the prevalent scientific investigation of the linguistic processes of grammatical structures associated with the dominant 'verbal' left brain-hemisphere. This study explores the relationship among primordial thought language, body boundary awareness and syntactic features--i.e., telicity, perfectivity and transitivity-in autobiographical narratives of everyday and dream memories. The results showed that event descriptions with atelic predicates and intransitive structures were more frequent in dream recall than in narratives of everyday memories. Primordial thought language and body boundary awareness, however, decreased with atelic predicates and transitive structures, which might indicate both the tendency of events to describe result states, such as achievements and accomplishments, as a means to bring about an unconscious wish fulfilment and the emphasis on event arguments to be realised without the inclusion of an external object. In narratives of everyday memories, penetration imagery increased with imperfective verb forms and decreased with perfective verb forms, and emotion lexis increased with atelic predicates and transitive structures, but not in dream memories.
Afifi, Rema A; Makhoul, Jihad; El Hajj, Taghreed; Nakkash, Rima T
2011-01-01
Although logic models are now touted as an important component of health promotion planning, implementation and evaluation, there are few published manuscripts that describe the process of logic model development, and fewer which do so with community involvement, despite the increasing emphasis on participatory research. This paper describes a process leading to the development of a logic model for a youth mental health promotion intervention using a participatory approach in a Palestinian refugee camp in Beirut, Lebanon. First, a needs assessment, including quantitative and qualitative data collection was carried out with children, parents and teachers. The second phase was identification of a priority health issue and analysis of determinants. The final phase in the construction of the logic model involved development of an intervention. The process was iterative and resulted in a more grounded depiction of the pathways of influence informed by evidence. Constructing a logic model with community input ensured that the intervention was more relevant to community needs, feasible for implementation and more likely to be sustainable. PMID:21278370
Lin, Xiaodong; Deng, Jiankang; Lyu, Yanlong; Qian, Pengcheng; Li, Yunfei
2018-01-01
The integration of multiple DNA logic gates on a universal platform to implement advance logic functions is a critical challenge for DNA computing. Herein, a straightforward and powerful strategy in which a guanine-rich DNA sequence lighting up a silver nanocluster and fluorophore was developed to construct a library of logic gates on a simple DNA-templated silver nanoclusters (DNA-AgNCs) platform. This library included basic logic gates, YES, AND, OR, INHIBIT, and XOR, which were further integrated into complex logic circuits to implement diverse advanced arithmetic/non-arithmetic functions including half-adder, half-subtractor, multiplexer, and demultiplexer. Under UV irradiation, all the logic functions could be instantly visualized, confirming an excellent repeatability. The logic operations were entirely based on DNA hybridization in an enzyme-free and label-free condition, avoiding waste accumulation and reducing cost consumption. Interestingly, a DNA-AgNCs-based multiplexer was, for the first time, used as an intelligent biosensor to identify pathogenic genes, E. coli and S. aureus genes, with a high sensitivity. The investigation provides a prototype for the wireless integration of multiple devices on even the simplest single-strand DNA platform to perform diverse complex functions in a straightforward and cost-effective way. PMID:29675221
Fuzzy logic controller to improve powerline communication
NASA Astrophysics Data System (ADS)
Tirrito, Salvatore
2015-12-01
The Power Line Communications (PLC) technology allows the use of the power grid in order to ensure the exchange of data information among devices. This work proposes an approach, based on Fuzzy Logic, that dynamically manages the amplitude of the signal, with which each node transmits, by processing the master-slave link quality measured and the master-slave distance. The main objective of this is to reduce both the impact of communication interferences induced and power consumption.
A resource-saving collective approach to biomedical semantic role labeling
2014-01-01
Background Biomedical semantic role labeling (BioSRL) is a natural language processing technique that identifies the semantic roles of the words or phrases in sentences describing biological processes and expresses them as predicate-argument structures (PAS’s). Currently, a major problem of BioSRL is that most systems label every node in a full parse tree independently; however, some nodes always exhibit dependency. In general SRL, collective approaches based on the Markov logic network (MLN) model have been successful in dealing with this problem. However, in BioSRL such an approach has not been attempted because it would require more training data to recognize the more specialized and diverse terms found in biomedical literature, increasing training time and computational complexity. Results We first constructed a collective BioSRL system based on MLN. This system, called collective BIOSMILE (CBIOSMILE), is trained on the BioProp corpus. To reduce the resources used in BioSRL training, we employ a tree-pruning filter to remove unlikely nodes from the parse tree and four argument candidate identifiers to retain candidate nodes in the tree. Nodes not recognized by any candidate identifier are discarded. The pruned annotated parse trees are used to train a resource-saving MLN-based system, which is referred to as resource-saving collective BIOSMILE (RCBIOSMILE). Our experimental results show that our proposed CBIOSMILE system outperforms BIOSMILE, which is the top BioSRL system. Furthermore, our proposed RCBIOSMILE maintains the same level of accuracy as CBIOSMILE using 92% less memory and 57% less training time. Conclusions This greatly improved efficiency makes RCBIOSMILE potentially suitable for training on much larger BioSRL corpora over more biomedical domains. Compared to real-world biomedical corpora, BioProp is relatively small, containing only 445 MEDLINE abstracts and 30 event triggers. It is not large enough for practical applications, such as pathway construction. We consider it of primary importance to pursue SRL training on large corpora in the future. PMID:24884358
Institutional logic in self-management support: coexistence and diversity.
Bossy, Dagmara; Knutsen, Ingrid Ruud; Rogers, Anne; Foss, Christina
2016-11-01
The prevalence of chronic conditions in Europe has been the subject of health-political reforms that have increasingly targeted collaboration between public, private and voluntary organisations for the purpose of supporting self-management of long-term diseases. The international literature describes collaboration across sectors as challenging, which implies that their respective logics are conflicting or incompatible. In line with the European context, recent Norwegian health policy advocates inter-sectorial partnerships. The aim of this policy is to create networks supporting better self-management for people with chronic conditions. The purpose of our qualitative study was to map different understandings of self-management support in private for-profit, volunteer and public organisations. These organisations are seen as potential self-management support networks for individuals with chronic conditions in Norway. From December 2012 to April 2013, we conducted 50 semi-structured interviews with representatives from relevant health and well-being organisations in different parts of Norway. According to the theoretical framework of institutional logic, representatives' statements are embedded with organisational understandings. In the analysis, we systematically assessed the representatives' different understandings of self-management support. The institutional logic we identified revealed traits of organisational historical backgrounds, and transitions in understanding. We found that the merging of individualism and fellowship in contemporary health policy generates different types of logic in different organisational contexts. The private for-profit organisations were concerned with the logic of a healthy appearance and mindset, whereas the private non-profit organisations emphasised fellowship and moral responsibility. Finally, the public, illness-oriented organisations tended to highlight individual conditions for illness management. Different types of logic may attract different users, and simultaneously, a diversity of logic types may challenge collaboration at the user's expense. Moral implications embed institutional logic implying a change towards individual responsibility for disease. Policy makers ought to consider complexities of logic in order to tailor the different needs of users. © 2015 John Wiley & Sons Ltd.
Proof and Proving: Logic, Impasses, and the Relationship to Problem Solving
ERIC Educational Resources Information Center
Savic, Milos
2012-01-01
Becoming a skillful prover is critical for success in advanced undergraduate and graduate mathematics courses. In this dissertation, I report my investigations of proof and the proving process in three separate studies. In the first study, I examined the amount of logic used in student-constructed proofs to help in the design of…
IT0: Discrete Math and Programming Logic Topics as a Hybrid Alternative to CS0
ERIC Educational Resources Information Center
Martin, Nancy L.
2015-01-01
This paper describes the development of a hybrid introductory course for students in their first or second year of an information systems technologies degree program at a large Midwestern university. The course combines topics from discrete mathematics and programming logic and design, a unique twist on most introductory courses. The objective of…
Band gaps and the possible effect on impact sensitivity for some nitro aromatic explosive materials
NASA Astrophysics Data System (ADS)
Zhang, Hong; Cheung, Frankie; Zhao, Feng; Cheng, Xin-Lu
The first principle density functional theory method SIESTA has been used to compute the band gap of several polynitroaromatic explosives, such as TATB, DATB, TNT, and picric acid. In these systems, the weakest bond is the one between an NO2 group and the aromatic ring. The bond dissociation energy (BDE) alone cannot predicate the relative sensitivity to impact of these four systems correctly. It was found that their relative impact sensitivity could be explained by considering the BDE and the band gap value of the crystal state together.
NASA Astrophysics Data System (ADS)
Krasilenko, Vladimir G.; Bardachenko, Vitaliy F.; Nikolsky, Alexander I.; Lazarev, Alexander A.
2007-04-01
In the paper we show that the biologically motivated conception of the use of time-pulse encoding gives the row of advantages (single methodological basis, universality, simplicity of tuning, training and programming et al) at creation and designing of sensor systems with parallel input-output and processing, 2D-structures of hybrid and neuro-fuzzy neurocomputers of next generations. We show principles of construction of programmable relational optoelectronic time-pulse coded processors, continuous logic, order logic and temporal waves processes, that lie in basis of the creation. We consider structure that executes extraction of analog signal of the set grade (order), sorting of analog and time-pulse coded variables. We offer optoelectronic realization of such base relational elements of order logic, which consists of time-pulse coded phototransformers (pulse-width and pulse-phase modulators) with direct and complementary outputs, sorting network on logical elements and programmable commutations blocks. We make estimations of basic technical parameters of such base devices and processors on their basis by simulation and experimental research: power of optical input signals - 0.200-20 μW, processing time - microseconds, supply voltage - 1.5-10 V, consumption power - hundreds of microwatts per element, extended functional possibilities, training possibilities. We discuss some aspects of possible rules and principles of training and programmable tuning on the required function, relational operation and realization of hardware blocks for modifications of such processors. We show as on the basis of such quasiuniversal hardware simple block and flexible programmable tuning it is possible to create sorting machines, neural networks and hybrid data-processing systems with the untraditional numerical systems and pictures operands.
Markovits, Henry
2014-12-01
Understanding the development of conditional (if-then) reasoning is critical for theoretical and educational reasons. Here we examined the hypothesis that there is a developmental transition between reasoning with true and contrary-to-fact (CF) causal conditionals. A total of 535 students between 11 and 14 years of age received priming conditions designed to encourage use of either a true or CF alternatives generation strategy and reasoning problems with true causal and CF causal premises (with counterbalanced order). Results show that priming had no effect on reasoning with true causal premises. By contrast, priming with CF alternatives significantly improved logical reasoning with CF premises. Analysis of the effect of order showed that reasoning with CF premises reduced logical responding among younger students but had no effect among older students. Results support the idea that there is a transition in the reasoning processes in this age range associated with the nature of the alternatives generation process required for logical reasoning with true and CF causal conditionals. Copyright © 2014 Elsevier Inc. All rights reserved.
Aliani, H; Kafaky, S Babaie; Saffari, A; Monavari, S M
2016-11-01
Appropriate management and planning of suitable areas for the development of ecotourism activities can play an important role in ensuring proper use of the environment. Due to the complexity of nature, applying different tools and models-particularly multi-criteria methods-can be useful in order to achieve these goals. In this study, to indicate suitable areas (land allocation) for ecotourism activities in Taleghan county, weighted linear combination (WLC) using geographical information system (GIS), fuzzy logic, and analytical network process (ANP) were used. To compare the applicability of each of these methods in achieving the goal, the results were compared with the previous model presented by Makhdoum. The results showed that the WLC and ANP methods are more efficient than the Makhdoum model in allocating lands for recreational areas and ecotourism purposes since concomitant use of fuzzy logic and ANP for ranking and weighing the criteria provides us with more flexible and logical conditions. Furthermore, the mentioned method makes it possible to involve ecological, economic, and social criteria simultaneously in the evaluation process in order to allocate land for ecotourism purposes.
Dynamic Event Tree advancements and control logic improvements
DOE Office of Scientific and Technical Information (OSTI.GOV)
Alfonsi, Andrea; Rabiti, Cristian; Mandelli, Diego
The RAVEN code has been under development at the Idaho National Laboratory since 2012. Its main goal is to create a multi-purpose platform for the deploying of all the capabilities needed for Probabilistic Risk Assessment, uncertainty quantification, data mining analysis and optimization studies. RAVEN is currently equipped with three different sampling categories: Forward samplers (Monte Carlo, Latin Hyper Cube, Stratified, Grid Sampler, Factorials, etc.), Adaptive Samplers (Limit Surface search, Adaptive Polynomial Chaos, etc.) and Dynamic Event Tree (DET) samplers (Deterministic and Adaptive Dynamic Event Trees). The main subject of this document is to report the activities that have been donemore » in order to: start the migration of the RAVEN/RELAP-7 control logic system into MOOSE, and develop advanced dynamic sampling capabilities based on the Dynamic Event Tree approach. In order to provide to all MOOSE-based applications a control logic capability, in this Fiscal Year an initial migration activity has been initiated, moving the control logic system, designed for RELAP-7 by the RAVEN team, into the MOOSE framework. In this document, a brief explanation of what has been done is going to be reported. The second and most important subject of this report is about the development of a Dynamic Event Tree (DET) sampler named “Hybrid Dynamic Event Tree” (HDET) and its Adaptive variant “Adaptive Hybrid Dynamic Event Tree” (AHDET). As other authors have already reported, among the different types of uncertainties, it is possible to discern two principle types: aleatory and epistemic uncertainties. The classical Dynamic Event Tree is in charge of treating the first class (aleatory) uncertainties; the dependence of the probabilistic risk assessment and analysis on the epistemic uncertainties are treated by an initial Monte Carlo sampling (MCDET). From each Monte Carlo sample, a DET analysis is run (in total, N trees). The Monte Carlo employs a pre-sampling of the input space characterized by epistemic uncertainties. The consequent Dynamic Event Tree performs the exploration of the aleatory space. In the RAVEN code, a more general approach has been developed, not limiting the exploration of the epistemic space through a Monte Carlo method but using all the forward sampling strategies RAVEN currently employs. The user can combine a Latin Hyper Cube, Grid, Stratified and Monte Carlo sampling in order to explore the epistemic space, without any limitation. From this pre-sampling, the Dynamic Event Tree sampler starts its aleatory space exploration. As reported by the authors, the Dynamic Event Tree is a good fit to develop a goal-oriented sampling strategy. The DET is used to drive a Limit Surface search. The methodology that has been developed by the authors last year, performs a Limit Surface search in the aleatory space only. This report documents how this approach has been extended in order to consider the epistemic space interacting with the Hybrid Dynamic Event Tree methodology.« less
Electric-field control of local ferromagnetism using a magnetoelectric multiferroic.
Chu, Ying-Hao; Martin, Lane W; Holcomb, Mikel B; Gajek, Martin; Han, Shu-Jen; He, Qing; Balke, Nina; Yang, Chan-Ho; Lee, Donkoun; Hu, Wei; Zhan, Qian; Yang, Pei-Ling; Fraile-Rodríguez, Arantxa; Scholl, Andreas; Wang, Shan X; Ramesh, R
2008-06-01
Multiferroics are of interest for memory and logic device applications, as the coupling between ferroelectric and magnetic properties enables the dynamic interaction between these order parameters. Here, we report an approach to control and switch local ferromagnetism with an electric field using multiferroics. We use two types of electromagnetic coupling phenomenon that are manifested in heterostructures consisting of a ferromagnet in intimate contact with the multiferroic BiFeO(3). The first is an internal, magnetoelectric coupling between antiferromagnetism and ferroelectricity in the BiFeO(3) film that leads to electric-field control of the antiferromagnetic order. The second is based on exchange interactions at the interface between a ferromagnet (Co(0.9)Fe(0.1)) and the antiferromagnet. We have discovered a one-to-one mapping of the ferroelectric and ferromagnetic domains, mediated by the colinear coupling between the magnetization in the ferromagnet and the projection of the antiferromagnetic order in the multiferroic. Our preliminary experiments reveal the possibility to locally control ferromagnetism with an electric field.
Electric-field control of local ferromagnetism using a magnetoelectric multiferroic
NASA Astrophysics Data System (ADS)
Chu, Ying-Hao; Martin, Lane W.; Holcomb, Mikel B.; Gajek, Martin; Han, Shu-Jen; He, Qing; Balke, Nina; Yang, Chan-Ho; Lee, Donkoun; Hu, Wei; Zhan, Qian; Yang, Pei-Ling; Fraile-Rodríguez, Arantxa; Scholl, Andreas; Wang, Shan X.; Ramesh, R.
2008-06-01
Multiferroics are of interest for memory and logic device applications, as the coupling between ferroelectric and magnetic properties enables the dynamic interaction between these order parameters. Here, we report an approach to control and switch local ferromagnetism with an electric field using multiferroics. We use two types of electromagnetic coupling phenomenon that are manifested in heterostructures consisting of a ferromagnet in intimate contact with the multiferroic BiFeO3. The first is an internal, magnetoelectric coupling between antiferromagnetism and ferroelectricity in the BiFeO3 film that leads to electric-field control of the antiferromagnetic order. The second is based on exchange interactions at the interface between a ferromagnet (Co0.9Fe0.1) and the antiferromagnet. We have discovered a one-to-one mapping of the ferroelectric and ferromagnetic domains, mediated by the colinear coupling between the magnetization in the ferromagnet and the projection of the antiferromagnetic order in the multiferroic. Our preliminary experiments reveal the possibility to locally control ferromagnetism with an electric field.
Optimal space communications techniques. [all digital phase locked loop for FM demodulation
NASA Technical Reports Server (NTRS)
Schilling, D. L.
1973-01-01
The design, development, and analysis are reported of a digital phase-locked loop (DPLL) for FM demodulation and threshold extension. One of the features of the developed DPLL is its synchronous, real time operation. The sampling frequency is constant and all the required arithmetic and logic operations are performed within one sampling period, generating an output sequence which is converted to analog form and filtered. An equation relating the sampling frequency to the carrier frequency must be satisfied to guarantee proper DPLL operation. The synchronous operation enables a time-shared operation of one DPLL to demodulate several FM signals simultaneously. In order to obtain information about the DPLL performance at low input signal-to-noise ratios, a model of an input noise spike was introduced, and the DPLL equation was solved using a digital computer. The spike model was successful in finding a second order DPLL which yielded a five db threshold extension beyond that of a first order DPLL.
The Application of LOGO! in Control System of a Transmission and Sorting Mechanism
NASA Astrophysics Data System (ADS)
Liu, Jian; Lv, Yuan-Jun
Logic programming of general logic control module LOGO! has been recommended the application in transmission and sorting mechanism. First, the structure and operating principle of the mechanism had been introduced. Then the pneumatic loop of the mechanism had been plotted in the software of FluidSIM-P. At last, pneumatic loop and motors had been control by LOGO!, which makes the control process simple and clear instead of the complicated control of ordinary relay. LOGO! can achieve the complicated interlock control composed of inter relays and time relays. In the control process, the logic control function of LOGO! is fully used to logic programming so that the system realizes the control of air cylinder and motor. It is reliable and adjustable mechanism after application.
NASA Technical Reports Server (NTRS)
Rodgers, T. E.; Johnson, J. F.
1977-01-01
The logic and methodology for a preliminary grouping of Spacelab and mixed-cargo payloads is proposed in a form that can be readily coded into a computer program by NASA. The logic developed for this preliminary cargo grouping analysis is summarized. Principal input data include the NASA Payload Model, payload descriptive data, Orbiter and Spacelab capabilities, and NASA guidelines and constraints. The first step in the process is a launch interval selection in which the time interval for payload grouping is identified. Logic flow steps are then taken to group payloads and define flight configurations based on criteria that includes dedication, volume, area, orbital parameters, pointing, g-level, mass, center of gravity, energy, power, and crew time.
NASA Astrophysics Data System (ADS)
Girola Schneider, R.
2017-07-01
The fuzzy logic is a branch of the artificial intelligence founded on the concept that everything is a matter of degree. It intends to create mathematical approximations on the resolution of certain types of problems. In addition, it aims to produce exact results obtained from imprecise data, for which it is particularly useful for electronic and computer applications. This enables it to handle vague or unspecific information when certain parts of a system are unknown or ambiguous and, therefore, they cannot be measured in a reliable manner. Also, when the variation of a variable can produce an alteration on the others The main focus of this paper is to prove the importance of these techniques formulated from a theoretical analysis on its application on ambiguous situations in the field of the rich clusters of galaxies. The purpose is to show its applicability in the several classification systems proposed for the rich clusters, which are based on criteria such as the level of richness of the cluster, the distribution of the brightest galaxies, whether there are signs of type-cD galaxies or not or the existence of sub-clusters. Fuzzy logic enables the researcher to work with "imprecise" information implementing fuzzy sets and combining rules to define actions. The control systems based on fuzzy logic join input variables that are defined in terms of fuzzy sets through rule groups that produce one or several output values of the system under study. From this context, the application of the fuzzy logic's techniques approximates the solution of the mathematical models in abstractions about the rich galaxy cluster classification of physical properties in order to solve the obscurities that must be confronted by an investigation group in order to make a decision.
Prado, Jérôme; Noveck, Ira A
2007-04-01
Participants experience difficulty detecting that an item depicting an H-in-a-square confirms the logical rule, "If there is not a T then there is not a circle." Indeed, there is a perceptual conflict between the items mentioned in the rule (T and circle) and in the test item (H and square). Much evidence supports the claim that correct responding depends on detecting and resolving such conflicts. One aim of this study is to find more precise neurological evidence in support of this claim by using a parametric event-related functional magnetic resonance imaging (fMRI) paradigm. We scanned 20 participants while they were required to judge whether or not a conditional rule was verified (or falsified) by a corresponding target item. We found that the right middorsolateral prefrontal cortex (mid-DLPFC) was specifically engaged, together with the medial frontal (anterior cingulate and presupplementary motor area [pre-SMA]) and parietal cortices, when mismatching was present. Activity in these regions was also linearly correlated with the level of mismatch between the rule and the test item. Furthermore, a psychophysiological interaction analysis revealed that activation of the mid-DLPFC, which increases as mismatching does, was accompanied by a decrease in functional integration with the bilateral primary visual cortex and an increase in functional integration with the right parietal cortex. This indicates a need to break away from perceptual cues in order to select an appropriate logical response. These findings strongly indicate that the regions involved in inhibitory control (including the right mid-DLPFC and the medial frontal cortex) are engaged when participants have to overcome perceptual mismatches in order to provide a logical response. These findings are also consistent with neuroimaging studies investigating the belief bias, where prior beliefs similarly interfere with logical reasoning.
Bittner, J.W.; Biscardi, R.W.
1991-03-19
An electronic measurement circuit is disclosed for high speed comparison of the relative amplitudes of a predetermined number of electrical input signals independent of variations in the magnitude of the sum of the signals. The circuit includes a high speed electronic switch that is operably connected to receive on its respective input terminals one of said electrical input signals and to have its common terminal serve as an input for a variable-gain amplifier-detector circuit that is operably connected to feed its output to a common terminal of a second high speed electronic switch. The respective terminals of the second high speed electronic switch are operably connected to a plurality of integrating sample and hold circuits, which in turn have their outputs connected to a summing logic circuit that is operable to develop first, second and third output voltages, the first output voltage being proportional to a predetermined ratio of sums and differences between the compared input signals, the second output voltage being proportional to a second summed ratio of predetermined sums and differences between said input signals, and the third output voltage being proportional to the sum of signals to the summing logic circuit. A servo system that is operably connected to receive said third output signal and compare it with a reference voltage to develop a slowly varying feedback voltage to control the variable-gain amplifier in said common amplifier-detector circuit in order to make said first and second output signals independent of variations in the magnitude of the sum of said input signals. 2 figures.
Bittner, John W.; Biscardi, Richard W.
1991-01-01
An electronic measurement circuit for high speed comparison of the relative amplitudes of a predetermined number of electrical input signals independent of variations in the magnitude of the sum of the signals. The circuit includes a high speed electronic switch that is operably connected to receive on its respective input terminals one of said electrical input signals and to have its common terminal serve as an input for a variable-gain amplifier-detector circuit that is operably connected to feed its output to a common terminal of a second high speed electronic switch. The respective terminals of the second high speed electronic switch are operably connected to a plurality of integrating sample and hold circuits, which in turn have their outputs connected to a summing logic circuit that is operable to develop first, second and third output voltages, the first output voltage being proportional to a predetermined ratio of sums and differences between the compared input signals, the second output voltage being proportional to a second summed ratio of predetermined sums and differences between said input signals, and the third output voltage being proportional to the sum of signals to the summing logic circuit. A servo system that is operably connected to receive said third output signal and compare it with a reference voltage to develop a slowly varying feedback voltage to control the variable-gain amplifier in said common amplifier-detector circuit in order to make said first and second output signals independent of variations in the magnitude of the sum of said input signals.
NASA Astrophysics Data System (ADS)
Rapoport, Diego L.
2011-01-01
In this transdisciplinary article which stems from philosophical considerations (that depart from phenomenology—after Merleau-Ponty, Heidegger and Rosen—and Hegelian dialectics), we develop a conception based on topological (the Moebius surface and the Klein bottle) and geometrical considerations (based on torsion and non-orientability of manifolds), and multivalued logics which we develop into a unified world conception that surmounts the Cartesian cut and Aristotelian logic. The role of torsion appears in a self-referential construction of space and time, which will be further related to the commutator of the True and False operators of matrix logic, still with a quantum superposed state related to a Moebius surface, and as the physical field at the basis of Spencer-Brown's primitive distinction in the protologic of the calculus of distinction. In this setting, paradox, self-reference, depth, time and space, higher-order non-dual logic, perception, spin and a time operator, the Klein bottle, hypernumbers due to Musès which include non-trivial square roots of ±1 and in particular non-trivial nilpotents, quantum field operators, the transformation of cognition to spin for two-state quantum systems, are found to be keenly interwoven in a world conception compatible with the philosophical approach taken for basis of this article. The Klein bottle is found not only to be the topological in-formation for self-reference and paradox whose logical counterpart in the calculus of indications are the paradoxical imaginary time waves, but also a classical-quantum transformer (Hadamard's gate in quantum computation) which is indispensable to be able to obtain a complete multivalued logical system, and still to generate the matrix extension of classical connective Boolean logic. We further find that the multivalued logic that stems from considering the paradoxical equation in the calculus of distinctions, and in particular, the imaginary solutions to this equation, generates the matrix logic which supersedes the classical logic of connectives and which has for particular subtheories fuzzy and quantum logics. Thus, from a primitive distinction in the vacuum plane and the axioms of the calculus of distinction, we can derive by incorporating paradox, the world conception succinctly described above.
Nodal aberration theory applied to freeform surfaces
NASA Astrophysics Data System (ADS)
Fuerschbach, Kyle; Rolland, Jannick P.; Thompson, Kevin P.
2014-12-01
When new three-dimensional packages are developed for imaging optical systems, the rotational symmetry of the optical system is often broken, changing its imaging behavior and making the optical performance worse. A method to restore the performance is to use freeform optical surfaces that compensate directly the aberrations introduced from tilting and decentering the optical surfaces. In order to effectively optimize the shape of a freeform surface to restore optical functionality, it is helpful to understand the aberration effect the surface may induce. Using nodal aberration theory the aberration fields induced by a freeform surface in an optical system are explored. These theoretical predications are experimentally validated with the design and implementation of an aberration generating telescope.
Materials Integration and Doping of Carbon Nanotube-based Logic Circuits
NASA Astrophysics Data System (ADS)
Geier, Michael
Over the last 20 years, extensive research into the structure and properties of single- walled carbon nanotube (SWCNT) has elucidated many of the exceptional qualities possessed by SWCNTs, including record-setting tensile strength, excellent chemical stability, distinctive optoelectronic features, and outstanding electronic transport characteristics. In order to exploit these remarkable qualities, many application-specific hurdles must be overcome before the material can be implemented in commercial products. For electronic applications, recent advances in sorting SWCNTs by electronic type have enabled significant progress towards SWCNT-based integrated circuits. Despite these advances, demonstrations of SWCNT-based devices with suitable characteristics for large-scale integrated circuits have been limited. The processing methodologies, materials integration, and mechanistic understanding of electronic properties developed in this dissertation have enabled unprecedented scales of SWCNT-based transistor fabrication and integrated circuit demonstrations. Innovative materials selection and processing methods are at the core of this work and these advances have led to transistors with the necessary transport properties required for modern circuit integration. First, extensive collaborations with other research groups allowed for the exploration of SWCNT thin-film transistors (TFTs) using a wide variety of materials and processing methods such as new dielectric materials, hybrid semiconductor materials systems, and solution-based printing of SWCNT TFTs. These materials were integrated into circuit demonstrations such as NOR and NAND logic gates, voltage-controlled ring oscillators, and D-flip-flops using both rigid and flexible substrates. This dissertation explores strategies for implementing complementary SWCNT-based circuits, which were developed by using local metal gate structures that achieve enhancement-mode p-type and n-type SWCNT TFTs with widely separated and symmetric threshold voltages. Additionally, a novel n-type doping procedure for SWCNT TFTs was also developed utilizing a solution-processed organometallic small molecule to demonstrate the first network top-gated n-type SWCNT TFTs. Lastly, new doping and encapsulation layers were incorporated to stabilize both p-type and n-type SWCNT TFT electronic properties, which enabled the fabrication of large-scale memory circuits. Employing these materials and processing advances has addressed many application specific barriers to commercialization. For instance, the first thin-film SWCNT complementary metal-oxide-semi-conductor (CMOS) logic devices are demonstrated with sub-nanowatt static power consumption and full rail-to-rail voltage transfer characteristics. With the introduction of a new n-type Rh-based molecular dopant, the first SWCNT TFTs are fabricated in top-gate geometries over large areas with high yield. Then by utilizing robust encapsulation methods, stable and uniform electronic performance of both p-type and n-type SWCNT TFTs has been achieved. Based on these complementary SWCNT TFTs, it is possible to simulate, design, and fabricate arrays of low-power static random access memory (SRAM) circuits, achieving large-scale integration for the first time based on solution-processed semiconductors. Together, this work provides a direct pathway for solution processable, large scale, power-efficient advanced integrated logic circuits and systems.
Self-Tuning of Design Variables for Generalized Predictive Control
NASA Technical Reports Server (NTRS)
Lin, Chaung; Juang, Jer-Nan
2000-01-01
Three techniques are introduced to determine the order and control weighting for the design of a generalized predictive controller. These techniques are based on the application of fuzzy logic, genetic algorithms, and simulated annealing to conduct an optimal search on specific performance indexes or objective functions. Fuzzy logic is found to be feasible for real-time and on-line implementation due to its smooth and quick convergence. On the other hand, genetic algorithms and simulated annealing are applicable for initial estimation of the model order and control weighting, and final fine-tuning within a small region of the solution space, Several numerical simulations for a multiple-input and multiple-output system are given to illustrate the techniques developed in this paper.
System and method for programmable bank selection for banked memory subsystems
Blumrich, Matthias A.; Chen, Dong; Gara, Alan G.; Giampapa, Mark E.; Hoenicke, Dirk; Ohmacht, Martin; Salapura, Valentina; Sugavanam, Krishnan
2010-09-07
A programmable memory system and method for enabling one or more processor devices access to shared memory in a computing environment, the shared memory including one or more memory storage structures having addressable locations for storing data. The system comprises: one or more first logic devices associated with a respective one or more processor devices, each first logic device for receiving physical memory address signals and programmable for generating a respective memory storage structure select signal upon receipt of pre-determined address bit values at selected physical memory address bit locations; and, a second logic device responsive to each of the respective select signal for generating an address signal used for selecting a memory storage structure for processor access. The system thus enables each processor device of a computing environment memory storage access distributed across the one or more memory storage structures.
On the notion of free will in the Free Will Theorem
NASA Astrophysics Data System (ADS)
Landsman, Klaas
2017-02-01
The (Strong) Free Will Theorem (FWT) of Conway and Kochen (2009) on the one hand follows from uncontroversial parts of modern physics and elementary mathematical and logical reasoning, but on the other hand seems predicated on an undefined notion of free will (allowing physicists to "freely choose" the settings of their experiments). This makes the theorem philosophically vulnerable, especially if it is construed as a proof of indeterminism or even of libertarian free will (as Conway & Kochen suggest). However, Cator and Landsman (Foundations of Physics 44, 781-791, 2014) previously gave a reformulation of the FWT that does not presuppose indeterminism, but rather assumes a mathematically specific form of such "free choices" even in a deterministic world (based on a non-probabilistic independence assumption). In the present paper, which is a philosophical sequel to the one just mentioned, I argue that the concept of free will used in the latter version of the FWT is essentially the one proposed by Lewis (1981), also known as 'local miracle compatibilism' (of which I give a mathematical interpretation that might be of some independent interest also beyond its application to the FWT). As such, the (reformulated) FWT in my view challenges compatibilist free will à la Lewis (albeit in a contrived way via bipartite EPR-type experiments), falling short of supporting libertarian free will.
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.
The knowledge instinct, cognitive algorithms, modeling of language and cultural evolution
NASA Astrophysics Data System (ADS)
Perlovsky, Leonid I.
2008-04-01
The talk discusses mechanisms of the mind and their engineering applications. The past attempts at designing "intelligent systems" encountered mathematical difficulties related to algorithmic complexity. The culprit turned out to be logic, which in one way or another was used not only in logic rule systems, but also in statistical, neural, and fuzzy systems. Algorithmic complexity is related to Godel's theory, a most fundamental mathematical result. These difficulties were overcome by replacing logic with a dynamic process "from vague to crisp," dynamic logic. It leads to algorithms overcoming combinatorial complexity, and resulting in orders of magnitude improvement in classical problems of detection, tracking, fusion, and prediction in noise. I present engineering applications to pattern recognition, detection, tracking, fusion, financial predictions, and Internet search engines. Mathematical and engineering efficiency of dynamic logic can also be understood as cognitive algorithm, which describes fundamental property of the mind, the knowledge instinct responsible for all our higher cognitive functions: concepts, perception, cognition, instincts, imaginations, intuitions, emotions, including emotions of the beautiful. I present our latest results in modeling evolution of languages and cultures, their interactions in these processes, and role of music in cultural evolution. Experimental data is presented that support the theory. Future directions are outlined.
Logical Fallacies and the Abuse of Climate Science: Fire, Water, and Ice
NASA Astrophysics Data System (ADS)
Gleick, P. H.
2012-12-01
Good policy without good science and analysis is unlikely. Good policy with bad science is even more unlikely. Unfortunately, there is a long history of abuse or misuse of science in fields with ideological, religious, or economically controversial policy implications, such as planetary physics during the time of Galileo, the evolution debate, or climate change. Common to these controversies are what are known as "logical fallacies" -- patterns of reasoning that are always -- or at least commonly -- wrong due to a flaw in the structure of the argument that renders the argument invalid. All scientists should understand the nature of logical fallacies in order to (1) avoid making mistakes and reaching unsupported conclusion, (2) help them understand and refute the flaws in arguments made by others, and (3) aid in communicating science to the public. This talk will present a series of logical fallacies often made in the climate science debate, including "arguments from ignorance," "arguments from error," "arguments from misinterpretation," and "cherry picking." Specific examples will be presented in the area of temperature analysis, water resources, and ice dynamics, with a focus on selective use or misuse of data.; "Argument from Error" - an amusing example of a logical fallacy.
Interaction between language and vision: It’s momentary, abstract, and it develops
Dessalegn, Banchiamlack; Landau, Barbara
2013-01-01
In this paper, we present a case study that explores the nature and development of the mechanisms by which language interacts with and influences our ability to represent and retain information from one of our most important non-linguistic systems-- vision. In previous work (Dessalegn & Landau, 2008), we showed that 4 year-olds remembered conjunctions of visual features better when the visual target was accompanied by a sentence containing an asymmetric spatial predicate (e.g., the yellow is to the left of the black) but not when the visual target was accompanied by a sentence containing a novel noun (e.g., look at the dax) or a symmetric spatial predicate (e.g., the yellow is touching the black). In this paper, we extend these findings. In three experiments, 3, 4 and 6 year-olds were shown square blocks split in half by color vertically, horizontally or diagonally (e.g., yellow-left, black-right) and were asked to perform a delayed-matching task. We found that sentences containing spatial asymmetric predicates (e.g., the yellow is to the left of the black) and non-spatial asymmetric predicates (e.g., the yellow is prettier than the black) helped 4 year-olds, although not to the same extent. By contrast, 3 year-olds did not benefit from different linguistic instructions at all while 6 year-olds performed at ceiling in the task with or without the relevant sentences. Our findings suggest by age 4, the effects of language on non-linguistic tasks depend on highly abstract representations of the linguistic instructions and are momentary, seen only in the context of the task. We further speculate that language becomes more automatically engaged in nonlinguistic tasks over development. PMID:23545385
Preti, Robert A; Chan, Wai Shun; Kurtzberg, Joanne; Dornsife, Ronna E.; Wallace, Paul K.; Furlange, Rosemary; Lin, Anna; Omana-Zapata, Imelda; Bonig, Halvard; Tonn, Thorsten
2018-01-01
Background Evaluation of the BD™ Stem Cell Enumeration (SCE) Kit was conducted at four clinical sites with flow cytometry CD34+ enumeration, to assess agreement between two investigational methods, the BD FACSCanto™ II and BD FACSCalibur™ systems, and the predicate method (Beckman Coulter Stem-Kit™ reagents). Methods Leftover and delinked specimens (n = 1,032) from clinical flow cytometry testing were analyzed on the BD FACSCanto II (n = 918) and BD FACSCalibur (n = 905) in normal and mobilized blood, frozen and thawed bone marrow, and leucopheresis and cord blood anticoagulated with CPD, ACD-A, heparin, and EDTA alone or in combination. Fresh leucopheresis analysis addressed site equivalency for sample preparation, testing, and analysis. Results The mean relative bias showed agreement within predefined parameters for the BD FACSCanto II (−2.81 to 4.31 ±7.1) and BD FACSCalibur (−2.69 to 5.2 ±7.9). Results are reported as absolute and relative differences compared to the predicate for viable CD34+, percentage of CD34+ in CD45+, and viable CD45+ populations (or gates). Bias analyses of the distribution of the predicate low, mid, and high bin values were done using BD FACSCanto II optimal gating and BD FACSCalibur manual gating for viable CD34+, percentage of CD34+ in CD45+, and viable CD45+. Bias results from both investigational methods show agreement. Deming regression analyses showed a linear relationship with R2 >0.92 for both investigational methods. Discussion In conclusion, the results from both investigational methods demonstrated agreement and equivalence with the predicate method for enumeration of absolute viable CD34+, percentage of viable CD34+ in CD45+, and absolute viable CD45+ populations. PMID:24927716
On the Use of CAD-Native Predicates and Geometry in Surface Meshing
NASA Technical Reports Server (NTRS)
Aftosmis, M. J.
1999-01-01
Several paradigms for accessing CAD geometry during surface meshing for CFD are discussed. File translation, inconsistent geometry engines and non-native point construction are all identified as sources of non-robustness. The paper argues in favor of accessing CAD parts and assemblies in their native format, without translation, and for the use of CAD-native predicates and constructors in surface mesh generation. The discussion also emphasizes the importance of examining the computational requirements for exact evaluation of triangulation predicates during surface meshing. The native approach is demonstrated through an algorithm for the generation of closed manifold surface triangulations from CAD geometry. CAD parts and assemblies are used in their native format, and a part's native geometry engine is accessed through a modeler-independent application programming interface (API). In seeking a robust and fully automated procedure, the algorithm is based on a new physical space manifold triangulation technique specially developed to avoid robustness issues associated with poorly conditioned mappings. In addition, this approach avoids the usual ambiguities associated with floating-point predicate evaluation on constructed coordinate geometry in a mapped space. The technique is incremental, so that each new site improves the triangulation by some well defined quality measure. The algorithm terminates after achieving a prespecified measure of mesh quality and produces a triangulation such that no angle is less than a given angle bound, a or greater than pi - 2alpha. This result also sets bounds on the maximum vertex degree, triangle aspect-ratio and maximum stretching rate for the triangulation. In addition to the output triangulations for a variety of CAD parts, the discussion presents related theoretical results which assert the existence of such an angle bound, and demonstrate that maximum bounds of between 25 deg and 30 deg may be achieved in practice.