wanyu/IteraTeR_v2 huggingface dataset:
Original:  If all activities return to normal, the epidemic growth suffers a steep increase over the current pattern , and the demand for ICU beds my surpass 3.5 times the country's capacity.
Revised:  If all activities return to normal, the epidemic growth suffers a steep increase over the current pattern , and the demand for ICU beds may surpass 3 times the country's capacity.
Edit intent: clarity
Original:  This novel methodology is used to estimate the basic reproductive number of recent outbreaks, including the ongoing COVID-19 epidemic.
Revised:  This novel methodology is used to estimate the basic reproduction ratio of recent outbreaks, including the ongoing COVID-19 epidemic.
Edit intent: clarity
Original:  We deploy neutral social bots on Twitter to probe biases that may emerge from interactions between user actions , platform mechanisms, and manipulation by inauthentic actors.
Revised:  We deploy neutral social bots on Twitter to probe biases that may emerge from interactions between users , platform mechanisms, and manipulation by inauthentic actors.
Edit intent: clarity
Original:  Partisan accounts, especially conservative ones, tend to receive more followers, follow more automated accounts, are exposed to more low-credibility content, and find themselves in echo chambers.
Revised:  Partisan accounts, especially conservative ones, tend to receive more followers, follow more automated accounts, and find themselves in echo chambers.
Edit intent: clarity
Original:  We find weak evidence of liberal bias in the news feed ranking algorithm for conservative accounts.
Revised:  We find weak evidence of liberal bias in the news feed ranking algorithm for partisan accounts.
Edit intent: clarity
Original:  Partisan accounts, especially conservative ones, tend to receive more followers , find themselves in denser communities, and follow more automated accounts.
Revised:  Partisan accounts, especially conservative ones, tend to receive more followers and follow more automated accounts.
Edit intent: clarity
Original:  Due to its pivotal role of guiding customers towards purchasing, there is a natural motivation for unscrupulous parties to spoof RS for profits.
Revised:  Due to its pivotal role in guiding customers towards purchasing, there is a natural motivation for unscrupulous parties to spoof RS for profits.
Edit intent: fluency
Original:  In this paper  we study the shilling attack: a subsistent and profitable attack where an adversarial party injects a number of user profiles to promote or demote a target item.
Revised:  In this paper , we study the shilling attack: a subsistent and profitable attack where an adversarial party injects a number of user profiles to promote or demote a target item.
Edit intent: fluency
Original:  AUSH is capable of tailoring attacks against RS according to budget and complex attack goals  such as targeting on a specific user group.
Revised:  AUSH is capable of tailoring attacks against RS according to budget and complex attack goals , such as targeting on a specific user group.
Edit intent: fluency
Original:  AUSH is capable of tailoring attacks against RS according to budget and complex attack goals  such as targeting on a specific user group.
Revised:  AUSH is capable of tailoring attacks against RS according to budget and complex attack goals such as targeting a specific user group.
Edit intent: fluency
Original: Ca^{2+} plays  important role in cell signal transduction.
Revised: Ca^{2+} plays an important role in cell signal transduction.
Edit intent: fluency
Original:  In this wrok, the 3-dimensional probability distribution of Ca^{2+}  which is read out by phosphorylation  is studied in two scenarios with simulation and mean field ansatz .
Revised:  In this wrok, the 3-dimensional probability distribution of Ca^{2+} , which is read out by phosphorylation is studied in two scenarios with simulation and mean field ansatz .
Edit intent: fluency
Original:  In this wrok, the 3-dimensional probability distribution of Ca^{2+}  which is read out by phosphorylation  is studied in two scenarios with simulation and mean field ansatz .
Revised:  In this wrok, the 3-dimensional probability distribution of Ca^{2+} which is read out by phosphorylation , is studied in two scenarios with simulation and mean field ansatz .
Edit intent: fluency
Original:  Thus, some recent spoken language understanding (SLU) modules have utilized an end-to-end structure that preserves the uncertainty information.
Revised:  Thus, some recent spoken language understanding (SLU) modules have utilized end-to-end structure that preserves the uncertainty information.
Edit intent: fluency
Original:  Thus, some recent spoken language understanding (SLU) modules have utilized an end-to-end structure that preserves the uncertainty information.
Revised:  Thus, some recent spoken language understanding (SLU) modules have utilized an end-to-end structures that preserve the uncertainty information.
Edit intent: fluency
Original:  We demonstrate the validity of our proposal upon the performance on the Fluent Speech Command dataset .
Revised:  We demonstrate the validity of our proposal upon the performance on Fluent Speech Command dataset .
Edit intent: fluency
Original:  Simulation results show that our proposed work leads the network to equilibrium by reducing energy consumption and maintaining network throughput that are suitable for IoT .
Revised:  Simulation results show that our proposed work leads the network to equilibrium by reducing energy consumption and maintaining high network throughput .
Edit intent: clarity
Original: Routing in Software-Defined Wireless sensor networks (SD-WSNs) can be either single or multi-hop  whereas the network is either static or dynamic.
Revised: Routing in Software-Defined Wireless sensor networks (SD-WSNs) can be either single or multi-hop , whereas the network is either static or dynamic.
Edit intent: fluency
Original:  On the other hand, if moving sensors are there  then SDN controllers of zones are not able to handle route discovery sessions by themselves;
Revised:  On the other hand, if moving sensors are there , then SDN controllers of zones are not able to handle route discovery sessions by themselves;
Edit intent: fluency
Original:  On the other hand, if moving sensors are there  then SDN controllers of zones are not able to handle route discovery sessions by themselves;
Revised:  On the other hand, if moving sensors are there then SDN controllers of zones cannot handle route discovery sessions by themselves;
Edit intent: clarity
Original:  Moving sensors find lots of applications in robotics where robots continue to move from one room to another to sensing the environment.
Revised:  Moving sensors find lots of robotics applications where robots continue to move from one room to another to sensing the environment.
Edit intent: clarity
Original:  A huge amount of energy can be saved in these kinds of networks if transmission range control is applied.
Revised:  A huge amount of energy can be saved in these networks if transmission range control is applied.
Edit intent: clarity
Original:  The multiple power levels exist in each node, and each of these levels takes possible actions after a potential sender node decides to transmit/forward a message.
Revised:  Multiple power levels exist in each node, and each of these levels takes possible actions after a potential sender node decides to transmit/forward a message.
Edit intent: coherence
Original:  Based on each such action , the next states of the concerned sender node as well as the communication session are re-determined while the router receives a reward.
Revised:  Based on each such activity , the next states of the concerned sender node as well as the communication session are re-determined while the router receives a reward.
Edit intent: clarity
Original:  Based on each such action , the next states of the concerned sender node as well as the communication session are re-determined while the router receives a reward.
Revised:  Based on each such action , the next states of the concerned sender node and the communication session are re-determined while the router receives a reward.
Edit intent: clarity
Original:  In order to decide the optimum power level in the next iteration , the Epsilon-greedy algorithm is applied in this study .
Revised:  The Epsilon-greedy algorithm is applied in this study to decide the optimum power level in the next iteration , the Epsilon-greedy algorithm is applied in this study .
Edit intent: clarity
Original:  In order to decide the optimum power level in the next iteration , the Epsilon-greedy algorithm is applied in this study .
Revised:  In order to decide the optimum power level in the next iteration .
Edit intent: clarity
Original:  Simulation results show that our proposed work leads the network to equilibrium by reducing energy consumption and maintaining high network throughput.
Revised:  Simulation results show that our proposed work leads the network to equilibrium by reducing energy consumption and maintaining network throughput.
Edit intent: clarity
Original: In this work we present a new and small corpus in the area of Computational Creativity (CC) , the Literary Sentiment Sentence Spanish Corpus (LISSS).
Revised: In this work we present a new small data-set in Computational Creativity (CC) , the Literary Sentiment Sentence Spanish Corpus (LISSS).
Edit intent: clarity
Original:  We address this corpus of literary sentences in order to evaluate algorithms of sentiment classification and emotions detection.
Revised:  We address this corpus of literary sentences in order to evaluate or design algorithms of emotions classification and detection.
Edit intent: clarity
Original:  We have constitute it by manually classifying its sentences in five emotions: Love, Fear, Happiness, Anger and Sadness/Pain.
Revised:  We have constitute this corpus by manually classifying its sentences in five emotions: Love, Fear, Happiness, Anger and Sadness/Pain.
Edit intent: clarity
Original:  We have constitute it by manually classifying its sentences in five emotions: Love, Fear, Happiness, Anger and Sadness/Pain.
Revised:  We have constitute it by manually classifying the sentences in a set of emotions: Love, Fear, Happiness, Anger and Sadness/Pain.
Edit intent: clarity
Original:  The LISSS corpus will be available to the community as a free resource to evaluate or create CC algorithms.
Revised:  The LISSS corpus will be available to the community as a free resource to evaluate or create CC-like algorithms.
Edit intent: clarity
Original: Predicting the success of research proposals is of considerable relevance to research funding bodies, scientific entities and government agencies.
Revised: Predicting the output of research grants is of considerable relevance to research funding bodies, scientific entities and government agencies.
Edit intent: clarity
Original:  In this study, we investigate whether text features extracted from proposals title and abstracts are able to identify successful funded research proposals .
Revised:  In this study, we investigate whether text features extracted from projects title and abstracts are able to identify successful funded research proposals .
Edit intent: fluency
Original:  In this study, we investigate whether text features extracted from proposals title and abstracts are able to identify successful funded research proposals .
Revised:  In this study, we investigate whether text features extracted from proposals title and abstracts are able to identify productive grants .
Edit intent: clarity
Original:  Topical and complexity text features were used to identify predictors of success .
Revised:  Topical and complexity text features were used to identify predictors of productivity .
Edit intent: clarity
Original:  The results indicate that both topical and complexity measurements are relevant for identifying successful proposals in the considered dataset .
Revised:  The results indicate that there is a statistically significant relationship between text features and grants productivity, however such a dependence is weak .
Edit intent: clarity
Original:  A feature relevance analysis revealed that  abstract text length and metrics derived from lexical diversity are among the most discriminative features.
Revised:  A feature relevance analysis revealed that the abstract text length and metrics derived from lexical diversity are among the most discriminative features.
Edit intent: fluency
Original:  We also found that the prediction accuracy has no significant dependence on the considered proposal language .
Revised:  We also found that the prediction accuracy has a dependence on the considered proposal language .
Edit intent: clarity
Original:  Our findings suggest that textual information, in combination with other features , are potentially useful to assist the identification of relevant research ideas.
Revised:  Our findings suggest that text features should be used in combination with other features , are potentially useful to assist the identification of relevant research ideas.
Edit intent: clarity
Original:  Our findings suggest that textual information, in combination with other features , are potentially useful to assist the identification of relevant research ideas.
Revised:  Our findings suggest that textual information, in combination with other features to assist the identification of relevant research ideas.
Edit intent: clarity
Original:  We show the effectiveness of the proposed model with audio and visual modalities on the dense video captioning task, yet the module is capable to input any two modalities in a sequence-to-sequence task.
Revised:  We show the effectiveness of the proposed model with audio and visual modalities on the dense video captioning task, yet the module is capable of digesting any two modalities in a sequence-to-sequence task.
Edit intent: clarity
Original:  We  show that the pre-training a bi-modal encoder along with a bi-modal decoder for captioning can be used as a feature extractor for a simple proposal generation module.
Revised:  We also show that the pre-training a bi-modal encoder along with a bi-modal decoder for captioning can be used as a feature extractor for a simple proposal generation module.
Edit intent: coherence
Original:  We  show that the pre-training a bi-modal encoder along with a bi-modal decoder for captioning can be used as a feature extractor for a simple proposal generation module.
Revised:  We show that the pre-trained bi-modal encoder along with a bi-modal decoder for captioning can be used as a feature extractor for a simple proposal generation module.
Edit intent: fluency
Original:  We  show that the pre-training a bi-modal encoder along with a bi-modal decoder for captioning can be used as a feature extractor for a simple proposal generation module.
Revised:  We show that the pre-training a bi-modal encoder as a part of the bi-modal decoder for captioning can be used as a feature extractor for a simple proposal generation module.
Edit intent: clarity
Original: Without any doubt, Machine Learning (ML) will be an important driver of future communications due to its foreseen performance in front of complex problems.
Revised: Without any doubt, Machine Learning (ML) will be an important driver of future communications due to its foreseen performance when applied to complex problems.
Edit intent: clarity
Original:  Network simulators can facilitate the adoption of ML-based solutions by means of training, testing, and validating ML models before being applied to an operative network.
Revised:  In particular, we present an architectural integration of simulators in ML-aware networks for training, testing, and validating ML models before being applied to an operative network.
Edit intent: clarity
Original:  Network simulators can facilitate the adoption of ML-based solutions by means of training, testing, and validating ML models before being applied to an operative network.
Revised:  Network simulators can facilitate the adoption of ML-based solutions by means of training, testing, and validating ML models before being applied to the operative network.
Edit intent: fluency
Original:   Finally, we showcase the potential benefits of integrating network simulators into ML-assisted communications through a proof-of-concept testbed implementation of a residential Wi-Fi network.
Revised:  Finally, we illustrate the integration of network simulators into ML-assisted communications through a proof-of-concept testbed implementation of a residential Wi-Fi network.
Edit intent: clarity
Original:  The T cell response is a critical part of both individual and herd immunity to SARS-CoV-2 and the efficacy of developed vaccines .
Revised:  T cells play a key role in the adaptive antiviral immune response by killing infected cells and facilitating the selection of virus-specific antibodies .
Edit intent: clarity
Original:  However neither the dynamics and cross-reactivity of the SARS-CoV-2-specific T cell response nor the diversity of resulting immune memory are well understood.
Revised:  However neither the dynamics and cross-reactivity of the SARS-CoV-2 specific T cell response nor the diversity of resulting immune memory are well understood.
Edit intent: fluency
Original:  Certain CD4+ clones were detected in the memory fraction at the pre-infection timepoint, suggesting participation of pre-existing cross-reactive memory T cells in the immune response to SARS-CoV-2.
Revised:  Certain T cell clones were detected in the memory fraction at the pre-infection timepoint, suggesting participation of pre-existing cross-reactive memory T cells in the immune response to SARS-CoV-2.
Edit intent: clarity
Original:  However neither the dynamics and cross-reactivity of the SARS-CoV-2 specific T cell response nor the diversity of resulting immune memory are well understood.
Revised:  However neither the dynamics and cross-reactivity of the SARS-CoV-2-specific T cell response nor the diversity of resulting immune memory are well understood.
Edit intent: fluency
Original:  In this study we use longitudinal high-throughput T cell receptor  sequencing to track changes in the T cell repertoire following two mild cases of COVID-19 infection .
Revised:  In this study we use longitudinal high-throughput T cell receptor (TCR) sequencing to track changes in the T cell repertoire following two mild cases of COVID-19 infection .
Edit intent: clarity
Original:  In this study we use longitudinal high-throughput T cell receptor  sequencing to track changes in the T cell repertoire following two mild cases of COVID-19 infection .
Revised:  In this study we use longitudinal high-throughput T cell receptor sequencing to track changes in the T cell repertoire following two mild cases of COVID-19 .
Edit intent: clarity
Original:  In both donors we identified SARS-CoV-2-responding CD4+ and CD8+ T cell clones .
Revised:  In both donors we identified CD4+ and CD8+ T cell clones .
Edit intent: clarity
Original:  This also gives an extremal bound of O_k(n^k) on the number of minimum k-cuts in an n-vertex graph and an algorithm to compute a minimum k-cut in similar runtime.
Revised:  This also gives an extremal bound of O_k(n^k) on the number of minimum k-cuts and an algorithm to compute a minimum k-cut in similar runtime.
Edit intent: clarity
Original:  The first main ingredient in our result is a fine-grained analysis of how the graph shrinks---and how the average degree evolves---under the Karger-Stein process.
Revised:  The first main ingredient in our result is a fine-grained analysis of how the graph shrinks -- and how the average degree evolves---under the Karger-Stein process.
Edit intent: fluency
Original:  The first main ingredient in our result is a fine-grained analysis of how the graph shrinks---and how the average degree evolves---under the Karger-Stein process.
Revised:  The first main ingredient in our result is a fine-grained analysis of how the graph shrinks---and how the average degree evolves -- in the Karger process.
Edit intent: clarity
Original:  The second ingredient is an extremal result bounding the number of cuts of size less than 2 \lambda_k/k, using the Sunflower lemma.
Revised:  The second ingredient is an extremal bound on the number of cuts of size less than 2 \lambda_k/k, using the Sunflower lemma.
Edit intent: clarity
Original: In the k-cut problem, we want to find the smallest set of edges whose deletion breaks a given (multi)graph into k connected components.
Revised: In the k-cut problem, we want to find the lowest-weight set of edges whose deletion breaks a given (multi)graph into k connected components.
Edit intent: clarity
Original:  Algorithms of Karger Stein and Thorup showed how to find such a minimum k-cut in time approximately O(n^{2k}) .
Revised:  Algorithms of Karger \& Stein can solve this in roughly O(n^{2k}) .
Edit intent: clarity
Original:  The best lower bounds come from conjectures about the solvability of the k-clique problem , and show that solving k-cut is likely to require time \Omega(n ^k) .
Revised:  The best lower bounds come from conjectures about the k-clique problem , and show that solving k-cut is likely to require time \Omega(n ^k) .
Edit intent: clarity
Original:  The best lower bounds come from conjectures about the solvability of the k-clique problem , and show that solving k-cut is likely to require time \Omega(n ^k) .
Revised:  The best lower bounds come from conjectures about the solvability of the k-clique problem imply that \Omega(n ^k) .
Edit intent: clarity
Original:  Recent results of Gupta, Lee  Li have given special-purpose algorithms that solve the problem in time n^{1.98k + O(1)} , and ones that have better performance for special classes of graphs (e.g., for small integer  weights).
Revised:  Recent results of Gupta, Lee Li have given special-purpose algorithms that solve the problem in time n^{1.98k + O(1)} , and ones that have better performance for certain classes of graphs (e.g., for small integer weights).
Edit intent: clarity
Original:  In this work, we resolve the problem for general graphs , by showing that the Contraction Algorithm of Karger outputs any fixed k-cut of weight \alpha \lambda_k with probability \Omega_k(n^{-\alpha k}), where \lambda_k denotes the minimum k-cut size .
Revised:  In this work, we resolve the problem for general graphs . We show that the Contraction Algorithm of Karger outputs any fixed k-cut of weight \alpha \lambda_k with probability \Omega_k(n^{-\alpha k}), where \lambda_k denotes the minimum k-cut size .
Edit intent: coherence
Original:  In this work, we resolve the problem for general graphs , by showing that the Contraction Algorithm of Karger outputs any fixed k-cut of weight \alpha \lambda_k with probability \Omega_k(n^{-\alpha k}), where \lambda_k denotes the minimum k-cut size .
Revised:  In this work, we resolve the problem for general graphs , by showing that the Contraction Algorithm of Karger outputs any fixed k-cut of weight \alpha \lambda_k with probability \Omega_k(n^{-\alpha k}), where \lambda_k denotes the minimum k-cut weight .
Edit intent: clarity
Original:  The second ingredient is an extremal bound on the number of cuts of size less than 2 \lambda_k/k, using the Sunflower lemma  .
Revised:  The second ingredient is an extremal bound on the number of cuts of weight less than 2 \lambda_k/k, using the Sunflower lemma .
Edit intent: clarity
Original:  The results show that the generated generators were able to achieve a good performance on most of the fitness functions over these three problems but on Zelda and Sokoban  they tend to depend on the initial state than modifying the map.
Revised:  The results show that the generated generators were able to achieve good performance on most of the fitness functions over these three problems but on Zelda and Sokoban they tend to depend on the initial state than modifying the map.
Edit intent: fluency