wanyu/IteraTeR_v2 huggingface dataset:
Original:  To this end, our general two-stage framework  consists of efficiently solving a problem-specific number problem  transferring its solution to a solution for the graph problem by applying flow computations.
Revised:  To this end, we develop a general two-stage framework consists of efficiently solving a problem-specific number problem transferring its solution to a solution for the graph problem by applying flow computations.
Edit intent: clarity
Original:  To this end, our general two-stage framework  consists of efficiently solving a problem-specific number problem  transferring its solution to a solution for the graph problem by applying flow computations.
Revised:  To this end, our general two-stage framework which consists of efficiently solving a problem-specific number problem transferring its solution to a solution for the graph problem by applying flow computations.
Edit intent: coherence
Original:  To this end, our general two-stage framework  consists of efficiently solving a problem-specific number problem  transferring its solution to a solution for the graph problem by applying flow computations.
Revised:  To this end, our general two-stage framework consists of efficiently solving a problem-specific number problem and transferring its solution to a solution for the graph problem by applying flow computations.
Edit intent: coherence
Original:  It has two features to be distinguishable from the deep architectures that have been proposed for the task: varying-size convolutional filters at the convolutional layer and 1-max pooling scheme at the pooling layer.
Revised:  Two further features distinguish it from the deep architectures that have been proposed for the task: varying-size convolutional filters at the convolutional layer and 1-max pooling scheme at the pooling layer.
Edit intent: clarity
Original:  a) we propose a novel hashing method for visual search using locally optimized codes that performs on-par with other state-of-the-art hashing approaches but offers more flexibility in terms of ranking, b)
Revised:  a) large-scale search tasks where performance is on par with other state-of-the-art hashing approaches but offers more flexibility in terms of ranking, b)
Edit intent: clarity
Original:  we extend our matching framework to multiple image queries and provide a simple and scalable solution that can efficiently produce visual recommendations for query sets of thousands of images and cluster collections of hundreds of millions of images , c) we show that this same representation can be used for efficient de-duplication of image search results, performing better than traditional hashing approaches , while still requiring only a few milliseconds to run.
Revised:  we extend our matching framework to multiple image queries and provide a simple and scalable solution that can efficiently produce visual recommendations for query sets of thousands of images and cluster collections of hundreds of millions of images , c) we show that this same representation can be used for efficient de-duplication of image search results, performing better than traditional hashing approaches while only requiring a few milliseconds to run.
Edit intent: coherence
Original:  In this paper we display results on datasets of up to 100 Million images, but in practice our system can find and rank similar images for millions of users from a search set of hundreds of millions of images in a runtime on the order of one hour on a large Hadoop cluster .
Revised:  In this paper we experiment on datasets of up to 100 Million images, but in practice our system can find and rank similar images for millions of users from a search set of hundreds of millions of images in a runtime on the order of one hour on a large Hadoop cluster .
Edit intent: clarity
Original:  In this paper we display results on datasets of up to 100 Million images, but in practice our system can find and rank similar images for millions of users from a search set of hundreds of millions of images in a runtime on the order of one hour on a large Hadoop cluster .
Revised:  In this paper we display results on datasets of up to 100 million images, but in practice our system can find and rank similar images for millions of users from a search set of hundreds of millions of images in a runtime on the order of one hour on a large Hadoop cluster .
Edit intent: fluency
Original: Many graphics and vision problems are naturally expressed as optimizations with either linear or non-linear least squares  objective functions over visual data, such as images and meshes.
Revised: Many graphics and vision problems can be expressed as non-linear least squares objective functions over visual data, such as images and meshes.
Edit intent: clarity
Original:  We propose a new language, Opt (available under URL in which a user simply writes energy functions over image- or graph-structured unknowns , and a compiler automatically generates state-of-the-art GPU optimization kernels.
Revised:  In this work, we propose a new language, Opt (available under URL in which a user simply writes energy functions over image- or graph-structured unknowns , and a compiler automatically generates state-of-the-art GPU optimization kernels.
Edit intent: coherence
Original:  We propose a new language, Opt (available under URL in which a user simply writes energy functions over image- or graph-structured unknowns , and a compiler automatically generates state-of-the-art GPU optimization kernels.
Revised:  We propose a new language, Opt (available under URL for writing these objective functions over image- or graph-structured unknowns , and a compiler automatically generates state-of-the-art GPU optimization kernels.
Edit intent: clarity
Original:  The end result is a system in which real-world energy functions in graphics and vision applications  are expressible in tens of lines of code .
Revised:  The end result is a system in which real-world graphics and vision applications are expressible in tens of lines of code .
Edit intent: clarity
Original:  They compile directly into highly-optimized GPU solver implementations with performance competitive with the best published hand-tuned, application-specific GPU solvers, and 1-2 orders of magnitude beyond a general-purpose auto-generated solver.
Revised:  They compile directly into highly-optimized GPU solver implementations . These solver have performance competitive with the best published hand-tuned, application-specific GPU solvers, and 1-2 orders of magnitude beyond a general-purpose auto-generated solver.
Edit intent: coherence
Original:  They compile directly into highly-optimized GPU solver implementations with performance competitive with the best published hand-tuned, application-specific GPU solvers, and 1-2 orders of magnitude beyond a general-purpose auto-generated solver.
Revised:  They compile directly into highly-optimized GPU solver implementations with performance competitive with the best published hand-tuned, application-specific GPU solvers, and orders of magnitude beyond a general-purpose auto-generated solver.
Edit intent: clarity
Original: Next generation mobile networks will have to rely ever more heavily on network sharing.
Revised: Next generation mobile networks will rely ever more heavily on network sharing.
Edit intent: clarity
Original:  As specifications are being developed, simulation has been widely employed for assessing the performance of coexistence mechanisms for LTE on unlicensed bands.
Edit intent: coherence
Original:  We first show that we are able to tune the scenario to reproduce similar performance metrics as reported in the literature.
Revised:  We first show that we are able to tune the scenario to reproduce similar performance metrics to those reported in the literature.
Edit intent: clarity
Original:  Our initial study reveals that there remain many open questions about how LTE should be implemented to achieve good coexistence properties, and that a broader scope of implementation issues, traffic models, and fuller system models should be studied further before drawing final conclusions on the performance of LBT mechanisms .
Revised:  Our initial study reveals that there remain many open questions about how LTE should be implemented to achieve good coexistence properties, and that a broader scope of implementation issues, traffic models, and fuller system models should be studied further before drawing final conclusions on the LBT coexistence performance .
Edit intent: clarity
Original: Within the framework of the Merton model, we consider the problem of concurrent portfolio losses in two non-overlapping credit portfolios.
Revised: We consider the problem of concurrent portfolio losses in two non-overlapping credit portfolios.
Edit intent: clarity
Original:  In order to explore the full statistical dependence structure  , we estimate the pairwise copulasof such portfolio losses .
Revised:  In order to explore the full statistical dependence structure of such portfolio losses , we estimate the pairwise copulasof such portfolio losses .
Edit intent: fluency
Original:  Anticipated idiosyncratic effects turn out to be negligible in almost every realistic setting .
Revised:  Anticipated idiosyncratic effects turn out to be negligible .
Edit intent: clarity
Original:  We also prove that (n-2)^{n-3} + (n-3)2^{n-3} - 1 is the minimal size of the alphabet required to meet the bound for n \ge 6. Finally, we show that the largest transition semigroups of minimal DFAs which recognize bifix-free languages are unique up to the naming the states.
Revised:  We also prove that (n-2)^{n-3} + (n-3)2^{n-3} - 1 is the minimal size of the alphabet required to meet the bound for n \ge 6. Finally, we show that the largest transition semigroups of minimal DFAs which recognize bifix-free languages are unique up to renaming the states.
Edit intent: fluency
Original:  The known provable complexity of C-CD can be O(n ) times slower than gradient descent (GD) and O(n ^2) times slower than randomized coordinate descent (R-CD) . However, these gaps seem rather puzzling since so far they have not been observed in practice;
Revised:  The known provable complexity of C-CD can be O(n ^2) times slower than randomized coordinate descent (R-CD) . However, these gaps seem rather puzzling since so far they have not been observed in practice;
Edit intent: coherence
Original:  In this paper we show that the gaps indeed exist .
Revised:  In this paper we show that the gap indeed exists .
Edit intent: fluency
Original:  We prove that there exists an example for which C-CD takes at least (n^3\kappa) or (n ^4 \text{CD} {\epsilon}} ) operations, where \kappa is the condition number , \text{CD determines the convergence rate of R-CD , and (\cdot) hides the dependency on \log 1/\epsilon.
Revised:  We prove that there exists an example for which C-CD takes at least (n^3\kappa) or O(n ^4 \text{CD} {\epsilon}} ) operations, where \kappa is the condition number , \text{CD determines the convergence rate of R-CD , and (\cdot) hides the dependency on \log 1/\epsilon.
Edit intent: clarity
Original:  We prove that there exists an example for which C-CD takes at least (n^3\kappa) or (n ^4 \text{CD} {\epsilon}} ) operations, where \kappa is the condition number , \text{CD determines the convergence rate of R-CD , and (\cdot) hides the dependency on \log 1/\epsilon.
Revised:  We prove that there exists an example for which C-CD takes at least (n^3\kappa) or (n ^4 \text{CD} {\epsilon}} ) operations, where \kappa _{\text{CD determines the convergence rate of R-CD , and (\cdot) hides the dependency on \log 1/\epsilon.
Edit intent: clarity
Original:  We prove that there exists an example for which C-CD takes at least (n^3\kappa) or (n ^4 \text{CD} {\epsilon}} ) operations, where \kappa is the condition number , \text{CD determines the convergence rate of R-CD , and (\cdot) hides the dependency on \log 1/\epsilon.
Revised:  We prove that there exists an example for which C-CD takes at least (n^3\kappa) or (n ^4 \text{CD} {\epsilon}} ) operations, where \kappa is the condition number , \text{CD determines the convergence rate of R-CD (\cdot) hides the dependency on \log 1/\epsilon.
Edit intent: coherence
Original:  This implies that C-CD can indeed be O(n  ) times slower than GD, and O( n^2 ) times slower than R-CD in the worst case.
Revised:  This implies that C-CD can indeed be O(n ^2 ) times slower than GD, and O( n^2 ) times slower than R-CD in the worst case.
Edit intent: fluency
Original:  One difficulty with the analysis of the constructed example is that the spectral radius of a non-symmetric iteration matrix does not necessarily constitutes a lower bound\textit{ for the convergence rate  ]  .
Revised:  One difficulty with the analysis is that the spectral radius of a non-symmetric iteration matrix does not necessarily constitutes a lower bound\textit{ for the convergence rate ] .
Edit intent: clarity
Original:  One difficulty with the analysis of the constructed example is that the spectral radius of a non-symmetric iteration matrix does not necessarily constitutes a lower bound\textit{ for the convergence rate  ]  .
Revised:  One difficulty with the analysis of the constructed example is that the spectral radius of a non-symmetric iteration matrix does not necessarily constitute a\textit{ for the convergence rate ] .
Edit intent: clarity
Original:  In particular, we show that in a random graph G(n,q), for the right value of q, the number of nodes making a wrong decision is logarithmic order of n.
Revised:  In particular, we show that in a random graph G(n,q), for the right value of q, the number of nodes making a wrong decision is logarithmic in n.
Edit intent: clarity
Original:  too many persons decide based on information cascades) and too little information sharing (small q, too many persons decide independently based on their own signal) a constant fraction of persons make a wrong decision .
Revised:  too many persons decide based on information cascades) and too little information sharing (small q, too many persons decide independently based on their own signal) a constant fraction of nodes make a wrong decision .
Edit intent: fluency
Original:  Our result shows that  for exactly the right amount of information sharing, asymptotically everyone decides correctly .
Revised:  Our result shows that for exactly the right amount of information sharing, asymptotically everyone can be right .
Edit intent: clarity
Original:  That is, there exists a large constant c>0 and for any function f, bitpdim(G_f)/6 \le bpsize(f) \le (bitpdim(G_f))^c.
Revised:  That is, there exists a constant c>0 and for any function f, bitpdim(G_f)/6 \le bpsize(f) \le (bitpdim(G_f))^c.
Edit intent: clarity
Original:  In this method, an algorithm designates a template polynomial p over program variables, generates constraints for p=0 to be indeed an invariant, and solves the generated constraints.
Revised:  In this method, an algorithm designates a template polynomial p over program variables, generates constraints for p=0 to be an invariant, and solves the generated constraints.
Edit intent: clarity
Original:  However, the template-based method often suffers from  increasing template size if the degree of a template polynomial is set too high.
Revised:  However, this approach often suffers from increasing template size if the degree of a template polynomial is set too high.
Edit intent: clarity
Original:  However, the template-based method often suffers from  increasing template size if the degree of a template polynomial is set too high.
Revised:  However, the template-based method often suffers from an increasing template size if the degree of a template polynomial is set too high.
Edit intent: fluency
Original:  However, the template-based method often suffers from  increasing template size if the degree of a template polynomial is set too high.
Revised:  However, the template-based method often suffers from increasing template size if the degree of a template polynomial is too high.
Edit intent: clarity
Original:  We propose a technique to improve the efficiency of template-based methods applied to higher-degree polynomials.
Revised:  We propose a technique to make template-based methods applied to higher-degree polynomials.
Edit intent: clarity
Original:  Our method is based on the following finding: If an algebraic invariant exists, then there is a specific algebraic invariant that we call a generalized homogeneous algebraic (GHA) invariant , which is often smaller.
Revised:  Our method is based on the following finding: If an algebraic invariant exists, then there is a specific algebraic invariant that we call a generalized homogeneous algebraic invariant that is often smaller.
Edit intent: clarity
Original:  This finding justifies to use only a smaller template that corresponds to a GHA invariantin invariant synthesis . Concretely, we state our finding above formally based on the abstract semantics of an imperative program proposed by Cachera et al.
Revised:  This finding justifies using only a smaller template that corresponds to a GHA invariantin invariant synthesis . Concretely, we state our finding above formally based on the abstract semantics of an imperative program proposed by Cachera et al.
Edit intent: fluency
Original:  This finding justifies to use only a smaller template that corresponds to a GHA invariantin invariant synthesis . Concretely, we state our finding above formally based on the abstract semantics of an imperative program proposed by Cachera et al.
Revised:  This finding justifies to use only a smaller template that corresponds to a generalized homogeneous algebraic invariant . Concretely, we state our finding above formally based on the abstract semantics of an imperative program proposed by Cachera et al.
Edit intent: clarity
Original:  We also empirically demonstrate that the restriction to GHA invariantsis useful;
Revised:  Furthermore, we also empirically demonstrate that the restriction to GHA invariantsis useful;
Edit intent: coherence
Original:  While others have focused on state- or city-level classification of tweets restricted to a specific country , here we undertake the task in a broader context by classifying global tweets at the country level,  so far unexplored in a real-time scenario.
Revised:  While others have focused on state- or city-level classification of tweets restricted to a specific country , here we undertake the task in a broader context by classifying global tweets at the country level, which is so far unexplored in a real-time scenario.
Edit intent: coherence
Original:  We analyse the extent to which a tweet's country of origin can be determined by making use of eight tweet-inherent features for classification using Support Vector Machines .
Revised:  We analyse the extent to which a tweet's country of origin can be determined by making use of eight tweet-inherent features for classification .
Edit intent: clarity
Original:  Among the features inherent in a tweet, we observe that the validity of historical tweet content fades over time, and other metadata associated with the tweet , such as the language of the tweet , the name of the user, or the time zone in which the useris located, lead to more accurate classification.
Revised:  We find that the use of a single feature, such as the use of tweet , such as the language of the tweet , the name of the user, or the time zone in which the useris located, lead to more accurate classification.
Edit intent: clarity
Original:  However, the difficulty of achieving an accurate classification increases  for countries with multiple commonalities, especially for English and Spanish speaking countries.
Revised:  However, the difficulty of achieving accurate classification increases for countries with multiple commonalities, especially for English and Spanish speaking countries.
Edit intent: fluency
Original: In contrast to  previous work that has focused on location classification of restricted subsets of tweets , here we undertake the task in a broader context by classifying global tweets at the country level, which is so far unexplored in a real-time scenario.
Revised: In contrast to previous work that has focused on location classification of tweets restricted to a specific country , here we undertake the task in a broader context by classifying global tweets at the country level, which is so far unexplored in a real-time scenario.
Edit intent: clarity
Original:  ] Breaking the reflection symmetry, such appealing method could realize both even and odd Green's functions associated with any arbitrary operator . Based on the developed theory and by using Brewster effect, we demonstrate realization of a first-order differentiator.
Revised:  ]. Breaking the reflection symmetry, such appealing method could realize both even and odd Green's functions associated with any arbitrary operator . Based on the developed theory and by using Brewster effect, we demonstrate realization of a first-order differentiator.
Edit intent: fluency
Original:  ] Breaking the reflection symmetry, such appealing method could realize both even and odd Green's functions associated with any arbitrary operator . Based on the developed theory and by using Brewster effect, we demonstrate realization of a first-order differentiator.
Revised:  ] Breaking the reflection symmetry, such configurations could realize both even and odd Green's functions associated with any arbitrary operator . Based on the developed theory and by using Brewster effect, we demonstrate realization of a first-order differentiator.
Edit intent: clarity
Original:  ] Breaking the reflection symmetry, such appealing method could realize both even and odd Green's functions associated with any arbitrary operator . Based on the developed theory and by using Brewster effect, we demonstrate realization of a first-order differentiator.
Revised:  ] Breaking the reflection symmetry, such appealing method could realize both even and odd Green's functions associated with any arbitrary operator . Based on such appealing theory and by using Brewster effect, we demonstrate realization of a first-order differentiator.
Edit intent: clarity
Original:  we demonstrate that the sleeping beauty is an universal phenomenon in information diffusion and even more inspiring, there exist two consecutive sleeping beauties in the entire lifetime of propagation, suggesting that the information, including trending topics, search queries or Wikipedia views , which we call memes, will go unnoticed for a period and suddenly attracts some attention, and then it falls asleep again and later wakes up with another unexpected popularity peak.
Revised:  we demonstrate that the sleeping beauty is an interesting and unexceptional phenomenon in information diffusion and even more inspiring, there exist two consecutive sleeping beauties in the entire lifetime of propagation, suggesting that the information, including trending topics, search queries or Wikipedia views , which we call memes, will go unnoticed for a period and suddenly attracts some attention, and then it falls asleep again and later wakes up with another unexpected popularity peak.
Edit intent: clarity
Original:  we demonstrate that the sleeping beauty is an universal phenomenon in information diffusion and even more inspiring, there exist two consecutive sleeping beauties in the entire lifetime of propagation, suggesting that the information, including trending topics, search queries or Wikipedia views , which we call memes, will go unnoticed for a period and suddenly attracts some attention, and then it falls asleep again and later wakes up with another unexpected popularity peak.
Revised:  we demonstrate that the sleeping beauty is an universal phenomenon in information diffusion and even more inspiring, there exist two consecutive sleeping beauties in the entire lifetime of propagation, suggesting that the information, including scientific topics, search queries or Wikipedia views , which we call memes, will go unnoticed for a period and suddenly attracts some attention, and then it falls asleep again and later wakes up with another unexpected popularity peak.
Edit intent: clarity