From d5564eebac75434c4a578ef739c24590e52b7844 Mon Sep 17 00:00:00 2001 From: couchot Date: Sat, 14 Mar 2015 16:42:10 +0100 Subject: [PATCH] typos --- exp.tex | 2 +- prng.tex | 6 +++--- 2 files changed, 4 insertions(+), 4 deletions(-) diff --git a/exp.tex b/exp.tex index 931aec7..0b9a421 100644 --- a/exp.tex +++ b/exp.tex @@ -1,4 +1,4 @@ -Cette section présente une application directe de la théorie développée ci-avant +X section présente une application directe de la théorie développée ci-avant à la génération de nombres pseudo-aléatoires. On présente tout d'abord le générateur basé sur des fonctions chaotiques (section~\ref{sub:prng:algo}), puis comment intégrer la contrainte de \gls{distributionuniforme} (cf. glossaire) diff --git a/prng.tex b/prng.tex index 0667cca..db2e5e7 100644 --- a/prng.tex +++ b/prng.tex @@ -47,8 +47,8 @@ Sect.~\ref{sec:hypercube}. Notice that the chaos property of $G_f$ given in Sect.\ref{sec:proofOfChaos} only requires that the graph $\Gamma_{\{b\}}(f)$ is strongly connected. -Since the $\chi_{\textit{15Rairo}}$ algorithme -only adds propbability constraints on existing edges, +Since the $\chi_{\textit{15Rairo}}$ algorithm +only adds probability constraints on existing edges, it preserves this property. @@ -72,7 +72,7 @@ In this table the column which is labeled with $b$ (respectively by $E[\tau]$) gives the practical mixing time where the deviation to the standard distribution is less than $10^{-6}$ -(resp. the theoretical upper bound ofstopping time as described in +(resp. the theoretical upper bound of stopping time as described in Sect.~\ref{sec:hypercube}). -- 2.39.5