\documentclass{ita}
\usepackage{graphicx}
\usepackage{dsfont}
\usepackage{stmaryrd}
\usepackage[font=footnotesize]{subfig}
\usepackage{ifthen}
\usepackage{color}
\usepackage{algorithm2e}
\usepackage[hyperfirst=true,nogroupskip,nonumberlist,xindy]{glossaries}



%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Définitions personnelles
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\definecolor{bleuclair}{rgb}{0.75,0.75,1.0}
\newcommand{\ANNOT}[1]{
  ~\linebreak
  \centerline{
    {\Huge{\danger}}
    \large\fcolorbox{black}{bleuclair}{
      \begin{minipage}[h]{.8\linewidth}
        #1
      \end{minipage}
    }
    {\Huge{\danger}}
  }
}

% \theoremstyle{plain}
% \theoremheaderfont{\normalfont\bfseries\sc}
% \theorembodyfont{\slshape}
% \theoremsymbol{\ensuremath{\diamondsuit}}
% \theoremprework{\bigskip}
% \theoremseparator{.}
\newtheorem{Def}{\underline{Définition}}
\newtheorem{Lemma}{\underline{Lemme}}
\newtheorem{Theo}{\underline{Théorème}}
% \theoremheaderfont{\sc}
% \theorembodyfont{\upshape}
% \theoremstyle{nonumberplain}
% \theoremseparator{}
% \theoremsymbol{\rule{1ex}{1ex}}
\newtheorem{Proof}{Preuve :}
\newtheorem{xpl}{Exemple illustratif :}

\newcommand{\vectornorm}[1]{\ensuremath{\left|\left|#1\right|\right|_2}}
%\newcommand{\ie}{\textit{i.e.}}
\newcommand{\Nats}[0]{\ensuremath{\mathbb{N}}}
\newcommand{\R}[0]{\ensuremath{\mathbb{R}}}
\newcommand{\Z}[0]{\ensuremath{\mathbb{Z}}}
\newcommand{\Bool}[0]{\ensuremath{\mathds{B}}}
\newcommand{\rel}[0]{\ensuremath{{\mathcal{R}}}}
\newcommand{\Gall}[0]{\ensuremath{\mathcal{G}}}


\newcommand{\JFC}[1]{\begin{color}{green}\textit{}\end{color}}
\newcommand{\CG}[1]{\begin{color}{blue}\textit{}\end{color}}
\newcommand{\og}[0]{``}
\newcommand{\fg}[1]{''}




\makeglossaries
\loadglsentries{glossaire}


\title{XXX}

\begin{document}

\author{Jean-François Couchot, Christophe Guyeux, Pierre-Cyrile Heam}
\address{Institut FEMTO-ST, Université de Franche-Comté, Belfort, France}

\author{Sylvain Contassot-Vivier}
\address{Loria - UMR 7503, Université de Lorraine, Nancy, France}

\date{...}

\begin{abstract}
This   paper  extends   the  results   presented  in~\cite{bcgr11ip}
and~\cite{chgw14oip} by using the \emph{chaotic} updating mode, in the sense
of F.  Robert~\cite{Robert}.  In this mode, several components of the system
may be  updated at each iteration.   At the theoretical level,  we show that
    the properties of  chaos and uniformity of the  obtained PRNG are preserved.
    At  the practical level,  we show  that the  algorithm that  builds strongly
    connected  iteration graphs,  with doubly  stochastic Markov  matrix,  has a
    reduced mixing time.
\end{abstract}

\section{Introduction}
\input{intro}

\section{Préliminaires}
\label{section:chaos}
\input{sdd}

\section{Caractérisation des systèmes dynamiques booléens chaotiques}
\label{section:caracterisation}
\input{cs}


\section{Application  à la génération de nombres pseudo-aléatoires}
\label{section:genpa}
\input{exp}


\section{Expérimentations}
\label{section:expes}
\input{nist}

\section{Conclusion}
\input{conclusion}

%\acknowledgements{...}

\appendix%\begin{annex}
   \section{Preuve de continuité de $G_f$ dans $(\mathcal{X},d)$}
  \label{anx:cont}
  \input{annexecontinuite}


\printglossaries

\bibliography{biblio}

\end{document}
