wanyu/IteraTeR_v2 huggingface dataset:
Original:  We are interested in the computation of some expected statistics of a SCH, including diameter, width, and combinatorial complexity.
Revised:  We are interested in computing certain expected statistics of a SCH, including diameter, width, and combinatorial complexity.
Edit intent: clarity
Original: Coordinated multipoint (CoMP) communications are considered for the fifth-generation (5G) small cell networks as a tool to improve the high data rates and the cell-edge throughput.
Revised: Coordinated multipoint (CoMP) communications are considered for the fifth-generation (5G) small-cell networks as a tool to improve the high data rates and the cell-edge throughput.
Edit intent: fluency
Original:  What's more, the network energy efficiency of fractal small cell networks adopting the SBS cooperation strategy with the received signal power constraint is analyzed.
Revised:  What's more, the network energy efficiency of fractal smallcell networks adopting the SBS cooperation strategy with the received signal power constraint is analyzed.
Edit intent: fluency
Original:  We establish that these approximations are guaranteed to converge to the exact stationary solution as the truncated state-space expands to the full state-space .
Revised:  We establish that these approximations are guaranteed to converge to the exact stationary solution as the truncated state-space .
Edit intent: clarity
Original:  In particular, we show that using a quantized tensor train (QTT) implementation of our sFSP method, problems admitting more than 100 million states can be efficiently solved.
Revised:  In particular, we show that using a quantised tensor train (QTT) implementation of our sFSP method, problems admitting more than 100 million states can be efficiently solved.
Edit intent: fluency
Original:  Experimentally, we observe that GaKCo achieves the same accuracy as the state-of-the-art and outperforms its speed by factors of 2, 100, and 4, on classifying sequences of DNA (5 datasets), protein (12 datasets), and character-based English text (2 datasets), respectively  GaKCo is shared as an open source tool at URL
Revised:  Experimentally, we observe that GaKCo achieves the same accuracy as the state-of-the-art and outperforms its speed by factors of 2, 100, and 4, on classifying sequences of DNA (5 datasets), protein (12 datasets), and character-based English text (2 datasets), respectively . GaKCo is shared as an open source tool at URL
Edit intent: fluency
Original:  The jth predator eats the j-1th species and is eaten by the j+ 1th predator;
Revised:  The jth predator eats the j-1st species and is eaten by the j+ 1th predator;
Edit intent: fluency
Original:  The jth predator eats the j-1th species and is eaten by the j+ 1th predator;
Revised:  The jth predator eats the j-1th species and is eaten by the j+ 1st predator;
Edit intent: fluency
Original:  We remark that, unlike most of the results from the literature, we provide an in depth analysis for both non-degenerate and degenerate noise. 
Revised:  We remark that, unlike most of the results available in the literature, we provide an in depth analysis for both non-degenerate and degenerate noise. 
Edit intent: clarity
Original:  The method proposed here builds on the method presented by Labeur and Wells [SIAM J. Sci. Comput., vol. 34 (2012), pp. A889--A913].
Revised:  The method builds on the method presented by Labeur and Wells [SIAM J. Sci. Comput., vol. 34 (2012), pp. A889--A913].
Edit intent: clarity
Original:  We show that with simple modifications of the function spaces in the method of Labeur and Wells that it is possible to formulate a simple method with pointwise divergence-free velocity fields , and which is both momentum conservingand energy stable .
Revised:  We show that with modifications of the function spaces in the method of Labeur and Wells that it is possible to formulate a simple method with pointwise divergence-free velocity fields , and which is both momentum conservingand energy stable .
Edit intent: fluency
Original:  We show that with simple modifications of the function spaces in the method of Labeur and Wells that it is possible to formulate a simple method with pointwise divergence-free velocity fields , and which is both momentum conservingand energy stable .
Revised:  We show that with simple modifications of the function spaces in the method of Labeur and Wells it is possible to formulate a simple method with pointwise divergence-free velocity fields , and which is both momentum conservingand energy stable .
Edit intent: fluency
Original:  Theoretical results are verified by two- and three-dimensional numerical examples and for different orders of polynomial approximation.
Revised:  Theoretical results are supported by two- and three-dimensional numerical examples and for different orders of polynomial approximation.
Edit intent: clarity
Original:  Whenever two disks meet , the one with the lower index disappears.
Revised:  Whenever two disks touch , the one with the lower index disappears.
Edit intent: clarity
Original:  Whenever two disks meet , the one with the lower index disappears.
Revised:  Whenever two disks meet , the one with the higher index disappears.
Edit intent: clarity
Original:  This problem was introduced by Funke, Krumpe, and Storandt IWOCA 2016 . We provide the first general subquadratic algorithm for computing the times and the order of disappearance.
Revised:  IWOCA 2016 . We provide the first general subquadratic algorithm for computing the times and the order of disappearance.
Edit intent: coherence
Original:  This algorithm also works for other shapes ( such as rectangles)and in any fixed dimension.
Revised:  This algorithm also works for other shapes ( e.g., rectangles), and it works in any fixed dimension.
Edit intent: coherence
Original:  [ALENEX 2017]  and Funke and Storandt [ EWCG 2017].
Revised:  [ALENEX 2017] , and Funke and Storandt [ EWCG 2017].
Edit intent: fluency
Original:  Finally, we give an \Omega(n\log n) lower bound on the problem , showing that our quadtree algorithms are almost tight.
Revised:  Finally, we give an \Omega(n\log n) lower bound , showing that our quadtree algorithms are almost tight.
Edit intent: clarity
Original: This paper proposes the use of the Spectral method to simulate diffusive moisture transfer through porous materials , which can be strongly nonlinear and can significantly affect sensible and latent heat transfer.
Revised: This paper proposes the use of a Spectral method to simulate diffusive moisture transfer through porous materials , which can be strongly nonlinear and can significantly affect sensible and latent heat transfer.
Edit intent: fluency
Original:  The Spectral method is compared with the classical implicit Euler and Crank-Nicolson schemes .
Revised:  The Spectral method is compared with both classical Euler implicit and Crank-Nicolson schemes .
Edit intent: clarity
Original:  The results show that the Spectral  approach enables to accurately simulate the field of interest.
Revised:  The results show that the Spectral approach enables to simulate accurately the field of interest.
Edit intent: fluency
Original:  Furthermore, the numerical gains become particularly interesting for nonlinear cases since the proposed method drastically can reduce the computer run time by 99\% when compared to the traditional Crank-Nicolson scheme  .
Revised:  Furthermore, numerical gains become particularly interesting for nonlinear cases since the proposed method drastically can reduce the computer run time by 99\% when compared to the traditional Crank-Nicolson scheme .
Edit intent: fluency
Original:  Furthermore, the numerical gains become particularly interesting for nonlinear cases since the proposed method drastically can reduce the computer run time by 99\% when compared to the traditional Crank-Nicolson scheme  .
Revised:  Furthermore, the numerical gains become particularly interesting for nonlinear cases since the proposed method can drastically reduce the computer run time by 99\% when compared to the traditional Crank-Nicolson scheme .
Edit intent: fluency
Original: We propose sensorimotor tappings, a new graphical technique that explicitly represents relations between the time steps of an agent's sensorimotor loop and a single training step of an adaptive model that the agent is using internally .
Revised: In this paper, we propose the concept of sensorimotor tappings, a new graphical technique that explicitly represents relations between the time steps of an agent's sensorimotor loop and a single training step of an adaptive model that the agent is using internally .
Edit intent: clarity
Original: We propose sensorimotor tappings, a new graphical technique that explicitly represents relations between the time steps of an agent's sensorimotor loop and a single training step of an adaptive model that the agent is using internally .
Revised: We propose sensorimotor tappings, a new graphical technique that explicitly represents relations between the time steps of an agent's sensorimotor loop and a single training step of an adaptive internal model .
Edit intent: clarity
Original:  In the paper we introduce the problem domain, explain the basic idea, provide example tappings for standard configurations used in developmental models, and show how tappings can be applied to problems in related fields.
Revised:  Here we explain the basic idea, provide example tappings for standard configurations used in developmental models, and show how tappings can be applied to problems in related fields.
Edit intent: clarity
Original:  Ortner asked if an analogous result held for embeddability into a compact orientable surface \Sigma_g of genus g>0.
Revised:  Ortner asked if an analogous result holds for embeddability into a compact orientable surface \Sigma_g of genus g>0.
Edit intent: fluency
Original:  For the ease of presentation the theory is restricted to 2D star-shaped obstacles in low-dimensional setting .
Revised:  For the ease of presentation the theory is restricted to star-shaped obstacles in low-dimensional setting .
Edit intent: clarity
Original:  This paper overviews the main dimensions over which the debate has unfolded and discusses some representative results, with a focus on those situations in which consensus emerges ` spontaneously' in absence of centralised institutions . Covered topics include the macroscopic consequences of the different microscopic rules of behavioural contagion, the role of social networks, and the mechanisms that prevent the formation of a consensus or alter it after it has emerged.
Revised:  This paper overviews the main dimensions over which the debate has unfolded and to discuss some representative examples. It focuses on those situations in which consensus emerges ` spontaneously' in absence of centralised institutions . Covered topics include the macroscopic consequences of the different microscopic rules of behavioural contagion, the role of social networks, and the mechanisms that prevent the formation of a consensus or alter it after it has emerged.
Edit intent: clarity
Original:  This paper overviews the main dimensions over which the debate has unfolded and discusses some representative results, with a focus on those situations in which consensus emerges ` spontaneously' in absence of centralised institutions . Covered topics include the macroscopic consequences of the different microscopic rules of behavioural contagion, the role of social networks, and the mechanisms that prevent the formation of a consensus or alter it after it has emerged.
Revised:  This paper overviews the main dimensions over which the debate has unfolded and discusses some representative results, with a focus on those situations in which consensus emerges ' spontaneously' in absence of centralised institutions . Covered topics include the macroscopic consequences of the different microscopic rules of behavioural contagion, the role of social networks, and the mechanisms that prevent the formation of a consensus or alter it after it has emerged.
Edit intent: fluency
Original:  This paper overviews the main dimensions over which the debate has unfolded and discusses some representative results, with a focus on those situations in which consensus emerges ` spontaneously' in absence of centralised institutions . Covered topics include the macroscopic consequences of the different microscopic rules of behavioural contagion, the role of social networks, and the mechanisms that prevent the formation of a consensus or alter it after it has emerged.
Revised:  This paper overviews the main dimensions over which the debate has unfolded and discusses some representative results, with a focus on those situations in which consensus emerges ` spontaneously' in absence of centralised institutions and covers topic that include the macroscopic consequences of the different microscopic rules of behavioural contagion, the role of social networks, and the mechanisms that prevent the formation of a consensus or alter it after it has emerged.
Edit intent: coherence
Original:  However, the literature is vast and scattered widely across fields, making it hard for the single researcher to navigate it.
Revised:  However, the literature is vast and widely scattered across fields, making it hard for the single researcher to navigate it.
Edit intent: fluency
Original:  To solve the problem, a proximal-gradient scheme is studied.
Edit intent: coherence
Original:  Specifically, the smooth and nonsmooth terms are dealt with by gradient update and proximal update , respectively.
Revised:  Specifically, the smooth and nonsmooth terms are dealt with by gradient and proximal updates , respectively.
Edit intent: fluency
Original:  The studied algorithm is closely related to a previous decentralized optimization algorithm, PG-EXTRA 37 , but has a few advantages.
Revised:  The proposed algorithm is closely related to a previous decentralized optimization algorithm, PG-EXTRA 37 , but has a few advantages.
Edit intent: clarity
Original:  The studied algorithm is closely related to a previous decentralized optimization algorithm, PG-EXTRA 37 , but has a few advantages.
Revised:  The studied algorithm is closely related to a previous algorithm, PG-EXTRA 37 , but has a few advantages.
Edit intent: clarity
Original:  First of all, in our new scheme, agents use uncoordinated step-sizes  and the stable upper bounds on step-sizes are independent from network topology .
Revised:  First of all, agents use uncoordinated step-sizes and the stable upper bounds on step-sizes are independent from network topology .
Edit intent: clarity
Original:  First of all, in our new scheme, agents use uncoordinated step-sizes  and the stable upper bounds on step-sizes are independent from network topology .
Revised:  First of all, in our new scheme, agents use uncoordinated step-sizes , and the stable upper bounds on step-sizes are independent from network topology .
Edit intent: fluency
Original:  First of all, in our new scheme, agents use uncoordinated step-sizes  and the stable upper bounds on step-sizes are independent from network topology .
Revised:  First of all, in our new scheme, agents use uncoordinated step-sizes and the stable upper bounds on step-sizes are independent of network topologies .
Edit intent: fluency
Original:  The step-sizes depend on local objective functions, and they can be as large as that of the gradient descent.
Revised:  The step-sizes depend on local objective functions, and they can be as large as those of the gradient descent.
Edit intent: fluency
Original:  The dependence of the convergence rate on the objective functions and the network are separated, and the convergence rate of our new scheme is as good as one of the two convergence rates that match the typical rates for the general gradient descent and the consensus averaging.
Revised:  The dependence of the convergence rate on the objective functions and the network are separated, and the convergence rate of the new algorithm is as good as one of the two convergence rates that match the typical rates for the general gradient descent and the consensus averaging.
Edit intent: clarity
Original:  We also provide some numerical experiments to demonstrate the efficacy of the introduced algorithms and validate our theoretical discoveries.
Revised:  We provide numerical experiments to demonstrate the efficacy of the introduced algorithms and validate our theoretical discoveries.
Edit intent: coherence
Original:  We also provide some numerical experiments to demonstrate the efficacy of the introduced algorithms and validate our theoretical discoveries.
Revised:  We also provide some numerical experiments to demonstrate the efficacy of the introduced algorithm and validate our theoretical discoveries.
Edit intent: fluency
Original:  We develop a reclassification-by-synthesis algorithm to perform training using a formulation stemmed from the Bayes theory.
Revised:  We employ a reclassification-by-synthesis algorithm to perform training using a formulation stemmed from the Bayes theory.
Edit intent: clarity
Original:  Our classifier is able to iteratively: (1) synthesize pseudo-negative samples in the synthesis step ;
Revised:  Our ICN tries to iteratively: (1) synthesize pseudo-negative samples in the synthesis step ;
Edit intent: clarity
Original:  Our classifier is able to iteratively: (1) synthesize pseudo-negative samples in the synthesis step ;
Revised:  Our classifier is able to iteratively: (1) synthesize pseudo-negative samples ;
Edit intent: clarity
Original:  and (2) enhance itself by improving the classification in the reclassification step .
Revised:  and (2) enhance itself by improving the classification .
Edit intent: clarity
Original:  We conduct experiments on standard benchmark datasets including MNIST, CIFAR , and SVHN using state-of-the-art CNN architectures, and observe improved classification results.
Revised:  We conduct experiments on benchmark datasets including MNIST, CIFAR , and SVHN using state-of-the-art CNN architectures, and observe improved classification results.
Edit intent: clarity
Original:  In order to represent the complexity of the full space of inputs, we use aligned deformations from optical flow solves  , and we leverage the power of generative neural networks to synthesize additional deformations for refinement.
Revised:  In order to represent the complexity of the full space of inputs, we use deformations from optical flow solves , and we leverage the power of generative neural networks to synthesize additional deformations for refinement.
Edit intent: clarity
Original:  Our representation makes it possible to  generate implicit surfaces of liquids very efficiently , which allows us to very efficiently display the scene from any angle, and to add secondary effects such as particle systems .
Revised:  Our representation makes it possible to rapidly generate implicit surfaces of liquids very efficiently , which allows us to very efficiently display the scene from any angle, and to add secondary effects such as particle systems .
Edit intent: clarity
Original:  Our representation makes it possible to  generate implicit surfaces of liquids very efficiently , which allows us to very efficiently display the scene from any angle, and to add secondary effects such as particle systems .
Revised:  Our representation makes it possible to generate implicit surfaces of liquids , which allows us to very efficiently display the scene from any angle, and to add secondary effects such as particle systems .
Edit intent: coherence
Original:  Our representation makes it possible to  generate implicit surfaces of liquids very efficiently , which allows us to very efficiently display the scene from any angle, and to add secondary effects such as particle systems .
Revised:  Our representation makes it possible to generate implicit surfaces of liquids very efficiently , which allows us to very efficiently display the scene from any angle, and to add secondary effects such as splash and foam particles .
Edit intent: clarity
Original:  To demonstrate the effectiveness of our approach, we showcase the method with several complex examples in two and four dimensions .
Revised:  To demonstrate the effectiveness of our approach, we showcase our method with several complex examples in two and four dimensions .
Edit intent: fluency
Original:  Our representation makes it possible to rapidly generate implicit surfaces of liquids, which allows us to very efficiently display the scene from any angle, and to add secondary effects such as splash and foam particles .
Revised:  Our representation makes it possible to rapidly generate the desired implicit surfaces .
Edit intent: clarity
Original:  We have implemented a mobile application with our full pipeline to demonstrate that real-time interactions with complex liquid effects are possible with our approach .
Revised:  We have implemented a mobile application to demonstrate that real-time interactions with complex liquid effects are possible with our approach .
Edit intent: clarity
Original:  Algorithm stability plays an important role when analyzing and visualizing time-varying data.
Revised:  This kind of algorithm stability is particularly relevant when analyzing and visualizing time-varying data.
Edit intent: clarity
Original:  However, so far, there are only few theoretical results on the stability of algorithms, possibly due to a lack of theoretical analysis tools .
Revised:  Stability in general plays an important role in a wide variety of areas, such as numerical analysis, machine learning, and topology, but is poorly understood in the context of (combinatorial) algorithms .
Edit intent: coherence
Original:  In this paper , we continue the development of a general framework for automata learning based on category theory and develop a class of optimizations and an accompanying correctness proof for learning algorithms  .
Revised:  In this paper we develop a class of optimizations and an accompanying correctness proof for learning algorithms .
Edit intent: coherence
Original:  These side-effects are used to learn more compact automaton models and the abstract categorical approach enables us to capture several possible optimizationsunder the same (p)roof .
Revised:  Our approach allows us to capture several possible optimizationsunder the same (p)roof .
Edit intent: coherence
Original:  The size of the automaton model learned is a bottleneck for scalability  and hence optimizations that enable learning of compact representations are important.
Revised:  The size of the automaton model learned is a bottleneck for scalability , and hence optimizations that enable learning of compact representations are important.
Edit intent: fluency
Original:  Our approach allows us to capture known algorithms, develop new ones, and add optimizations.
Revised:  We show that our approach allows us to capture known algorithms, develop new ones, and add optimizations.
Edit intent: coherence
Original:  Our approach allows us to capture known algorithms, develop new ones, and add optimizations.
Revised:  Our approach allows us to uniformly capture existing algorithms, develop new ones, and add optimizations.
Edit intent: clarity
Original: We compare the social character networks of biographical, legendary and fictional texts, in search of statistical marks of historical information .
Revised: We compare the social character networks of biographical, legendary and fictional texts, in search for marks of genre differentiation .
Edit intent: clarity
Original:  We examine the frequency of character appearance and find a Zipf Law that does not depend on the literary genera and historical content.
Revised:  We examine the degree distribution of character appearance and find a Zipf Law that does not depend on the literary genera and historical content.
Edit intent: clarity
Original:  We examine the frequency of character appearance and find a Zipf Law that does not depend on the literary genera and historical content.
Revised:  We examine the frequency of character appearance and find a Zipf Law that does not depend on the literary genre or historical content.
Edit intent: fluency