wanyu/IteraTeR_v2 huggingface dataset:
Original:   By properly setting CW2nd and other parameters, a WLAN implementing Uni-MUMAC exhibits that the system not only performs well in the downlink traffic dominated scenario, but it is also able to balance both the downlink and uplink throughput in the emerging uplink bandwidth-hungry scenario.
Revised:  By properly setting CW2nd and other parameters, Uni-MUMAC exhibits that the system not only performs well in the downlink traffic dominated scenario, but it is also able to balance both the downlink and uplink throughput in the emerging uplink bandwidth-hungry scenario.
Edit intent: clarity
Original:   By properly setting CW2nd and other parameters, a WLAN implementing Uni-MUMAC exhibits that the system not only performs well in the downlink traffic dominated scenario, but it is also able to balance both the downlink and uplink throughput in the emerging uplink bandwidth-hungry scenario.
Revised:  By properly setting CW2nd and other parameters, a WLAN implementing Uni-MUMAC exhibits that the system not only performs well in the downlink-dominant scenario, but it is also able to balance both the downlink and uplink throughput in the emerging uplink bandwidth-hungry scenario.
Edit intent: clarity
Original:  However, it has been recently shown that very different demographic models can actually generate the same SFS for arbitrarily large sample sizes.
Revised:  However, it has been recently shown that very different population demographies can actually generate the same SFS for arbitrarily large sample sizes.
Edit intent: clarity
Original:  Here, we revisit this problem and examine the identifiability of demographic models under the restriction that the population sizes are piecewise defined where each piece belongs to some family of biologically-motivated functions.
Revised:  Here, we revisit this problem and examine the identifiability of demographic models under the restriction that the population sizes are piecewise-defined where each piece belongs to some family of biologically-motivated functions.
Edit intent: fluency
Original:  In the cases of piecewise-constant and piecewise-exponential  models, which are often assumed in population genomic inferences, we provide explicit formulas for the bounds as simple functions of the number of pieces.
Revised:  In the cases of piecewise-constant , piecewise-exponential models, which are often assumed in population genomic inferences, we provide explicit formulas for the bounds as simple functions of the number of pieces.
Edit intent: fluency
Original:  Although in principle this non-identifiability issue poses a thorny challenge to statistical inference, the population size functions involved in the counterexamples are arguably not so biologically realistic.
Revised:  Although in principle this nonidentifiability issue poses a thorny challenge to statistical inference, the population size functions involved in the counterexamples are arguably not so biologically realistic.
Edit intent: fluency
Original:  In the cases of piecewise-constant, piecewise-exponential , and piecewise-generalized-exponential models, which are often assumed in population genomic inferences, we provide explicit formulas for the bounds as simple functions of the number of pieces.
Revised:  In the cases of piecewise-constant, piecewise-exponential and piecewise-generalized-exponential models, which are often assumed in population genomic inferences, we provide explicit formulas for the bounds as simple functions of the number of pieces.
Edit intent: fluency
Original: We introduce a free and open dataset of 7690 audio clips sampled from the field-recording tag in the Freesound audio archive.
Revised: We introduce a free and open dataset of 7690 audio clips sampled from the field-recording tag in the Freesound audio archive.
Edit intent: fluency
Original:  In this study we hypothesize that, the genome is organized into local domains that manifest similar enrichment pattern of histone modification, which leads to orchestrated regulation of expression of genes with relevant biological functions.
Revised:  In this study we hypothesize that, the genome is organized into local domains that manifest similar enrichment pattern of histone modification, which leads to orchestrated regulation of expression of genes with relevant bio- logical functions.
Edit intent: clarity
Original:  By modeling the sparse distribution of histone marks across the chromosome with a zero-inflated Gaussian mixture, our partitions capture local BLOCKs  manifest relatively homogeneous enrichment pattern of histone modifications.
Revised:  By modeling the sparse distribution of histone marks across the chromosome with a zero-inflated Gaussian mixture, our partitions capture local BLOCKs that manifest relatively homogeneous enrichment pattern of histone modifications.
Edit intent: fluency
Original:  We further characterized BLOCKs by their transcription levels, distribution of genes, binding profiles of a broad panel of chromatin proteins, degree of co-expression and GO enrichment.
Revised:  We further characterized BLOCKs by their transcription levels, distribution of genes, degree of co-regulation and GO enrichment.
Edit intent: clarity
Original:  Our results demonstrate that these blocks , although inferred merely from histone modifications, reveal strong relevance with transcription events and chromatin organization , which suggest their important roles in  coordinated gene regulation.
Revised:  Our results demonstrate that these BLOCKs , although inferred merely from histone modifications, reveal strong relevance with transcription events and chromatin organization , which suggest their important roles in coordinated gene regulation.
Edit intent: clarity
Original:  Our results demonstrate that these blocks , although inferred merely from histone modifications, reveal strong relevance with transcription events and chromatin organization , which suggest their important roles in  coordinated gene regulation.
Revised:  Our results demonstrate that these blocks , although inferred merely from histone modifications, reveal strong relevance with physical domains , which suggest their important roles in coordinated gene regulation.
Edit intent: clarity
Original:  Our results demonstrate that these blocks , although inferred merely from histone modifications, reveal strong relevance with transcription events and chromatin organization , which suggest their important roles in  coordinated gene regulation.
Revised:  Our results demonstrate that these blocks , although inferred merely from histone modifications, reveal strong relevance with transcription events and chromatin organization , which suggest their important roles in chromatin organization and coordinated gene regulation.
Edit intent: coherence
Original: Video streaming is heavily demanded by mobile users, as recent studies indicate.
Revised: Video streaming is in high demand by mobile users, as recent studies indicate.
Edit intent: clarity
Original:  In contrast to such buffer under-runs , good channel conditions cause common greedy buffering schemes to pile up very long buffers.
Revised:  In contrast to that , good channel conditions cause common greedy buffering schemes to pile up very long buffers.
Edit intent: clarity
Original:  Such over-buffering wastes expensive wireless channel capacity when the user decides to jump inside a video or to watch another .
Revised:  Such over-buffering wastes expensive wireless channel capacity .
Edit intent: coherence
Original:  This anticipatory scheduling avoids under-runs by downloading a large number of segments before a channel outage occurs, without wasting wireless capacity by excessive buffering.
Revised:  This anticipatory scheduling avoids buffer underruns by downloading a large number of segments before a channel outage occurs, without wasting wireless capacity by excessive buffering.
Edit intent: clarity
Original:  We formalize this approach as an optimization problem and derive practical heuristics for segment-based video streaming protocols (e.g., HLS or MPEG DASH).
Revised:  We formalize this approach as an optimization problem and derive practical heuristics for segmented video streaming protocols (e.g., HLS or MPEG DASH).
Edit intent: clarity
Original: Starting from the well-known importance of communication in the natural learning process, our main goal was to use the concept of language as an important instrument for improving supervised learning of artificial neural networks.
Revised: Starting from the well-known importance of communication in the natural learning process, our main goal was to use a similar mechanism in supervised learning of artificial neural networks.
Edit intent: clarity
Original:  This results in the need of changing the activation function for neurons in the first hidden layer .
Revised:  This results in the need of both modifying the activation function for neurons in the first hidden layer .
Edit intent: clarity
Original:  Testing the language-supervised learning for an XOR equivalent problem  , we noticed the interesting fact that the MLP is capable of recognizing patterns in the absence of corresponding word information , even though this kind of examples were not explicitly included in the training set  .
Revised:  Testing the language-supervised learning for an XOR equivalent problem . In this context , we noticed the interesting fact that the MLP is capable of recognizing patterns in the absence of corresponding word information , even though this kind of examples were not explicitly included in the training set .
Edit intent: coherence
Original:  Testing the language-supervised learning for an XOR equivalent problem  , we noticed the interesting fact that the MLP is capable of recognizing patterns in the absence of corresponding word information , even though this kind of examples were not explicitly included in the training set  .
Revised:  Testing the language-supervised learning for an XOR equivalent problem , we noticed the interesting fact that the MLP is capable of recognizing all input forms in the absence of corresponding word information , even though this kind of examples were not explicitly included in the training set .
Edit intent: clarity
Original: Inspired by the importance of both communication and error feedbacks in the natural learningprocess , our main goal was to use a similar mechanism in supervised learning of artificial neural networks.
Revised: Inspired by the importance of both communication and feedback on errors in human learning , our main goal was to use a similar mechanism in supervised learning of artificial neural networks.
Edit intent: clarity
Original: Inspired by the importance of both communication and error feedbacks in the natural learningprocess , our main goal was to use a similar mechanism in supervised learning of artificial neural networks.
Revised: Inspired by the importance of both communication and error feedbacks in the natural learningprocess , our main goal was to implement a similar mechanism in supervised learning of artificial neural networks.
Edit intent: clarity
Original:  Following the belief that basic concepts should be tested on simple examples, we tried to apply the previous mentioned mechanism on a XOR equivalent problem .
Revised:  Following the belief that basic concepts should be tested on simple examples, the previous mentioned mechanism on a XOR equivalent problem .
Edit intent: coherence
Original:  In this context, we noticed the interesting fact that the ANN was capable of recognizing all input forms in the absence of corresponding label information (words) , even though this kind of examples were not explicitly included in the training set  .
Revised:  In this context, we noticed the interesting fact that the ANN was capable to categorize all desired input vectors in the absence of corresponding label information (words) , even though this kind of examples were not explicitly included in the training set .
Edit intent: clarity
Original:  In this context, we noticed the interesting fact that the ANN was capable of recognizing all input forms in the absence of corresponding label information (words) , even though this kind of examples were not explicitly included in the training set  .
Revised:  In this context, we noticed the interesting fact that the ANN was capable of recognizing all input forms in the absence of their corresponding words , even though this kind of examples were not explicitly included in the training set .
Edit intent: clarity
Original:  In this context, we noticed the interesting fact that the ANN was capable of recognizing all input forms in the absence of corresponding label information (words) , even though this kind of examples were not explicitly included in the training set  .
Revised:  In this context, we noticed the interesting fact that the ANN was capable of recognizing all input forms in the absence of corresponding label information (words) , even though the training set .
Edit intent: clarity
Original:  Further analysis along applying this approach to more complex scenarios is currently in progress, as we consider the proposed language-supervised learning might contribute to a better understanding of mechanisms involved in natural learning , and opens also the possibility of creating a specific category of communicative artificial neural networks, with abstraction capabilities.
Revised:  Further analysis along applying this approach to more complex scenarios is currently in progress, as we consider the proposed language-driven algorithm might contribute to a better understanding of mechanisms involved in natural learning , and opens also the possibility of creating a specific category of communicative artificial neural networks, with abstraction capabilities.
Edit intent: clarity
Original:  Further analysis along applying this approach to more complex scenarios is currently in progress, as we consider the proposed language-supervised learning might contribute to a better understanding of mechanisms involved in natural learning , and opens also the possibility of creating a specific category of communicative artificial neural networks, with abstraction capabilities.
Revised:  Further analysis along applying this approach to more complex scenarios is currently in progress, as we consider the proposed language-supervised learning might contribute to a better understanding of learning in humans, opening as well the possibility to create a specific category of communicative artificial neural networks, with abstraction capabilities.
Edit intent: clarity
Original:  Further analysis along applying this approach to more complex scenarios is currently in progress, as we consider the proposed language-supervised learning might contribute to a better understanding of mechanisms involved in natural learning , and opens also the possibility of creating a specific category of communicative artificial neural networks, with abstraction capabilities.
Revised:  Further analysis along applying this approach to more complex scenarios is currently in progress, as we consider the proposed language-supervised learning might contribute to a better understanding of mechanisms involved in natural learning , and opens also the possibility of creating a specific category of artificial neural networks, with abstraction capabilities.
Edit intent: clarity
Original:  Scientists, either proficient or tender, usually submit their most important work to prestigious journals which receives high citations than the ordinary.
Revised:  Scientists, either proficient or tender, usually submit their most important work to prestigious journals which receives higher citations than the ordinary.
Edit intent: fluency
Original:  Thus, scientific journals play a crucial role in citation networks .
Revised:  How to model the role of scientific journals in citation dynamics is of great importance .
Edit intent: clarity
Original:  In this paper , we address this issue and develop a model for citations networks via an intrinsic nodal weight function and an intuitive ageing mechanism.
Revised:  In this paper we address this issue and develop a model for citations networks via an intrinsic nodal weight function and an intuitive ageing mechanism.
Edit intent: fluency
Original:  In this paper , we address this issue and develop a model for citations networks via an intrinsic nodal weight function and an intuitive ageing mechanism.
Revised:  In this paper , we address this issue and develop a model for citation networks via an intrinsic nodal weight function and an intuitive ageing mechanism.
Edit intent: fluency
Original:  The node-degree distribution of resulting networks shows a nonuniversal scaling: the distribution has exponential behaviour for small degree and  a power-law tail for large degree  .
Revised:  The node-degree distribution of resulting networks shows nonuniversal scaling: the distribution has exponential behaviour for small degree and a power-law tail for large degree .
Edit intent: fluency
Original:  The node-degree distribution of resulting networks shows a nonuniversal scaling: the distribution has exponential behaviour for small degree and  a power-law tail for large degree  .
Revised:  The node-degree distribution of resulting networks shows a nonuniversal scaling: the distribution has exponential behaviour for small degree and has a power-law tail for large degree .
Edit intent: fluency
Original: Whether a scientific paper to be cited is related not only to the influence of its author(s) but also to the journal publishing it.
Revised: Whether a scientific paper is cited is related not only to the influence of its author(s) but also to the journal publishing it.
Edit intent: clarity
Original:  The higher  impact factor of the journal, the larger  tipping point and the smaller power exponent are obtained.
Revised:  The higher the impact factor of the journal, the larger tipping point and the smaller power exponent are obtained.
Edit intent: fluency
Original:  The higher  impact factor of the journal, the larger  tipping point and the smaller power exponent are obtained.
Revised:  The higher impact factor of the journal, the larger the tipping point and the smaller power exponent are obtained.
Edit intent: fluency
Original:  The higher  impact factor of the journal, the larger  tipping point and the smaller power exponent are obtained.
Revised:  The higher impact factor of the journal, the larger tipping point and the smaller the power exponent that are obtained.
Edit intent: clarity
Original: Computer simulations generating both the growth of human population and the extinction of megafauna are tested using human population data.
Revised: Computer simulations show that the extinction of megafauna are tested using human population data.
Edit intent: clarity
Original: Computer simulations show that the extinction of megafauna is not correlated with the growth of human population .
Revised: Computer simulations carried out by Alroy (2001) are examined. Contrary to the claim of their Author, there is no convincing evidence that the extinction of megafauna is not correlated with the growth of human population .
Edit intent: coherence
Original:  They confirm the earlier conclusion that there was no intensification of growth between 10,000 and 1,000 years BP.
Revised:  They confirm the earlier conclusion that there was no intensification of growth between 10,000 and 1000 years BP.
Edit intent: clarity
Original:  Investigating growth dynamics of a bundle of N independent cytoskeletal filaments pushing against a wall, we show that  ATP/GTP hydrolysis  leads to a collective phenomena that is currently unknown.
Revised:  Investigating growth dynamics of a bundle of N independent cytoskeletal filaments pushing against a wall, we show that ATP/GTP hydrolysis ) leads to a collective phenomena that is currently unknown.
Edit intent: fluency
Original:  Investigating growth dynamics of a bundle of N independent cytoskeletal filaments pushing against a wall, we show that  ATP/GTP hydrolysis  leads to a collective phenomena that is currently unknown.
Revised:  Investigating growth dynamics of a bundle of N independent cytoskeletal filaments pushing against a wall, we show that ATP/GTP hydrolysis leads to a collective phenomenon that is currently unknown.
Edit intent: fluency
Original:  Simulating growing actin and microtubule bundles, considering both sequential and random hydrolysis, we make quantitative predictions of the excess forces  .
Revised:  Simulating growing actin and microtubule bundles, considering both sequential and random hydrolysis, we make quantitative predictions for the excess forces .
Edit intent: fluency
Original: In this paper we introduce analogues of the discrete complexity classes VP and VNP of sequences of functions in the Blum-Shub-Smale model .
Revised: In this paper we introduce constructible analogs of the discrete complexity classes VP and VNP of sequences of functions in the Blum-Shub-Smale model .
Edit intent: clarity
Original: In this paper we introduce analogues of the discrete complexity classes VP and VNP of sequences of functions in the Blum-Shub-Smale model .
Revised: In this paper we introduce analogues of the discrete complexity classes VP and VNP of sequences of functions .
Edit intent: clarity
Original:  The class analogous of VNP is defined using Euler integration.
Revised:  The class analogous to VNP is defined using Euler integration.
Edit intent: fluency
Original:  We introduce a class of sequences simple constructible sheaves, that could be seen as the sheaf theoretic analog of the Blum-Shub-Smale class \mathbf{P} _\R . We also define a hierarchy of complexity classes of sheaves mirroring the polynomial hierarchy, \mathbf{PH} _\R in the more classical theory.
Revised:  We introduce a class of sequences simple constructible sheaves, that could be seen as the sheaf-theoretic analog of the Blum-Shub-Smale class \mathbf{P} _\R . We also define a hierarchy of complexity classes of sheaves mirroring the polynomial hierarchy, \mathbf{PH} _\R in the more classical theory.
Edit intent: clarity
Original:  We prove  singly exponential upper bounds on the topological complexity of the sheaves in this hierarchy  .
Revised:  We prove a singly exponential upper bounds on the topological complexity of the sheaves in this hierarchy .
Edit intent: fluency
Original:  We prove  singly exponential upper bounds on the topological complexity of the sheaves in this hierarchy  .
Revised:  We prove singly exponential upper bound on the topological complexity of the sheaves in this hierarchy .
Edit intent: fluency
Original:  We obtain as a result a singly exponential complexity upper bound on the sheaf-theoretic version of quantifier elimination.
Revised:  We obtain as a result an algorithm with singly exponential complexity upper bound on the sheaf-theoretic version of quantifier elimination.
Edit intent: clarity
Original:  We obtain as a result a singly exponential complexity upper bound on the sheaf-theoretic version of quantifier elimination.
Revised:  We obtain as a result a singly exponential complexity for a sheaf-theoretic version of quantifier elimination.
Edit intent: clarity
Original:  We pose the natural sheaf theoretic analogues of the classical \mathbf{P} vs \mathbf{NP} question  and also discuss a connection with Toda's theorem from discrete complexity theory  .
Revised:  We pose the natural sheaf-theoretic analogs of the classical \mathbf{P} vs \mathbf{NP} question and also discuss a connection with Toda's theorem from discrete complexity theory .
Edit intent: fluency
Original:  We pose the natural sheaf theoretic analogues of the classical \mathbf{P} vs \mathbf{NP} question  and also discuss a connection with Toda's theorem from discrete complexity theory  .
Revised:  We pose the natural sheaf theoretic analogues of the classical \mathbf{P} vs \mathbf{NP} question , and also discuss a connection with Toda's theorem from discrete complexity theory .
Edit intent: fluency
Original:  We discuss several examples, develop a theory of completeness, and pose a conjecture analogous to the VP vs  VNP conjecture in the classical case.
Revised:  We discuss several examples, develop a theory of completeness, and pose a conjecture analogous to the VP vs . VNP conjecture in the classical case.
Edit intent: fluency