X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hdrcouchot.git/blobdiff_plain/dd837d463f86ebb399eb1cac274139e98815fdd1..fa0f3e5db965380aa9a72b5098cd11cfee161c6d:/main.tex?ds=inline

diff --git a/main.tex b/main.tex
index fdcf059..dcbfa74 100644
--- a/main.tex
+++ b/main.tex
@@ -198,14 +198,17 @@ On montre qu'on a des rÃ©sultats similaires.
 \section{GÃ©nÃ©rer des fonctions chaotiques}
 \input{11FCT} 
 
-
 \chapter{PrÃ©diction des systÃ¨mes chaotiques}
-
 \input{chaosANN}
 
 
 
 
+\part{Applications Ã  la gÃ©nÃ©ration de nombres pseudo alÃ©atoires}
+
+\chapter{CaractÃ©risation des gÃ©nÃ©rateurs chaotiques}
+\input{15RairoGen}
+
 
 
 
@@ -226,6 +229,24 @@ One challenge of this work should consist in weakening this constraint.
 We plan as future work to take into account other automatic approaches 
 to discharge proofs notably by deductive analysis~\cite{CGK05}. 
 
+\JFC{Perspective ANN}
+
+In  future  work we  intend  to  enlarge  the comparison  between  the
+learning   of  truly   chaotic  and   non-chaotic   behaviors.   Other
+computational intelligence tools such  as support vector machines will
+be investigated  too, to  discover which tools  are the  most relevant
+when facing a truly chaotic phenomenon.  A comparison between learning
+rate  success  and  prediction  quality will  be  realized.   Concrete
+consequences in biology, physics, and computer science security fields
+will then be stated.
+Ajouter lefait que le codede gray n'est pas optimal.
+On pourrait aussi travailler Ã  Ã©tablir un classement qui prÃ©serverait 
+le fait que deux configurations voisines seraient reprÃ©sentÃ©es 
+par deux entiers voisins.
+ 
+
+
+
 
 % \chapter{Conclusion}
 
