Equitable Probabilistic Elections in Ring Networks
Equivalence of compositional expressions and independence relations in compositional models
We generalize Jiroušek’s (right) composition operator in such a way that it can be applied to distribution functions with values in a “semifield“, and introduce (parenthesized) compositional expressions, which in some sense generalize Jiroušek’s “generating sequences” of compositional models. We say that two compositional expressions are equivalent if their evaluations always produce the same results whenever they are defined. Our first result is that a set system is star-like with centre if...
Equivalences and Congruences on Infinite Conway Games∗
Taking the view that infinite plays are draws, we study Conway non-terminating games and non-losing strategies. These admit a sharp coalgebraic presentation, where non-terminating games are seen as a final coalgebra and game contructors, such as disjunctive sum, as final morphisms. We have shown, in a previous paper, that Conway’s theory of terminating games can be rephrased naturally in terms of game (pre)congruences. Namely, various...
Equivalences and Congruences on Infinite Conway Games∗
Taking the view that infinite plays are draws, we study Conway non-terminating games and non-losing strategies. These admit a sharp coalgebraic presentation, where non-terminating games are seen as a final coalgebra and game contructors, such as disjunctive sum, as final morphisms. We have shown, in a previous paper, that Conway’s theory of terminating games can be rephrased naturally in terms of game (pre)congruences. Namely, various...
Erasing automata recognize more than context-free languages
Ergodic Properties of Certain Surjective Cellular Automata.
Errata : «Les hiérarchies de parties et leur demi-treillis»
Erratum: Equivalence of compositional expressions and independence relations in compositional models
Error frequency - regulator of the teaching algorithm
Establishing Order in Planar Subdivisions.
Estimates for H2 functions with concentration at low degrees and applications to complex symbolic computation.
Estimating composite functions by model selection
We consider the problem of estimating a function on for large values of by looking for some best approximation of by composite functions of the form . Our solution is based on model selection and leads to a very general approach to solve this problem with respect to many different types of functions and statistical frameworks. In particular, we handle the problems of approximating by additive functions, single and multiple index models, artificial neural networks, mixtures of Gaussian...
Estimating the value of contracts. A simulation study
Estimation of the algorithmic complexity of classes of computable models.
Estimation of tolerance relation on the basis of multiple pairwise comparisons with random errors
Estudio de algunas secuencias pseudoaleatorias de aplicación criptográfica.
Pseudorandom binary sequences are required in stream ciphers and other applications of modern communication systems. In the first case it is essential that the sequences be unpredictable. The linear complexity of a sequence is the amount of it required to define the remainder. This work addresses the problem of the analysis and computation of the linear complexity of certain pseudorandom binary sequences. Finally we conclude some characteristics of the nonlinear function that produces the sequences...
Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées
Étude des spécifications modulaires : constructions de colimites finies, diagrammes, isomorphismes
Étude des spécifications modulaires : constructions de colimites finies, diagrammes, isomorphismes. Partie II
Étude des spécifications modulaires : constructions de colimites finies, diagrammes, isomorphismes. Partie III