wanyu/IteraTeR_v2 huggingface dataset:
Original:  but the small natural mortality of adult has the ability to promote a mite-free colony as time lag is small or at an intermediate level;
Revised:  but the small natural mortality of adult has the ability to promote a mite-free colony when time lag is small or at an intermediate level;
Edit intent: clarity
Original:  (c) Large brood' s infestation rate can destabilize the  dynamics leading to colony collapse depending on initial population size under constant and non-constant seasonal model ;
Revised:  (c) High brood' infestation rates can destabilize the dynamics leading to colony collapse depending on initial population size under constant and non-constant seasonal model ;
Edit intent: clarity
Original:  (c) Large brood' s infestation rate can destabilize the  dynamics leading to colony collapse depending on initial population size under constant and non-constant seasonal model ;
Revised:  (c) Large brood' s infestation rate can destabilize the colony dynamics leading to colony collapse depending on initial population size under constant and non-constant seasonal model ;
Edit intent: fluency
Original:  (c) Large brood' s infestation rate can destabilize the  dynamics leading to colony collapse depending on initial population size under constant and non-constant seasonal model ;
Revised:  (c) Large brood' s infestation rate can destabilize the dynamics leading to population collapse depending on initial population size under constant and non-constant seasonal model ;
Edit intent: clarity
Original:  (c) Large brood' s infestation rate can destabilize the  dynamics leading to colony collapse depending on initial population size under constant and non-constant seasonal model ;
Revised:  (c) Large brood' s infestation rate can destabilize the dynamics leading to colony collapse depending on initial population size under constant and seasonal conditions ;
Edit intent: clarity
Original:  (d) Results from our sensitivity analysis indicate that the queen's egg-laying may have the greatest effect on colony  size.
Revised:  (d) Results from sensitivity analysis indicate that the queen's egg-laying may have the greatest effect on colony size.
Edit intent: fluency
Original:  (d) Results from our sensitivity analysis indicate that the queen's egg-laying may have the greatest effect on colony  size.
Revised:  (d) Results from our sensitivity analysis indicate the queen's egg-laying may have the greatest effect on colony size.
Edit intent: fluency
Original:  (d) Results from our sensitivity analysis indicate that the queen's egg-laying may have the greatest effect on colony  size.
Revised:  (d) Results from our sensitivity analysis indicate that the queen's egg-laying may have the greatest effect on colony population size.
Edit intent: clarity
Original:  The death rate of the brood and the colony size at which brood survivability is  half maximal were also shown to be highly sensitive with an inverse correlation to the colony population size.
Revised:  The brood death rate and the colony size at which brood survivability is half maximal were also shown to be highly sensitive with an inverse correlation to the colony population size.
Edit intent: clarity
Original:  The death rate of the brood and the colony size at which brood survivability is  half maximal were also shown to be highly sensitive with an inverse correlation to the colony population size.
Revised:  The death rate of the brood and the colony size at which brood survivability is the half maximal were also shown to be highly sensitive with an inverse correlation to the colony population size.
Edit intent: fluency
Original:  Our results provide the dynamics generated by seasonality where the mite population dies out leaving healthy colony while all population goes extinct without seasonality .
Revised:  Our results provide insights on the effects of seasonality on the dynamics .
Edit intent: clarity
Original: The world evolution of the Severe acute respiratory syndrome coronavirus 2 (SARS-Cov2 or simply COVID-19) lead the World Health Organization to declare it a pandemic.
Revised: The world evolution of the Severe acute respiratory syndrome coronavirus 2 (SARS-Cov2 or simply COVID-19) led the World Health Organization to declare it a pandemic.
Edit intent: fluency
Original:  The disease appeared in China in December 2019, and it  spread fast around the world, specially in european countries like Italy and Spain.
Revised:  The disease appeared in China in December 2019, and it has spread fast around the world, specially in european countries like Italy and Spain.
Edit intent: clarity
Original:  In order to slow down the initial grow of the disease through the country, confirmed positive cases were isolated to not transmit the disease.
Revised:  In order to slow down the initial growth of the disease through the country, confirmed positive cases were isolated to not transmit the disease.
Edit intent: fluency
Original:  We observed that most of the Obsidian participants were able to successfully complete most of the programming tasks we gave them .
Revised:  We observed that Obsidian participants were able to successfully complete most of the programming tasks we gave them .
Edit intent: clarity
Original:  We observed that most of the Obsidian participants were able to successfully complete most of the programming tasks we gave them .
Revised:  We observed that most of the Obsidian participants were able to successfully complete more of the programming tasks we gave them .
Edit intent: clarity
Original: We discuss combined effects of network clustering and adaptivity on epidemic spread .
Revised: We discuss combined effects of network clustering and adaptivity on epidemic spreading .
Edit intent: fluency
Original:  We address the question which mechanism is more effective for prohibiting disease propagation in a connected network:
Revised:  We address the question concerning the choice of optimal mechanism for most effective prohibiting disease propagation in a connected network:
Edit intent: clarity
Original: This paper describes a new and efficiently scalable approach to measure technological similarity between patents by combining  techniques from natural language processing with nearest-neighbor approximation.
Revised: This paper describes an efficiently scalable approach to measure technological similarity between patents by combining techniques from natural language processing with nearest-neighbor approximation.
Edit intent: clarity
Original:  We validate both technological signature and similarity in various ways, and demonstrate  their usefulness to create patent quality indicators, measure knowledge flows, and map technological change .
Revised:  We validate both technological signature and similarity in various ways, and demonstrate their usefulness to measure knowledge flows, and map technological change .
Edit intent: clarity
Original:  We validate both technological signature and similarity in various ways, and demonstrate  their usefulness to create patent quality indicators, measure knowledge flows, and map technological change .
Revised:  We validate both technological signature and similarity in various ways, and demonstrate their usefulness to create patent quality indicators, measure knowledge flows, map technological change .
Edit intent: fluency
Original:  Our dashboard allows visibility into the social media discussions around Coronavirus and the quality of information shared on the platform as the situation evolves .
Revised:  The dashboard allows visibility into the social media discussions around Coronavirus and the quality of information shared on the platform as the situation evolves .
Edit intent: fluency
Original:  Our dashboard allows visibility into the social media discussions around Coronavirus and the quality of information shared on the platform as the situation evolves .
Revised:  Our dashboard allows visibility into the social media discussions around Coronavirus and the quality of information shared on the platform , updated over time .
Edit intent: clarity
Original: The ongoing Coronavirus Disease (COVID-19) pandemic highlights the interconnected-ness of our present-day globalized world.
Revised: The ongoing Coronavirus (COVID-19) pandemic highlights the interconnected-ness of our present-day globalized world.
Edit intent: clarity
Original: The ongoing Coronavirus Disease (COVID-19) pandemic highlights the interconnected-ness of our present-day globalized world.
Revised: The ongoing Coronavirus Disease (COVID-19) pandemic highlights the inter-connectedness of our present-day globalized world.
Edit intent: fluency
Original:  We collect streaming data using the Twitter API from March 1, 2020 to date and identify false, misleading and clickbait contents from collected Tweets.
Revised:  We collect streaming data using the Twitter API , starting March 1, 2020 to date and identify false, misleading and clickbait contents from collected Tweets.
Edit intent: coherence
Original:  The dashboard maintains an evolving list of misinformation cascades, sentiments and emerging trends over time, accessible online at URL Keywords.
Revised:  The dashboard maintains an evolving list of misinformation cascades, sentiments and emerging trends in the
Edit intent: clarity
Original:  Currently, detection of acute infection as well as assessment of a patient's severity of illness are based on imperfect(and often superficial) measures of patient physiology .
Revised:  Current detection of acute infection as well as assessment of a patient's severity of illness are based on imperfect(and often superficial) measures of patient physiology .
Edit intent: fluency
Original:  Currently, detection of acute infection as well as assessment of a patient's severity of illness are based on imperfect(and often superficial) measures of patient physiology .
Revised:  Currently, detection of acute infection as well as assessment of a patient's severity of illness are imperfect .
Edit intent: clarity
Original:  Characterization of a patient's immune response by quantifying expression levels of key genes from blood represents a potentially more timely and precise means of accomplishing both tasks.
Revised:  Characterization of a patient's immune response by quantifying expression levels of specific genes from blood represents a potentially more timely and precise means of accomplishing both tasks.
Edit intent: clarity
Original:  In this analysis, we compare HO approaches for the development of diagnostic classifiers of acute infection and in-hospital mortality from gene expression of 29 diagnostic markers.
Revised:  We compare HO approaches for the development of diagnostic classifiers of acute infection and in-hospital mortality from gene expression of 29 diagnostic markers.
Edit intent: clarity
Original: We highlight the need for additional considerations about patient heterogeneity, dataset partitioning and optimization setup when applying HO methods in the healthcare context.
Revised: We highlight the need for further practical, deployment-centered benchmarking of HO approaches in the healthcare context.
Edit intent: clarity
Original:  A2PIT assumes a fixed number of outputs and uses auxiliary autoencoding losses to force the invalid outputs to be the copies of the input mixture, and detects invalid outputs in a fully unsupervised way during inference phase.
Revised:  A2PIT assumes a fixed number of outputs and uses auxiliary autoencoding loss to force the invalid outputs to be the copies of the input mixture, and detects invalid outputs in a fully unsupervised way during inference phase.
Edit intent: fluency
Original: Game-playing Evolutionary Algorithms, specifically Rolling Horizon Evolutionary Algorithms, have recently managed to beat the state of the art in performance across many games.
Revised: Game-playing Evolutionary Algorithms, specifically Rolling Horizon Evolutionary Algorithms, have recently managed to beat the state of the art in win rate across many video games.
Edit intent: clarity
Original:  However, the best results per game are highly dependent on the specific configuration of modifications and hybrids introduced over several works, each described as parameters in the algorithm.
Revised:  However, the best results in a game are highly dependent on the specific configuration of modifications and hybrids introduced over several works, each described as parameters in the algorithm.
Edit intent: clarity
Original:  This paper presents the state of the art in Rolling Horizon Evolutionary algorithms , combining all modifications described in literature and some additional ones for a large resultant hybrid.
Revised:  This paper presents the state of the art in Rolling Horizon Evolutionary Algorithms , combining all modifications described in literature and some additional ones for a large resultant hybrid.
Edit intent: fluency
Original:  This paper presents the state of the art in Rolling Horizon Evolutionary algorithms , combining all modifications described in literature and some additional ones for a large resultant hybrid.
Revised:  This paper presents the state of the art in Rolling Horizon Evolutionary algorithms , combining all modifications described in literature , as well as new ones, for a large resultant hybrid.
Edit intent: clarity
Original:  It then uses a parameter optimiser, the N-Tuple Bandit Evolutionary Algorithm, to find the best combination of parameters in 20 games with various properties from the General Video Game AI Framework.
Revised:  We then use a parameter optimiser, the N-Tuple Bandit Evolutionary Algorithm, to find the best combination of parameters in 20 games with various properties from the General Video Game AI Framework.
Edit intent: fluency
Original:  It then uses a parameter optimiser, the N-Tuple Bandit Evolutionary Algorithm, to find the best combination of parameters in 20 games with various properties from the General Video Game AI Framework.
Revised:  It then uses a parameter optimiser, the N-Tuple Bandit Evolutionary Algorithm, to find the best combination of parameters in 20 games from the General Video Game AI Framework.
Edit intent: clarity
Original:  We then analyse the algorithm's parameters and  interesting combinations revealed through the parameter optimisation process.
Revised:  We then analyse the algorithm's parameters and some interesting combinations revealed through the parameter optimisation process.
Edit intent: coherence
Original:  We then analyse the algorithm's parameters and  interesting combinations revealed through the parameter optimisation process.
Revised:  We then analyse the algorithm's parameters and interesting combinations revealed through the optimisation process.
Edit intent: clarity
Original:  Lastly, we show that it is possible to automatically explore a large parameter space and find configurations which outperform the state of the art  on several games  .
Revised:  Lastly, we find new state of the art on several games .
Edit intent: clarity
Original:  Lastly, we show that it is possible to automatically explore a large parameter space and find configurations which outperform the state of the art  on several games  .
Revised:  Lastly, we show that it is possible to automatically explore a large parameter space and find configurations which outperform the state of the art solutions on several games .
Edit intent: clarity
Original: [Objective] To develop a CAD system for proximal femoral fracture for plain frontal hip radiographs by CNN trained on a large dataset collected at multiple institutions.
Revised: [Objective] To develop a CAD system for hip fracture for plain frontal hip radiographs by CNN trained on a large dataset collected at multiple institutions.
Edit intent: clarity
Original:  [Conclusions] The CAD system using AI for the hip fracture which we developed could offer the diagnosis reason , and it became an image diagnosis tool with the high diagnosis accuracy.
Revised:  [Conclusions] The CAD system using AI for the hip fracture which we developed could offer the diagnosis basis , and it became an image diagnosis tool with the high diagnosis accuracy.
Edit intent: coherence
Original:  [Materials and methods ] In total, 4851 cases of hip fracture patients who visited each institution between  2009 and  2019 were included.
Revised:  [Materials and Methods ] In total, 4851 cases of hip fracture patients who visited each institution between 2009 and 2019 were included.
Edit intent: fluency
Original:  In the final evaluation, accuracy, sensitivity, specificity, F-value , and AUC were evaluated.
Revised:  In the final evaluation, accuracy, sensitivity, specificity, F-value and area under the curve (AUC) were evaluated.
Edit intent: clarity
Original:   Grad-CAM  was used to conceptualize the  basis of the diagnosis by the CAD system.
Revised:  Grad-CAM ) was used to conceptualize the basis of the diagnosis by the CAD system.
Edit intent: fluency
Original:   Grad-CAM  was used to conceptualize the  basis of the diagnosis by the CAD system.
Revised:  Grad-CAM was used to conceptualize the diagnostic basis of the diagnosis by the CAD system.
Edit intent: coherence
Original:   Grad-CAM  was used to conceptualize the  basis of the diagnosis by the CAD system.
Revised:  Grad-CAM was used to conceptualize the basis of the CAD system.
Edit intent: clarity
Original:  [Results] The diagnostic accuracy of the learning model was 96.1 \%, sensitivity  95.2 \%, specificity  96.9 \%, F value 0.961, and AUC  0.99.  Grad-CAM was used to show the most accurate diagnosis .
Revised:  [Results] The diagnostic accuracy of the learning model was accuracy of 96. 1 \%, sensitivity 95.2 \%, specificity 96.9 \%, F value 0.961, and AUC 0.99. Grad-CAM was used to show the most accurate diagnosis .
Edit intent: clarity
Original:  [Results] The diagnostic accuracy of the learning model was 96.1 \%, sensitivity  95.2 \%, specificity  96.9 \%, F value 0.961, and AUC  0.99.  Grad-CAM was used to show the most accurate diagnosis .
Revised:  [Results] The diagnostic accuracy of the learning model was 96.1 \%, sensitivity of 95.2 \%, specificity 96.9 \%, F value 0.961, and AUC 0.99. Grad-CAM was used to show the most accurate diagnosis .
Edit intent: clarity
Original:  [Results] The diagnostic accuracy of the learning model was 96.1 \%, sensitivity  95.2 \%, specificity  96.9 \%, F value 0.961, and AUC  0.99.  Grad-CAM was used to show the most accurate diagnosis .
Revised:  [Results] The diagnostic accuracy of the learning model was 96.1 \%, sensitivity 95.2 \%, specificity of 96.9 \%, F value 0.961, and AUC 0.99. Grad-CAM was used to show the most accurate diagnosis .
Edit intent: clarity
Original:  [Results] The diagnostic accuracy of the learning model was 96.1 \%, sensitivity  95.2 \%, specificity  96.9 \%, F value 0.961, and AUC  0.99.  Grad-CAM was used to show the most accurate diagnosis .
Revised:  [Results] The diagnostic accuracy of the learning model was 96.1 \%, sensitivity 95.2 \%, specificity 96.9 \%, F-value of 0.961, and AUC 0.99. Grad-CAM was used to show the most accurate diagnosis .
Edit intent: clarity
Original:  [Results] The diagnostic accuracy of the learning model was 96.1 \%, sensitivity  95.2 \%, specificity  96.9 \%, F value 0.961, and AUC  0.99.  Grad-CAM was used to show the most accurate diagnosis .
Revised:  [Results] The diagnostic accuracy of the learning model was 96.1 \%, sensitivity 95.2 \%, specificity 96.9 \%, F value 0.961, and AUC of 0.99. Grad-CAM was used to show the most accurate diagnosis .
Edit intent: clarity
Original: If K is a large enough field and P \subset K^2 is a fixed, generic set of points , which is available for precomputation , we show how to compute all  the evaluations of any dense polynomial f on Pin quasi-linear time.
Revised: Suppose K is a large enough field and P \subset K^2 is a fixed, generic set of points , which is available for precomputation , we show how to compute all the evaluations of any dense polynomial f on Pin quasi-linear time.
Edit intent: coherence
Original: If K is a large enough field and P \subset K^2 is a fixed, generic set of points , which is available for precomputation , we show how to compute all  the evaluations of any dense polynomial f on Pin quasi-linear time.
Revised: If K is a large enough field and P \subset K^2 is a fixed, generic set of points which is available for precomputation , we show how to compute all the evaluations of any dense polynomial f on Pin quasi-linear time.
Edit intent: fluency
Original: If K is a large enough field and P \subset K^2 is a fixed, generic set of points , which is available for precomputation , we show how to compute all  the evaluations of any dense polynomial f on Pin quasi-linear time.
Revised: If K is a large enough field and P \subset K^2 is a fixed, generic set of points , which is available for precomputation . We introduce a technique called the evaluations of any dense polynomial f on Pin quasi-linear time.
Edit intent: clarity
Original:  Similarly, in quasi-linear time then given interpolation constraints on P and a target y-degree, we compute an f having those evaluations on P and at most that y-degree  .
Revised:  Similarly, in quasi-linear time then given interpolation constraints on P and a target y-degree, we compute an f having those evaluations on P and satisfies an input y-degree .
Edit intent: clarity
Original:  Our genericity assumption is explicit and we prove  most point sets over a large enough field satisfy it .
Revised:  Our genericity assumption is explicit and we prove that it holds for most point sets over a large enough field satisfy it .
Edit intent: clarity
Original:  Our genericity assumption is explicit and we prove  most point sets over a large enough field satisfy it .
Revised:  Our genericity assumption is explicit and we prove most point sets over a large enough field .
Edit intent: clarity
Original:  If \mathcal{P} violates the assumption  our algorithms still work and the performance degrades smoothly according to a distance from being generic.
Revised:  If \mathcal{P} violates the assumption , our algorithms still work and the performance degrades smoothly according to a distance from being generic.
Edit intent: fluency
Original:  We apply the same technique to modular composition: fix a square-free G \in \mathbb{K}[x] and generic R \in \mathbb{K available for precomputation, we then input f \in \mathbb{K}[x,y] and output f(x, R (x)) ~\mathrm{rem~ G \in \mathbb{K}[x] } \operatorname{rem}  in quasi-linear time in the size of f, G, R .
Revised:  We apply the same technique to modular composition: fix a square-free G \in \mathbb{K}[x] and A \in \mathbb{K available for precomputation, we then input f \in \mathbb{K}[x,y] and output f(x, R (x)) ~\mathrm{rem~ G \in \mathbb{K}[x] } \operatorname{rem} in quasi-linear time in the size of f, G, R .
Edit intent: clarity
Original:  We apply the same technique to modular composition: fix a square-free G \in \mathbb{K}[x] and generic R \in \mathbb{K available for precomputation, we then input f \in \mathbb{K}[x,y] and output f(x, R (x)) ~\mathrm{rem~ G \in \mathbb{K}[x] } \operatorname{rem}  in quasi-linear time in the size of f, G, R .
Revised:  We apply the same technique to modular composition: fix a square-free G \in \mathbb{K}[x] and generic R \in \mathbb{K available for precomputation, then given an input f \in \mathbb{K}[x,y] and output f(x, R (x)) ~\mathrm{rem~ G \in \mathbb{K}[x] } \operatorname{rem} in quasi-linear time in the size of f, G, R .
Edit intent: clarity
Original:  We apply the same technique to modular composition: fix a square-free G \in \mathbb{K}[x] and generic R \in \mathbb{K available for precomputation, we then input f \in \mathbb{K}[x,y] and output f(x, R (x)) ~\mathrm{rem~ G \in \mathbb{K}[x] } \operatorname{rem}  in quasi-linear time in the size of f, G, R .
Revised:  We apply the same technique to modular composition: fix a square-free G \in \mathbb{K}[x] and generic R \in \mathbb{K available for precomputation, we then input f \in \mathbb{K}[x,y] we show how to compute f(x, R (x)) ~\mathrm{rem~ G \in \mathbb{K}[x] } \operatorname{rem} in quasi-linear time in the size of f, G, R .
Edit intent: clarity