wanyu/IteraTeR_v2 huggingface dataset:
Original:  Despite this potential, specific research activities on NDP have witnessed only limited success until recently, often owing to performance mismatches between logic and memory process technologies that put a limit on the processing capability of memory . Recently, there have been two major changes in the game, igniting the resurgence of NDP with renewed interest .
Revised:  Despite this potential, specific research activities on NDP have witnessed only limited success until recently, often owing to performance mismatches between logic and memory process technologies that put a limit on the processing capability of memory . Recently, two major changes in the game, igniting the resurgence of NDP with renewed interest .
Edit intent: coherence
Original:  Despite this potential, specific research activities on NDP have witnessed only limited success until recently, often owing to performance mismatches between logic and memory process technologies that put a limit on the processing capability of memory . Recently, there have been two major changes in the game, igniting the resurgence of NDP with renewed interest .
Revised:  Despite this potential, specific research activities on NDP have witnessed only limited success until recently, often owing to performance mismatches between logic and memory process technologies that put a limit on the processing capability of memory . Recently, there have been two major changes have occurred that have ignited renewed interest and caused a resurgence of NDP with renewed interest .
Edit intent: clarity
Original:  Despite this potential, specific research activities on NDP have witnessed only limited success until recently, often owing to performance mismatches between logic and memory process technologies that put a limit on the processing capability of memory . Recently, there have been two major changes in the game, igniting the resurgence of NDP with renewed interest .
Revised:  Despite this potential, specific research activities on NDP have witnessed only limited success until recently, often owing to performance mismatches between logic and memory process technologies that put a limit on the processing capability of memory . Recently, there have been two major changes in the game, igniting the resurgence of NDP .
Edit intent: clarity
Original:  The second is the advent of NAND flash-based solid-state drives (SSDs) containing multicore processors that can accommodate extra computation for data processing.
Revised:  The second is the popularity of NAND flash-based solid-state drives (SSDs) containing multicore processors that can accommodate extra computation for data processing.
Edit intent: clarity
Original:  Sparked by these application needs and technological support , we evaluate the potential of NDP for ML using a new SSD platform that allows us to simulate in-storage processing (ISP) of ML workloads.
Revised:  In this paper , we evaluate the potential of NDP for ML using a new SSD platform that allows us to simulate in-storage processing (ISP) of ML workloads.
Edit intent: clarity
Original:  Sparked by these application needs and technological support , we evaluate the potential of NDP for ML using a new SSD platform that allows us to simulate in-storage processing (ISP) of ML workloads.
Revised:  Sparked by these application needs and technological support , we evaluate the potential of NDP for ML using a new SSD platform that allows us to simulate instorage processing (ISP) of ML workloads.
Edit intent: fluency
Original:  Our platform (named ISP-ML) is a full-fledged simulator of a realistic multi-channel SSD that can execute various ML algorithms using the data stored in the SSD. For thorough performance analysis and  in-depth comparison with alternatives , we focus on a specific algorithm: stochastic gradient decent (SGD), which is the de facto standard for training differentiable learning machines including deep neural networks.
Revised:  Our platform (named ISP-ML) is a full-fledged simulator of a realistic multi-channel SSD that can execute various ML algorithms using data stored in the SSD. For thorough performance analysis and in-depth comparison with alternatives , we focus on a specific algorithm: stochastic gradient decent (SGD), which is the de facto standard for training differentiable learning machines including deep neural networks.
Edit intent: fluency
Original:  Our platform (named ISP-ML) is a full-fledged simulator of a realistic multi-channel SSD that can execute various ML algorithms using the data stored in the SSD. For thorough performance analysis and  in-depth comparison with alternatives , we focus on a specific algorithm: stochastic gradient decent (SGD), which is the de facto standard for training differentiable learning machines including deep neural networks.
Revised:  Our platform (named ISP-ML) is a full-fledged simulator of a realistic multi-channel SSD that can execute various ML algorithms using the data stored in the SSD. To conduct a thorough performance analysis and in-depth comparison with alternatives , we focus on a specific algorithm: stochastic gradient decent (SGD), which is the de facto standard for training differentiable learning machines including deep neural networks.
Edit intent: clarity
Original:  Our platform (named ISP-ML) is a full-fledged simulator of a realistic multi-channel SSD that can execute various ML algorithms using the data stored in the SSD. For thorough performance analysis and  in-depth comparison with alternatives , we focus on a specific algorithm: stochastic gradient decent (SGD), which is the de facto standard for training differentiable learning machines including deep neural networks.
Revised:  Our platform (named ISP-ML) is a full-fledged simulator of a realistic multi-channel SSD that can execute various ML algorithms using the data stored in the SSD. For thorough performance analysis and an in-depth comparison with alternatives , we focus on a specific algorithm: stochastic gradient decent (SGD), which is the de facto standard for training differentiable learning machines including deep neural networks.
Edit intent: fluency
Original:  Our platform (named ISP-ML) is a full-fledged simulator of a realistic multi-channel SSD that can execute various ML algorithms using the data stored in the SSD. For thorough performance analysis and  in-depth comparison with alternatives , we focus on a specific algorithm: stochastic gradient decent (SGD), which is the de facto standard for training differentiable learning machines including deep neural networks.
Revised:  Our platform (named ISP-ML) is a full-fledged simulator of a realistic multi-channel SSD that can execute various ML algorithms using the data stored in the SSD. For thorough performance analysis and in-depth comparison with alternative techniques , we focus on a specific algorithm: stochastic gradient decent (SGD), which is the de facto standard for training differentiable learning machines including deep neural networks.
Edit intent: clarity
Original:  Our platform (named ISP-ML) is a full-fledged simulator of a realistic multi-channel SSD that can execute various ML algorithms using the data stored in the SSD. For thorough performance analysis and  in-depth comparison with alternatives , we focus on a specific algorithm: stochastic gradient decent (SGD), which is the de facto standard for training differentiable learning machines including deep neural networks.
Revised:  Our platform (named ISP-ML) is a full-fledged simulator of a realistic multi-channel SSD that can execute various ML algorithms using the data stored in the SSD. For thorough performance analysis and in-depth comparison with alternatives , we focus on a specific algorithm: stochastic gradient descent (SGD), which is the de facto standard for training differentiable learning machines including deep neural networks.
Edit intent: fluency
Original:  Our platform (named ISP-ML) is a full-fledged simulator of a realistic multi-channel SSD that can execute various ML algorithms using the data stored in the SSD. For thorough performance analysis and  in-depth comparison with alternatives , we focus on a specific algorithm: stochastic gradient decent (SGD), which is the de facto standard for training differentiable learning machines including deep neural networks.
Revised:  Our platform (named ISP-ML) is a full-fledged simulator of a realistic multi-channel SSD that can execute various ML algorithms using the data stored in the SSD. For thorough performance analysis and in-depth comparison with alternatives , we focus on a specific algorithm: stochastic gradient decent (SGD), which is the de facto standard for training differentiable models such as logistic regression and neural networks.
Edit intent: clarity
Original:  We implement and compare three variants of SGD (synchronous, Downpour, and elastic averaging) using ISP-ML, exploiting the multiple NAND channels for parallelizing SGD.
Revised:  We implement and compare three SGD variants (synchronous, Downpour, and elastic averaging) using ISP-ML, exploiting the multiple NAND channels for parallelizing SGD.
Edit intent: fluency
Original:  We implement and compare three variants of SGD (synchronous, Downpour, and elastic averaging) using ISP-ML, exploiting the multiple NAND channels for parallelizing SGD.
Revised:  We implement and compare three variants of SGD (synchronous, Downpour, and elastic averaging) using ISP-ML, exploiting the multiple NAND channels to parallelize SGD.
Edit intent: fluency
Original:  Using the individual based model of Wright and Fisher, we compute the amplitude of neutral aggregation in the genome space, i.e., the probability PL,\Theta,M (k) of finding two individuals at genetic distance k for a genome of size L and mutation and migration number \Theta and M . In well mixed populations, we show that for \Theta \ll L, neutral aggregation is the dominant force and most individuals are found at short genetic distances from each other.
Revised:  Using the individual based model of Wright and Fisher, we compute the amplitude of neutral aggregation in the genome space, i.e., the probability of finding two individuals at genetic distance k for a genome of size L and mutation and migration number \Theta and M . In well mixed populations, we show that for \Theta \ll L, neutral aggregation is the dominant force and most individuals are found at short genetic distances from each other.
Edit intent: clarity
Original:  For a geographically dispersed population,  the controlling parameter is  a combination of mutation and migration numbers .
Revised:  For a geographically dispersed population, where the controlling parameter is a combination of mutation and migration numbers .
Edit intent: coherence
Original:  For a geographically dispersed population,  the controlling parameter is  a combination of mutation and migration numbers .
Revised:  For a geographically dispersed population, the controlling parameter is shown to be a combination of mutation and migration numbers .
Edit intent: clarity
Original:  For a geographically dispersed population,  the controlling parameter is  a combination of mutation and migration numbers .
Revised:  For a geographically dispersed population, the controlling parameter is a combination of mutation and migration probability .
Edit intent: clarity
Original:  As such, spontaneous nucleation of protein fibrils has received much attention in recent years with many theoretical and experimental studies focusing on the underlying physical principles.
Revised:  As such, spontaneous nucleation of protein fibrils has received much attention in recent years with many theoretical and experimental studies focussing on the underlying physical principles.
Edit intent: fluency
Original:  We first provide an overview of the thermodynamics and kinetics of spontaneous nucleation in protein filaments in the presence of one relevant degree of freedom, namely the cluster size.
Revised:  We first provide an overview of the thermodynamics and kinetics of spontaneous nucleation of protein filaments in the presence of one relevant degree of freedom, namely the cluster size.
Edit intent: fluency
Original:  The so called region growing paradigm 1 is modified and used for these two cut problems on directed graphs By this paradigm, we give for each problem an approximation algorithm such that both algorithms have an approximate factor .
Revised:  The so called region growing paradigm 1 is modified and used for these two cut problems on directed graphs . By using this paradigm, we give for each problem an approximation algorithm such that both algorithms have an approximate factor .
Edit intent: coherence
Original:  The work previously done on these problems  need to solve k linear programming, whereas our algorithms require only one linear programming for obtaining a good approximate factor .
Revised:  The work previously done on these problems . However, the previous works need to solve k linear programming, whereas our algorithms require only one linear programming for obtaining a good approximate factor .
Edit intent: coherence
Original: This report presents the results of the UNIFY Service Provider (SP)-DevOps activities.
Revised: This report presents the results of the UNIFY Service Provider DevOps activities.
Edit intent: clarity
Original:  Our assessment shows that SP-DevOps can help providers to reach a medium level of DevOps maturity and  significant reduction in OPEX.
Revised:  Our assessment shows that SP-DevOps can help providers to reach a medium level of DevOps maturity and allows significant reduction in OPEX.
Edit intent: coherence
Original:  Since then, continuous efforts have been taken to enhance its performance .
Revised:  The performance of k-means has been enhanced from different perspectives over the years .
Edit intent: clarity
Original:  Different from most of k-means variants, the clustering procedure is explicitly driven by an  objective function, which is feasible for the whole l2-space.
Revised:  Different from most of k-means variants, the clustering procedure is driven by an objective function, which is feasible for the whole l2-space.
Edit intent: clarity
Original:  K-means therefore becomes simpler , faster and better .
Revised:  The procedure of k-means becomes simpler and converges to a considerably better local optima .
Edit intent: clarity
Original:  To address the challenges introduced by sparsity, we propose a novel data layout, a new warp-based sampling kernel, and an efficient sparse count matrix updating algorithm that improves locality, makes efficient utilization of GPU warps, and reduces memory consumption. xperiments show that SaberLDA can learn from billions-token-scale data with up to 10,000 topics, which is almost two orders of magnitude larger than that of the previous GPU-based systems.
Revised:  To address the challenges introduced by sparsity, we propose a novel data layout, a new warp-based sampling kernel, and an efficient sparse count matrix updating algorithm that improves locality, makes efficient utilization of GPU warps, and reduces memory consumption. Experiments show that SaberLDA can learn from billions-token-scale data with up to 10,000 topics, which is almost two orders of magnitude larger than that of the previous GPU-based systems.
Edit intent: fluency
Original:  With a single GPU card, SaberLDA is able to earn 10,000 topics from a dataset of billions of tokens in a few hours, which is only achievable with clusters with tens of machines before.
Revised:  With a single GPU card, SaberLDA is able to learn 10,000 topics from a dataset of billions of tokens in a few hours, which is only achievable with clusters with tens of machines before.
Edit intent: clarity
Original: Due to the increasing number of authors per publication , a change in counting method for a publication or citation indicator will often change the result of the indicator.
Revised: Due to the increasing number of authors per publication , a change in counting method will often change the result of the indicator.
Edit intent: clarity
Original: Due to the increasing number of authors per publication , a change in counting method for a publication or citation indicator will often change the result of the indicator.
Revised: Due to the increasing number of authors per publication , a change in counting method for a publication or citation indicator will often change the value of an indicator.
Edit intent: clarity
Original:  I have analyzed arguments for counting methods in a sample of 13 recent bibliometric studies and compared the result with discussions of arguments for counting methods in three older studies.
Revised:  I have identified arguments for counting methods in a sample of 13 recent bibliometric studies and compared the result with discussions of arguments for counting methods in three older studies.
Edit intent: clarity
Original:  Based on the arguments in the studies I formed argument categories which were grouped based on the underlying logics of the arguments .
Revised:  Based on the underlying logics of the arguments .
Edit intent: clarity
Original:  The first group focuses on arguments related to what an indicator measures, the next group on avoiding double counting of publications and/or citations, the third on pragmatic reasons for the choice of counting method, and the fourth group on an indicators influence on the research community or how it is influenced by the research community .
Revised:  The first group focuses on arguments related to what an indicator measures, the next group on avoiding double counting of publications and/or citations, the third on pragmatic reasons for the choice of counting method, and Group 4 on an indicator's influence on the research community or how it is influenced by the research community .
Edit intent: clarity
Original:  The first group focuses on arguments related to what an indicator measures, the next group on avoiding double counting of publications and/or citations, the third on pragmatic reasons for the choice of counting method, and the fourth group on an indicators influence on the research community or how it is influenced by the research community .
Revised:  The first group focuses on arguments related to what an indicator measures, the next group on avoiding double counting of publications and/or citations, the third on pragmatic reasons for the choice of counting method, and the fourth group on an indicators influence on the research community or how it is perceived by researchers. This categorization can be used to describe and discuss how bibliometric studies with publication and citation indicators argue for counting methods .
Edit intent: clarity
Original:  This abstract generalization is set in a Banach lattice %DIFDELCMD < \cal %%% X with a unit order .
Revised:  This abstract generalization is set in a Banach lattice %DIFDELCMD < \cal %%% with a order unit .
Edit intent: clarity
Original: We present the Macaulay2 package NumericalImplicitization  , which allows for user-friendly computation of the basic invariants of the image of a polynomial map, such as dimension, degree, and Hilbert function values.
Revised: We present the NumericalImplicitization , which allows for user-friendly computation of the basic invariants of the image of a polynomial map, such as dimension, degree, and Hilbert function values.
Edit intent: coherence
Original: We present the Macaulay2 package NumericalImplicitization  , which allows for user-friendly computation of the basic invariants of the image of a polynomial map, such as dimension, degree, and Hilbert function values.
Revised: We present the Macaulay2 package NumericalImplicitization , which allows for user-friendly computation of the invariants of the image of a polynomial map, such as dimension, degree, and Hilbert function values.
Edit intent: clarity
Original:  This package relies on methods of numerical algebraic geometry, such as homotopy continuation and monodromy.
Revised:  This package relies on methods of numerical algebraic geometry, including homotopy continuation and monodromy.
Edit intent: clarity
Original: We introduce a class of flexible and tractable static factor models for the joint term structure of  default probabilities, the factor copula models.
Revised: We present a class of flexible and tractable static factor models for the joint term structure of default probabilities, the factor copula models.
Edit intent: coherence
Original: We introduce a class of flexible and tractable static factor models for the joint term structure of  default probabilities, the factor copula models.
Revised: We introduce a class of flexible and tractable static factor models for the term structure of default probabilities, the factor copula models.
Edit intent: clarity
Original: We introduce a class of flexible and tractable static factor models for the joint term structure of  default probabilities, the factor copula models.
Revised: We introduce a class of flexible and tractable static factor models for the joint term structure of joint default probabilities, the factor copula models.
Edit intent: fluency
Original:  These high dimensional models remain parsimonious with pair copula constructions, and nest numerous standard models as special cases.
Revised:  These high dimensional models remain parsimonious with pair copula constructions, and nest many standard models as special cases.
Edit intent: fluency
Original:  An empirical exercise shows that a simple model specification can fit credit index tranche prices.
Revised:  An empirical exercise illustrates the flexibility of our approach by fitting credit index tranche prices.
Edit intent: clarity
Original:  These high dimensional models remain parsimonious with pair copula constructions, and nest many standard models as special cases.
Revised:  These high-dimensional models remain parsimonious with pair copula constructions, and nest many standard models as special cases.
Edit intent: fluency
Original:  These high dimensional models remain parsimonious with pair copula constructions, and nest many standard models as special cases.
Revised:  These high dimensional models remain parsimonious with pair-copula constructions, and nest many standard models as special cases.
Edit intent: fluency
Original: This paper investigates the global dynamics of a mean field model of the electroencephalogram developed by Liley et al. , 2002.
Revised: This paper investigates the global dynamics of a mean field model of the electroencephalogram developed by Liley et al. , 2002.
Edit intent: fluency
Original:  Challenges towards establishing a global attractor for the model are discussed and it is shown that there exist parameter values for which the constructed semidynamical systems do not posses a compact global attractor , due to the lack of assymptotic compactness property.
Revised:  Challenges towards establishing a global attractor for the model are discussed and it is shown that there exist parameter values for which the constructed semidynamical systems do not possess a compact global attractor , due to the lack of assymptotic compactness property.
Edit intent: fluency
Original:  Challenges towards establishing a global attractor for the model are discussed and it is shown that there exist parameter values for which the constructed semidynamical systems do not posses a compact global attractor , due to the lack of assymptotic compactness property.
Revised:  Challenges towards establishing a global attractor for the model are discussed and it is shown that there exist parameter values for which the constructed semidynamical systems do not posses a compact global attractor due to the lack of assymptotic compactness property.
Edit intent: fluency
Original:  Challenges towards establishing a global attractor for the model are discussed and it is shown that there exist parameter values for which the constructed semidynamical systems do not posses a compact global attractor , due to the lack of assymptotic compactness property.
Revised:  Challenges towards establishing a global attractor for the model are discussed and it is shown that there exist parameter values for which the constructed semidynamical systems do not posses a compact global attractor , due to the lack of the asymptotic compactness property.
Edit intent: fluency