wanyu/IteraTeR_v2 huggingface dataset:
Original:  We show that there exists a preferred direction of straight lines, i.e.\ straight vertical lines can be stable for sufficiently many particles, while  other rotations of the straight lines are unstable steady states, both for a sufficiently large number of particles and in the continuum limit.
Revised:  We show that there exists a preferred direction of straight lines, i.e.\ straight vertical lines can be stable for sufficiently many particles, while many other rotations of the straight lines are unstable steady states, both for a sufficiently large number of particles and in the continuum limit.
Edit intent: clarity
Original: Many data mining tasks cannot be completely addressed by automated processes, such as sentiment analysis and image classification.
Revised: Many data mining tasks cannot be completely addressed by auto- mated processes, such as sentiment analysis and image classification.
Edit intent: fluency
Original:  Thanks to public crowdsourcing platforms, e.g., Amazon Mechanical Turk and CrowdFlower , we can easily involve hundreds of thousands of ordi- nary workers (i.e., the crowd) to address these machine-hard tasks.
Revised:  Thanks to public crowdsourcing platforms, e.g., Amazon Mechanical Turk and Crowd- Flower , we can easily involve hundreds of thousands of ordi- nary workers (i.e., the crowd) to address these machine-hard tasks.
Edit intent: fluency
Original:  Thanks to public crowdsourcing platforms, e.g., Amazon Mechanical Turk and CrowdFlower , we can easily involve hundreds of thousands of ordi- nary workers (i.e., the crowd) to address these machine-hard tasks.
Revised:  Thanks to public crowdsourcing platforms, e.g., Amazon Mechanical Turk and CrowdFlower , we can easily involve hundreds of thousands of ordinary workers (i.e., the crowd) to address these machine-hard tasks.
Edit intent: fluency
Original:  We rst give an overview of crowdsourcing, and then summarize the fundamental techniques, including quality control, cost control, and latency control, which must be considered in crowdsourced data mining.
Revised:  We first give an overview of crowdsourcing, and then summarize the fundamental techniques, including quality control, cost control, and latency control, which must be considered in crowdsourced data mining.
Edit intent: fluency
Original: In this paper, we consider the numerical solution of scattering problems with multi-periodic layers with different periodicities.
Revised: In this paper, we consider a numerical method to solve scattering problems with multi-periodic layers with different periodicities.
Edit intent: clarity
Original:  By introducing a convolution operator between two Bloch transformed fields , the problem is written into an equivalent coupled family of quasi-periodic scattering problemswith inhomogeneous medium.
Revised:  With this method , the problem is written into an equivalent coupled family of quasi-periodic scattering problemswith inhomogeneous medium.
Edit intent: clarity
Original:  At the end of this paper, relative errors of the numerical solutions will be listed to illustrate the convergence of the numerical algorithm.
Revised:  At the end of this paper, relative errors of the numerical solutions will be shown to illustrate the convergence of the numerical algorithm.
Edit intent: clarity
Original:  We then deduce a similar result for the mixed discriminant of doubly stochastic n-tuples of matrices from the Marcus - Spielman - Srivastava bound on the roots of the mixed characteristic polynomial. 
Revised:  We deduce a similar result for the mixed discriminant of doubly stochastic n-tuples of matrices from the Marcus - Spielman - Srivastava bound on the roots of the mixed characteristic polynomial. 
Edit intent: coherence
Original:  In this regard, we introduce a discriminative text-conditional GAN for sample generation with a simple self-paced strat- egy for sample selection.
Revised:  In this regard, we introduce a discriminative text-conditional GAN for sample generation with a simple self-paced strategy for sample selection.
Edit intent: fluency
Original:  We show the results of our pro- posed discriminative hallucinated method for 1-, 2-, and 5- shot learning on the CUB dataset, where the accuracy is improved by employing multimodal data.
Revised:  We show the results of our proposed discriminative hallucinated method for 1-, 2-, and 5- shot learning on the CUB dataset, where the accuracy is improved by employing multimodal data.
Edit intent: fluency
Original: This paper presents a unified method for extraction of geometrical shape features in binary image data using a linear partial differential equation (PDE)  .
Revised: A unified method for extraction of geometrical shape features in binary image data using a linear partial differential equation (PDE) .
Edit intent: clarity
Original: This paper presents a unified method for extraction of geometrical shape features in binary image data using a linear partial differential equation (PDE)  .
Revised: This paper presents a unified method for extracting geometric shape features from binary image data using a linear partial differential equation (PDE) .
Edit intent: fluency
Original:  The PDE and functions are formulated to extract geometrical shape features, which are thickness, shape orientationand skeleton, all at once .
Revised:  The PDE and functions are formulated to extract the thickness, orientation, and skeleton simultaneously .
Edit intent: clarity
Original:  Additionally, two- and three-dimensional numerical examples are shown to confirm the validity and usefulness of the proposed method.
Revised:  In addition, two and three-dimensional numerical examples are shown to confirm the validity and usefulness of the proposed method.
Edit intent: coherence
Original:  Additionally, two- and three-dimensional numerical examples are shown to confirm the validity and usefulness of the proposed method.
Revised:  Additionally, two- and three-dimensional numerical examples are presented to confirm the validity and usefulness of the proposed method.
Edit intent: clarity
Original:  Additionally, two- and three-dimensional numerical examples are shown to confirm the validity and usefulness of the proposed method.
Revised:  Additionally, two- and three-dimensional numerical examples are shown to confirm the usefulness of the proposed method.
Edit intent: clarity
Original:  In addition, two and three-dimensional numerical examples are presented to confirm the usefulness of the proposed method.
Revised:  In addition, two-dimensional numerical examples are presented to confirm the usefulness of the proposed method.
Edit intent: clarity
Original:  Not only do we find that the system is still functioning as expected , we also find evidence that disruptions to the genetic construct are  likely to be removed by natural selection, contributing to the system's long term stability.
Revised:  Not only do we find that the system is still functioning as designed , we also find evidence that disruptions to the genetic construct are likely to be removed by natural selection, contributing to the system's long term stability.
Edit intent: clarity
Original:  Not only do we find that the system is still functioning as expected , we also find evidence that disruptions to the genetic construct are  likely to be removed by natural selection, contributing to the system's long term stability.
Revised:  Not only do we find that the system is still functioning as expected , we also show evidence that disruptions to the genetic construct are likely to be removed by natural selection, contributing to the system's long term stability.
Edit intent: clarity
Original:  Not only do we find that the system is still functioning as expected , we also find evidence that disruptions to the genetic construct are  likely to be removed by natural selection, contributing to the system's long term stability.
Revised:  Not only do we find that the system is still functioning as expected , we also find evidence that disruptions to the genetic construct are likely to be removed by natural selection, contributing to the system's robust, long-term stability.
Edit intent: clarity
Original:  This  appears to be a result of a fundamental relationship between ribosomal proteins and cellular defences which protect against cancer development.
Revised:  This stability appears to be a result of a fundamental relationship between ribosomal proteins and cellular defences which protect against cancer development.
Edit intent: clarity
Original:  As far as the authors are aware, this is the longest continually functioning gene-drive system so far verified.
Revised:  As far as we are aware, this is the longest continually functioning gene-drive system so far verified.
Edit intent: clarity
Original:  The Drosophila lines used to test this system have been deposited at a Drosophila stock center  and are available to labs for independent testing of various aspects of the system .
Revised:  The Drosophila lines used to test this system have been deposited at a Drosophila stock center , and are available to labs for independent testing of various aspects of the system .
Edit intent: fluency
Original:  The Drosophila lines used to test this system have been deposited at a Drosophila stock center  and are available to labs for independent testing of various aspects of the system .
Revised:  The Drosophila lines used to test this system have been deposited at a Drosophila stock center and are available to labs for further, independent testing .
Edit intent: clarity
Original:  Video distribution schemes based on caching combined with device-to-device (D2D) communications promise order-of-magnitude greater spectral efficiency for video delivery, but hinge on the principle of " concentrated demand distributions.
Revised:  Video distribution schemes based on caching combined with device-to-device (D2D) communications promise order-of-magnitude greater spectral efficiency for video delivery, but hinge on the principle of ` concentrated demand distributions.
Edit intent: fluency
Original:  " This letter presents, for the first time,  evaluations of the spectral efficiency of such schemes based on measured cellular demand distributions.
Revised:  ' This paper presents, for the first time, evaluations of the spectral efficiency of such schemes based on measured cellular demand distributions.
Edit intent: clarity
Original:  In particular, we use a database with more than 100 million requests (689,461 for cellular users) from the BBC iPlayer, a popular video streaming service in the U.K., to evaluate the throughput-outage tradeoff of a random caching D2D based scheme, and find that also for this realistic case , order-of-magnitude improvements can be achieved.
Revised:  In particular, we use a dataset with more than 100 million requests (689,461 for cellular users) from the BBC iPlayer, a popular video streaming service in the U.K., to evaluate the throughput-outage tradeoff of a random caching D2D based scheme, and find that also for this realistic case , order-of-magnitude improvements can be achieved.
Edit intent: clarity
Original:  In particular, we use a database with more than 100 million requests (689,461 for cellular users) from the BBC iPlayer, a popular video streaming service in the U.K., to evaluate the throughput-outage tradeoff of a random caching D2D based scheme, and find that also for this realistic case , order-of-magnitude improvements can be achieved.
Revised:  In particular, we use a database with more than 100 million requests from the BBC iPlayer, a popular video streaming service in the U.K., to evaluate the throughput-outage tradeoff of a random caching D2D based scheme, and find that also for this realistic case , order-of-magnitude improvements can be achieved.
Edit intent: coherence
Original:  In particular, we use a database with more than 100 million requests (689,461 for cellular users) from the BBC iPlayer, a popular video streaming service in the U.K., to evaluate the throughput-outage tradeoff of a random caching D2D based scheme, and find that also for this realistic case , order-of-magnitude improvements can be achieved.
Revised:  In particular, we use a database with more than 100 million requests (689,461 for cellular users) from the BBC iPlayer, a popular video streaming service in the U.K., to evaluate the throughput-outage tradeoff of a random caching D2D based scheme, and find that also for the numerical evaluations based on a realistic setup , order-of-magnitude improvements can be achieved.
Edit intent: clarity
Original: Today, a considerable Internet traffic is sent from the datacenter and headed for users.
Revised: Today, considerable Internet traffic is sent from the datacenter and headed for users.
Edit intent: fluency
Original: Today, a considerable Internet traffic is sent from the datacenter and headed for users.
Revised: Today, a considerable Internet traffic is sent from the datacenter and heads for users.
Edit intent: fluency
Original:  With continuous upgrades in network infrastructure and user devices, the characteristics of connections served by servers in the datacenter are usually diverse and varied over time  .
Revised:  The characteristics of connections served by servers in the datacenter are usually diverse and varied over time .
Edit intent: clarity
Original:  With continuous upgrades in network infrastructure and user devices, the characteristics of connections served by servers in the datacenter are usually diverse and varied over time  .
Revised:  With continuous upgrades in network infrastructure and user devices, the characteristics of connections served by servers in datacenters are usually diverse and varied over time .
Edit intent: fluency
Original:  With continuous upgrades in network infrastructure and user devices, the characteristics of connections served by servers in the datacenter are usually diverse and varied over time  .
Revised:  With continuous upgrades in network infrastructure and user devices, the characteristics of connections served by servers in the datacenter are usually diverse and varied over time , with continuous upgrades in network infrastructure and user devices .
Edit intent: coherence
Original:  As a result, one particular congestion control algorithm is hard to accommodate the heterogeneity and perform well in all scenarios.
Revised:  As a result, a specific congestion control algorithm is hard to accommodate the heterogeneity and perform well in all scenarios.
Edit intent: clarity
Original:  As a result, one particular congestion control algorithm is hard to accommodate the heterogeneity and perform well in all scenarios.
Revised:  As a result, one particular congestion control algorithm hardly accommodates the heterogeneity and perform well in all scenarios.
Edit intent: clarity
Original:  As a result, one particular congestion control algorithm is hard to accommodate the heterogeneity and perform well in all scenarios.
Revised:  As a result, one particular congestion control algorithm is hard to accommodate the heterogeneity and performs well in various scenarios.
Edit intent: clarity
Original:  In this paper , we present Micro Congestion Control (MCC) --- a novel framework for Internet congestion control.
Revised:  In this work , we present Micro Congestion Control (MCC) --- a novel framework for Internet congestion control.
Edit intent: clarity
Original:  With MCC, diverse algorithms can be assigned  to connections in one server to cover the heterogeneity, and multiple algorithms can be applied in each connection's life cycle to keep pace with the dynamic of the Internet .
Revised:  With MCC, diverse algorithms can be assigned to connections in one server to adapt to heterogeneity, and multiple algorithms can be applied in each connection's life cycle to keep pace with the dynamic of the Internet .
Edit intent: clarity
Original:  With MCC, diverse algorithms can be assigned  to connections in one server to cover the heterogeneity, and multiple algorithms can be applied in each connection's life cycle to keep pace with the dynamic of the Internet .
Revised:  With MCC, diverse algorithms can be assigned to connections in one server to cover the heterogeneity, and different algorithms can be applied in each connection's life cycle to keep pace with the dynamic of the Internet .
Edit intent: clarity
Original:  With MCC, diverse algorithms can be assigned  to connections in one server to cover the heterogeneity, and multiple algorithms can be applied in each connection's life cycle to keep pace with the dynamic of the Internet .
Revised:  With MCC, diverse algorithms can be assigned to connections in one server to cover the heterogeneity, and multiple algorithms can be chosen in each connection's life cycle to keep pace with the dynamic of the Internet .
Edit intent: clarity
Original:  With MCC, diverse algorithms can be assigned  to connections in one server to cover the heterogeneity, and multiple algorithms can be applied in each connection's life cycle to keep pace with the dynamic of the Internet .
Revised:  With MCC, diverse algorithms can be assigned to connections in one server to cover the heterogeneity, and multiple algorithms can be applied in each connection's life cycle to keep pace with the dynamic of network .
Edit intent: clarity
Original:  We design and implement MCC in Linux, and experiments show that MCC is capable of smoothly switching among various candidate algorithms on the fly to achieve potential performance gain  . Meanwhile, the overheads introduced by MCC are moderate and acceptable.
Revised:  We design and implement MCC in Linux, and the experiments validate that MCC is capable of smoothly switching among various candidate algorithms on the fly to achieve potential performance gain . Meanwhile, the overheads introduced by MCC are moderate and acceptable.
Edit intent: clarity
Original:  Intuitively our network can be interpreted as applying random hyperplanes to the space of all patches of input images followed by average pooling to obtain final features .
Revised:  Intuitively our network can be interpreted as partitioning the space of all patches of input images followed by average pooling to obtain final features .
Edit intent: clarity
Original:  We show that the ratio of image pixel distribution similarity across classes to within classes and the average margin of the linear support vector machine on test data are both higher in our network's final layer compared to the input space.
Revised:  We show that the ratio of image pixel distribution similarity across classes to within classes is higher in our network's final layer compared to the input space.
Edit intent: clarity
Original:  We then apply the linear support vector machine for image classification and k-nearest neighbor for image similarity detection on our network's final layer .
Revised:  When we apply the linear support vector machine for image classification and k-nearest neighbor for image similarity detection on our network's final layer .
Edit intent: coherence
Original:  We show that for classification our network attains higher accuracies than previous random networks and is not far behind in accuracy to trained state of the art networks, especially in the top-k setting.
Revised:  We show that for classification our network attains higher accuracies than previous random networks and is not far behind that of trained networks, particularly in the top-k setting.
Edit intent: clarity
Original:  In the problem of image similarity we find that  k-nearest neighbor gives a comparable precision on the Corel Princeton Image Similarity Benchmark than if we were to use the last hidden layer of trained networks.
Revised:  In the problem of image similarity we find that k-nearest neighbor gives a comparable precision on the Corel Princeton Image Similarity Benchmark than if we were to use the final layer of trained networks.
Edit intent: clarity
Original: As the largest e-commerce platform, Taobao helps advertisers reach billions of search requests each day with its sponsored searchservice , which has also contributed considerable revenue to the platform.
Revised: As the largest e-commerce platform, Taobao helps advertisers reach billions of search queries each day via sponsored search , which has also contributed considerable revenue to the platform.
Edit intent: clarity
Original:  How to design a suit of marketing optimization tool to cater various advertiser demands while balancing platform revenue and consumer experience is significant to a healthy and sustainable marketing ecosystem , among which bidding strategy plays a critical role.
Revised:  An efficient bidding strategy to cater to diverse advertiser demands while balancing platform revenue and consumer experience is significant to a healthy and sustainable marketing ecosystem , among which bidding strategy plays a critical role.
Edit intent: clarity
Original:  In this paper we propose Customer Intelligent Agent , a bidding optimization framework which designs an impression-level bidding strategy to reflect advertiser' s conversion willingness and budget control.
Revised:  In this paper we propose Customer Intelligent Agent , a bidding optimization framework which implements an impression-level bidding strategy to reflect advertiser' s conversion willingness and budget control.
Edit intent: clarity
Original:  In this paper we propose Customer Intelligent Agent , a bidding optimization framework which designs an impression-level bidding strategy to reflect advertiser' s conversion willingness and budget control.
Revised:  In this paper we propose Customer Intelligent Agent , a bidding optimization framework which designs an impression-level bidding to reflect advertisers' conversion willingness and budget control.
Edit intent: clarity
Original:  In this way, with a simplified control ability for advertisers, CIA is capable of fulfilling various e-commerce advertiser demands in different levels, such as GMV optimization, style comparison etc.
Revised:  In this way, CIA is capable of fulfilling various e-commerce advertiser demands in different levels, such as GMV optimization, style comparison etc.
Edit intent: coherence
Original:  In this way, with a simplified control ability for advertisers, CIA is capable of fulfilling various e-commerce advertiser demands in different levels, such as GMV optimization, style comparison etc.
Revised:  In this way, with a simplified control ability for advertisers, CIA is capable of fulfilling various e-commerce advertiser demands on different levels, such as GMV optimization, style comparison etc.
Edit intent: clarity
Original:  In this way, with a simplified control ability for advertisers, CIA is capable of fulfilling various e-commerce advertiser demands in different levels, such as GMV optimization, style comparison etc.
Revised:  In this way, with a simplified control ability for advertisers, CIA is capable of fulfilling various e-commerce advertiser demands in different levels, such as Gross Merchandise Volume optimization, style comparison etc.
Edit intent: fluency
Original:  Moreover, CIA has been deployed online as a major bidding tool for advertisers in TSA.
Revised:  Moreover, CIA has been deployed online as a major bidding tool in TSA.
Edit intent: clarity
Original:  We use clustering algorithms to create coarser levels that preserve the principal components of the covariance or Gram matrix.
Revised:  We use clustering algorithms to create a coarser level that preserves the principal components of the covariance or Gram matrix.
Edit intent: fluency
Original:  These coarser levels approximate the dominant eigenvectors and are used to build a multilevel preconditioner accelerating the Conjugate Gradient method.
Revised:  This coarser level approximates the dominant eigenvectors and are used to build a multilevel preconditioner accelerating the Conjugate Gradient method.
Edit intent: fluency
Original:  These coarser levels approximate the dominant eigenvectors and are used to build a multilevel preconditioner accelerating the Conjugate Gradient method.
Revised:  These coarser levels approximate the dominant eigenvectors and is used to build a multilevel preconditioner accelerating the Conjugate Gradient method.
Edit intent: fluency