wanyu/IteraTeR_v2 huggingface dataset:
Original:  Through empirical results, it has been concluded that for low bit rate compression, the quantization error introduced by uniform quantizeris higher than that of non-linear quantizer, and thus suggesting the use of non-linear quantizer for low bit rate lossy compression .
Revised:  Through empirical results, it has been concluded that for low bit rate compression, the non-uniform quantizer performs better than the deadzone uniform quantizer in the perceptual quality of the reconstructed image, especially at low bitrates. More importantly, unlike the deadzone uniform quantizer, the non-uniform quantizer accomplishes better visual quality with a few quantized values .
Edit intent: clarity
Original: This project proposed a discrete stochastic dynamic programming (SDP) model for sustainable ecosystem planning of the Loess Plateau in Northwestern, China, and analyzed the ecological resource planning by the evolutionary game model in the decision-making process.
Revised: This paper proposed a discrete stochastic dynamic programming (SDP) model for sustainable ecosystem planning of the Loess Plateau in Northwestern, China, and analyzed the ecological resource planning by the evolutionary game model in the decision-making process.
Edit intent: clarity
Original:  Faudree, Gy\'arf\'as, Schelp and Tuza  [The Strong Chromatic Index of Graphs, Ars Combin., 29B (1990), pp.  205--211] considered a particular subclass of chordless graphs, namely the class of graphs in which all the cycle lengths are multiples of four, and asked whether the strong chromatic index of these graphs can be bounded by a linear function of the maximum degree.
Revised:  Faudree, Gy\'arf\'as, Schelp and Tuza ~ [The Strong Chromatic Index of Graphs, Ars Combin., 29B (1990), pp. 205--211] considered a particular subclass of chordless graphs, namely the class of graphs in which all the cycle lengths are multiples of four, and asked whether the strong chromatic index of these graphs can be bounded by a linear function of the maximum degree.
Edit intent: fluency
Original:  Faudree, Gy\'arf\'as, Schelp and Tuza  [The Strong Chromatic Index of Graphs, Ars Combin., 29B (1990), pp.  205--211] considered a particular subclass of chordless graphs, namely the class of graphs in which all the cycle lengths are multiples of four, and asked whether the strong chromatic index of these graphs can be bounded by a linear function of the maximum degree.
Revised:  Faudree, Gy\'arf\'as, Schelp and Tuza [The Strong Chromatic Index of Graphs, Ars Combin., 29B (1990), pp. ~ 205--211] considered a particular subclass of chordless graphs, namely the class of graphs in which all the cycle lengths are multiples of four, and asked whether the strong chromatic index of these graphs can be bounded by a linear function of the maximum degree.
Edit intent: fluency
Original:  Chang and Narayanan  [Strong Chromatic Index of 2-degenerate Graphs, J. Graph Theory, to appear, doi:10.1002/jgt.21646 ] answered this question in the affirmative by proving that if G is a chordless graph with maximum degree \Delta, then \chi'_s(G) \leq 8\Delta -6.
Revised:  Chang and Narayanan ~ [Strong Chromatic Index of 2-degenerate Graphs, J. Graph Theory, to appear, doi:10.1002/jgt.21646 ] answered this question in the affirmative by proving that if G is a chordless graph with maximum degree \Delta, then \chi'_s(G) \leq 8\Delta -6.
Edit intent: fluency
Original:  This bound is tight upto to an additive constant.
Revised:  This bound is tight up to to an additive constant.
Edit intent: fluency
Original: Device-to-device (D2D) communication enables us to spread information in the local area without infrastructure support.
Edit intent: coherence
Original:  In this letter, we focus on such information spreading in mobile wireless networks where all nodes move around.
Revised:  In this letter, we focus on information spreading in mobile wireless networks where all nodes move around.
Edit intent: clarity
Original: We derive the average number of nodes that have successfully received a given information packet as a function of the transmission range and the number of transmissions.
Revised: We derive the average number of nodes that have successfully received a given information packet as a function of the transmission power and the number of transmissions.
Edit intent: clarity
Original:  By solving the problem, we provide an optimal rule for the transmission range of the source node.
Revised:  By solving the problem, we provide an optimal rule for the transmission power of the source node.
Edit intent: clarity
Original: Power laws, characterized by quantities following 1/ x^\alpha{ . Power laws have also been observed in neural recordings , both at the macroscopic and microscopic levels: at the macroscopic level, the power spectral density (PSD) of the electroencephalogram (EEG) has been seen to follow 1/f^ distributions;
Revised: Power laws, that is, power spectral densities (PSDs) exhibiting 1/ x^\alpha{ . Power laws have also been observed in neural recordings , both at the macroscopic and microscopic levels: at the macroscopic level, the power spectral density (PSD) of the electroencephalogram (EEG) has been seen to follow 1/f^ distributions;
Edit intent: clarity
Original:  Finally, we propose the numerical reparametrization algorithm for rational parametric plane curves, and\cal \cal \cal \cal {\cal  {\it  \cal  the error bound is carefully discussed \cal \cal  .
Revised:  Finally, we propose the numerical reparametrization algorithm for rational parametric plane curves, and\cal \cal \cal \cal {\cal {\it of\cal the error bound is carefully discussed \cal \cal .
Edit intent: fluency
Original:  Finally, we propose the numerical reparametrization algorithm for rational parametric plane curves, and\cal \cal \cal \cal {\cal  {\it  \cal  the error bound is carefully discussed \cal \cal  .
Revised:  Finally, we propose the numerical reparametrization algorithm for rational parametric plane curves, and\cal \cal \cal \cal {\cal {\it \cal the error bound is carefully discussed \cal \cal D .
Edit intent: coherence
Original:  Our Turbinesoftware offers a generic framework enabling the simulation of any algorithmically definable dynamics of any network.
Revised:  Our Turbinesoftware offers a generic framework enabling fast simulation of any algorithmically definable dynamics of any network.
Edit intent: clarity
Original:  Perturbation centrality is the reciprocal of the time needed to dissipate a starting perturbation in the network.
Edit intent: coherence
Original:  High perturbation centrality nodes of the Met-tRNA synthetase protein structure network were identified as amino acids involved in substrate binding and allosteric communication by earlier studies.
Revised:  High perturbation centrality nodes of the Met-tRNA synthetase protein structure network were identified as amino acids involved in intra-protein communication by earlier studies.
Edit intent: clarity
Original:  Changes in perturbation centralities of yeast protein-protein interaction network nodes upon various stresses well recapitulated the functional changes of stressed yeast cells.
Revised:  Changes in perturbation centralities of yeast interactome nodes upon various stresses well recapitulated the functional changes of stressed yeast cells.
Edit intent: clarity
Original:  The  Turbine software and the perturbation centrality measure  provide a large variety of novel options for future studies on network robustness, signalingmechanisms and drug design.
Revised:  The Turbine software and the perturbation centrality measure may provide a large variety of novel options for future studies on network robustness, signalingmechanisms and drug design.
Edit intent: coherence
Original:  The growth behavior of a population is guided by two coupled ordinary differential equations given by a non-differentiable vector field whose parameters are the secondary sex ratio (the ratio of males to females at time of birth), inter- and intra-gender competitions, fertility  rates and a mating function.
Revised:  The growth behavior of a population is guided by two coupled ordinary differential equations given by a non-differentiable vector field whose parameters are the secondary sex ratio (the ratio of males to females at time of birth), inter- , intra- and outer-gender competitions, fertility rates and a mating function.
Edit intent: fluency
Original:  The growth behavior of a population is guided by two coupled ordinary differential equations given by a non-differentiable vector field whose parameters are the secondary sex ratio (the ratio of males to females at time of birth), inter- and intra-gender competitions, fertility  rates and a mating function.
Revised:  The growth behavior of a population is guided by two coupled ordinary differential equations given by a non-differentiable vector field whose parameters are the secondary sex ratio (the ratio of males to females at time of birth), inter- and intra-gender competitions, fertility and mortality rates and a mating function.
Edit intent: clarity
Original:  In particular, we describe conditions on the secondary sex ratio and discuss the role of the median number of female sexual partners of each male for the conservation of a two-sex species.
Revised:  In particular, we describe conditions on the secondary sex ratio and discuss the role of the average number of female sexual partners of each male for the conservation of a two-sex species.
Edit intent: clarity
Original:  We find that dispersal impacts the stability of metapopulations through local patches dynamics and various dispersal behaviors ( positive density-dependent dispersal , costly dispersal , social fencing of immigrants and settlement facilitation).
Revised:  We discuss both the influence of local within-patch dynamics and the effects of various dispersal behaviors ( positive density-dependent dispersal , costly dispersal , social fencing of immigrants and settlement facilitation).
Edit intent: clarity
Original:  We present an analog of the above inapproximability results for multi-spin systems.
Revised:  We present the first analog of the above inapproximability results for multi-spin systems.
Edit intent: clarity
Original: We study the notion of `` cancellation-free '' circuits.
Revised: We study the notion of " cancellation-free '' circuits.
Edit intent: fluency
Original: We study the notion of `` cancellation-free '' circuits.
Revised: We study the notion of `` cancellation-free " circuits.
Edit intent: fluency
Original: In Rothvo \ss 2011 it was shown that there exists a 0/1 polytope  such that any higher-dimensional polytope projecting to it must have a subexponential number of facets, i.e., its linear extension complexity is subexponential .
Revised: In Rothvo 2011 it was shown that there exists a 0/1 polytope such that any higher-dimensional polytope projecting to it must have a subexponential number of facets, i.e., its linear extension complexity is subexponential .
Edit intent: fluency
Original:  The question as to whether there exists a 0/1 polytope having high PSD extension complexity was left open , i. e., is there a 0/1 polytope such that any spectrahedron projecting to it must be the intersection of a subexponential sized semidefinite cone and an affine space ?
Revised:  The question whether there exists a 0/1 polytope having high PSD extension complexity was left open , i. e., is there a 0/1 polytope such that any spectrahedron projecting to it must be the intersection of a subexponential sized semidefinite cone and an affine space ?
Edit intent: coherence
Original:  The question as to whether there exists a 0/1 polytope having high PSD extension complexity was left open , i. e., is there a 0/1 polytope such that any spectrahedron projecting to it must be the intersection of a subexponential sized semidefinite cone and an affine space ?
Revised:  The question as to whether there exists a 0/1 polytope with high PSD extension complexity was left open , i. e., is there a 0/1 polytope such that any spectrahedron projecting to it must be the intersection of a subexponential sized semidefinite cone and an affine space ?
Edit intent: fluency
Original:  We  demonstrate the utility of our estimator in four standard methods -- regression, canonical correlation analysis, discriminant analysis , and EM clustering -- when the number of samples is dominated by or comparable to the number of covariates.
Revised:  We also demonstrate the utility of our estimator in four standard methods -- regression, canonical correlation analysis, discriminant analysis , and EM clustering -- when the number of samples is dominated by or comparable to the number of covariates.
Edit intent: coherence
Original:  We  demonstrate the utility of our estimator in four standard methods -- regression, canonical correlation analysis, discriminant analysis , and EM clustering -- when the number of samples is dominated by or comparable to the number of covariates.
Revised:  We demonstrate the utility of our estimator in four standard methods -- discriminant analysis and EM clustering -- when the number of samples is dominated by or comparable to the number of covariates.
Edit intent: clarity
Original:  Here we present featureCounts, a light-weight read summarization program  . featureCounts was found to be >15 times faster and use much less memory than the popular methods.
Revised:  Here we present featureCounts, a read summarization program . featureCounts was found to be >15 times faster and use much less memory than the popular methods.
Edit intent: clarity
Original: A high quality dataset for phylogenetic analysis contains a maximum amount of information regarding evolutionary relationships and a minimal amount of noise.
Edit intent: coherence
Original:  We have developed a novel approach for rapidly obtaining such data directly from next- generation sequencing reads without  a reference genome.
Revised:  We have developed a novel approach for rapidly obtaining such data directly from next- generation sequencing reads without the use of a reference genome.
Edit intent: clarity
Original:  Using this approach, which we call SISRS(for Site Identification from Short Read Sequences), we avoid the time consuming steps of de novo  assembly, genome-genome alignment, and annotation to identify potential phylogenetic markers.
Revised:  This software, called SISRS, avoids the time consuming steps of de novo assembly, genome-genome alignment, and annotation to identify potential phylogenetic markers.
Edit intent: clarity
Original:  For simulations , SISRS was able to identify large numbers of variable sites as long as the data contained phylogenetic signal.
Revised:  For simulations , SISRS was able to identify large numbers of loci containing variable sites with phylogenetic signal.
Edit intent: clarity
Original:  The objective is to find a path from the source to the destination that results in the minimum number of nodes overhearing the message by carefully choosing the relaying nodes and their corresponding transmission power.
Revised:  The objective is to find a path from a source to its destination that results in the minimum number of nodes overhearing the message by carefully choosing the relaying nodes and their corresponding transmission power.
Edit intent: clarity
Original:  The objective is to find a path from the source to the destination that results in the minimum number of nodes overhearing the message by carefully choosing the relaying nodes and their corresponding transmission power.
Revised:  The objective is to find a path from the source to the destination that results in the minimum number of nodes overhearing the message by a judicious choice of relaying nodes and their corresponding transmission power.
Edit intent: clarity
Original:  We then develop two polynomial-time approximation algorithms that offer \frac{n{2}} and n{2n-1}  for general directed hypergraphs (which can model non-isomorphic signal propagation in space) and constant approximation ratios for ring hypergraphs (which result from isomorphic signal propagation).
Revised:  We then develop two polynomial-time approximation algorithms that offer \frac{n{2}} and n{2n-1} approximation ratios for general directed hypergraphs (which can model non-isomorphic signal propagation in space) and constant approximation ratios for ring hypergraphs (which result from isomorphic signal propagation).
Edit intent: clarity
Original:  In particular, no algorithm , even with complete location information of the eavesdroppers, can obtain a thinner path than the proposed algorithm which does not require the knowledge of eavesdropper locations  .
Revised:  This algorithm does not require the knowledge of eavesdropper locations .
Edit intent: clarity
Original:  In this paper, we propose a non-uniform femtocell network deployment scheme, in which the femtocell base stations (BSs) are not utilized in the region within a prescribed distance away from any macrocell BSs  . Based upon a stochastic geometric framework , the downlink coverage and single user throughput are characterized with tractable results.
Revised:  In this paper, we propose a non-uniform femtocell network deployment scheme, in which the femtocell base stations (BSs) are not utilized in the region within a prescribed distance away from any macrocell BSs . Based upon the analytical framework provided in this work , the downlink coverage and single user throughput are characterized with tractable results.
Edit intent: clarity
Original:  This work demonstrates the benefits obtained from a simple non-uniform femtocell deployment, which highlights the importance of deploying femtocell BSs selectively.
Revised:  This work demonstrates the benefits obtained from a simple non-uniform femtocell deployment, which highlights the importance of deploying small cells selectively.
Edit intent: clarity
Original: Learning with Errors (LWE) problems are the foundations for numerous applications in lattice-based cryptography and are prov-ably as hard as approximate lattice problems in the worst case.
Revised: Learning with Errors (LWE) problems are the foundations for numerous applications in lattice-based cryptography and are provably as hard as approximate lattice problems in the worst case.
Edit intent: fluency
Original:  The  download time is reduced because when a content file is encoded to add redundancy and distributed across multiple disks, reading only a subset of the disks is sufficient to reconstruct the content.
Revised:  The expected download time is reduced because when a content file is encoded to add redundancy and distributed across multiple disks, reading only a subset of the disks is sufficient to reconstruct the content.
Edit intent: clarity
Original:  Our results demonstrate the fundamental trade-off between the  download time and the amount of storage space.
Revised:  Our results demonstrate the fundamental trade-off between the expected download time and the amount of storage space.
Edit intent: clarity
Original:  A key feature of the method is the ability to derive the key output statistics from single SNP summary statistics, hence making it possible to perform systematic meta-analysis type comparisons across multiple GWAS datasets (implemented online at URL We demonstrate the value of the approach by re-analysing a gene expression dataset in 966 liver samples with a published meta-analysis of lipid traits including > 100,000 individuals of European ancestry.
Revised:  A key feature of the method is the ability to derive the output statistics from single SNP summary statistics, hence making it possible to perform systematic meta-analysis type comparisons across multiple GWAS datasets (implemented online at URL We demonstrate the value of the approach by re-analysing a gene expression dataset in 966 liver samples with a published meta-analysis of lipid traits including > 100,000 individuals of European ancestry.
Edit intent: fluency
Original:  Our co-localisation results are broadly consistent with the conclusion from the published meta-analysis.
Edit intent: coherence
Original:  Combining all lipid biomarkers, our re-analysis supported 29 out of 38 reported co-localisation results with eQTLs.
Revised:  Combining all lipid biomarkers, our re-analysis supported 29 out of 38 reported colocalisation results with eQTLs.
Edit intent: clarity
Original:  Two clearly discordant findings (IFT172, CPNE1), as well as multiple new co-localisation results, highlight the value of a formal systematic statistical test.
Revised:  Two clearly discordant findings (IFT172, CPNE1), as well as multiple new colocalisation results, highlight the value of a formal systematic statistical test.
Edit intent: fluency
Original: Genetic association studies, in particular the genome-wide association study (GWAS) design, have provided a wealth of novel insights into the aetiology of a wide range of human diseases and traits , in particular cardiovascular diseases and lipid biomarkers .
Revised: Genetic association studies, in particular the genome-wide association study design, have provided a wealth of novel insights into the aetiology of a wide range of human diseases and traits , in particular cardiovascular diseases and lipid biomarkers .
Edit intent: clarity
Original: Genetic association studies, in particular the genome-wide association study (GWAS) design, have provided a wealth of novel insights into the aetiology of a wide range of human diseases and traits , in particular cardiovascular diseases and lipid biomarkers .
Revised: Genetic association studies, in particular the genome-wide association study (GWAS) design, have provided a wealth of novel insights into the aetiology of a wide range of human diseases and traits .
Edit intent: coherence
Original:  A key feature of the method is the ability to derive the output statistics from single SNP summary statistics, hence making it possible to perform systematic meta-analysis type comparisons across multiple GWAS datasets (implemented online at URL We demonstrate the value of the approach by re-analysing a gene expression dataset in 966 liver samples with a published meta-analysis of lipid traits including >100, 000 individuals of European ancestry.
Revised:  We demonstrate the value of the approach by re-analysing a gene expression dataset in 966 liver samples with a published meta-analysis of lipid traits including >100, 000 individuals of European ancestry.
Edit intent: clarity
Original:  A key feature of the method is the ability to derive the output statistics from single SNP summary statistics, hence making it possible to perform systematic meta-analysis type comparisons across multiple GWAS datasets (implemented online at URL We demonstrate the value of the approach by re-analysing a gene expression dataset in 966 liver samples with a published meta-analysis of lipid traits including >100, 000 individuals of European ancestry.
Revised:  A key feature of the method is the ability to derive the output statistics from single SNP summary statistics, hence making it possible to perform systematic meta-analysis type comparisons across multiple GWAS datasets (implemented online at URL We demonstrate the value of the approach by reanalysing a gene expression dataset in 966 liver samples with a published meta-analysis of lipid traits including >100, 000 individuals of European ancestry.
Edit intent: fluency
Original:  Combining all lipid biomarkers, our re-analysis supported 29 out of 38 reported colocalisation results with eQTLs . Two clearly discordant findings (IFT172, CPNE1), as well as multiple new colocalisation results, highlight the value of a formal systematic statistical test.
Revised:  Combining all lipid biomarkers, our reanalysis supported 29 out of 38 reported colocalisation results with eQTLs . Two clearly discordant findings (IFT172, CPNE1), as well as multiple new colocalisation results, highlight the value of a formal systematic statistical test.
Edit intent: fluency