Relative directed homotopy theory of partially ordered spaces.
Relative goodness of EOL forms
Relative injectivity as cocompleteness for a class of distributors.
Relative sets and rough sets
In this paper, by defining a pair of classical sets as a relative set, an extension of the classical set algebra which is a counterpart of Belnap's four-valued logic is achieved. Every relative set partitions all objects into four distinct regions corresponding to four truth-values of Belnap's logic. Like truth-values of Belnap's logic, relative sets have two orderings; one is an order of inclusion and the other is an order of knowledge or information. By defining a rough set as a pair of definable...
Relativizations of the P = NP problem over the complex number field.
Relaxed algorithms for -adic numbers
Current implementations of -adic numbers usually rely on so called zealous algorithms, which compute with truncated -adic expansions at a precision that can be specified by the user. In combination with Newton-Hensel type lifting techniques, zealous algorithms can be made very efficient from an asymptotic point of view.In the similar context of formal power series, another so called lazy technique is also frequently implemented. In this context, a power series is essentially a stream of coefficients,...
Relevance and redundancy in fuzzy classification systems.
Fuzzy classification systems is defined in this paper as an aggregative model, in such a way that Ruspini classical definition of fuzzy partition appears as a particular case. Once a basic recursive model has been accepted, we then propose to analyze relevance and redundancy in order to allow the possibility of learning from previous experiences. All these concepts are applied to a real picture, showing that our approach allows to check quality of such a classification system.
Reliability Analysis of a Two-Unit Standby System by Computer Simulation
Reliable robust path planning with application to mobile robots
This paper is devoted to path planning when the safety of the system considered has to be guaranteed in the presence of bounded uncertainty affecting its model. A new path planner addresses this problem by combining Rapidly-exploring Random Trees (RRT) and a set representation of uncertain states. An idealized algorithm is presented first, before a description of one of its possible implementations, where compact sets are wrapped into boxes. The resulting path planner is then used for nonholonomic...
Remarks concerning RSA-cryptosystem exponents
Remarks on algorithm 32
Remarks on DOL growth sequences
Remarks on heterogeneous algebras
Remarks on pebble games on graphs
Remarques sur la suite engendrée par des substitutions composées
Reparametrizations of continuous paths.
Répartition des suites et substitutions
Repetition thresholds for subdivided graphs and trees
The repetition threshold introduced by Dejean and Brandenburg is the smallest real number α such that there exists an infinite word over a k-letter alphabet that avoids β-powers for all β > α. We extend this notion to colored graphs and obtain the value of the repetition thresholds of trees and “large enough” subdivisions of graphs for every alphabet size.
Repetition thresholds for subdivided graphs and trees
The repetition threshold introduced by Dejean and Brandenburg is the smallest real number α such that there exists an infinite word over a k-letter alphabet that avoids β-powers for all β > α. We extend this notion to colored graphs and obtain the value of the repetition thresholds of trees and “large enough” subdivisions of graphs for every alphabet size.
Repetitions and permutations of columns in the semijoin algebra
Codd defined the relational algebra [E.F. Codd, Communications of the ACM 13 (1970) 377–387; E.F. Codd, Relational completeness of data base sublanguages, in Data Base Systems, R. Rustin, Ed., Prentice-Hall (1972) 65–98] as the algebra with operations projection, join, restriction, union and difference. His projection operator can drop, permute and repeat columns of a relation. This permuting and repeating of columns does not really add expressive power to the relational algebra. Indeed, using the...