wanyu/IteraTeR_v2 huggingface dataset:
Original:  However, the value of nominal typing to mainstream OO developers, as a means for designing robust OO software, seems to be not yet fully appreciated among PL researchers---perpetuating an unnecessary schism between many mainstream OO developers and language designers and many OO PL researchers  with each side discounting  the views of the other.
Revised:  However, the value of nominal typing to mainstream OO developers, as a means for designing robust OO software, seems to be in wait for full appreciation among PL researchers--thereby perpetuating an unnecessary schism between many mainstream OO developers and language designers and many OO PL researchers with each side discounting the views of the other.
Edit intent: clarity
Original:  However, the value of nominal typing to mainstream OO developers, as a means for designing robust OO software, seems to be not yet fully appreciated among PL researchers---perpetuating an unnecessary schism between many mainstream OO developers and language designers and many OO PL researchers  with each side discounting  the views of the other.
Revised:  However, the value of nominal typing to mainstream OO developers, as a means for designing robust OO software, seems to be not yet fully appreciated among PL researchers---perpetuating an unnecessary schism between many OO developers and language designers and many OO PL researchers with each side discounting the views of the other.
Edit intent: fluency
Original:  However, the value of nominal typing to mainstream OO developers, as a means for designing robust OO software, seems to be not yet fully appreciated among PL researchers---perpetuating an unnecessary schism between many mainstream OO developers and language designers and many OO PL researchers  with each side discounting  the views of the other.
Revised:  However, the value of nominal typing to mainstream OO developers, as a means for designing robust OO software, seems to be not yet fully appreciated among PL researchers---perpetuating an unnecessary schism between many mainstream OO developers and language designers and many OO PL researchers , with each side discounting the views of the other.
Edit intent: fluency
Original:  However, the value of nominal typing to mainstream OO developers, as a means for designing robust OO software, seems to be not yet fully appreciated among PL researchers---perpetuating an unnecessary schism between many mainstream OO developers and language designers and many OO PL researchers  with each side discounting  the views of the other.
Revised:  However, the value of nominal typing to mainstream OO developers, as a means for designing robust OO software, seems to be not yet fully appreciated among PL researchers---perpetuating an unnecessary schism between many mainstream OO developers and language designers and many OO PL researchers with each side discounting , if not even disregarding, the views of the other.
Edit intent: clarity
Original:  In this article we strengthen earlier efforts to demonstrate the semantic value of nominal typing by presenting a technical comparison between nominal OO type systems and structural OO type systems.
Revised:  In this essay we strengthen earlier efforts to demonstrate the semantic value of nominal typing by presenting a technical comparison between nominal OO type systems and structural OO type systems.
Edit intent: fluency
Original:  In other recent work, we also compare a domain-theoretic model of nominally-typed OOP to models of structurally-typed OOP.
Revised:  Recently, a domain-theoretic model of nominally-typed OOP to models of structurally-typed OOP.
Edit intent: coherence
Original:  In other recent work, we also compare a domain-theoretic model of nominally-typed OOP to models of structurally-typed OOP.
Revised:  In other recent work, we also compare a domain-theoretic model of nominally-typed OOP was compared to well-known models of structurally-typed OOP.
Edit intent: clarity
Original:  These comparisons provide a clear and deep technical and mathematical account for the relation between nominal and structural OO type systems that has not been presented before, and they help further demonstrate the key value of nominal typing and nominal subtyping  .
Revised:  Combined, these comparisons provide a clear and deep technical and mathematical account for the relation between nominal and structural OO type systems that has not been presented before, and they help further demonstrate the key value of nominal typing and nominal subtyping .
Edit intent: coherence
Original:  These comparisons provide a clear and deep technical and mathematical account for the relation between nominal and structural OO type systems that has not been presented before, and they help further demonstrate the key value of nominal typing and nominal subtyping  .
Revised:  These comparisons provide a clear and deep account for the relation between nominal and structural OO type systems that has not been presented before, and they help further demonstrate the key value of nominal typing and nominal subtyping .
Edit intent: clarity
Original:  These comparisons provide a clear and deep technical and mathematical account for the relation between nominal and structural OO type systems that has not been presented before, and they help further demonstrate the key value of nominal typing and nominal subtyping  .
Revised:  These comparisons provide a clear and deep technical and mathematical account for the relation between nominal and structural OO type systems that has not been presented before, and they help demonstrate the key value of nominal typing and nominal subtyping .
Edit intent: clarity
Original:  In particular , we show that our bound provides new insights into the notion of dimension witness, and we also use it to show that the sets of restricted-dimensional prepare-and-measure correlations are not always convex.
Revised:  In particular , we show that our bound provides new insights into the notion of dimension witness, and we also use it to show that the sets of restricted-dimensional prepare-and-measure correlations are not always convex.
Edit intent: fluency
Original:  This (partially) answers two open problems posed by Ravsky and Verbitsky [ WG 2011: 295-306 ].
Revised:  This (partially) answers two open problems posed by Ravsky and Verbitsky [ WG 2011: 295-306 ].
Edit intent: fluency
Original:  This (partially) answers two open problems posed by Ravsky and Verbitsky [ WG 2011: 295-306 ].
Revised:  This (partially) answers two open problems posed by Ravsky and Verbitsky [ WG~ 2011: 295-306 ].
Edit intent: fluency
Original:  This (partially) answers two open problems posed by Ravsky and Verbitsky [ WG 2011: 295-306 ].
Revised:  This (partially) answers two open problems posed by Ravsky and Verbitsky [ WG 2011: 295--306 ].
Edit intent: fluency
Original: Consider the following problem: Given a planar graph G, what is the maximum number p such that G has a planar straight-line drawing with p collinear vertices ?
Revised:  Given a planar graph G, what is the maximum number p such that G has a planar straight-line drawing with p collinear vertices ?
Edit intent: clarity
Original: Consider the following problem: Given a planar graph G, what is the maximum number p such that G has a planar straight-line drawing with p collinear vertices ?
Revised: Consider the following problem: Given a planar graph G, what is the maximum number of collinear vertices in a planar straight-line drawing with p collinear vertices ?
Edit intent: clarity
Original: Consider the following problem: Given a planar graph G, what is the maximum number p such that G has a planar straight-line drawing with p collinear vertices ?
Revised: Consider the following problem: Given a planar graph G, what is the maximum number p such that G has a planar straight-line drawing of G ?
Edit intent: clarity
Original:  The following results are known for it : Every n-vertex planar graph has a planar straight-line drawing with \Omega(n) collinear vertices;
Revised:  The following results are known : Every n-vertex planar graph has a planar straight-line drawing with \Omega(n) collinear vertices;
Edit intent: clarity
Original:  This (partially ) answers two open problems posed by Ravsky and Verbitsky WG ~2011:295--306 . Similar results are not possible for all bounded treewidth planar graphs or for all bounded degree planar graphs.
Revised:  This (partially ) answers two open problems posed by Ravsky and Verbitsky ~2011:295--306 . Similar results are not possible for all bounded treewidth planar graphs or for all bounded degree planar graphs.
Edit intent: clarity
Original:  This (partially ) answers two open problems posed by Ravsky and Verbitsky WG ~2011:295--306 . Similar results are not possible for all bounded treewidth planar graphs or for all bounded degree planar graphs.
Revised:  This (partially ) answers two open problems posed by Ravsky and Verbitsky WG . Similar results are not possible for all bounded treewidth planar graphs or for all bounded degree planar graphs.
Edit intent: clarity
Original:  This (partially ) answers two open problems posed by Ravsky and Verbitsky WG ~2011:295--306 . Similar results are not possible for all bounded treewidth planar graphs or for all bounded degree planar graphs.
Revised:  This (partially ) answers two open problems posed by Ravsky and Verbitsky WG ~2011:295--306 . Similar results are not possible for all bounded treewidth or bounded degree planar graphs.
Edit intent: fluency
Original:  Given a planar graph G, what is the maximum number of collinear vertices in a planar straight-line drawing of G ? This problem resides at the core of several graph drawing problems, including universal point subsets, untangling, and column planarity.
Revised: Consider the following problem: Given a planar graph G, what is the maximum number of collinear vertices in a planar straight-line drawing of G ? This problem resides at the core of several graph drawing problems, including universal point subsets, untangling, and column planarity.
Edit intent: clarity
Original:  Given a planar graph G, what is the maximum number of collinear vertices in a planar straight-line drawing of G ? This problem resides at the core of several graph drawing problems, including universal point subsets, untangling, and column planarity.
Revised:  Given a planar graph G, what is the maximum number p such that G has a planar straight-line drawing of G ? This problem resides at the core of several graph drawing problems, including universal point subsets, untangling, and column planarity.
Edit intent: clarity
Original:  The following results are known  : Every n-vertex planar graph has a planar straight-line drawing with \Omega(n) collinear vertices;
Revised:  The following results are known for it : Every n-vertex planar graph has a planar straight-line drawing with \Omega(n) collinear vertices;
Edit intent: clarity
Original:  We extend the linear bound to planar graphs of treewidth at most three and to triconnected cubic planar graphs , partiallyanswering two problems posed by Ravsky and Verbitsky  .
Revised:  We extend the linear bound to planar graphs of treewidth at most three and to triconnected cubic planar graphs . This (partially) answers two open problems posed by Ravsky and Verbitsky .
Edit intent: clarity
Original:  Similar results are not possible for all bounded treewidth or bounded degree planar graphs.
Revised:  Similar results are not possible for all bounded treewidth planar graphs or for all bounded degree planar graphs.
Edit intent: fluency
Original:  We provide a full theoretical framework as well as practical applications for both single-curve and multi-curve estimation .
Revised:  We provide a full theoretical framework as well as several practical applications .
Edit intent: clarity
Original:  It should be emphasized that we do not impose any geometric restrictions on the tetrahedron itself  .
Revised:  Because we do not impose any geometric restrictions on the tetrahedron itself .
Edit intent: coherence
Original:  These instances are characterized with descriptive attributes from one or more disjoint sets of attributes  called views.
Revised:  These descriptions are represented as rules inferred from one or more disjoint sets of attributes called views.
Edit intent: clarity
Original:  These instances are characterized with descriptive attributes from one or more disjoint sets of attributes  called views.
Revised:  These instances are characterized with descriptive attributes from one or more disjoint sets of attributes , called views.
Edit intent: fluency
Original:  Informally, we show that, for a partial function f, if there is no efficient \footnote{In the world of query complexity, being efficient means using O(%DIFDELCMD < \operatorname*{polylog}%%% (n)) time.
Revised:  Informally, we show that, for a partial function f, if there is no efficient \footnote{%DIFDELCMD < \operatorname*{polylog}%%% (n)) time.
Edit intent: clarity
Original:  Informally, we show that, for a partial function f, if there is no efficient \footnote{In the world of query complexity, being efficient means using O(%DIFDELCMD < \operatorname*{polylog}%%% (n)) time.
Revised:  Informally, we show that, for a partial function f, if there is no efficient \footnote{In the world of query complexity, being efficient means using O(%DIFDELCMD < \operatorname*{polylog}%%% (In the world of query complexity, being efficient means using O(
Edit intent: coherence
Original:  They also lead to a new oracle separation P^{SZK^{O}} \not\subset \mathsf{PP}^{\mathcal{O}} , which is close to an oracle separation between \mathsf{SZK and \mathsf{PP}---an open problem in the field of oracle separations} .
Revised:  They also lead to a new oracle separation P^{SZK^{O}} \not\subset \mathsf{PP}^{\mathcal{O}} and \mathsf{PP}---an open problem in the field of oracle separations} .
Edit intent: coherence
Original: The Bacterial Foraging Optimization (BFO)  is one of the metaheuristics algorithms that most widely used to solve optimization problems.
Revised: The Bacterial Foraging Optimization (BFO) algorithm is one of the metaheuristics algorithms that most widely used to solve optimization problems.
Edit intent: clarity
Original:  The main aim of algorithm is to eliminate those bacteria that have weak foraging methods and maintaining those bacteria that have strong foraging methods.
Revised:  The main aim of algorithm is to eliminate those bacteria that have weak foraging properties and maintain those bacteria that have strong foraging methods.
Edit intent: clarity
Original:  In particular, we give for each p,d,r, explicit bounds on the p-th Betti numbers of affine and projective subvarieties of C^k and P^k_{C}  , defined by r polynomials of degrees at most d as a function of p,d and r. Unlike previous bounds these bounds are independent of k, the dimension of the ambient space.
Revised:  In particular, we give for each p,d,r, explicit bounds on the p-th Betti numbers of affine and projective subvarieties of C^k , P^k_{C} , defined by r polynomials of degrees at most d as a function of p,d and r. Unlike previous bounds these bounds are independent of k, the dimension of the ambient space.
Edit intent: fluency
Original:  By splitting vertices, creating virtual edges and by inserting new ones, we obtain nontrivial upper bounds on tensor rank, border rank and asymptotic rank of the resulting tensors.
Revised:  By splitting vertices, creating virtual edges and by inserting new ones, we obtain nontrivial upper bounds on tensor rank, border rank and asymptotic rank of the final tensors.
Edit intent: clarity
Original:  In the asymptotic setting we obtain upper bounds in terms of the matrix multiplication exponent \omega and the rectangular matrix multiplication parameter \alpha that are optimal if \omega equals two.
Revised:  In the asymptotic setting we obtain upper bounds in terms of the matrix multiplication exponent \omega and the rectangular matrix multiplication parameter \alpha . These bounds are optimal if \omega equals two.
Edit intent: clarity
Original:  We also give examples that illustrate that tensor surgery on general graphs might involve the absorption of virtual hyperedges and  provide an example of tensor surgery on a hypergraph.
Revised:  We also give examples that illustrate that tensor surgery on general graphs might involve the absorption of virtual hyperedges and we provide an example of tensor surgery on a hypergraph.
Edit intent: fluency
Original:  In the context of quantum information theory, our results may be interpreted as upper bounds on the rate of Greenberger-Horne-Zeilinger (GHZ) states needed in order to create a graph of Einstein-Podolsky-Rosen states , or, more generally, GHZ states shared among subsets of the vertices .
Revised:  In the context of quantum information theory, our results may be interpreted as upper bounds on the number of Greenberger-Horne-Zeilinger (GHZ) states needed in order to create a graph of Einstein-Podolsky-Rosen states , or, more generally, GHZ states shared among subsets of the vertices .
Edit intent: clarity
Original:  In the context of quantum information theory, our results may be interpreted as upper bounds on the rate of Greenberger-Horne-Zeilinger (GHZ) states needed in order to create a graph of Einstein-Podolsky-Rosen states , or, more generally, GHZ states shared among subsets of the vertices .
Revised:  In the context of quantum information theory, our results may be interpreted as upper bounds on the rate of Greenberger-Horne-Zeilinger states needed in order to create a graph of Einstein-Podolsky-Rosen states , or, more generally, GHZ states shared among subsets of the vertices .
Edit intent: clarity
Original:  In the context of quantum information theory, our results may be interpreted as upper bounds on the rate of Greenberger-Horne-Zeilinger (GHZ) states needed in order to create a graph of Einstein-Podolsky-Rosen states , or, more generally, GHZ states shared among subsets of the vertices .
Revised:  In the context of quantum information theory, our results may be interpreted as upper bounds on the rate of Greenberger-Horne-Zeilinger (GHZ) states needed in order to create a network of Einstein-Podolsky-Rosen states , or, more generally, GHZ states shared among subsets of the vertices .
Edit intent: clarity
Original: Content caching in small base stations (SBSs) or wireless infostations is considered as a suitable approach to improve the efficiency in wireless content delivery.
Revised: Content caching in small base stations or wireless infostations is considered as a suitable approach to improve the efficiency in wireless content delivery.
Edit intent: clarity
Original: Content caching in small base stations (SBSs) or wireless infostations is considered as a suitable approach to improve the efficiency in wireless content delivery.
Revised: Content caching in small base stations (SBSs) or wireless infostations is considered to be a suitable approach to improve the efficiency in wireless content delivery.
Edit intent: fluency
Original:  Due to storage limitations, placing the optimal content into local caches is crucial . Cache content placement is challenging since it requires knowledge about the content popularity distribution, which is often not available in advance.
Revised:  Placing the optimal content into local caches is crucial . Cache content placement is challenging since it requires knowledge about the content popularity distribution, which is often not available in advance.
Edit intent: coherence
Original:  Due to storage limitations, placing the optimal content into local caches is crucial . Cache content placement is challenging since it requires knowledge about the content popularity distribution, which is often not available in advance.
Revised:  Due to storage limitations, placing the optimal content into local caches is crucial due to storage limitations, but it requires knowledge about the content popularity distribution, which is often not available in advance.
Edit intent: coherence
Original:  Moreover,  content popularity is subject to fluctuations as mobile users with different interests connect to the caching entity over time.
Revised:  Moreover, content popularity is subject to fluctuations since mobile users with different interests connect to the caching entity over time.
Edit intent: clarity
Original:   In this paper, we propose a novel algorithm for context-aware proactive cache content placement.
Revised:  Which content a user prefers may depend on the user's context. In this paper, we propose a novel algorithm for context-aware proactive cache content placement.
Edit intent: clarity
Original:  By regularly observing context information of connected users, updating the cache content accordingly and observing the demands for cache content subsequently, the algorithm learns context-specific content popularity online over time .
Revised:  By regularly observing context information of connected users, updating the cache content and observing cache hits subsequently .
Edit intent: clarity
Original:  We derive a sub-linear regret bound, which characterizes the learning speed and proves that our algorithm asymptotically maximizes the average number of cache hits.
Revised:  We derive a sublinear regret bound, which characterizes the learning speed and proves that our algorithm asymptotically maximizes the average number of cache hits.
Edit intent: fluency
Original:  We derive a sub-linear regret bound, which characterizes the learning speed and proves that our algorithm asymptotically maximizes the average number of cache hits.
Revised:  We derive a sub-linear regret bound, which characterizes the learning speed and proves that our algorithm converges to the optimal cache content placement strategy in terms of maximizing the number of cache hits.
Edit intent: clarity
Original:  Furthermore, our algorithm supports service differentiation by allowing operators of caching entities to prioritize groups of customers .
Revised:  Furthermore, our algorithm supports service differentiation by allowing operators of caching entities to prioritize customer groups .
Edit intent: clarity
Original:  Our numerical results confirm that by exploiting contextual information, our algorithm outperforms state-of-the-art algorithms in a real world data set, with an increase in the number of cache hits of at least 14\%.
Revised:  Our numerical results confirm that our algorithm outperforms state-of-the-art algorithms in a real world data set, with an increase in the number of cache hits of at least 14\%.
Edit intent: clarity
Original:  The intersection of the horizontal and vertical roads are the vertices of OWRN and any two consecutive vertices on a road is connected by an edge.
Revised:  The intersections of the horizontal and vertical roads are the vertices of OWRN and any two consecutive vertices on a road is connected by an edge.
Edit intent: fluency
Original:  The intersection of the horizontal and vertical roads are the vertices of OWRN and any two consecutive vertices on a road is connected by an edge.
Revised:  The intersection of the horizontal and vertical roads are the vertices of OWRN and any two consecutive vertices on a road are connected by an edge.
Edit intent: fluency
Original:  In this work, we analyze the problem of collision free Traffic configuration in an OWRN.
Revised:  In this work, we analyze the problem of collision free traffic configuration in a OWRN.
Edit intent: fluency
Original:  Lastly we investigate the properties of connectedness, shortest paths in an OWRN.
Revised:  Lastly we investigate the properties of connectedness, shortest paths in a OWRN.
Edit intent: fluency
Original:  The architectural genetics of ancestor deep neural networks is encapsulated using the concept of synaptic probability density models, which can be viewed as the ' DNA' of these ancestor networks.
Revised:  The architectural traits of ancestor deep neural networks is encapsulated using the concept of synaptic probability density models, which can be viewed as the ' DNA' of these ancestor networks.
Edit intent: clarity