wanyu/IteraTeR_v2 huggingface dataset:
Original:  For this test model, we show that the stability threshold on the extrapolation step, above which the simulation breaks down, is largely independent from the time-scale separation parameter of the linear model, which severely restricts the time step of direct path simulation.
Edit intent: coherence
Original:  Our results demonstrate thatthe micro-macro acceleration method increases the admissible time step for multi-scale systems beyond step sizes for which a direct time discretization becomes unstable.
Revised:  Our results demonstrate thatthe micro-macro acceleration method increases the admissible time steps far beyond those for which a direct time discretization becomes unstable.
Edit intent: clarity
Original:  It may serve as an introduction into algebraic topology motivated by algorithmic, combinatorial and geometric problems.
Revised:  It may serve as an introduction to starting ideas of algebraic topology motivated by algorithmic, combinatorial and geometric problems.
Edit intent: clarity
Original: In 1932, Paul Erdos asked whether a random walk constructed from a binary sequence can achieve  , for the sequence itself and for all its subsequences formed by homogeneous arithmetic progressions , the lowest possible deviation (lowest discrepancy) .
Revised: In 1932, Paul Erdos asked whether a random walk constructed from a binary sequence can achieve the lowest possible deviation (lowest discrepancy) , for the sequence itself and for all its subsequences formed by homogeneous arithmetic progressions , the lowest possible deviation (lowest discrepancy) .
Edit intent: fluency
Original: In 1932, Paul Erdos asked whether a random walk constructed from a binary sequence can achieve  , for the sequence itself and for all its subsequences formed by homogeneous arithmetic progressions , the lowest possible deviation (lowest discrepancy) .
Revised: In 1932, Paul Erdos asked whether a random walk constructed from a binary sequence can achieve , for the sequence itself and for all its subsequences formed by homogeneous arithmetic progressions .
Edit intent: clarity
Original:  based Erdos motifs are greatly under-represented in the human genome, (2) the strong(G and C)/weak(A and T) based Erdos motifs are slightly over-represented , (3) the densities of the two are negatively correlated, (4)  Erdos motifs based on all three mappings being combined are slightly under-represented , and (5) the strong/weak based Erdos motifs are greatly over-represented in the human messenger RNA sequences , possibly caused by an overlooked pattern in the Erdos sequence .
Revised:  based Erdos motifs are greatly underrepresented in the human genome, (2) the strong(G and C)/weak(A and T) based Erdos motifs are slightly over-represented , (3) the densities of the two are negatively correlated, (4) Erdos motifs based on all three mappings being combined are slightly under-represented , and (5) the strong/weak based Erdos motifs are greatly over-represented in the human messenger RNA sequences , possibly caused by an overlooked pattern in the Erdos sequence .
Edit intent: fluency
Original:  based Erdos motifs are greatly under-represented in the human genome, (2) the strong(G and C)/weak(A and T) based Erdos motifs are slightly over-represented , (3) the densities of the two are negatively correlated, (4)  Erdos motifs based on all three mappings being combined are slightly under-represented , and (5) the strong/weak based Erdos motifs are greatly over-represented in the human messenger RNA sequences , possibly caused by an overlooked pattern in the Erdos sequence .
Revised:  based Erdos motifs are greatly under-represented in the human genome, (2) the strong(G and C)/weak(A and T) based Erdos motifs are slightly overrepresented , (3) the densities of the two are negatively correlated, (4) Erdos motifs based on all three mappings being combined are slightly under-represented , and (5) the strong/weak based Erdos motifs are greatly over-represented in the human messenger RNA sequences , possibly caused by an overlooked pattern in the Erdos sequence .
Edit intent: fluency
Original:  based Erdos motifs are greatly under-represented in the human genome, (2) the strong(G and C)/weak(A and T) based Erdos motifs are slightly over-represented , (3) the densities of the two are negatively correlated, (4)  Erdos motifs based on all three mappings being combined are slightly under-represented , and (5) the strong/weak based Erdos motifs are greatly over-represented in the human messenger RNA sequences , possibly caused by an overlooked pattern in the Erdos sequence .
Revised:  based Erdos motifs are greatly under-represented in the human genome, (2) the strong(G and C)/weak(A and T) based Erdos motifs are slightly over-represented , (3) the densities of the two are negatively correlated, (4) the Erdos motifs based on all three mappings being combined are slightly under-represented , and (5) the strong/weak based Erdos motifs are greatly over-represented in the human messenger RNA sequences , possibly caused by an overlooked pattern in the Erdos sequence .
Edit intent: fluency
Original:  based Erdos motifs are greatly under-represented in the human genome, (2) the strong(G and C)/weak(A and T) based Erdos motifs are slightly over-represented , (3) the densities of the two are negatively correlated, (4)  Erdos motifs based on all three mappings being combined are slightly under-represented , and (5) the strong/weak based Erdos motifs are greatly over-represented in the human messenger RNA sequences , possibly caused by an overlooked pattern in the Erdos sequence .
Revised:  based Erdos motifs are greatly under-represented in the human genome, (2) the strong(G and C)/weak(A and T) based Erdos motifs are slightly over-represented , (3) the densities of the two are negatively correlated, (4) Erdos motifs based on all three mappings being combined are slightly underrepresented , and (5) the strong/weak based Erdos motifs are greatly over-represented in the human messenger RNA sequences , possibly caused by an overlooked pattern in the Erdos sequence .
Edit intent: fluency
Original:  based Erdos motifs are greatly under-represented in the human genome, (2) the strong(G and C)/weak(A and T) based Erdos motifs are slightly over-represented , (3) the densities of the two are negatively correlated, (4)  Erdos motifs based on all three mappings being combined are slightly under-represented , and (5) the strong/weak based Erdos motifs are greatly over-represented in the human messenger RNA sequences , possibly caused by an overlooked pattern in the Erdos sequence .
Revised:  based Erdos motifs are greatly under-represented in the human genome, (2) the strong(G and C)/weak(A and T) based Erdos motifs are slightly over-represented , (3) the densities of the two are negatively correlated, (4) Erdos motifs based on all three mappings being combined are slightly under-represented , and (5) the strong/weak based Erdos motifs are greatly overrepresented in the human messenger RNA sequences , possibly caused by an overlooked pattern in the Erdos sequence .
Edit intent: fluency
Original:  based Erdos motifs are greatly under-represented in the human genome, (2) the strong(G and C)/weak(A and T) based Erdos motifs are slightly over-represented , (3) the densities of the two are negatively correlated, (4)  Erdos motifs based on all three mappings being combined are slightly under-represented , and (5) the strong/weak based Erdos motifs are greatly over-represented in the human messenger RNA sequences , possibly caused by an overlooked pattern in the Erdos sequence .
Revised:  based Erdos motifs are greatly under-represented in the human genome, (2) the strong(G and C)/weak(A and T) based Erdos motifs are slightly over-represented , (3) the densities of the two are negatively correlated, (4) Erdos motifs based on all three mappings being combined are slightly under-represented , and (5) the strong/weak based Erdos motifs are greatly over-represented in the human messenger RNA sequences .
Edit intent: clarity
Original:  More precisely , we learn a description of the distribution on the observed variables as a Markov Random Field (or MRF), even though it exhibits complex higher- order interactions .
Revised:  In fact , we learn a description of the distribution on the observed variables as a Markov Random Field (or MRF), even though it exhibits complex higher- order interactions .
Edit intent: coherence
Original:  More precisely , we learn a description of the distribution on the observed variables as a Markov Random Field (or MRF), even though it exhibits complex higher- order interactions .
Revised:  More precisely , we learn a description of the distribution on the observed variables as a Markov Random Field .
Edit intent: clarity
Original:  Moreover our results extend in a straightforward manner to ferromagnetic Ising models with latent variables.
Revised:  Our algorithm extends straighforwardly to general ferromagnetic Ising models with latent variables.
Edit intent: clarity
Original: For network scientists, it has always been an interesting problem to identify the influential nodes in the given network.
Revised: For network scientists, it has always been an interesting problem to identify the influential nodes in a given network.
Edit intent: fluency
Original:  K-shell decomposition method is a widely used method which assigns a shell-index value to each node based on its influential power.
Revised:  The k-shell decomposition method is a widely used method which assigns a shell-index value to each node based on its influential power.
Edit intent: clarity
Original:  The k-shell method requires the global information of the network to compute the shell-index of a node that is not feasible for large-scale real-world dynamic networks.
Revised:  The k-shell method requires the global information of the network to compute the shell-index of a node that is infeasible for large-scale real-world dynamic networks.
Edit intent: clarity
Original:  In the present work, we propose a method to estimate the shell-index of a node using  local information.
Revised:  In this work, we propose a method to estimate the shell-index of a node using local information.
Edit intent: clarity
Original:  In the present work, we propose a method to estimate the shell-index of a node using  local information.
Revised:  In the present work, we propose a method to estimate the shell-index of a node using its local information.
Edit intent: clarity
Original:  We further use hill-climbing based approach to hit the top-ranked nodes in a small number of steps  .
Revised:  We also propose hill-climbing based approach to hit the top-ranked nodes in a small number of steps .
Edit intent: clarity
Original: The gravity model  analogous to Newton's law of universal gravitation has successfully described the flow between different spatial regions, such as human migration, traffic flows, international economic trades, etc.
Revised: The gravity model (GM) analogous to Newton's law of universal gravitation has successfully described the flow between different spatial regions, such as human migration, traffic flows, international economic trades, etc.
Edit intent: clarity
Original:  This simple but powerful approach relies only on the "mass" factor represented by the scale of the regions and the "geometrica" factor represented by the geographical distance.
Revised:  This simple but powerful approach relies only on the 'mass' factor represented by the scale of the regions and the "geometrica" factor represented by the geographical distance.
Edit intent: fluency
Original:  This simple but powerful approach relies only on the "mass" factor represented by the scale of the regions and the "geometrica" factor represented by the geographical distance.
Revised:  This simple but powerful approach relies only on the "mass" factor represented by the scale of the regions and the 'geometrical' factor represented by the geographical distance.
Edit intent: fluency
Original:  However, when the population has a subpopulation structure distinguished by different attributes, the estimation of the flow solely from the coarse-grained geographical factors in the gravity model causes the loss of differential geographical information for each attribute.
Revised:  However, when the population has a subpopulation structure distinguished by different attributes, the estimation of the flow solely from the coarse-grained geographical factors in the GM causes the loss of differential geographical information for each attribute.
Edit intent: clarity
Original:  To exploit the full information contained in the geographical information of subpopulation structure, we generalize the gravity model for population flow by explicitly harnessing the subpopulation properties characterized by both attributes and geography.
Revised:  To exploit the full information contained in the geographical information of subpopulation structure, we generalize the GM for population flow by explicitly harnessing the subpopulation properties characterized by both attributes and geography.
Edit intent: clarity
Original:  By exploiting more refined geographical and clan information, our generalized gravity model properly describes the real data, a part of which could not be explained by the conventional gravity model .
Revised:  By exploiting more refined geographical and clan information, our generalized GM properly describes the real data, a part of which could not be explained by the conventional gravity model .
Edit intent: clarity
Original:  By exploiting more refined geographical and clan information, our generalized gravity model properly describes the real data, a part of which could not be explained by the conventional gravity model .
Revised:  By exploiting more refined geographical and clan information, our generalized gravity model properly describes the real data, a part of which could not be explained by the conventional GM .
Edit intent: clarity
Original:  Therefore, we would like to emphasize the necessity of using our generalized version of the gravity model , when the information on such non-geographical subpopulation structures is available.
Revised:  Therefore, we would like to emphasize the necessity of using our generalized version of the GM , when the information on such non-geographical subpopulation structures is available.
Edit intent: clarity
Original:  Therefore, we would like to emphasize the necessity of using our generalized version of the gravity model , when the information on such non-geographical subpopulation structures is available.
Revised:  Therefore, we would like to emphasize the necessity of using our generalized version of the gravity model , when the information on such nongeographical subpopulation structures is available.
Edit intent: fluency
Original:  The paper also reports the performance of a case study where streaming vision pipelines are executed by time-sharing .
Revised:  The paper also reports the performance of realtime computer vision pipelines when time-shared .
Edit intent: clarity
Original: User data is the primary input of digital advertising, the fuel of free Internet as we know it.
Revised: User data is the primary input of digital advertising, fueling the free Internet as we know it.
Edit intent: fluency
Original:  As a result, web entities invest a lot in elaborate tracking mechanisms to acquire more and more user data that can sell to data markets and advertisers.
Revised:  As a result, web companies invest a lot in elaborate tracking mechanisms to acquire more and more user data that can sell to data markets and advertisers.
Edit intent: clarity
Original:  As a result, web entities invest a lot in elaborate tracking mechanisms to acquire more and more user data that can sell to data markets and advertisers.
Revised:  As a result, web entities invest a lot in elaborate tracking mechanisms to acquire user data that can sell to data markets and advertisers.
Edit intent: clarity
Original:  To address this, Cookie Synchronization (CSync) came to the rescue . CSync facilitates an information sharing channel between third parties that may or may not have direct access to the website the user visits.
Revised:  To address this, Cookie Synchronization (CSync) came to the rescue , facilitating an information sharing channel between third parties that may or may not have direct access to the website the user visits.
Edit intent: coherence
Original:  To address this, Cookie Synchronization (CSync) came to the rescue . CSync facilitates an information sharing channel between third parties that may or may not have direct access to the website the user visits.
Revised:  To address this, Cookie Synchronization (CSync) came to the rescue . CSync facilitates an information sharing channel between third parties that may or not have direct access to the website the user visits.
Edit intent: fluency
Original:  With CSync, they merge the user data they own in the background , but also reconstruct the browsing history of a user bypassing the same origin policy.
Revised:  In the background, with CSync, they merge the user data they own in the background , but also reconstruct the browsing history of a user bypassing the same origin policy.
Edit intent: coherence
Original:  With CSync, they merge the user data they own in the background , but also reconstruct the browsing history of a user bypassing the same origin policy.
Revised:  With CSync, they merge user data they own in the background , but also reconstruct the browsing history of a user bypassing the same origin policy.
Edit intent: fluency
Original:  With CSync, they merge the user data they own in the background , but also reconstruct the browsing history of a user bypassing the same origin policy.
Revised:  With CSync, they merge the user data they own , but also reconstruct the browsing history of a user bypassing the same origin policy.
Edit intent: clarity
Original:  With CSync, they merge the user data they own in the background , but also reconstruct the browsing history of a user bypassing the same origin policy.
Revised:  With CSync, they merge the user data they own in the background , but also reconstruct a user's browsing history, bypassing the same origin policy.
Edit intent: clarity
Original:  In addition , we see that CSync increases the number of entities that track the user by a factor of 6.7.
Revised:  In addition , we see that CSync increases the number of domains that track the user by a factor of 6.7.
Edit intent: clarity
Original:  For identifying and evaluating the usefulness of different kinds of patterns, many techniques / constraints have been proposed, such as support, confidence, sequence order, and utility parameters (e.g., weight, price, profit, quantity,  etc.).
Revised:  For identifying and evaluating the usefulness of different kinds of patterns, many techniques and constraints have been proposed, such as support, confidence, sequence order, and utility parameters (e.g., weight, price, profit, quantity, etc.).
Edit intent: fluency
Original:  For identifying and evaluating the usefulness of different kinds of patterns, many techniques / constraints have been proposed, such as support, confidence, sequence order, and utility parameters (e.g., weight, price, profit, quantity,  etc.).
Revised:  For identifying and evaluating the usefulness of different kinds of patterns, many techniques / constraints have been proposed, such as support, confidence, sequence order, and utility parameters (e.g., weight, price, profit, quantity, satisfaction, etc.).
Edit intent: clarity
Original:  A taxonomy of the most common and state-of-the-art approaches for mining different kinds of high-utility patterns is presented  , including Apriori-based, tree-based, projection-based, vertical-/horizontal-data-format-based, and other hybrid approaches.
Revised:  A taxonomy of the most common and state-of-the-art approaches for mining different kinds of high-utility patterns is presented in detail , including Apriori-based, tree-based, projection-based, vertical-/horizontal-data-format-based, and other hybrid approaches.
Edit intent: clarity
Original: With the growing popularity of resource sharing and shared resources, large volumes of complex data of different types are collected automatically.
Revised: With the growing popularity of shared resources, large volumes of complex data of different types are collected automatically.
Edit intent: clarity
Original:  For sequential pattern mining (SPM) , it is used in a wide variety of real-life applications.
Revised:  For sequential pattern mining (SPM) is used in a wide variety of real-life applications.
Edit intent: clarity
Original:  We review the related work of PSPM in detail, including partition-based algorithms for PSPM, Apriori-based PSPM, pattern growth based PSPM, and hybrid algorithms for PSPM, and provide deep description (i.e., characteristics, advantages, and disadvantages ) of each parallel approach of PSPM. Some advanced topics for PSPM and the related open-source software are further reviewed in details  .
Revised:  We review the related work of PSPM in detail, including partition-based algorithms for PSPM, Apriori-based PSPM, pattern growth based PSPM, and hybrid algorithms for PSPM, and provide deep description (i.e., characteristics, advantages, disadvantages and summarization) of these parallel approaches of each parallel approach of PSPM. Some advanced topics for PSPM and the related open-source software are further reviewed in details .
Edit intent: clarity
Original:  We review the related work of PSPM in detail, including partition-based algorithms for PSPM, Apriori-based PSPM, pattern growth based PSPM, and hybrid algorithms for PSPM, and provide deep description (i.e., characteristics, advantages, and disadvantages ) of each parallel approach of PSPM. Some advanced topics for PSPM and the related open-source software are further reviewed in details  .
Revised:  We review the related work of PSPM in detail, including partition-based algorithms for PSPM, Apriori-based PSPM, pattern growth based PSPM, and hybrid algorithms for PSPM, and provide deep description (i.e., characteristics, advantages, and disadvantages ) of PSPM. Some advanced topics for PSPM and the related open-source software are further reviewed in details .
Edit intent: clarity
Original:  For instance, what value should be given to a two author or three author publication with respect to a single author publication?
Revised:  For instance, what value should be given to a two-author or three-author publication with respect to a single author publication?
Edit intent: fluency
Original:  For instance, what value should be given to a two author or three author publication with respect to a single author publication?
Revised:  For instance, what value should be given to a two author or three author publication with respect to a single-author publication?
Edit intent: fluency
Original:  This paper  proposes a practical method to compute the expected value of an n authors publication that takes into consideration the added value induced by collaboration in contexts in which there is no prior or ex ante information about the publication  potential merits or scientific impact.
Revised:  This paper proposes a practical method to compute the expected value of an n-authors publication that takes into consideration the added value induced by collaboration in contexts in which there is no prior or ex ante information about the publication potential merits or scientific impact.
Edit intent: fluency
Original:  This paper  proposes a practical method to compute the expected value of an n authors publication that takes into consideration the added value induced by collaboration in contexts in which there is no prior or ex ante information about the publication  potential merits or scientific impact.
Revised:  This paper proposes a practical method to compute the expected value of an n authors publication that takes into consideration the added value induced by collaboration in contexts in which there is no prior or ex-ante information about the publication potential merits or scientific impact.
Edit intent: fluency