A Logic With Higher Order Conditional Probabilities
A Logic With Higher Order Probabilities
A logical analysis of the truth-reaction paradox
A logical model of HCP.
A logic-based environment for developing natural language processing applications
We present a system providing a set of tools for developing natural language processing (NLP) applications such as natural language interfaces, communication aid systems, etc. This system is based on two principles: modularity of knowledge representation to ensure the portability of the system, and guided sentence composition to ensure transparency, i.e. to ensure that the produced sentences are well-formed at the lexical, syntactic, semantic and conceptual levels. We first describe the formalisms...
A Loopless Implementation of a Gray Code for Signed Permutations
A lower bound for reversible automata
A Lower Bound For Reversible Automata
A reversible automaton is a finite automaton in which each letter induces a partial one-to-one map from the set of states into itself. We solve the following problem proposed by Pin. Given an alphabet A, does there exist a sequence of languages Kn on A which can be accepted by a reversible automaton, and such that the number of states of the minimal automaton of Kn is in O(n), while the minimal number of states of a reversible automaton accepting Kn is in O(ρn) for some ρ > 1? We give...
A lower bound for the arithmetical complexity of Sturmian words.
A Lyapunov-based design tool of impedance controllers for robot manipulators
This paper presents a design tool of impedance controllers for robot manipulators, based on the formulation of Lyapunov functions. The proposed control approach addresses two challenges: the regulation of the interaction forces, ensured by the impedance error converging to zero, while preserving a suitable path tracking despite constraints imposed by the environment. The asymptotic stability of an equilibrium point of the system, composed by full nonlinear robot dynamics and the impedance control,...
A Macsyma implementation of Zeilberger's fast algorithm.
A Markovian concurrency measure
A mathematical and computational framework for reliable real-time solution of parametrized partial differential equations
We present in this article two components: these components can in fact serve various goals independently, though we consider them here as an ensemble. The first component is a technique for the rapid and reliable evaluation prediction of linear functional outputs of elliptic (and parabolic) partial differential equations with affine parameter dependence. The essential features are (i) (provably) rapidly convergent global reduced–basis approximations — Galerkin projection onto a space spanned...
A Mathematical and Computational Framework for Reliable Real-Time Solution of Parametrized Partial Differential Equations
We present in this article two components: these components can in fact serve various goals independently, though we consider them here as an ensemble. The first component is a technique for the rapid and reliable evaluation prediction of linear functional outputs of elliptic (and parabolic) partial differential equations with affine parameter dependence. The essential features are (i) (provably) rapidly convergent global reduced–basis approximations — Galerkin projection onto a space WN spanned...
A mathematical framework for learning and adaption: (generalized) random systems with complete connections.
The aim of this paper is to show that the theory of (generalized) random systems with complete connection may serve as a mathematical framework for learning and adaption. Chapter 1 is of an introductory nature and gives a general description of the problems with which one is faced. In Chapter 2 the mathematical model and some results about it are explained. Chapter 3 deals with special learning and adaption models.
A Mathematical Theory of Interface Aesthetics
A matrix inequality based design method for consensus problems in multi-agent systems
In this paper, we study a consensus problem in multi-agent systems, where the entire system is decentralized in the sense that each agent can only obtain information (states or outputs) from its neighbor agents. The existing design methods found in the literature are mostly based on a graph Laplacian of the graph which describes the interconnection structure among the agents, and such methods cannot deal with complicated control specification. For this purpose, we propose to reduce the consensus...
A mental cutting test on female students using a stereographic system.
A metatheoretical characterization of negation as finite failure.
A method for generating compound spring element curves in contact with cylindrical surfaces.