wanyu/IteraTeR_v2 huggingface dataset:
Original:  Then, two kinds of end-to-end methods based on convolutional neural networks : P-CNN, H-CNN , are proposed to achieve robust CE forensics when JPEG compression and  histogram-based anti-forensics attack is applied as an pre/post processing, respectively.
Revised:  Then, two kinds of end-to-end methods based on convolutional neural networks : P-CNN, H-CNN , are proposed to achieve robust CE forensics when JPEG compression and histogram-based anti-forensics attack are applied as pre/post processing, respectively.
Edit intent: fluency
Original:  The experimental results prove that the proposed methods have much better performance than the stateof- the-art schemes.
Revised:  Experimental results show that the proposed methods have much better performance than the stateof- the-art schemes.
Edit intent: coherence
Original:  The experimental results prove that the proposed methods have much better performance than the stateof- the-art schemes.
Revised:  The experimental results prove that the proposed methods produce much better performance than the stateof- the-art schemes.
Edit intent: clarity
Original:  The experimental results prove that the proposed methods have much better performance than the stateof- the-art schemes.
Revised:  The experimental results prove that the proposed methods have much better performance than the state-of-the-art schemes.
Edit intent: fluency
Original: Contrast enhancement (CE) forensics has always been of concern to image forensics community.
Revised: Contrast enhancement (CE) forensics has always been ofconcern to image forensics community.
Edit intent: fluency
Original:  It can provide an effective rule for recovering image history and identifying tampered images.
Revised:  It can provide aneffective tool for recovering image history and identifying tampered images.
Edit intent: clarity
Original:  It can provide an effective rule for recovering image history and identifying tampered images.
Revised:  It can provide an effective rule for recovering image history and identifyingtampered images.
Edit intent: fluency
Original:  Although a number of algorithms have been proposed, the robustness of CE forensics techniques for common pre/post processing is unsatisfactory.
Revised:  Although several CE forensic algorithmshave been proposed, the robustness of CE forensics techniques for common pre/post processing is unsatisfactory.
Edit intent: clarity
Original:  Attenuate such deficiency, in this letter we first present a theoretical analysis of the robustness and stability of feature space in pixel and  histogram domains.
Revised:  Attenuate such deficiency, inthis paper we first present a theoretical analysis of the robustness and stability of feature space in pixel and histogram domains.
Edit intent: clarity
Original:  Then, two kinds of end-to-end methods based on convolutional neural networks (P-CNN, H-CNN) are proposed to achieve robust CE forensics when JPEG compression and the histogram-based anti-forensics attack are applied as pre/post processing, respectively . Experimental results show that the proposed methods produce much better performance than the state-of-the-art schemes .
Revised:  Then, insuch two domains, two end-to-end methods based on convolutional neural networks (P-CNN, H-CNN) are proposed to achieve robust CE forensics when JPEG compression and the histogram-based anti-forensics attack are applied as pre/post processing, respectively . Experimental results show that the proposed methods produce much better performance than the state-of-the-art schemes .
Edit intent: clarity
Original:  Then, two kinds of end-to-end methods based on convolutional neural networks (P-CNN, H-CNN) are proposed to achieve robust CE forensics when JPEG compression and the histogram-based anti-forensics attack are applied as pre/post processing, respectively . Experimental results show that the proposed methods produce much better performance than the state-of-the-art schemes .
Revised:  Then, two kinds of end-to-end methods based on convo-lutional neural networks (P-CNN, H-CNN) are proposed to achieve robust CE forensics when JPEG compression and the histogram-based anti-forensics attack are applied as pre/post processing, respectively . Experimental results show that the proposed methods produce much better performance than the state-of-the-art schemes .
Edit intent: fluency
Original:  Then, two kinds of end-to-end methods based on convolutional neural networks (P-CNN, H-CNN) are proposed to achieve robust CE forensics when JPEG compression and the histogram-based anti-forensics attack are applied as pre/post processing, respectively . Experimental results show that the proposed methods produce much better performance than the state-of-the-art schemes .
Revised:  Then, two kinds of end-to-end methods based on convolutional neural networks (P-CNN, H-CNN) are proposed toachieve robust CE forensics when JPEG compression and the histogram-based anti-forensics attack are applied as pre/post processing, respectively . Experimental results show that the proposed methods produce much better performance than the state-of-the-art schemes .
Edit intent: fluency
Original:  Then, two kinds of end-to-end methods based on convolutional neural networks (P-CNN, H-CNN) are proposed to achieve robust CE forensics when JPEG compression and the histogram-based anti-forensics attack are applied as pre/post processing, respectively . Experimental results show that the proposed methods produce much better performance than the state-of-the-art schemes .
Revised:  Then, two kinds of end-to-end methods based on convolutional neural networks (P-CNN, H-CNN) are proposed to achieve robust CE forensics against pre-JPEG compressionand anti-forensics attack are applied as pre/post processing, respectively . Experimental results show that the proposed methods produce much better performance than the state-of-the-art schemes .
Edit intent: clarity
Original:  Then, two kinds of end-to-end methods based on convolutional neural networks (P-CNN, H-CNN) are proposed to achieve robust CE forensics when JPEG compression and the histogram-based anti-forensics attack are applied as pre/post processing, respectively . Experimental results show that the proposed methods produce much better performance than the state-of-the-art schemes .
Revised:  Then, two kinds of end-to-end methods based on convolutional neural networks (P-CNN, H-CNN) are proposed to achieve robust CE forensics when JPEG compression and the histogram-based anti-forensics attacks . Experimental results show that the proposed methods produce much better performance than the state-of-the-art schemes .
Edit intent: clarity
Original:  Then, two kinds of end-to-end methods based on convolutional neural networks (P-CNN, H-CNN) are proposed to achieve robust CE forensics when JPEG compression and the histogram-based anti-forensics attack are applied as pre/post processing, respectively . Experimental results show that the proposed methods produce much better performance than the state-of-the-art schemes .
Revised:  Then, two kinds of end-to-end methods based on convolutional neural networks (P-CNN, H-CNN) are proposed to achieve robust CE forensics when JPEG compression and the histogram-based anti-forensics attack are applied as pre/post processing, respectively . Experimental results show that theproposed methods achieve much better performance than the state-of-the-art schemes .
Edit intent: fluency
Original:  Evaluations in a near-memory computing scenario where the accelerator is placed on the logic base die of a Hybrid Memory Cube demonstrate a 2.6 x energy efficiency improvement  over contemporary GPUs at 4.4x less silicon area, and an average compute performance of 1.01 Tflop/s for training large state-of-the-art networks with full floating-point precision.
Revised:  Evaluations in a near-memory computing with NTX embedded into residual area on the Logic Base die of a Hybrid Memory Cube demonstrate a 2.6 x energy efficiency improvement over contemporary GPUs at 4.4x less silicon area, and an average compute performance of 1.01 Tflop/s for training large state-of-the-art networks with full floating-point precision.
Edit intent: clarity
Original:  Evaluations in a near-memory computing scenario where the accelerator is placed on the logic base die of a Hybrid Memory Cube demonstrate a 2.6 x energy efficiency improvement  over contemporary GPUs at 4.4x less silicon area, and an average compute performance of 1.01 Tflop/s for training large state-of-the-art networks with full floating-point precision.
Revised:  Evaluations in a near-memory computing scenario where the accelerator is placed on the logic base die of a Hybrid Memory Cube demonstrate a 2.6 x energy efficiency improvement over contemporary GPUs at 4.4x less silicon area, and a compute performance of 1.01 Tflop/s for training large state-of-the-art networks with full floating-point precision.
Edit intent: clarity
Original: Until recently, those deep steganalyzers in spatial domain are all designed for gray-scale images.
Revised: Until recently, deep steganalyzers in spatial domain are all designed for gray-scale images.
Edit intent: clarity
Original: Until recently, those deep steganalyzers in spatial domain are all designed for gray-scale images.
Revised: Until recently, those deep steganalyzers in spatial domain have been all designed for gray-scale images.
Edit intent: fluency
Original:  The experimental results show that our proposed network outperform other state-of-the-art color image steganalytic models either hand-crafted or learned using deep networks in the literature by a clear margin.
Revised:  The experimental results show that our proposed network outperforms other state-of-the-art color image steganalytic models either hand-crafted or learned using deep networks in the literature by a clear margin.
Edit intent: fluency
Original: The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer enables the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete logarithm over Abelian groups,  and phase estimation  .
Revised: The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete logarithm over Abelian groups, and phase estimation .
Edit intent: clarity
Original: The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer enables the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete logarithm over Abelian groups,  and phase estimation  .
Revised: The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer enables the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete logarithm over Abelian groups, solving systems of linear equations, and phase estimation .
Edit intent: clarity
Original: The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer enables the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete logarithm over Abelian groups,  and phase estimation  .
Revised: The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer enables the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete logarithm over Abelian groups, and phase estimation , to name a few .
Edit intent: clarity
Original:  In this paper  we show how to obtain approximate QFT with the T-count of O(n \log(n)).
Revised:  In this paper , we show how to obtain approximate QFT with the T-count of O(n \log(n)).
Edit intent: fluency
Original: The  Minimum Error Correction (MEC) approach is used as a metric for reconstruction of haplotypes from NGS reads.
Revised: The Minimum Error Correction (MEC) metric is often used for reconstruction of haplotypes from NGS reads.
Edit intent: clarity
Original:  In this paper, we show that the MEC may encounter with imprecise reconstructed haplotypes for some NGS devices . Specifically, using mathematical derivations, we evaluate this approach for the SOLiD, Illumina, 454, Ion, Pacific BioSciences , Oxford Nanopore , and 10X Genomics devices.
Revised:  In this paper, we show that the MEC may encounter with imprecise reconstructed haplotypes for some NGS devices . Specifically, we evaluate this approach for the SOLiD, Illumina, 454, Ion, Pacific BioSciences , Oxford Nanopore , and 10X Genomics devices.
Edit intent: coherence
Original:  The formal comparison of the MTD formula with the Pearson correlation of a time derivative reveals only minor differences, which we find negligible in practice.
Revised:  The formal comparison of the MTD formula with the Pearson correlation of the derivatives reveals only minor differences, which we find negligible in practice.
Edit intent: clarity
Original: Aim. We performed a network analysis of the spatial distribution patterns of plant species using a network approach in order to analyse the biogeographical structure of the French Mediterranean flora.
Revised: Aim. We analysed the spatial distribution patterns of plant species using a network approach in order to analyse the biogeographical structure of the French Mediterranean flora.
Edit intent: clarity
Original: Aim. We performed a network analysis of the spatial distribution patterns of plant species using a network approach in order to analyse the biogeographical structure of the French Mediterranean flora.
Revised: Aim. We performed a network analysis of the spatial distribution patterns of plant species , in order to analyse the biogeographical structure of the French Mediterranean flora.
Edit intent: coherence
Original: Aim. We performed a network analysis of the spatial distribution patterns of plant species using a network approach in order to analyse the biogeographical structure of the French Mediterranean flora.
Revised: Aim. We performed a network analysis of the spatial distribution patterns of plant species using a network approach in order to characterize the biogeographical structure of the French Mediterranean flora.
Edit intent: clarity
Original:  The proposed network approach provides a characterization of the biogeographical structure which confirms some previously recognized floristic regions in southern France, while providing more precise insights into the relationships between them .
Revised:  The proposed network approach illustrates the biogeographical structure which confirms some previously recognized floristic regions in southern France, while providing more precise insights into the relationships between them .
Edit intent: clarity
Original:  The proposed network approach provides a characterization of the biogeographical structure which confirms some previously recognized floristic regions in southern France, while providing more precise insights into the relationships between them .
Revised:  The proposed network approach provides a characterization of the biogeographical structure of the flora in southern France, while providing more precise insights into the relationships between them .
Edit intent: clarity
Original:  The proposed network approach provides a characterization of the biogeographical structure which confirms some previously recognized floristic regions in southern France, while providing more precise insights into the relationships between them .
Revised:  The proposed network approach provides a characterization of the biogeographical structure which confirms some previously recognized floristic regions in southern France, and provides precise insights into the relationships between them .
Edit intent: clarity
Original:  The proposed network approach provides a characterization of the biogeographical structure which confirms some previously recognized floristic regions in southern France, while providing more precise insights into the relationships between them .
Revised:  The proposed network approach provides a characterization of the biogeographical structure which confirms some previously recognized floristic regions in southern France, while providing more precise insights into the relationships between bioregions .
Edit intent: clarity
Original:  This approach sheds light on the historical and ecological mechanisms shaping the distribution of Mediterranean biota , and exemplify why fragmented distributions are common in the Mediterranean region  .
Revised:  This approach sheds light on ecological drivers shaping the distribution of Mediterranean biota , and exemplify why fragmented distributions are common in the Mediterranean region .
Edit intent: clarity
Original: Updating an abstract Voronoi diagram in linear time, after deletion of one site , has been an open problemfor a long time.
Revised: Updating an abstract Voronoi diagram after deletion of one site , has been an open problemfor a long time.
Edit intent: clarity
Original:  Similarly for various concrete Voronoi diagrams of generalized sites, other than points .
Revised:  Similarly for various concrete Voronoi diagrams of non-point sites .
Edit intent: clarity
Original:  In this paper we present a simple, expected linear-time algorithm to update an abstract Voronoi diagram after deletion  .
Revised:  In this paper , we present an expected linear-time algorithm to update an abstract Voronoi diagram after deletion .
Edit intent: coherence
Original:  Voronoi-like diagrams serve as intermediate structures, which are considerably simpler to compute, thus, making an expected linear-time construction possible.
Edit intent: coherence
Original:  We formalize the concept  and prove that it is robust under an insertionoperation, thus ,  enabling its use in incremental constructions  .
Revised:  We formalize the concept , and prove that it is robust under an insertionoperation, thus , enabling its use in incremental constructions .
Edit intent: fluency
Original:  We formalize the concept  and prove that it is robust under an insertionoperation, thus ,  enabling its use in incremental constructions  .
Revised:  We formalize the concept and prove that it is robust under insertion , enabling its use in incremental constructions .
Edit intent: coherence
Original:  We formalize the concept  and prove that it is robust under an insertionoperation, thus ,  enabling its use in incremental constructions  .
Revised:  We formalize the concept and prove that it is robust under an insertionoperation, thus , therefore, enabling its use in incremental constructions .
Edit intent: coherence
Original:  While it is recognized that thymic cells are 'audited' to optimize an organism's immune repertoire, whether gametogenesis could be orchestrated similarly to favor high quality gametes is uncertain.
Revised:  While it is recognized that thymic cells are 'audited' to optimize an organism's immune repertoire, whether gametogenesis could be orchestrated similarly to favour high quality gametes is uncertain.
Edit intent: fluency
Original:  This 'stress test' is achieved in the same way that thymic screening for potential immunological incompatibilities is achieved , namely by 'promiscuous' expression, under the influence of the AIRE protein, of the products of genes that are not normally specific for that organ.
Revised:  This 'stress test' is achieved in the same way that thymic screening for potential immunological incompatibilities is achieved - by 'promiscuous' expression, under the influence of the AIRE protein, of the products of genes that are not normally specific for that organ.
Edit intent: coherence
Original:  While not excluding the subsequent emergence of hybrid incompatibilities due to the intermixing of genomic sequences from parents (rather than grandparents), many observations, such as the number of proteins that are "surprising candidates for expression" during gametogenesis, can be explained on this basis  .
Revised:  While not excluding the subsequent emergence of hybrid incompatibilities due to the intermixing of genomic sequences from parents (rather than grandparents), many observations, such as the number of proteins that are aberrantly expressed during gametogenesis, can be explained on this basis .
Edit intent: clarity
Original: Many dynamic programming algorithms  are "pure" in that they only use min or max and addition operations in their recursion equations.
Revised: Many dynamic programming algorithms are "pure" in that their recursion equations only use min or max and addition operations in their recursion equations.
Edit intent: fluency
Original: Many dynamic programming algorithms  are "pure" in that they only use min or max and addition operations in their recursion equations.
Revised: Many dynamic programming algorithms are "pure" in that they only use min / max and addition operations in their recursion equations.
Edit intent: fluency
Original:  In this note, we show that for any \alpha>1-%DIFDELCMD < \lfloor %%% t/2%DIFDELCMD < \rfloor %%% ^{-1 the generating function for (list) graph homomorphisms from G to H can be calculated in subexponential time \mathcal{O}%DIFDELCMD < \left(%%% 2^{ \left(}\right)}  | V(G) | ^{\alpha}%DIFDELCMD < \MBLOCKRIGHTBRACE\right) %%% in the class of P_t-free graphs G. As a corollary, we show that the number of 3-colourings of a P_t-free graph G can be found in subexponential time.
Revised:  %DIFDELCMD < \lfloor %%% t/2%DIFDELCMD < \rfloor %%% ^{-1 the generating function for (list) graph homomorphisms from G to H can be calculated in subexponential time \mathcal{O}%DIFDELCMD < \left(%%% 2^{ \left(}\right)} | V(G) | ^{\alpha}%DIFDELCMD < \MBLOCKRIGHTBRACE\right) %%% in the class of P_t-free graphs G. As a corollary, we show that the number of 3-colourings of a P_t-free graph G can be found in subexponential time.
Edit intent: coherence
Original:  In this note, we show that for any \alpha>1-%DIFDELCMD < \lfloor %%% t/2%DIFDELCMD < \rfloor %%% ^{-1 the generating function for (list) graph homomorphisms from G to H can be calculated in subexponential time \mathcal{O}%DIFDELCMD < \left(%%% 2^{ \left(}\right)}  | V(G) | ^{\alpha}%DIFDELCMD < \MBLOCKRIGHTBRACE\right) %%% in the class of P_t-free graphs G. As a corollary, we show that the number of 3-colourings of a P_t-free graph G can be found in subexponential time.
Revised:  In this note, we show that for any \alpha>1-%DIFDELCMD < \lfloor %%% %DIFDELCMD < \rfloor %%% ^{-1 the generating function for (list) graph homomorphisms from G to H can be calculated in subexponential time \mathcal{O}%DIFDELCMD < \left(%%% 2^{ \left(}\right)} | V(G) | ^{\alpha}%DIFDELCMD < \MBLOCKRIGHTBRACE\right) %%% in the class of P_t-free graphs G. As a corollary, we show that the number of 3-colourings of a P_t-free graph G can be found in subexponential time.
Edit intent: coherence
Original:  In this note, we show that for any \alpha>1-%DIFDELCMD < \lfloor %%% t/2%DIFDELCMD < \rfloor %%% ^{-1 the generating function for (list) graph homomorphisms from G to H can be calculated in subexponential time \mathcal{O}%DIFDELCMD < \left(%%% 2^{ \left(}\right)}  | V(G) | ^{\alpha}%DIFDELCMD < \MBLOCKRIGHTBRACE\right) %%% in the class of P_t-free graphs G. As a corollary, we show that the number of 3-colourings of a P_t-free graph G can be found in subexponential time.
Revised:  In this note, we show that for any \alpha>1-%DIFDELCMD < \lfloor %%% t/2%DIFDELCMD < \rfloor %%% We show that the generating function for (list) graph homomorphisms from G to H can be calculated in subexponential time \mathcal{O}%DIFDELCMD < \left(%%% 2^{ \left(}\right)} | V(G) | ^{\alpha}%DIFDELCMD < \MBLOCKRIGHTBRACE\right) %%% in the class of P_t-free graphs G. As a corollary, we show that the number of 3-colourings of a P_t-free graph G can be found in subexponential time.
Edit intent: coherence