wanyu/IteraTeR_v2 huggingface dataset:
Original:  Organized in a coherent account, our work introduces the following contributions: (1)  Theoretical compilation of vision, cognition, and Information Visualization , (2) Meticulous discussions supported by vast literature , and (3) Recommendations to have visualizations satisfy visual-cognitive aspects  .
Revised:  Organized in a coherent account, our work introduces the following contributions: (1) Theoretical compilation of vision, cognition, and Information Visualization ; (2) Meticulous discussions supported by vast literature , and (3) Recommendations to have visualizations satisfy visual-cognitive aspects .
Edit intent: fluency
Original:  Organized in a coherent account, our work introduces the following contributions: (1)  Theoretical compilation of vision, cognition, and Information Visualization , (2) Meticulous discussions supported by vast literature , and (3) Recommendations to have visualizations satisfy visual-cognitive aspects  .
Revised:  Organized in a coherent account, our work introduces the following contributions: (1) Theoretical compilation of vision, cognition, and Information Visualization , (2) Discussions supported by vast literature , and (3) Recommendations to have visualizations satisfy visual-cognitive aspects .
Edit intent: clarity
Original:  Organized in a coherent account, our work introduces the following contributions: (1)  Theoretical compilation of vision, cognition, and Information Visualization , (2) Meticulous discussions supported by vast literature , and (3) Recommendations to have visualizations satisfy visual-cognitive aspects  .
Revised:  Organized in a coherent account, our work introduces the following contributions: (1) Theoretical compilation of vision, cognition, and Information Visualization , (2) Meticulous discussions supported by vast literature ; and (3) Recommendations to have visualizations satisfy visual-cognitive aspects .
Edit intent: fluency
Original:  Organized in a coherent account, our work introduces the following contributions: (1)  Theoretical compilation of vision, cognition, and Information Visualization , (2) Meticulous discussions supported by vast literature , and (3) Recommendations to have visualizations satisfy visual-cognitive aspects  .
Revised:  Organized in a coherent account, our work introduces the following contributions: (1) Theoretical compilation of vision, cognition, and Information Visualization , (2) Meticulous discussions supported by vast literature , and (3) Reflections on visual-cognitive aspects .
Edit intent: clarity
Original:  There have been numerous suggestions for models of gene regulatory networks , with varying degrees of expressivity and ease of analysis.
Revised:  Boolean networks are a common modeling choice since they balance between detail and ease of analysis.
Edit intent: clarity
Original:  We introduce a new parametric texture model based on the powerful feature spaces of convolutional neural networks optimised for object recognition.
Revised:  We introduce a new parametric texture model based on the feature spaces of convolutional neural networks optimised for object recognition.
Edit intent: clarity
Original: In this paper, we consider edge colorings of the complete graph, where the vertices are points in R^d, and each color class E_i is defined by a semi-algebraic relation of constant complexityon the point set.
Revised: We consider m-colorings of the edges of a complete graph, where the vertices are points in R^d, and each color class E_i is defined by a semi-algebraic relation of constant complexityon the point set.
Edit intent: clarity
Original: In this paper, we consider edge colorings of the complete graph, where the vertices are points in R^d, and each color class E_i is defined by a semi-algebraic relation of constant complexityon the point set.
Revised: In this paper, we consider edge colorings of the complete graph, where each color class E_i is defined by a semi-algebraic relation of constant complexityon the point set.
Edit intent: clarity
Original:  Here we show that f^{\ast(n,p,}%DIFDELCMD < \lceil%%% \log p%DIFDELCMD < \rceil %%% + 1) \geq \Omega%DIFDELCMD < \left(%%% n^{\frac{1{c\log^2p}}}%DIFDELCMD < \right)%%% , and f^{\ast(n,p, }%DIFDELCMD < \lceil%%% \log p%DIFDELCMD < \rceil%%% )\leq O(\log n), thus determining the exact value of q at which f^{\ast problem of Erdos .
Revised:  Here we show that f^{\ast(n,p,}%DIFDELCMD < \lceil%%% %DIFDELCMD < \rceil %%% + 1) \geq \Omega%DIFDELCMD < \left(%%% n^{\frac{1{c\log^2p}}}%DIFDELCMD < \right)%%% , and f^{\ast(n,p, }%DIFDELCMD < \lceil%%% \log p%DIFDELCMD < \rceil%%% )\leq O(\log n), thus determining the exact value of q at which f^{\ast problem of Erdos .
Edit intent: fluency
Original:  Here we show that f^{\ast(n,p,}%DIFDELCMD < \lceil%%% \log p%DIFDELCMD < \rceil %%% + 1) \geq \Omega%DIFDELCMD < \left(%%% n^{\frac{1{c\log^2p}}}%DIFDELCMD < \right)%%% , and f^{\ast(n,p, }%DIFDELCMD < \lceil%%% \log p%DIFDELCMD < \rceil%%% )\leq O(\log n), thus determining the exact value of q at which f^{\ast problem of Erdos .
Revised:  Here we show that f^{\ast(n,p,}%DIFDELCMD < \lceil%%% \log p%DIFDELCMD < \rceil %%% + 1) \geq \Omega%DIFDELCMD < \left(%%% n^{\frac{1{c\log^2p}}}%DIFDELCMD < \right)%%% (n,p, }%DIFDELCMD < \lceil%%% \log p%DIFDELCMD < \rceil%%% )\leq O(\log n), thus determining the exact value of q at which f^{\ast problem of Erdos .
Edit intent: coherence
Original:  Here we show that f^{\ast(n,p,}%DIFDELCMD < \lceil%%% \log p%DIFDELCMD < \rceil %%% + 1) \geq \Omega%DIFDELCMD < \left(%%% n^{\frac{1{c\log^2p}}}%DIFDELCMD < \right)%%% , and f^{\ast(n,p, }%DIFDELCMD < \lceil%%% \log p%DIFDELCMD < \rceil%%% )\leq O(\log n), thus determining the exact value of q at which f^{\ast problem of Erdos .
Revised:  Here we show that f^{\ast(n,p,}%DIFDELCMD < \lceil%%% \log p%DIFDELCMD < \rceil %%% + 1) \geq \Omega%DIFDELCMD < \left(%%% n^{\frac{1{c\log^2p}}}%DIFDELCMD < \right)%%% , and f^{\ast(n,p, }%DIFDELCMD < \lceil%%% %DIFDELCMD < \rceil%%% )\leq O(\log n), thus determining the exact value of q at which f^{\ast problem of Erdos .
Edit intent: fluency
Original:  Let V be an n-element planar point set such that any p members of V determine at least p%DIFDELCMD < \choose %%% 2 - p + 6 distinct distances.
Revised:  Let V be an n-element planar point set such that any p members of V determine at least %DIFDELCMD < \choose %%% 2 - p + 6 distinct distances.
Edit intent: fluency
Original:  the runtime of approximating the Viterbi path is  reduced from O( n k^2 ) steps to O( n k \log(k) \log(\log(k) ) ) steps  .
Revised:  the runtime of approximating the Viterbi path is thus reduced from O( n k^2 ) steps to O( n k \log(k) \log(\log(k) ) ) steps .
Edit intent: coherence
Original:  Immersed-boundary kernels are derived from a certain set of postulates  to achieve approximate grid translational invariance, interpolation accuracy and computational efficiency.
Revised:  Immersed-boundary kernels are derived from a set of postulates to achieve approximate grid translational invariance, interpolation accuracy and computational efficiency.
Edit intent: clarity
Original:  Immersed-boundary kernels are derived from a certain set of postulates  to achieve approximate grid translational invariance, interpolation accuracy and computational efficiency.
Revised:  Immersed-boundary kernels are derived from a certain set of postulates designed to achieve approximate grid translational invariance, interpolation accuracy and computational efficiency.
Edit intent: clarity
Original:  In this note, we present a new 6-point immersed-boundary kernel that is C^3 and features a substantially improved translational invariance compared to other common IB kernels.
Revised:  In this note, we present a new 6-point immersed-boundary kernel that is C^3 and yields a substantially improved translational invariance compared to other common IB kernels.
Edit intent: clarity
Original:  In this note, we present a new 6-point immersed-boundary kernel that is \mathcal{C a substantially improved translational invariance compared to other common IB kernels.
Revised:  In this note, we present a new 6-point immersed-boundary kernels that are \mathscr{C a substantially improved translational invariance compared to other common IB kernels.
Edit intent: fluency
Original: Emergence of localized eigenvectors can cause a failure of standard spectral method for graph partitioning.
Revised: In the case of graph partitioning, the emergence of localized eigenvectors can cause a failure of standard spectral method for graph partitioning.
Edit intent: clarity
Original: Emergence of localized eigenvectors can cause a failure of standard spectral method for graph partitioning.
Revised: Emergence of localized eigenvectors can cause the standard spectral method for graph partitioning.
Edit intent: clarity
Original:  The spectral method using the non-backtracking matrix was proposed as a way to overcome this problem.
Revised:  The spectral method using a non-backtracking matrix was proposed as a way to overcome this problem.
Edit intent: fluency
Original:  The numerical experiments on several examples of real networks show that, indeed, the non-backtracking matrix does not exhibit localization of eigenvectors.
Revised:  The numerical experiments on several examples of real networks , it is clear that the non-backtracking matrix does not exhibit localization of eigenvectors.
Edit intent: clarity
Original:  We show that , however, localized eigenvectors of the non-backtracking matrix out of the spectral band can exist, deteriorating the performance of graph partitioning.
Revised:  However, we show that localized eigenvectors of the non-backtracking matrix out of the spectral band can exist, deteriorating the performance of graph partitioning.
Edit intent: fluency
Original:  We show that , however, localized eigenvectors of the non-backtracking matrix out of the spectral band can exist, deteriorating the performance of graph partitioning.
Revised:  We show that , however, localized eigenvectors of the non-backtracking matrix can exist outside the spectral band can exist, deteriorating the performance of graph partitioning.
Edit intent: fluency
Original:  We show that , however, localized eigenvectors of the non-backtracking matrix out of the spectral band can exist, deteriorating the performance of graph partitioning.
Revised:  We show that , however, localized eigenvectors of the non-backtracking matrix out of the spectral band , which may lead to deterioration in the performance of graph partitioning.
Edit intent: clarity
Original:  Differently, the focus of this manuscript is on intuitions , algorithm derivation, and implementations, and should be accessible to those with knowledge in elementary matrix algebra  .
Revised:  Differently, the focus of this manuscript is on intuition , algorithm derivation, and implementations, and should be accessible to those with knowledge in elementary matrix algebra .
Edit intent: fluency
Original:  Differently, the focus of this manuscript is on intuitions , algorithm derivation, and implementations, and should be accessible to those with knowledge in elementary matrix algebra  .
Revised:  Differently, the focus of this manuscript is on intuitions , algorithm derivation, and implementation. This manuscript should be accessible to those with knowledge in elementary matrix algebra .
Edit intent: coherence
Original:  Differently, the focus of this manuscript is on intuitions , algorithm derivation, and implementations, and should be accessible to those with knowledge in elementary matrix algebra  .
Revised:  Differently, the focus of this manuscript is on intuitions , algorithm derivation, and implementations, and should be accessible to people with knowledge in elementary matrix algebra .
Edit intent: clarity
Original: We show how the concept of enumeration reducibility from computability theory may be applied to obtain computability conditions on descriptions of substructures of algebras, more prominently on the language of forbidden words of a subshift, and on the word problem for finitely generated groups.
Revised: We show how the concept of enumeration reducibility from comput-ability theory may be applied to obtain computability conditions on descriptions of substructures of algebras, more prominently on the language of forbidden words of a subshift, and on the word problem for finitely generated groups.
Edit intent: fluency
Original:  The package is written in C++ and it is templated, open source, and includes a Matlab interface.
Revised:  The package is written in C++ and it is templated, open source, and includes a MATLAB interface.
Edit intent: fluency
Original:  We also include an efficient MINRES implementation, applied with a specialized symmetric positive definite preconditioning technique based on the ILDL factorization.
Revised:  We also include an efficient MINRES implementation, applied with a specialized symmetric positive definite preconditioner based on the ILDL factorization.
Edit intent: clarity
Original:  The proposed design was implemented in a 0.18 \mu m \mum CMOS technology.
Revised:  The proposed design was implemented in a 0.18 \mum CMOS technology.
Edit intent: fluency
Original:  The neuron circuit occupies a small area of 0.01 mm^2 and has an energy-efficiency of 9.3 pJ per spikeper synapse.
Revised:  The neuron circuit occupies a small area of 0.01 mm^2 and has an energy-efficiency of 9.3 pJ /spike/ synapse.
Edit intent: clarity
Original: Providing the neurobiological basis of information processing in higher animals, spiking neural networks must be able to learn a variety of complicated computations, including the generation of appropriate, possibly delayed reactions to inputs and the self-sustained generation of complex activity patterns, e.g.  for locomotion.
Revised: Providing the neurobiological basis of information processing in higher animals, spiking neural networks must be able to learn a variety of complicated computations, including the generation of appropriate, possibly delayed reactions to inputs and the self-sustained generation of complex activity patterns, e.g. ~ for locomotion.
Edit intent: fluency
Original:  In this paper we investigate the effect of relaxing the reversibility assumption and allowing the position of the root to be another unknown quantity in the model.
Revised:  In this paper we investigate the effect of relaxing the reversibility assumption and allowing the position of the root to be another unknown in the model.
Edit intent: clarity
Original:  We propose two hierarchical models which are centred on a reversible model but perturbed to allow non-reversibility.
Revised:  We propose two hierarchical models that are centred on a reversible model but perturbed to allow non-reversibility.
Edit intent: fluency
Original:  We illustrate the performance of the two non-reversible models in analyses of simulated datasets using two types of topological priors.
Revised:  We illustrate the performance of the two non-reversible models in analyses of simulated data sets using two types of topological priors.
Edit intent: clarity
Original:  We then apply the models to a real biological dataset , the radiation of polyploid yeasts, for which there is a robust biological opinion about the root position.
Revised:  We then apply the models to a real biological data set , the radiation of polyploid yeasts, for which there is a robust biological opinion about the root position.
Edit intent: fluency
Original:  Finally we apply the models to a second biological dataset for which the rooted tree is controversial: the ribosomal tree of life.
Revised:  Finally we apply the models to a second biological data set for which the rooted tree is controversial: the ribosomal tree of life.
Edit intent: clarity
Original:  We compare the two non-reversible models and conclude that both are useful in inferring the position of the root from real biological datasets .
Revised:  We compare the two non-reversible models and conclude that both are useful in inferring the position of the root from real biological data sets .
Edit intent: clarity
Original:  It is based on the equivalence between the computation of (i) an extended formulation of size r of a polytope P, and (ii) a rank-r nonnegative factorization of a slack matrix of the polytope P.
Revised:  Our bounds are based on the equivalence between the computation of (i) an extended formulation of size r of a polytope P, and (ii) a rank-r nonnegative factorization of a slack matrix of the polytope P.
Edit intent: clarity
Original:  We provide explicit nonnegative factorizations for the slack matrix of any regular n-gons of size 2%DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %%% - 1 if 2^{k-1 < n \leq 2^{k-1}+2^{k-2} for some integer k, and of size 2 }%DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %DIFDELCMD < %%% if 2^{k-1+2^{k-2} < n \leq 2^{k}.
Revised:  We provide explicit nonnegative factorizations for the slack matrix of the n-gons of size 2%DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %%% - 1 if 2^{k-1 < n \leq 2^{k-1}+2^{k-2} for some integer k, and of size 2 }%DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %DIFDELCMD < %%% if 2^{k-1+2^{k-2} < n \leq 2^{k}.
Edit intent: clarity
Original:  We provide explicit nonnegative factorizations for the slack matrix of any regular n-gons of size 2%DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %%% - 1 if 2^{k-1 < n \leq 2^{k-1}+2^{k-2} for some integer k, and of size 2 }%DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %DIFDELCMD < %%% if 2^{k-1+2^{k-2} < n \leq 2^{k}.
Revised:  We provide explicit nonnegative factorizations for the slack matrix of any regular n-gons %DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %%% - 1 if 2^{k-1 < n \leq 2^{k-1}+2^{k-2} for some integer k, and of size 2 }%DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %DIFDELCMD < %%% if 2^{k-1+2^{k-2} < n \leq 2^{k}.
Edit intent: fluency
Original:  We provide explicit nonnegative factorizations for the slack matrix of any regular n-gons of size 2%DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %%% - 1 if 2^{k-1 < n \leq 2^{k-1}+2^{k-2} for some integer k, and of size 2 }%DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %DIFDELCMD < %%% if 2^{k-1+2^{k-2} < n \leq 2^{k}.
Revised:  We provide explicit nonnegative factorizations for the slack matrix of any regular n-gons of size 2%DIFDELCMD < \lceil %%% %DIFDELCMD < \rceil %%% - 1 if 2^{k-1 < n \leq 2^{k-1}+2^{k-2} for some integer k, and of size 2 }%DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %DIFDELCMD < %%% if 2^{k-1+2^{k-2} < n \leq 2^{k}.
Edit intent: fluency
Original:  We provide explicit nonnegative factorizations for the slack matrix of any regular n-gons of size 2%DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %%% - 1 if 2^{k-1 < n \leq 2^{k-1}+2^{k-2} for some integer k, and of size 2 }%DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %DIFDELCMD < %%% if 2^{k-1+2^{k-2} < n \leq 2^{k}.
Revised:  We provide explicit nonnegative factorizations for the slack matrix of any regular n-gons of size 2%DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %%% - 1 if 2^{k-1 < n \leq 2^{k-1}+2^{k-2} for some integer k, and of size 2 }%DIFDELCMD < \lceil %%% %DIFDELCMD < \rceil %DIFDELCMD < %%% if 2^{k-1+2^{k-2} < n \leq 2^{k}.
Edit intent: fluency
Original:  We provide explicit nonnegative factorizations for the slack matrix of any regular n-gons of size 2%DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %%% - 1 if 2^{k-1 < n \leq 2^{k-1}+2^{k-2} for some integer k, and of size 2 }%DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %DIFDELCMD < %%% if 2^{k-1+2^{k-2} < n \leq 2^{k}.
Revised:  We provide explicit nonnegative factorizations for the slack matrix of any regular n-gons of size 2%DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %%% - 1 if 2^{k-1 < n \leq 2^{k-1}+2^{k-2} for some integer k, and of size 2 }%DIFDELCMD < \lceil %%% \log_2(n)%DIFDELCMD < \rceil %DIFDELCMD < %%% +2^{k-2} < n \leq 2^{k}.
Edit intent: coherence
Original:  One test of this hypothesis is to look for an acceleration of molecular clocks 2 to 2.5 Ma due to a probable moderately nearby supernova at that time.
Revised:  One test of this hypothesis is to look for an acceleration of molecular clocks 2 to 2.5 Ma due to one or more moderately nearby supernovae known to have happened at that time.
Edit intent: clarity
Original:  Another is to look for reduced disparity in benthic organisms of the deep ocean  .
Revised:  Another is to look for reduced disparity in benthic organisms of the deep ocean . .
Edit intent: fluency
Original:  It was argued that this pattern is largely inconsistent with incompleteness of the fossil record as the principal driver of the disparity.
Revised:  It has been argued that this pattern is largely inconsistent with incompleteness of the fossil record as the principal driver of the disparity.
Edit intent: fluency
Original:  The trends show that the disparity is much larger for mitochondrial DNA than for nuclear DNA ;
Revised:  The trends show that the disparity is much larger for mitochondrial DNA than for nuclear DNA ,
Edit intent: fluency
Original:  (iii) the probability distributions of time interval and the number of visits taken to revisit the same academic forum both follow power-laws, indicating the existence of memory effect in academic forum activities.
Revised:  (iii) the probability distributions of time intervals and the number of visits taken to revisit the same academic forum both follow power-laws, indicating the existence of memory effect in academic forum activities.
Edit intent: fluency
Original: Countless learning tasks require awareness of time .
Revised: Countless learning tasks require dealing with sequential data .
Edit intent: clarity
Original:  Image captioning, speech synthesis  , and video game playing all require that a model generate sequences of outputs.
Revised:  Image captioning, speech synthesis , music generation , and video game playing all require that a model generate sequences of outputs.
Edit intent: clarity
Original:  Image captioning, speech synthesis, music generation, and video game playing all require that a model generate sequences of outputs .
Revised:  Image captioning, speech synthesis, and music generation all require that a model generate sequences of outputs .
Edit intent: clarity
Original:  Image captioning, speech synthesis, music generation, and video game playing all require that a model generate sequences of outputs .
Revised:  Image captioning, speech synthesis, music generation, and video game playing all require that a model produce outputs that are sequences .
Edit intent: clarity
Original:  In other domains, such as time series prediction, video analysis, and music information retrieval, a model must learn from sequences of inputs . Significantly more interactive tasks, such as natural language translation , engaging in dialogue, and robotic control , often demand both  . Recurrent neural networks (RNNs) are a powerful family of connectionist models that capture time dynamics via cycles in the graph.
Revised:  In other domains, such as time series prediction, video analysis, and musical information retrieval, a model must learn from sequences of inputs . Significantly more interactive tasks, such as natural language translation , engaging in dialogue, and robotic control , often demand both . Recurrent neural networks (RNNs) are a powerful family of connectionist models that capture time dynamics via cycles in the graph.
Edit intent: fluency