From: couturie <raphael.couturier@univ-fcomte.Fr>
Date: Sun, 28 Jun 2015 15:03:23 +0000 (+0200)
Subject: modif reponse aux reviewers
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/prng_gpu.git/commitdiff_plain/6f71a8e8c76974cada0ce140b630cb1c38835336?ds=sidebyside

modif reponse aux reviewers
---

diff --git a/Revision.tex b/Revision.tex
index 4356cf2..d2dab82 100644
--- a/Revision.tex
+++ b/Revision.tex
@@ -35,7 +35,7 @@ One minor piece that I didn't find addressed in the paper is the issue of how th
 Excellent excellent work!''
 
 \medskip
-In practice the seed are generated using ISAAC which is a cryptographic PRNG. So the security of our seed lies on the security of ISAAC. We think that this is enough to consider that our seeds are sufficiently secure.
+In practice the seeds are generated using ISAAC which is a cryptographic PRNG. So the security of our seeds lies on the security of ISAAC. We think that this is enough to consider that our seeds are sufficiently secure.
 
 \end{enumerate}
 
@@ -60,7 +60,7 @@ longer period of the resultant generator compared to any of the input generators
 \medskip
 We have added the following text in Section 4.2:\\
 Obviously, when $S$ is periodic of period $p$, then $x$ is periodic too of
-period either $p$ or $2p$, depending of the fact that, after $p$ iterations,
+period either $p$ or $2p$, depending on the fact that, after $p$ iterations,
 the state of the system may or not be the same than before these iterations.
 \end{enumerate}
 
@@ -85,7 +85,7 @@ The paper has been reread by a native speaker
 While working through the paper a few minor questions arised:
 -	page 7, Algorithm 3: is the increment of i in the while loop implicit, or where is it incremented?''
 
-In fact this is implicit with the while
+In fact this is implicit with the ''while'' instruction.
 
 \item ``In Algorithm 5 and 6 threadIdx is written sometimes as threadId''
 
@@ -93,7 +93,7 @@ In fact this is implicit with the while
 
  \item ``Page 19, Algorithm 6: there are 8 random numbers and their corresponding 8 states. You state that only a few of them are used, which is reflected in the algorithm itself. Are always the same ones used, or do you also rotate there?''
 
-   In practice, 8 BBS random number are used but for each of them only the fourth last bits are used. So we used $8 \times 4=32$ bits. If we chose a bigger number of BBS, the computation is slower. That is why we have used 8 BBS which seems to be a good trade-off.
+   In practice, 8 BBS random numbers are used but for each of them only the four last bits are used. So we used $8 \times 4=32$ bits. If we chose a bigger number of BBS, the computation would slower. That is why we have used 8 BBS which seems to be a good trade-off.
    
  \item ``In the references starting on page 21, some references need a bit more work. Probably BibTeX did some magic there and needs 
    to be tweaked manually. Example Ref [7] nist needs to be NIST.''
@@ -111,7 +111,7 @@ In fact this is implicit with the while
 mathematically oriented journal, as the focus on supercomputers and supercomputing capabilities is not as strong in this paper. 
 Nevertheless, I recommend the paper for publication.''
 
-In fact there are different part in this paper, we have chosen the Journal of Supercomputing because for previous submussions this journal has a wide audience and it is of really good quality.
+In fact there are different parts in this paper, we have chosen the Journal of Supercomputing because, for previous submissions to this journal, we had interesting reviews and because this journal has a wide audience and it is of really good quality.
 \end{enumerate}