5 \usepackage[font=footnotesize]{subfig}
8 \usepackage{algorithm2e}
12 \usepackage[latin1]{inputenc}
13 \usepackage[T1]{fontenc}
14 \usepackage[english]{babel}
15 \usepackage{amsmath,amssymb,latexsym,eufrak,euscript}
16 \usepackage{pstricks,pst-node,pst-coil}
20 \usepackage{pgflibrarysnakes}
24 \usetikzlibrary{arrows}
25 \usetikzlibrary{automata}
26 \usetikzlibrary{snakes}
27 \usetikzlibrary{shapes}
30 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
31 % Définitions personnelles
32 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
34 \definecolor{bleuclair}{rgb}{0.75,0.75,1.0}
35 \newcommand{\ANNOT}[1]{
39 \large\fcolorbox{black}{bleuclair}{
40 \begin{minipage}[h]{.8\linewidth}
50 \newcommand {\tv}[1] {\lVert #1 \rVert_{\rm TV}}
55 \def \ts {\tau_{\rm stop}}
58 % \theoremstyle{plain}
59 % \theoremheaderfont{\normalfont\bfseries\sc}
60 % \theorembodyfont{\slshape}
61 % \theoremsymbol{\ensuremath{\diamondsuit}}
62 % \theoremprework{\bigskip}
63 % \theoremseparator{.}
64 \newtheorem{Def}{\underline{Définition}}
65 \newtheorem{Lemma}{\underline{Lemme}}
66 \newtheorem{Theo}{\underline{Théorème}}
67 % \theoremheaderfont{\sc}
68 % \theorembodyfont{\upshape}
69 % \theoremstyle{nonumberplain}
71 % \theoremsymbol{\rule{1ex}{1ex}}
72 \newtheorem{Proof}{Preuve :}
73 \newtheorem{xpl}{Exemple illustratif :}
75 \newcommand{\vectornorm}[1]{\ensuremath{\left|\left|#1\right|\right|_2}}
76 %\newcommand{\ie}{\textit{i.e.}}
77 \newcommand{\Nats}[0]{\ensuremath{\mathbb{N}}}
78 \newcommand{\R}[0]{\ensuremath{\mathbb{R}}}
79 \newcommand{\Z}[0]{\ensuremath{\mathbb{Z}}}
80 \newcommand{\Bool}[0]{\ensuremath{\mathds{B}}}
81 \newcommand{\rel}[0]{\ensuremath{{\mathcal{R}}}}
82 \newcommand{\Gall}[0]{\ensuremath{\mathcal{G}}}
85 \newcommand{\JFC}[1]{\begin{color}{green}\textit{}\end{color}}
86 \newcommand{\CG}[1]{\begin{color}{blue}\textit{}\end{color}}
87 \newcommand{\og}[0]{``}
88 \newcommand{\fg}[1]{''}
99 \author{Jean-François Couchot, Christophe Guyeux, Pierre-Cyrile Heam}
100 \address{Institut FEMTO-ST, Université de Franche-Comté, Belfort, France}
102 \author{Sylvain Contassot-Vivier}
103 \address{Loria - UMR 7503, Université de Lorraine, Nancy, France}
108 This paper extends the results presented in~\cite{bcgr11ip}
109 and~\cite{chgw14oip} by using the \emph{chaotic} updating mode, in the sense
110 of F. Robert~\cite{Robert}. In this mode, several components of the system
111 may be updated at each iteration. At the theoretical level, we show that
112 the properties of chaos and uniformity of the obtained PRNG are preserved.
113 At the practical level, we show that the algorithm that builds strongly
114 connected iteration graphs, with doubly stochastic Markov matrix, has a
118 \section{Introduction}
121 \section{\uppercase{Preliminaries}}\label{sec:preliminaries}
122 \input{preliminaries}
125 \section{Proof Of Chaos}
129 \section{Stopping Time}
132 % Donner la borne du stopping time quand on marche dedans (nouveau).
133 % Énoncer le problème de la taille de cette borne (elle est certes finie, mais grande).
138 \section{Quality study of the strategy}
139 %6) Se pose alors la question de comment générer une stratégie de "bonne qualité". Par exemple, combien de générateurs aléatoires embarquer ? (nouveau)
142 \section{Expérimentations}
148 %\acknowledgements{...}
151 \bibliography{biblio}