wanyu/IteraTeR_v2 huggingface dataset:
Original:  Using nulling detection structure employed in V-BLAST receiver, we propose a detection scheme in the destination which is able to provide a diversity order of two for all users.
Revised:  Using "nulling detection" structure employed in V-BLAST receiver, we propose a detection scheme in the destination which is able to provide a diversity order of two for all users.
Edit intent: coherence
Original:  We analytically evaluate the performance of our proposed scheme for a two-user-one-relay MARC provide a tight upper bound for both uncoded and convolutionally coded transmission blocks  .
Revised:  We analytically evaluate the performance of our proposed scheme for the MARC with two users where tight upper bounds for both uncoded and convolutionally coded transmission blocks .
Edit intent: clarity
Original:  We analytically evaluate the performance of our proposed scheme for a two-user-one-relay MARC provide a tight upper bound for both uncoded and convolutionally coded transmission blocks  .
Revised:  We analytically evaluate the performance of our proposed scheme for a two-user-one-relay MARC provide a tight upper bound for both uncoded and Convolutionally coded transmission blocks .
Edit intent: fluency
Original:  We analytically evaluate the performance of our proposed scheme for a two-user-one-relay MARC provide a tight upper bound for both uncoded and convolutionally coded transmission blocks  .
Revised:  We analytically evaluate the performance of our proposed scheme for a two-user-one-relay MARC provide a tight upper bound for both uncoded and convolutionally coded transmission blocks are provided .
Edit intent: clarity
Original:  We verify our analytical evaluations by simulations and compare the results with those of non-cooperate transmission and Alamouti's scheme for the same power and rate transmission.
Revised:  We verify our analytical evaluations by simulations and compare the results with those of noncooperative transmission and Alamouti's scheme for the same power and rate transmission.
Edit intent: fluency
Original: To better characterize how variation in regulatory sequences drives divergence in gene expression, we undertook a systematic study of transcription factor binding and gene expression in the blastoderm embryos of four species that sample much of the diversity in the 60 million-year old genus Drosophila : D. melanogaster, D. yakuba, D. pseudoobscura and D. virilis.
Revised: Extensive divergence of transcription factor binding and gene expression in the blastoderm embryos of four species that sample much of the diversity in the 60 million-year old genus Drosophila : D. melanogaster, D. yakuba, D. pseudoobscura and D. virilis.
Edit intent: clarity
Original: For any fixed integer q%DIFDELCMD < \ge %%% 2, a q-monomial has the format%DIFDELCMD < \displaystyle %DIFDELCMD < %%% x^{s_1_{i_1}x^{s_2}_{i_2}... x_{i_t}^{s_t} such that 1}%DIFDELCMD < \le %%% s_j%DIFDELCMD < \le %%% q-1, 1%DIFDELCMD < \le %%% j%DIFDELCMD < \le %%% t. We devise two algorithms in this paper.
Revised: %DIFDELCMD < \ge %%% 2, a q-monomial has the format%DIFDELCMD < \displaystyle %DIFDELCMD < %%% x^{s_1_{i_1}x^{s_2}_{i_2}... x_{i_t}^{s_t} such that 1}%DIFDELCMD < \le %%% s_j%DIFDELCMD < \le %%% q-1, 1%DIFDELCMD < \le %%% j%DIFDELCMD < \le %%% t. We devise two algorithms in this paper.
Edit intent: clarity
Original: For any fixed integer q%DIFDELCMD < \ge %%% 2, a q-monomial has the format%DIFDELCMD < \displaystyle %DIFDELCMD < %%% x^{s_1_{i_1}x^{s_2}_{i_2}... x_{i_t}^{s_t} such that 1}%DIFDELCMD < \le %%% s_j%DIFDELCMD < \le %%% q-1, 1%DIFDELCMD < \le %%% j%DIFDELCMD < \le %%% t. We devise two algorithms in this paper.
Revised: For any fixed integer q%DIFDELCMD < \ge %%% 2, a q-monomial has the format%DIFDELCMD < \displaystyle %DIFDELCMD < %%% _{i_1}x^{s_2}_{i_2}... x_{i_t}^{s_t} such that 1}%DIFDELCMD < \le %%% s_j%DIFDELCMD < \le %%% q-1, 1%DIFDELCMD < \le %%% j%DIFDELCMD < \le %%% t. We devise two algorithms in this paper.
Edit intent: clarity
Original: For any fixed integer q%DIFDELCMD < \ge %%% 2, a q-monomial has the format%DIFDELCMD < \displaystyle %DIFDELCMD < %%% x^{s_1_{i_1}x^{s_2}_{i_2}... x_{i_t}^{s_t} such that 1}%DIFDELCMD < \le %%% s_j%DIFDELCMD < \le %%% q-1, 1%DIFDELCMD < \le %%% j%DIFDELCMD < \le %%% t. We devise two algorithms in this paper.
Revised: For any fixed integer q%DIFDELCMD < \ge %%% 2, a q-monomial has the format%DIFDELCMD < \displaystyle %DIFDELCMD < %%% x^{s_1_{i_1}x^{s_2}_{i_2}... x_{i_t}^{s_t} such that 1}%DIFDELCMD < \le %%% s_j%DIFDELCMD < \le %%% q-1, 1%DIFDELCMD < \le %%% %DIFDELCMD < \le %%% t. We devise two algorithms in this paper.
Edit intent: fluency
Original: For any fixed integer q%DIFDELCMD < \ge %%% 2, a q-monomial has the format%DIFDELCMD < \displaystyle %DIFDELCMD < %%% x^{s_1_{i_1}x^{s_2}_{i_2}... x_{i_t}^{s_t} such that 1}%DIFDELCMD < \le %%% s_j%DIFDELCMD < \le %%% q-1, 1%DIFDELCMD < \le %%% j%DIFDELCMD < \le %%% t. We devise two algorithms in this paper.
Revised: For any fixed integer q%DIFDELCMD < \ge %%% 2, a q-monomial has the format%DIFDELCMD < \displaystyle %DIFDELCMD < %%% x^{s_1_{i_1}x^{s_2}_{i_2}... x_{i_t}^{s_t} such that 1}%DIFDELCMD < \le %%% s_j%DIFDELCMD < \le %%% q-1, 1%DIFDELCMD < \le %%% j%DIFDELCMD < \le %%% In this paper, we devise two algorithms in this paper.
Edit intent: clarity
Original:  Soft selective sweeps are likely either when adaptation proceeds from standing genetic variation or in large populations where adaptation is not mutation-limited . Current statistical methods are not well designed to test for soft sweeps, and thus are likely to miss these possibly numerous adaptive events because they look for characteristic reductions in heterozygosity .
Revised:  Soft selective sweeps are likely either when adaptation proceeds from standing genetic variation or in large populations where adaptation is not mutation-limited . Current statistical methods were not designed to detect soft sweeps, and thus are likely to miss these possibly numerous adaptive events because they look for characteristic reductions in heterozygosity .
Edit intent: clarity
Original:  Soft selective sweeps are likely either when adaptation proceeds from standing genetic variation or in large populations where adaptation is not mutation-limited . Current statistical methods are not well designed to test for soft sweeps, and thus are likely to miss these possibly numerous adaptive events because they look for characteristic reductions in heterozygosity .
Revised:  Soft selective sweeps are likely either when adaptation proceeds from standing genetic variation or in large populations where adaptation is not mutation-limited . Current statistical methods are not well designed to test for soft sweeps, and are therefore likely to miss these possibly numerous adaptive events because they look for characteristic reductions in heterozygosity .
Edit intent: fluency
Original:  Soft selective sweeps are likely either when adaptation proceeds from standing genetic variation or in large populations where adaptation is not mutation-limited . Current statistical methods are not well designed to test for soft sweeps, and thus are likely to miss these possibly numerous adaptive events because they look for characteristic reductions in heterozygosity .
Revised:  Soft selective sweeps are likely either when adaptation proceeds from standing genetic variation or in large populations where adaptation is not mutation-limited . Current statistical methods are not well designed to test for soft sweeps, and thus are likely to miss these possibly numerous adaptive events .
Edit intent: coherence
Original:  Here, we developed a statistical test based on a haplotype statistic, H12 , capable of detecting both hard and soft sweeps with similar power.
Revised:  Here, we develop a statistical test based on a haplotype statistic, H12 , capable of detecting both hard and soft sweeps with similar power.
Edit intent: fluency
Original:  Here, we developed a statistical test based on a haplotype statistic, H12 , capable of detecting both hard and soft sweeps with similar power.
Revised:  Here, we developed a statistical test ( H12 , capable of detecting both hard and soft sweeps with similar power.
Edit intent: clarity
Original:  We used H12 to identify multiple genomic regions that have undergone recent and strong adaptation using a population sample of fully sequenced Drosophila melanogaster strains  (DGRP).
Revised:  We use H12 to identify multiple genomic regions that have undergone recent and strong adaptation using a population sample of fully sequenced Drosophila melanogaster strains (DGRP).
Edit intent: fluency
Original:  We used H12 to identify multiple genomic regions that have undergone recent and strong adaptation using a population sample of fully sequenced Drosophila melanogaster strains  (DGRP).
Revised:  We used H12 to identify multiple genomic regions that have undergone recent and strong adaptation in a population sample of fully sequenced Drosophila melanogaster strains (DGRP).
Edit intent: fluency
Original:  We then developed a second statistical test based on a statistic H2/H1 | H12, to test whether a given selective sweep detected by H12 is hard or soft . Surprisingly, when applying the test based on H2/H1 | H12 to the top 50 most extreme H12 candidates in the DGRP data  , we reject the hard sweep hypothesis in every case.
Revised:  We then develop a second statistical test based on a statistic H2/H1 | H12, to test whether a given selective sweep detected by H12 is hard or soft . Surprisingly, when applying the test based on H2/H1 | H12 to the top 50 most extreme H12 candidates in the DGRP data , we reject the hard sweep hypothesis in every case.
Edit intent: fluency
Original:  We then developed a second statistical test based on a statistic H2/H1 | H12, to test whether a given selective sweep detected by H12 is hard or soft . Surprisingly, when applying the test based on H2/H1 | H12 to the top 50 most extreme H12 candidates in the DGRP data  , we reject the hard sweep hypothesis in every case.
Revised:  We then developed a second statistical test ( H2/H1 | H12, to test whether a given selective sweep detected by H12 is hard or soft . Surprisingly, when applying the test based on H2/H1 | H12 to the top 50 most extreme H12 candidates in the DGRP data , we reject the hard sweep hypothesis in every case.
Edit intent: clarity
Original:  We then developed a second statistical test based on a statistic H2/H1 | H12, to test whether a given selective sweep detected by H12 is hard or soft . Surprisingly, when applying the test based on H2/H1 | H12 to the top 50 most extreme H12 candidates in the DGRP data  , we reject the hard sweep hypothesis in every case.
Revised:  We then developed a second statistical test based on a statistic H2/H1 | H12, to test whether a given selective sweep detected by H12 . Surprisingly, when applying the test based on H2/H1 | H12 to the top 50 most extreme H12 candidates in the DGRP data , we reject the hard sweep hypothesis in every case.
Edit intent: clarity
Original:  We then developed a second statistical test based on a statistic H2/H1 | H12, to test whether a given selective sweep detected by H12 is hard or soft . Surprisingly, when applying the test based on H2/H1 | H12 to the top 50 most extreme H12 candidates in the DGRP data  , we reject the hard sweep hypothesis in every case.
Revised:  We then developed a second statistical test based on a statistic H2/H1 | H12, to test whether a given selective sweep detected by H12 is hard or soft . Surprisingly, when applying this test to the top 50 most extreme H12 candidates in the DGRP data , we reject the hard sweep hypothesis in every case.
Edit intent: clarity
Original:  We then developed a second statistical test based on a statistic H2/H1 | H12, to test whether a given selective sweep detected by H12 is hard or soft . Surprisingly, when applying the test based on H2/H1 | H12 to the top 50 most extreme H12 candidates in the DGRP data  , we reject the hard sweep hypothesis in every case.
Revised:  We then developed a second statistical test based on a statistic H2/H1 | H12, to test whether a given selective sweep detected by H12 is hard or soft . Surprisingly, when applying the test based on H2/H1 | H12 to the top 50 most extreme H12 candidates in the DGRP data set , we reject the hard sweep hypothesis in every case.
Edit intent: clarity
Original:  In contrast, all 50 cases show strong support (Bayes Factor >10  ) for a soft sweep model.
Revised:  In contrast, all 50 candidates show strong support (Bayes Factor >10 ) for a soft sweep model.
Edit intent: clarity
Original:  In contrast, all 50 cases show strong support (Bayes Factor >10  ) for a soft sweep model.
Revised:  In contrast, all 50 cases show strong support (Bayes factors >10 ) for a soft sweep model.
Edit intent: fluency
Original:  Our results suggest that recent adaptation in North American populations of D. melanogaster has led primarily to soft sweepseither because it utilized standing genetic variation or because the short-term effective population size in D. melanogaster  is on the order of billions or larger.
Revised:  Our results suggest that recent adaptation in North American populations of D. melanogaster has generated abundant and primarily soft sweeps, consistent with previous claims that the short-term effective population size in D. melanogaster is on the order of billions or larger.
Edit intent: clarity
Original:  In a soft sweep, multiple adaptive haplotypes sweep through the population simultaneously, whereas in a hard sweep only a single adaptive haplotype reaches high population frequency.
Revised:  In a soft sweep, multiple adaptive haplotypes sweep through the population simultaneously, in contrast to hard sweeps in which only a single adaptive haplotype reaches high population frequency.
Edit intent: coherence
Original:  In a soft sweep, multiple adaptive haplotypes sweep through the population simultaneously, whereas in a hard sweep only a single adaptive haplotype reaches high population frequency.
Revised:  In a soft sweep, multiple adaptive haplotypes sweep through the population simultaneously, whereas in a hard sweep only a single adaptive haplotype rises to high frequency.
Edit intent: clarity
Original:  We then develop a second statistical test (H2/H1) that is sensitive to signatures common to soft sweeps but not hard sweeps, in order to determine the softness of the sweeps detected by H12  . Surprisingly, when applying this test to the top 50 most extreme H12 candidates in the DGRP data set, we reject the hard sweep hypothesis in every case.
Revised:  We then develop a second statistical test (H2/H1) that is sensitive to signatures common to soft sweeps but not hard sweeps, in order to determine whether sweeps detected by H12 . Surprisingly, when applying this test to the top 50 most extreme H12 candidates in the DGRP data set, we reject the hard sweep hypothesis in every case.
Edit intent: clarity
Original:  We introduce and study graphs that admit non-negative real weights associated to their vertices so that a set of vertices is a total dominating set if and only if the sum of the corresponding weights exceeds a certain threshold.
Revised:  We introduce and study graphs that admit non-negative real weights associated to their vertices such that a set of vertices is a total dominating set if and only if the sum of the corresponding weights exceeds a certain threshold.
Edit intent: clarity
Original:  We present a polynomial time recognition algorithm of total domishold graphs, and obtain partial results towards a characterization of graphs in which the above property holds in a hereditary sense.
Revised:  We present a polynomial time recognition algorithm of total domishold graphs, and characterize graphs in which the above property holds in a hereditary sense.
Edit intent: clarity
Original:  Our characterization in the case of split graphs is obtained by studying a new family of hypergraphs, defined similarly as the Sperner hypergraphs, which might be of independent interest.
Revised:  Our characterization is obtained by studying a new family of hypergraphs, defined similarly as the Sperner hypergraphs, which might be of independent interest.
Edit intent: coherence
Original:  Our characterization in the case of split graphs is obtained by studying a new family of hypergraphs, defined similarly as the Sperner hypergraphs, which might be of independent interest.
Revised:  Our characterization in the case of split graphs is obtained by studying a new family of hypergraphs, defined similarly as the Sperner hypergraphs, which may be of independent interest.
Edit intent: fluency
Original: We say that a q-ary length n code is non-overlapping if the set of non-trivial prefixes of codewords and the set of non-trivial suffices of codewords are disjoint.
Revised: We say that a q-ary length n code is non-overlapping if the set of non-trivial prefixes of codewords and the set of non-trivial suffices of codewords are disjoint.
Edit intent: fluency
Original:  More precisely, we show that our construction provides non-overlapping codes whose cardinality is within an (absolute) constant factor of the upper bound, for all parameters n and q. We also consider codes of short length, showing that the upper bound of q^n/(2n-1) is not always asymptotically tight.
Revised:  More precisely, we show that our construction provides non-overlapping codes whose cardinality is within an (absolute) constant factor of the upper bound, for all parameters n and q.. We also consider codes of short length, showing that the upper bound of q^n/(2n-1) is not always asymptotically tight.
Edit intent: fluency
Original:  We provide a conjecture on the leading term of the cardinality of an optimal non-overlapping code when n is fixed and q\rightarrow \infty  .
Revised:  We provide a conjecture on the leading term of the maximal cardinality of a non-overlapping code when n is fixed and q\rightarrow \infty .
Edit intent: clarity
Original:  In particular, two special "constant " unary constraints are a key to an arity reduction of arbitrary constraints, necessary for the classification.
Revised:  In particular, two special constant unary constraints are a key to an arity reduction of arbitrary constraints, necessary for the classification.
Edit intent: fluency
Original:  By a direct application of this approximability result, we construct polynomial-time randomized approximation-preserving Turing reductions (or AP-reductions)  to any given # CSP composed of symmetric real-valued constraints of arbitrary arities from #CSP(g) for an appropriate constraint g without any use of extra unary constraints .
Revised:  By a direct application of this approximability result, we construct polynomial-time randomized approximation-preserving Turing reductions (or AP-reductions) to any given # CSPs composed of symmetric real-valued constraints of arbitrary arities from #CSP(g) for an appropriate constraint g without any use of extra unary constraints .
Edit intent: fluency
Original:  By a direct application of this approximability result, we construct polynomial-time randomized approximation-preserving Turing reductions (or AP-reductions)  to any given # CSP composed of symmetric real-valued constraints of arbitrary arities from #CSP(g) for an appropriate constraint g without any use of extra unary constraints .
Revised:  By a direct application of this approximability result, we construct polynomial-time randomized approximation-preserving Turing reductions (or AP-reductions) to any given # CSP composed of symmetric real-valued constraints of arbitrary arities even in the presence of arbitrary extra unary constraints .
Edit intent: clarity
Original: In this paper is presented the new modelling framework combining the replicator dynamics (which is the standard model of the frequency dependent selection) with the Leslie Matrix model of the age-structured population.
Revised: In this paper we present a new modelling framework combining the replicator dynamics (which is the standard model of the frequency dependent selection) with the Leslie Matrix model of the age-structured population.
Edit intent: clarity
Original: In this paper is presented the new modelling framework combining the replicator dynamics (which is the standard model of the frequency dependent selection) with the Leslie Matrix model of the age-structured population.
Revised: In this paper is presented the new modelling framework combining replicator dynamics (which is the standard model of the frequency dependent selection) with the Leslie Matrix model of the age-structured population.
Edit intent: fluency
Original: In this paper is presented the new modelling framework combining the replicator dynamics (which is the standard model of the frequency dependent selection) with the Leslie Matrix model of the age-structured population.
Revised: In this paper is presented the new modelling framework combining the replicator dynamics (which is the standard model of frequency dependent selection) with the Leslie Matrix model of the age-structured population.
Edit intent: fluency
Original: In this paper is presented the new modelling framework combining the replicator dynamics (which is the standard model of the frequency dependent selection) with the Leslie Matrix model of the age-structured population.
Revised: In this paper is presented the new modelling framework combining the replicator dynamics (which is the standard model of the frequency dependent selection) with the model of an age-structured population.
Edit intent: clarity
Original:  It is shown that  Euler--Lotka equation is satisfied when  new model reaches the steady state ( ie.stable related frequencies between the age classes).
Revised:  It is shown that the Euler--Lotka equation is satisfied when new model reaches the steady state ( ie.stable related frequencies between the age classes).
Edit intent: fluency
Original:  It is shown that  Euler--Lotka equation is satisfied when  new model reaches the steady state ( ie.stable related frequencies between the age classes).
Revised:  It is shown that Euler--Lotka equation is satisfied when the new model reaches the steady state ( ie.stable related frequencies between the age classes).
Edit intent: fluency
Original:  It is shown that  Euler--Lotka equation is satisfied when  new model reaches the steady state ( ie.stable related frequencies between the age classes).
Revised:  It is shown that Euler--Lotka equation is satisfied when new model reaches a steady state ( ie.stable related frequencies between the age classes).
Edit intent: clarity
Original:  It is shown that  Euler--Lotka equation is satisfied when  new model reaches the steady state ( ie.stable related frequencies between the age classes).
Revised:  It is shown that Euler--Lotka equation is satisfied when new model reaches the steady state ( i.e. stable frequencies between the age classes).
Edit intent: clarity
Original:  The methodology of the multipopulation games is used for  derivation of two, mutually equivalent systems of equations.
Revised:  The methodology of the multipopulation games is used for the derivation of two, mutually equivalent systems of equations.
Edit intent: fluency
Original:  First contains equations describing the evolution of the strategy frequencies in the whole population completed by subsystems of equations describing the evolution of the age structure for each strategy.
Revised:  The first contains equations describing the evolution of the strategy frequencies in the whole population completed by subsystems of equations describing the evolution of the age structure for each strategy.
Edit intent: coherence
Original:  Second system contains equations describing the changes of general populations age structure, completed with subsystems of equations describing the selection of the strategies within each age class  .
Revised:  The second system contains equations describing the changes of general populations age structure, completed with subsystems of equations describing the selection of the strategies within each age class .
Edit intent: clarity