wanyu/IteraTeR_v2 huggingface dataset:
Original:  While in  steganography we hide information in the least important bits, this time we would like to create codes resembling given picture - hide information in the freedom of producing grayness in black and white picture using halftone technique  .
Revised:  While in standard steganography we hide information in the least important bits, this time we would like to create codes resembling given picture - hide information in the freedom of producing grayness in black and white picture using halftone technique .
Edit intent: clarity
Original:  While in  steganography we hide information in the least important bits, this time we would like to create codes resembling given picture - hide information in the freedom of producing grayness in black and white picture using halftone technique  .
Revised:  While in steganography we hide information in the least important bits, this time we create codes resembling given picture - hide information in the freedom of producing grayness in black and white picture using halftone technique .
Edit intent: coherence
Original:  While in  steganography we hide information in the least important bits, this time we would like to create codes resembling given picture - hide information in the freedom of producing grayness in black and white picture using halftone technique  .
Revised:  While in steganography we hide information in the least important bits, this time we would like to create codes resembling given picture - hide information in the freedom of realizing grayness by black and white picture using halftone technique .
Edit intent: clarity
Original:  While in  steganography we hide information in the least important bits, this time we would like to create codes resembling given picture - hide information in the freedom of producing grayness in black and white picture using halftone technique  .
Revised:  While in steganography we hide information in the least important bits, this time we would like to create codes resembling given picture - hide information in the freedom of producing grayness in black and white pixels using halftone technique .
Edit intent: clarity
Original: Let S be a two colored (red and blue) set of n points in the plane.
Revised: Let S be a 2-colored (red and blue) set of n points in the plane.
Edit intent: fluency
Original:  A subset I of S is an island if there is a convex set C such that I=C\cap S.
Revised:  A subset I of S is an island if there exits a convex set C such that I=C\cap S.
Edit intent: clarity
Original:  This concept of was recently defined by Bereg et al. [CGTA 2013].
Revised:  This concept was recently defined by Bereg et al. [CGTA 2013].
Edit intent: clarity
Original: The stable allocation problem is one of the broadest extensions of the  stable marriage problem on bipartite graphs.
Revised: The stable allocation problem is one of the broadest extensions of the well-known stable marriage problem on bipartite graphs.
Edit intent: clarity
Original:  With this we also show that random best response strategies converge to a stable allocation with probability one .
Revised:  With this we also show that random best response strategies lead to a stable allocation with probability one .
Edit intent: clarity
Original: Many organisms live in populations structured by class and location , exhibit plastic responses to their environment and their social partners, and are subject to non-additive ecological and fitness effects.
Revised: Many organisms live in populations structured by space and by class , exhibit plastic responses to their environment and their social partners, and are subject to non-additive ecological and fitness effects.
Edit intent: clarity
Original: Many organisms live in populations structured by class and location , exhibit plastic responses to their environment and their social partners, and are subject to non-additive ecological and fitness effects.
Revised: Many organisms live in populations structured by class and location , exhibit plastic responses to their social partners, and are subject to non-additive ecological and fitness effects.
Edit intent: clarity
Original:  Using models for both discrete and continuous phenotypes, we show that analyzing these factors into a consistent framework reveals that they generically interact with one another in ways not previously emphasized or recognized . Specifically, behavioral responses  , genetic assortment  , and synergy all interact in non-trivial ways that cannot be summarized by simple summary indices.
Revised:  Using models for both discrete and continuous phenotypes, we show that analyzing these factors in a consistent framework reveals that they generically interact with one another in ways not previously emphasized or recognized . Specifically, behavioral responses , genetic assortment , and synergy all interact in non-trivial ways that cannot be summarized by simple summary indices.
Edit intent: fluency
Original:  Using models for both discrete and continuous phenotypes, we show that analyzing these factors into a consistent framework reveals that they generically interact with one another in ways not previously emphasized or recognized . Specifically, behavioral responses  , genetic assortment  , and synergy all interact in non-trivial ways that cannot be summarized by simple summary indices.
Revised:  Using models for both discrete and continuous phenotypes, we show that analyzing these factors into a consistent framework reveals that they interact with one another in ways not previously emphasized or recognized . Specifically, behavioral responses , genetic assortment , and synergy all interact in non-trivial ways that cannot be summarized by simple summary indices.
Edit intent: clarity
Original:  Using models for both discrete and continuous phenotypes, we show that analyzing these factors into a consistent framework reveals that they generically interact with one another in ways not previously emphasized or recognized . Specifically, behavioral responses  , genetic assortment  , and synergy all interact in non-trivial ways that cannot be summarized by simple summary indices.
Revised:  Using models for both discrete and continuous phenotypes, we show that analyzing these factors into a consistent framework reveals that they generically interact with one another in ways not previously emphasized . Specifically, behavioral responses , genetic assortment , and synergy all interact in non-trivial ways that cannot be summarized by simple summary indices.
Edit intent: clarity
Original:  Using models for both discrete and continuous phenotypes, we show that analyzing these factors into a consistent framework reveals that they generically interact with one another in ways not previously emphasized or recognized . Specifically, behavioral responses  , genetic assortment  , and synergy all interact in non-trivial ways that cannot be summarized by simple summary indices.
Revised:  Using models for both discrete and continuous phenotypes, we show that analyzing these factors into a consistent framework reveals that they generically interact with one another in ways not previously emphasized or recognized . Specifically, behavioral responses , genetic assortment , and synergy interact in non-trivial ways that cannot be summarized by simple summary indices.
Edit intent: clarity
Original:  Using models for both discrete and continuous phenotypes, we show that analyzing these factors into a consistent framework reveals that they generically interact with one another in ways not previously emphasized or recognized . Specifically, behavioral responses  , genetic assortment  , and synergy all interact in non-trivial ways that cannot be summarized by simple summary indices.
Revised:  Using models for both discrete and continuous phenotypes, we show that analyzing these factors into a consistent framework reveals that they generically interact with one another in ways not previously emphasized or recognized . Specifically, behavioral responses , genetic assortment , and synergy all interact in non-trivial ways that cannot be easily captured by simple summary indices.
Edit intent: clarity
Original:  Social evolution theory has long recognized that all of these factors can lead to different selection pressures but has only recently has attempted to synthesize how these factors interact.
Revised:  Social evolution theory has long recognized that all of these factors can lead to different selection pressures but has only recently attempted to synthesize how these factors interact.
Edit intent: fluency
Original:  Using models for both discrete and continuous phenotypes, we show that analyzing these factors in a consistent framework reveals that they interact with one another in ways not previously emphasized . Specifically, behavioral responses (reciprocity), genetic assortment (relatedness) , and synergy interact in non-trivial ways that cannot be easily captured by simple summary indices  .
Revised:  Using models for both discrete and continuous phenotypes, we show that analyzing these factors in a consistent framework reveals that they interact with one another in ways previously overlooked . Specifically, behavioral responses (reciprocity), genetic assortment (relatedness) , and synergy interact in non-trivial ways that cannot be easily captured by simple summary indices .
Edit intent: clarity
Original:  Using models for both discrete and continuous phenotypes, we show that analyzing these factors in a consistent framework reveals that they interact with one another in ways not previously emphasized . Specifically, behavioral responses (reciprocity), genetic assortment (relatedness) , and synergy interact in non-trivial ways that cannot be easily captured by simple summary indices  .
Revised:  Using models for both discrete and continuous phenotypes, we show that analyzing these factors in a consistent framework reveals that they interact with one another in ways not previously emphasized . Specifically, behavioral responses (reciprocity), genetic relatedness , and synergy interact in non-trivial ways that cannot be easily captured by simple summary indices .
Edit intent: fluency
Original:  Using models for both discrete and continuous phenotypes, we show that analyzing these factors in a consistent framework reveals that they interact with one another in ways not previously emphasized . Specifically, behavioral responses (reciprocity), genetic assortment (relatedness) , and synergy interact in non-trivial ways that cannot be easily captured by simple summary indices  .
Revised:  Using models for both discrete and continuous phenotypes, we show that analyzing these factors in a consistent framework reveals that they interact with one another in ways not previously emphasized . Specifically, behavioral responses (reciprocity), genetic assortment (relatedness) , and synergy interact in non-trivial ways that cannot be easily captured by simple summary indices of assortment .
Edit intent: clarity
Original:  Given the richness of social behavior across taxa, these interactions should be a boon for empirical research as they are likely crucial for describing the complex relationship between ecology, demography, and social behavior.
Revised:  Given the richness of social behavior across taxa, these interactions should be a boon for empirical research as they are likely crucial for describing the complex relationship linking ecology, demography, and social behavior.
Edit intent: fluency
Original:  Moreover, we show that the variance of the routing path length normalized by its expected value converges to 9\pi^2/64-1 asymptotically ;
Revised:  Moreover, we show that the variance of the routing path length converges to 9\pi^2/64-1 asymptotically ;
Edit intent: clarity
Original:  In this paper, all the translations of the KIFMM are accelerated by using the singular value decomposition (SVD) based on the low rank property of the translating matrices.
Revised:  In this paper, all the translations of the KIFMM are accelerated by using the singular value decomposition (SVD) based on the low-rank property of the translating matrices.
Edit intent: fluency
Original:  Many voting systems are  in the general case  computationally resistant to some of these manipulative actions.
Revised:  Many voting systems are , in the general case computationally resistant to some of these manipulative actions.
Edit intent: fluency
Original:  Many voting systems are  in the general case  computationally resistant to some of these manipulative actions.
Revised:  Many voting systems are in the general case , computationally resistant to some of these manipulative actions.
Edit intent: fluency
Original:  Recently, Faliszewski, Hemaspaandra, and Hemaspaandra FHH11 studied the complexity of dishonest behavior in nearly single-peaked electorates.
Revised:  Recently, Faliszewski, Hemaspaandra, and Hemaspaandra studied the complexity of dishonest behavior in nearly single-peaked electorates.
Edit intent: clarity
Original:  Furthermore, we explore the relations between several notions of early single-peakedness and study the complexity of manipulation for nearly single-peaked  elections.
Revised:  Furthermore, we explore the relations between several notions of nearly single-peakedness and study the complexity of manipulation for nearly single-peaked elections.
Edit intent: clarity
Original:  Many voting systems are, in the general case, computationally resistant to some of these manipulative actions.
Revised:  Many voting rules are, in the general case, computationally resistant to some of these manipulative actions.
Edit intent: clarity
Original:  However when restricted to single-peaked electorates, these systems suddenly become easy to manipulate.
Revised:  However when restricted to single-peaked electorates, these rules suddenly become easy to manipulate.
Edit intent: clarity
Original:   Furthermore, we explore the relations between several notions of nearly single-peakedness and study the complexity of manipulation for nearly single-peaked veto elections .
Revised:  Furthermore, we explore the relations between the new notions introduced in this paper and existing notions from the literature .
Edit intent: clarity
Original:  In case the single-peaked axis is given, we show that determining the distance is always computable in polynomial time.
Revised:  In case the single-peaked axis is given, we show that determining the distance is always possible in polynomial time.
Edit intent: clarity
Original: * This is an oracle that takes as input a subset S \subseteq [N] of the domain [N] of the unknown probability distribution %DIFDELCMD < \D %DIFDELCMD < %%%  and returns a draw from the conditional probability distribution %DIFDELCMD < \D %DIFDELCMD < %%%  restricted to S.
Revised: * This is an oracle that takes as input a subset S \subseteq [N] of the domain [N] of the unknown probability distribution %DIFDELCMD < \D %DIFDELCMD < %%% D and returns a draw from the conditional probability distribution %DIFDELCMD < \D %DIFDELCMD < %%% restricted to S.
Edit intent: clarity
Original: * This is an oracle that takes as input a subset S \subseteq [N] of the domain [N] of the unknown probability distribution %DIFDELCMD < \D %DIFDELCMD < %%%  and returns a draw from the conditional probability distribution %DIFDELCMD < \D %DIFDELCMD < %%%  restricted to S.
Revised: * This is an oracle that takes as input a subset S \subseteq [N] of the domain [N] of the unknown probability distribution %DIFDELCMD < \D %DIFDELCMD < %%% and returns a draw from the conditional probability distribution %DIFDELCMD < \D %DIFDELCMD < %%% D restricted to S.
Edit intent: clarity
Original: MicroRNAs are small noncoding RNAs that regulate genes post- transciptionally by binding and degrading target eukaryotic mR- NAs .
Revised: MicroRNAs are small noncoding RNAs that regulate genes post-transciptionally by binding and degrading target eukaryotic mR- NAs .
Edit intent: fluency
Original: MicroRNAs are small noncoding RNAs that regulate genes post- transciptionally by binding and degrading target eukaryotic mR- NAs .
Revised: MicroRNAs are small noncoding RNAs that regulate genes post- transciptionally by binding and degrading target eukaryotic mRNAs .
Edit intent: fluency
Original:  This suggests a new experimental strategy for uncovering the microRNA-mRNA interactions and testing the competing endogenous RNA (ceRNA) hypothesis.
Revised:  We conclude by discussing possible experimental strategies for uncovering the microRNA-mRNA interactions and testing the competing endogenous RNA (ceRNA) hypothesis.
Edit intent: clarity
Original:  Given  a graph G with a vertex s there is an unknown path starting from s.
Revised:  Given a graph G and a vertex s there is an unknown path starting from s.
Edit intent: fluency
Original:  Finally, we consider the case when the graph G is a grid graph , in which case using the connection with separators, we give asymptotically tight bounds ( as a function of the size of the grid n, in case the dimension of the grid d is considered to be fixed) for variants of the above search problem.
Revised:  Finally, we consider the case when the graph G is a grid graph . In this case, using the connection with separators, we give asymptotically tight bounds ( as a function of the size of the grid n, in case the dimension of the grid d is considered to be fixed) for variants of the above search problem.
Edit intent: coherence
Original:  Finally, we consider the case when the graph G is a grid graph , in which case using the connection with separators, we give asymptotically tight bounds ( as a function of the size of the grid n, in case the dimension of the grid d is considered to be fixed) for variants of the above search problem.
Revised:  Finally, we consider the case when the graph G is a grid graph , in which case using the connection with separators, we give asymptotically tight bounds as a function of the size of the grid n, in case the dimension of the grid d is considered to be fixed) for variants of the above search problem.
Edit intent: fluency
Original:  Finally, we consider the case when the graph G is a grid graph , in which case using the connection with separators, we give asymptotically tight bounds ( as a function of the size of the grid n, in case the dimension of the grid d is considered to be fixed) for variants of the above search problem.
Revised:  Finally, we consider the case when the graph G is a grid graph , in which case using the connection with separators, we give asymptotically tight bounds ( as a function of the size of the grid , if the dimension of the grid d is considered to be fixed) for variants of the above search problem.
Edit intent: clarity
Original: Wireless sensor networks are  characterized by resource challenged nodes.
Revised: Wireless sensor networks are normally characterized by resource challenged nodes.
Edit intent: coherence
Original:  Since the communication is the energy bottleneck in these networks, minimizing communication overhead is important.
Revised:  Since communication costs the most in terms of energy in these networks, minimizing communication overhead is important.
Edit intent: clarity
Original:  Since the communication is the energy bottleneck in these networks, minimizing communication overhead is important.
Revised:  Since the communication is the energy bottleneck in these networks, minimizing this overhead is important.
Edit intent: clarity
Original: The IEEE 754-2008 standard recommends the correct rounding of  elementary functions.
Revised: The IEEE 754-2008 standard recommends the correct rounding of some elementary functions.
Edit intent: clarity
Original:  We consider in this paper accelerating such computations, namely Lef\`evre algorithm , on Graphics Processing Units ( GPU ) which are massively parallel architectures with a partial SIMD execution (Single Instruction Multiple Data).
Revised:  We consider in this paper accelerating such computations, namely Lefe'vre algorithm on Graphics Processing Units ( GPU ) which are massively parallel architectures with a partial SIMD execution (Single Instruction Multiple Data).
Edit intent: fluency
Original:  We consider in this paper accelerating such computations, namely Lef\`evre algorithm , on Graphics Processing Units ( GPU ) which are massively parallel architectures with a partial SIMD execution (Single Instruction Multiple Data).
Revised:  We consider in this paper accelerating such computations, namely Lef\`evre algorithm , on Graphics Processing Units ( GPUs ) which are massively parallel architectures with a partial SIMD execution (Single Instruction Multiple Data).
Edit intent: fluency
Original:  We also present an efficient hybrid CPU-GPU deployment of the generation of  polynomial approximations required in Lef\`evre algorithm.
Revised:  We also present an efficient hybrid CPU-GPU deployment of the generation of the polynomial approximations required in Lef\`evre algorithm.
Edit intent: fluency
Original:  However, a bounded medium , such as a concrete slab , is usually dispersive and damped.
Revised:  However, a bounded medium such as a concrete slab , is usually dispersive and damped.
Edit intent: fluency
Original:  This studydemonstrates that under such conditions, assimilating the concrete slab  to a thin plate and considering a Kelvin-Voigt damping model, the{\em perceived propagation velocity  decreases when the source-sensor distance increases.
Revised:  In this study, we demonstrate that under such conditions, assimilating the concrete slab to a thin plate and considering a Kelvin-Voigt damping model, the{\em perceived propagation velocity decreases when the source-sensor distance increases.
Edit intent: fluency
Original:  This studydemonstrates that under such conditions, assimilating the concrete slab  to a thin plate and considering a Kelvin-Voigt damping model, the{\em perceived propagation velocity  decreases when the source-sensor distance increases.
Revised:  This studydemonstrates that under such conditions, the concrete slab to a thin plate and considering a Kelvin-Voigt damping model, the{\em perceived propagation velocity decreases when the source-sensor distance increases.
Edit intent: clarity
Original:  This studydemonstrates that under such conditions, assimilating the concrete slab  to a thin plate and considering a Kelvin-Voigt damping model, the{\em perceived propagation velocity  decreases when the source-sensor distance increases.
Revised:  This studydemonstrates that under such conditions, assimilating the concrete slab to a thin plate ; considering a Kelvin-Voigt damping model, the{\em perceived propagation velocity decreases when the source-sensor distance increases.
Edit intent: coherence
Original:  This studydemonstrates that under such conditions, assimilating the concrete slab  to a thin plate and considering a Kelvin-Voigt damping model, the{\em perceived propagation velocity  decreases when the source-sensor distance increases.
Revised:  This studydemonstrates that under such conditions, assimilating the concrete slab to a thin plate and considering a Kelvin-Voigt damping model, the{\em perceived propagation velocity , which decreases when the source-sensor distance increases.
Edit intent: clarity
Original:  Although bacterial communities associated with Drosophila might be important for many aspects of Drosophila biology, little is known about their diversity and compositionor the factors shaping these communities .
Revised:  Although bacterial communities associated with Drosophila might be important for many aspects of Drosophila biology, knowledge about their diversity and compositionor the factors shaping these communities .
Edit intent: clarity