wanyu/IteraTeR_v2 huggingface dataset:
Original:  We also investigated the performance benefits of using features derived from PubMed metadata fields, from various publicly-available named entity recognizers and from pharmacokinetic dictionaries.
Revised:  We also investigated the performance benefits of using features derived from PubMed metadata fields, various publicly available named entity recognizers and from pharmacokinetic dictionaries.
Edit intent: fluency
Original:  We also investigated the performance benefits of using features derived from PubMed metadata fields, from various publicly-available named entity recognizers and from pharmacokinetic dictionaries.
Revised:  We also investigated the performance benefits of using features derived from PubMed metadata fields, from various publicly-available named entity recognizers , and pharmacokinetic dictionaries.
Edit intent: fluency
Original:  We found that word-bigram textual features were important for achieving optimal classifier performance , that features derived from Medical Subject Headings (MeSH) terms significantly improved abstract classification , and that some drug-related entity named recognition tools and dictionaries led to slight but significant improvements, especially in classification of evidence sentences . ...
Revised:  We found that word bigram features were important for achieving optimal classifier performance , that features derived from Medical Subject Headings (MeSH) terms significantly improved abstract classification , and that some drug-related entity named recognition tools and dictionaries led to slight but significant improvements, especially in classification of evidence sentences . ...
Edit intent: clarity
Original:  We found that word-bigram textual features were important for achieving optimal classifier performance , that features derived from Medical Subject Headings (MeSH) terms significantly improved abstract classification , and that some drug-related entity named recognition tools and dictionaries led to slight but significant improvements, especially in classification of evidence sentences . ...
Revised:  We found that word-bigram textual features were important for achieving optimal classifier performance and that features derived from Medical Subject Headings (MeSH) terms significantly improved abstract classification , and that some drug-related entity named recognition tools and dictionaries led to slight but significant improvements, especially in classification of evidence sentences . ...
Edit intent: fluency
Original:  We found that word-bigram textual features were important for achieving optimal classifier performance , that features derived from Medical Subject Headings (MeSH) terms significantly improved abstract classification , and that some drug-related entity named recognition tools and dictionaries led to slight but significant improvements, especially in classification of evidence sentences . ...
Revised:  We found that word-bigram textual features were important for achieving optimal classifier performance , that features derived from Medical Subject Headings (MeSH) terms significantly improved abstract classification . ...
Edit intent: coherence
Original: Let P be a set of n points in the plane and S a set of non-crossing line segments between vertices in P, called constraints.
Revised: Let P be a set of n vertices in the plane and S a set of non-crossing line segments between vertices in P, called constraints.
Edit intent: clarity
Original:  The constrained \theta _m-graph is constructed by partitioning the plane around each vertex into m disjoint cones, each with aperture \theta = 2 \pi/m, and adding an edge to the `closest' visible vertex in each cone.
Revised:  The constrained \Theta _m-graph is constructed by partitioning the plane around each vertex into m disjoint cones, each with aperture \theta = 2 \pi/m, and adding an edge to the `closest' visible vertex in each cone.
Edit intent: fluency
Original:  We consider how to route on the constrained \theta _6-graph.
Revised:  We consider how to route on the constrained \Theta _6-graph.
Edit intent: fluency
Original:  We first show that no deterministic 1-local routing algorithm is o(n)-competitive on all pairs of vertices of the constrained \theta _6-graph.
Revised:  We first show that no deterministic 1-local routing algorithm is o(n)-competitive on all pairs of vertices of the constrained \Theta _6-graph.
Edit intent: fluency
Original:  After that, we show how to route between any two visible vertices of the constrained \theta _6-graph using only 1-local information.
Revised:  After that, we show how to route between any two visible vertices of the constrained \Theta _6-graph using only 1-local information.
Edit intent: fluency
Original:  Additionally, we provide a 1-local 18-competitive routing algorithm for visible vertices in the constrained half- \theta _6-graph, a subgraph of the constrained \theta _6-graph that is equivalent to the Delaunay graph where the empty region is an equilateral triangle.
Revised:  Additionally, we provide a 1-local 18-competitive routing algorithm for visible vertices in the constrained half- \Theta _6-graph, a subgraph of the constrained \theta _6-graph that is equivalent to the Delaunay graph where the empty region is an equilateral triangle.
Edit intent: fluency
Original:  Additionally, we provide a 1-local 18-competitive routing algorithm for visible vertices in the constrained half- \theta _6-graph, a subgraph of the constrained \theta _6-graph that is equivalent to the Delaunay graph where the empty region is an equilateral triangle.
Revised:  Additionally, we provide a 1-local 18-competitive routing algorithm for visible vertices in the constrained half- \theta _6-graph, a subgraph of the constrained \Theta _6-graph that is equivalent to the Delaunay graph where the empty region is an equilateral triangle.
Edit intent: fluency
Original:  Our routing algorithm guarantees that the returned path has length at most 2 times the Euclidean distance between the source and destination .
Revised:  Our routing algorithm guarantees that the returned path is 2-competitive .
Edit intent: clarity
Original:  In addition, we show that unless NP=P, the maximum induced matching in a hamiltonian bipartite graph cannot be approximated  based on a hamiltonian cycle of the graph within a ratio of n^{ 1- \epsilon}, where n is the number of vertices in the graph and \epsilon is any positive constant.
Revised:  In addition, we show that unless NP=P, the maximum induced matching in a hamiltonian graph cannot be approximated based on a hamiltonian cycle of the graph within a ratio of n^{ 1- \epsilon}, where n is the number of vertices in the graph and \epsilon is any positive constant.
Edit intent: clarity
Original:  In addition, we show that unless NP=P, the maximum induced matching in a hamiltonian bipartite graph cannot be approximated  based on a hamiltonian cycle of the graph within a ratio of n^{ 1- \epsilon}, where n is the number of vertices in the graph and \epsilon is any positive constant.
Revised:  In addition, we show that unless NP=P, the maximum induced matching in a hamiltonian bipartite graph cannot be approximated within a ratio of n^{1-\epsilon based on a hamiltonian cycle of the graph within a ratio of n^{ 1- \epsilon}, where n is the number of vertices in the graph and \epsilon is any positive constant.
Edit intent: fluency
Original:  Even more worryingly, in many such situations, confidence in parameter estimates and forecasts is itself far over-estimated, leading to the potential for large errors that mask their own presence.
Revised:  Even more worryingly, in such situations, confidence in parameter estimates and forecasts is itself far over-estimated, leading to the potential for large errors that mask their own presence.
Edit intent: clarity
Original:  Even more worryingly, in many such situations, confidence in parameter estimates and forecasts is itself far over-estimated, leading to the potential for large errors that mask their own presence.
Revised:  Even more worryingly, in many such situations, confidence in parameter estimates and forecasts can itself be far over-estimated, leading to the potential for large errors that mask their own presence.
Edit intent: clarity
Original:  Second , we demonstrate an alternative based on stochastic models fit to raw data from the 2014 West African Ebola virus disease outbreak.
Revised:  Next , we demonstrate an alternative based on stochastic models fit to raw data from the 2014 West African Ebola virus disease outbreak.
Edit intent: fluency
Original:  Second , we demonstrate an alternative based on stochastic models fit to raw data from the 2014 West African Ebola virus disease outbreak.
Revised:  Second , we demonstrate an alternative based on stochastic models fit to raw data from the 2014 West Africa Ebola Virus Disease outbreak.
Edit intent: fluency
Original: We study two fundamental problems in computational geometry: finding the maximum inscribed ball (MaxIB) inside a polytope defined by m hyperplanes in a d-dimensional space, and finding the minimum enclosing ball (MinEB) of a set of n points in a d-dimensional space.
Revised: We study two fundamental problems in computational geometry: finding the maximum inscribed ball (MaxIB) inside a bounded polyhedron defined by m hyperplanes in a d-dimensional space, and finding the minimum enclosing ball (MinEB) of a set of n points in a d-dimensional space.
Edit intent: clarity
Original:  We translate both geometry problems into purely algebraic optimization questions, and apply ideas from first-order convex optimizations to obtain simple and nearly-linear-time algorithms.
Revised:  We translate both these geometric problems into optimization problems and apply first-order convex optimizations to obtain simple and nearly-linear-time algorithms.
Edit intent: clarity
Original:  For MaxIB, our algorithm produces a (1-\varepsilon)-approximate solution in time (m d \alpha / \varepsilon), compared to the best known running time  O(m d \alpha^3 / \varepsilon^3) of Xie, Snoeyink, and Xu [XSX06], where \alpha \geq 1 is the aspect ratio of the polytope.
Revised:  For MaxIB, (m d \alpha / \varepsilon), compared to the best known running time O(m d \alpha^3 / \varepsilon^3) of Xie, Snoeyink, and Xu [XSX06], where \alpha \geq 1 is the aspect ratio of the polytope.
Edit intent: clarity
Original:  For MaxIB, our algorithm produces a (1-\varepsilon)-approximate solution in time (m d \alpha / \varepsilon), compared to the best known running time  O(m d \alpha^3 / \varepsilon^3) of Xie, Snoeyink, and Xu [XSX06], where \alpha \geq 1 is the aspect ratio of the polytope.
Revised:  For MaxIB, our algorithm produces a (1-\varepsilon)-approximate solution in time the best known running time O(m d \alpha^3 / \varepsilon^3) of Xie, Snoeyink, and Xu [XSX06], where \alpha \geq 1 is the aspect ratio of the polytope.
Edit intent: clarity
Original:  For MaxIB, our algorithm produces a (1-\varepsilon)-approximate solution in time (m d \alpha / \varepsilon), compared to the best known running time  O(m d \alpha^3 / \varepsilon^3) of Xie, Snoeyink, and Xu [XSX06], where \alpha \geq 1 is the aspect ratio of the polytope.
Revised:  For MaxIB, our algorithm produces a (1-\varepsilon)-approximate solution in time (m d \alpha / \varepsilon), compared to the best known running time is O(m d \alpha^3 / \varepsilon^3) of Xie, Snoeyink, and Xu [XSX06], where \alpha \geq 1 is the aspect ratio of the polytope.
Edit intent: fluency
Original:  For MaxIB, our algorithm produces a (1-\varepsilon)-approximate solution in time (m d \alpha / \varepsilon), compared to the best known running time  O(m d \alpha^3 / \varepsilon^3) of Xie, Snoeyink, and Xu [XSX06], where \alpha \geq 1 is the aspect ratio of the polytope.
Revised:  For MaxIB, our algorithm produces a (1-\varepsilon)-approximate solution in time (m d \alpha / \varepsilon), compared to the best known running time O(m d \alpha^3 / \varepsilon^3) [XSX06], where \alpha \geq 1 is the aspect ratio of the polytope.
Edit intent: clarity
Original: We study two fundamental problems in computational geometry: finding the maximum inscribed ball (MaxIB) inside a bounded polyhedron defined by m hyperplanes in a d-dimensional space, and finding the minimum enclosing ball (MinEB) of a set of n points in a d-dimensional space.
Revised: We study two fundamental problems in computational geometry: finding the maximum inscribed ball (MaxIB) inside a bounded polyhedron defined by m hyperplanes , and the minimum enclosing ball (MinEB) of a set of n points in a d-dimensional space.
Edit intent: fluency
Original: We study two fundamental problems in computational geometry: finding the maximum inscribed ball (MaxIB) inside a bounded polyhedron defined by m hyperplanes in a d-dimensional space, and finding the minimum enclosing ball (MinEB) of a set of n points in a d-dimensional space.
Revised: We study two fundamental problems in computational geometry: finding the maximum inscribed ball (MaxIB) inside a bounded polyhedron defined by m hyperplanes in a d-dimensional space, and finding the minimum enclosing ball (MinEB) of a set of n points , both in d-dimensional space.
Edit intent: clarity
Original:  We obtain two new algorithms for MaxIB: one runs in O( m d \alpha / \varepsilon) time using smooth optimization, and the other runs in O( md + m \sqrt{d \alpha}  \alpha^2 } / \varepsilon ) time using saddle-point optimization.
Revised:  We obtain two new algorithms for MaxIB: one runs in O( md + m d \alpha / \varepsilon) time using smooth optimization, and the other runs in O( md + m \sqrt{d \alpha} \alpha^2 } / \varepsilon ) time using saddle-point optimization.
Edit intent: fluency
Original:  We obtain two new algorithms for MaxIB: one runs in O( m d \alpha / \varepsilon) time using smooth optimization, and the other runs in O( md + m \sqrt{d \alpha}  \alpha^2 } / \varepsilon ) time using saddle-point optimization.
Revised:  We obtain two new algorithms for MaxIB: one runs in O( m d \alpha / \varepsilon) time using smooth optimization, and the other runs in O( md + m \sqrt{d \alpha} \sqrt{d \alpha^2 } / \varepsilon ) time using saddle-point optimization.
Edit intent: fluency
Original:  For MinEB, the best known running time is O(n d / \varepsilon) SVZ11 . We obtain two new algorithms for MinEB: one runs in \tilde{O}( n d / \sqrt{\varepsilon}) time using smooth optimization, and the other runs in \tilde{O}( nd + n \sqrt{d/ \sqrt{\varepsilon})time using }  saddle-point optimization  .
Revised:  For MinEB, the best known running time is O(n d / \varepsilon) SVZ11 to \tilde{O}( n d / \sqrt{\varepsilon}) time using smooth optimization, and the other runs in \tilde{O}( nd + n \sqrt{d/ \sqrt{\varepsilon})time using } saddle-point optimization .
Edit intent: clarity
Original:  For MinEB, the best known running time is O(n d / \varepsilon) SVZ11 . We obtain two new algorithms for MinEB: one runs in \tilde{O}( n d / \sqrt{\varepsilon}) time using smooth optimization, and the other runs in \tilde{O}( nd + n \sqrt{d/ \sqrt{\varepsilon})time using }  saddle-point optimization  .
Revised:  For MinEB, the best known running time is O(n d / \varepsilon) SVZ11 . We obtain two new algorithms for MinEB: one runs in \tilde{O}( nd + n \sqrt{d / \sqrt{\varepsilon}) time using smooth optimization, and the other runs in \tilde{O}( nd + n \sqrt{d/ \sqrt{\varepsilon})time using } saddle-point optimization .
Edit intent: fluency
Original:  For MinEB, the best known running time is O(n d / \varepsilon) SVZ11 . We obtain two new algorithms for MinEB: one runs in \tilde{O}( n d / \sqrt{\varepsilon}) time using smooth optimization, and the other runs in \tilde{O}( nd + n \sqrt{d/ \sqrt{\varepsilon})time using }  saddle-point optimization  .
Revised:  For MinEB, the best known running time is O(n d / \varepsilon) SVZ11 . We obtain two new algorithms for MinEB: one runs in \tilde{O}( n d / \sqrt{\varepsilon}) , a speed-up up to \tilde{O}( nd + n \sqrt{d/ \sqrt{\varepsilon})time using } saddle-point optimization .
Edit intent: clarity
Original: We investigate a Lotka-Volterra model for a plankton ecosystem with a single resource , self-limitation effects, and parameters depending on climate states such as temperature.
Revised: We consider a model for plankton ecosystems with resources , self-limitation effects, and parameters depending on climate states such as temperature.
Edit intent: clarity
Original:  Analytical investigation and numerical simulations show that the stochastic dynamics of this system exhibit strong dependence on initial parameters . A range of situations were considered, and in cases of climate dependence the ecosystem can become more stable , and coexistence of different species may occur .
Revised:  Analytical investigation and numerical simulations show that the model is well posed and investigate its dynamical properties. The number of species which can coexist depends on both parameters and forcing. Our numerical simulations show that the system is more stable under chaotic forcing .
Edit intent: clarity
Original: We introduce an O(n log n) time  algorithm for the convex hull problem on points with locations determined by a continuous probability distribution.
Revised: We introduce an O(n log n) time algorithm for the convex hull problem when each input point is a location determined by a continuous probability distribution.
Edit intent: clarity
Original:  Our algorithm finds the convex hull of such  points to precision within some expected correctness determined by a user-given confidence value p . In order to precisely explain how correct the resulting structure is, we introduce a new certificate error model for calculating and understanding approximate geometric error based on the fundamental properties of a geometric structure.
Revised:  Our algorithm finds the convex hull of such points to precision within some expected correctness determined by a user-given confidence value . In order to precisely explain how correct the resulting structure is, we introduce a new certificate error model for calculating and understanding approximate geometric error based on the fundamental properties of a geometric structure.
Edit intent: clarity
Original:  Such behavior is commonly referred to as "bet-hedging ". Long-term survival probabilities and population sizes can be much enhanced by exploiting such hybrid strategies.
Revised:  Such behavior is commonly referred to as "bet-hedging ." Long-term survival probabilities and population sizes can be much enhanced by exploiting such hybrid strategies.
Edit intent: fluency
Original:  Here, we study the simplest possible birth-death stochastic model in which individuals can choose between a poor but safe strategy, a better but risky alternative, or a combination of both.
Revised:  Here, we study the simplest possible birth-death stochastic model in which individuals can choose among a poor but safe strategy, a better but risky alternative, or a combination of both.
Edit intent: fluency
Original:  We show analytically and computationally that the benefits derived from bet-hedging strategies are much enhanced for higher environmental variabilities (large external noise) and/or for small spatial dimensions (large intrinsic noise).
Revised:  We show analytically and computationally that the benefits derived from bet-hedging strategies are much stronger for higher environmental variabilities (large external noise) and/or for small spatial dimensions (large intrinsic noise).
Edit intent: clarity
Original:  The two standard summary statistics of persistent homology are the barcode and the persistence diagram.
Revised:  The most commonly used summary statistics of persistent homology are the barcode and the persistence diagram.
Edit intent: clarity
Original:  A third summary statistic, the persistence landscape, was recently introduced by Bubenik.
Revised:  Another summary statistic, the persistence landscape, was recently introduced by Bubenik.
Edit intent: clarity
Original:  Nevertheless, CSMA/CA relies on a random backoff that while effective and totally distributed , in principle is unable to completely eliminate collisions, therefore degrading the network throughput as more contenders attempt to share the channel.
Revised:  Nevertheless, CSMA/CA relies on a random backoff that while effective and fully decentralised , in principle is unable to completely eliminate collisions, therefore degrading the network throughput as more contenders attempt to share the channel.
Edit intent: clarity
Original:   Carrier Sense Multiple Access with Enhanced Collision Avoidance (CSMA/ECA) is able to create a collision-free schedule in a totally distributed manner using a deterministic backoff after successful transmissions.
Revised:  To overcome these situations, Carrier Sense Multiple Access with Enhanced Collision Avoidance (CSMA/ECA) is able to create a collision-free schedule in a totally distributed manner using a deterministic backoff after successful transmissions.
Edit intent: coherence
Original:   Carrier Sense Multiple Access with Enhanced Collision Avoidance (CSMA/ECA) is able to create a collision-free schedule in a totally distributed manner using a deterministic backoff after successful transmissions.
Revised:  Carrier Sense Multiple Access with Enhanced Collision Avoidance (CSMA/ECA) is able to create a collision-free schedule in a fully decentralised manner using a deterministic backoff after successful transmissions.
Edit intent: clarity
Original:  Additionally, it provides the first evaluation results of CSMA/ECA in non-saturated traffic conditions as well as its performance when coexisting with CSMA/CA nodes.
Revised:  Additionally, it provides the first evaluation results of CSMA/ECA with non-saturated traffic conditions as well as its performance when coexisting with CSMA/CA nodes.
Edit intent: fluency
Original: Mining frequent tree patterns has many practical applications in different areas such as XML data, bioinformatics and World Wide Web.
Revised: Mining frequent tree patterns has many applications in different areas such as XML data, bioinformatics and World Wide Web.
Edit intent: clarity
Original:  The crucial step in frequent pattern mining is frequency counting which involves performing a matching operator to find occurrences (instances) of a pattern tree in database trees.
Revised:  The crucial step in frequent pattern mining is frequency counting , which involves a matching operator to find occurrences (instances) of a pattern tree in database trees.
Edit intent: clarity
Original:  The crucial step in frequent pattern mining is frequency counting which involves performing a matching operator to find occurrences (instances) of a pattern tree in database trees.
Revised:  The crucial step in frequent pattern mining is frequency counting which involves performing a matching operator to find occurrences (instances) of a tree pattern in a given collection of trees.
Edit intent: clarity
Original:  A widely used matching operator for tree-structured data is subtree homeomorphism, where an edge in the pattern tree is mapped onto an ancestor-descendant relationship in the database tree.
Revised:  A widely used matching operator for tree-structured data is subtree homeomorphism, where an edge in the tree pattern is mapped onto an ancestor-descendant relationship in the database tree.
Edit intent: fluency
Original:  A widely used matching operator for tree-structured data is subtree homeomorphism, where an edge in the pattern tree is mapped onto an ancestor-descendant relationship in the database tree.
Revised:  A widely used matching operator for tree-structured data is subtree homeomorphism, where an edge in the pattern tree is mapped onto an ancestor-descendant relationship in the given tree.
Edit intent: clarity
Original:  We propose a compact data-structure, called occ, which can encode and represent several occurrences of a pattern tree .
Revised:  We propose a compact data-structure, called occ, which can encode and represent several occurrences of a tree pattern .
Edit intent: clarity