wanyu/IteraTeR_v2 huggingface dataset:
Original: Uncovering urban mobility patterns is crucial for further predicting and controlling spatially embedded events.
Revised: Uncovering urban mobility patterns is very important for predicting and controlling spatially embedded events.
Edit intent: clarity
Original: Uncovering urban mobility patterns is crucial for further predicting and controlling spatially embedded events.
Revised: Uncovering urban mobility patterns is crucial for further predicting and controlling spatial events.
Edit intent: clarity
Original:  In this article, we analyze millions of geographical check-ins crawled from a Chinese leading location-based social networking service , Jiepang.com  , which contains demographical information and thus allows the group-specific studies.
Revised:  In this study, we analyzed millions of geographical check-ins crawled from a Chinese leading location-based social networking service , Jiepang.com , which contains demographical information and thus allows the group-specific studies.
Edit intent: clarity
Original:  In this article, we analyze millions of geographical check-ins crawled from a Chinese leading location-based social networking service , Jiepang.com  , which contains demographical information and thus allows the group-specific studies.
Revised:  In this article, we analyze millions of geographical check-ins crawled from a leading Chinese location-based social networking service , Jiepang.com , which contains demographical information and thus allows the group-specific studies.
Edit intent: fluency
Original:  In this article, we analyze millions of geographical check-ins crawled from a Chinese leading location-based social networking service , Jiepang.com  , which contains demographical information and thus allows the group-specific studies.
Revised:  In this article, we analyze millions of geographical check-ins crawled from a Chinese leading location-based social networking service ( Jiepang.com , which contains demographical information and thus allows the group-specific studies.
Edit intent: fluency
Original:  In this article, we analyze millions of geographical check-ins crawled from a Chinese leading location-based social networking service , Jiepang.com  , which contains demographical information and thus allows the group-specific studies.
Revised:  In this article, we analyze millions of geographical check-ins crawled from a Chinese leading location-based social networking service , Jiepang.com ) , which contains demographical information and thus allows the group-specific studies.
Edit intent: fluency
Original:  In this article, we analyze millions of geographical check-ins crawled from a Chinese leading location-based social networking service , Jiepang.com  , which contains demographical information and thus allows the group-specific studies.
Revised:  In this article, we analyze millions of geographical check-ins crawled from a Chinese leading location-based social networking service , Jiepang.com , which contains demographic information that facilitates group-specific studies.
Edit intent: clarity
Original:  We found distinguishable mobility patterns of natives and non-natives in all five large cities under consideration, and by assigning different algorithms onto natives and non-natives,  the accuracy of location prediction can be largely improved compared with pure algorithms.
Revised:  We determined the distinct mobility patterns of natives and non-natives in all five large cities under consideration, and by assigning different algorithms onto natives and non-natives, the accuracy of location prediction can be largely improved compared with pure algorithms.
Edit intent: clarity
Original:  We found distinguishable mobility patterns of natives and non-natives in all five large cities under consideration, and by assigning different algorithms onto natives and non-natives,  the accuracy of location prediction can be largely improved compared with pure algorithms.
Revised:  We found distinguishable mobility patterns of natives and non-natives in all five large cities under consideration, and by assigning different algorithms onto natives and non-natives, the accuracy of location prediction compared with the basic algorithms.
Edit intent: clarity
Original:  We further propose the so-called indigenization coefficients to quantify to which extent an individual behaves like a native, which depend only on check-in behaviors, instead of any demographical information.
Revised:  We also propose so-called indigenization coefficients to quantify to which extent an individual behaves like a native, which depend only on check-in behaviors, instead of any demographical information.
Edit intent: coherence
Original:  We further propose the so-called indigenization coefficients to quantify to which extent an individual behaves like a native, which depend only on check-in behaviors, instead of any demographical information.
Revised:  We further propose the so-called indigenization coefficients to quantify the extent to which an individual behaves like a native, which depend only on check-in behaviors, instead of any demographical information.
Edit intent: fluency
Original:  We further propose the so-called indigenization coefficients to quantify to which extent an individual behaves like a native, which depend only on check-in behaviors, instead of any demographical information.
Revised:  We further propose the so-called indigenization coefficients to quantify to which extent an individual behaves like a native, which depends only on their check-in behaviors, instead of any demographical information.
Edit intent: clarity
Original:  To our surprise, a hybrid algorithm weighted by the indigenization coefficients outperforms the mixed algorithm accounting for additional demographical information .
Revised:  To our surprise, a hybrid algorithm weighted using the indigenization coefficients outperforms the mixed algorithm accounting for additional demographical information .
Edit intent: fluency
Original:  To our surprise, a hybrid algorithm weighted by the indigenization coefficients outperforms the mixed algorithm accounting for additional demographical information .
Revised:  To our surprise, a hybrid algorithm weighted by the indigenization coefficients outperformed a mixed algorithm that used additional demographic information, suggesting the advantage of behavioral data in characterizing individual mobility compared with the demographic information. The present location prediction algorithms can find applications in urban planning, traffic forecasting, mobile recommendation, and so on .
Edit intent: coherence
Original:  We provide extended definitions of mathematical multilinear operations such as Kronecker, Hadamard, and contracted products, with their properties for tensor calculus.
Revised:  We provide extended definitions of linear and multilinear operations such as Kronecker, Hadamard, and contracted products, with their properties for tensor calculus.
Edit intent: clarity
Original:  We provide extended definitions of mathematical multilinear operations such as Kronecker, Hadamard, and contracted products, with their properties for tensor calculus.
Revised:  We provide extended definitions of mathematical multilinear operations such as Kronecker, Hadamard, and contracted products, and establish links between them for tensor calculus.
Edit intent: clarity
Original:  Then we introduce an effective low-rank tensor approximation technique called the tensor train (TT) format with a number of mathematical and graphical representations.
Revised:  Then we introduce effective low-rank tensor approximation technique called the tensor train (TT) format with a number of mathematical and graphical representations.
Edit intent: fluency
Original:  The suggested representations can be used for describing numerical methods based on the TT format for solving large-scale optimization problems such as the system of linear equations and  eigenvalue problems.
Revised:  The suggested representations can be used for describing numerical methods based on the TT format for solving large-scale optimization problems such as systems of linear equations and eigenvalue problems.
Edit intent: fluency
Original:  However, the robustness gain comes at the cost of requiring more data, because the second-order Markov model requires citation data from twice as long a period.
Revised:  However, the robustness gain comes at the cost of requiring more citation data over a longer time period.
Edit intent: clarity
Original:  We show that apparent CFC can arise because of spectral correlations due to common non-stationarities and non-linear effects that might be unrelated to a true interaction between frequency components.
Revised:  We show that apparent CFC can appear because of spectral correlations due to common non-stationarities and non-linear effects that might be unrelated to a true interaction between frequency components.
Edit intent: clarity
Original:  We show that apparent CFC can arise because of spectral correlations due to common non-stationarities and non-linear effects that might be unrelated to a true interaction between frequency components.
Revised:  We show that apparent CFC can arise because of spectral correlations due to common non-stationarities that may arise in the total absence of interactions between neural frequency components.
Edit intent: clarity
Original:  After reviewing common problems in CFCanalysis, we discuss how different statistical/modeling approaches to CFC can be conceptually organized according to their biophysical interpretability and statistical inference approach.
Revised:  After reviewing common problems in CFCanalysis, we discuss how different statistical/modeling approaches according to their biophysical interpretability and statistical inference approach.
Edit intent: clarity
Original:  We end with a list of practical recommendations to avoid common errors and  enhance the interpretability of the analysis.
Revised:  We end with a list of practical recommendations to avoid common errors and to enhance the interpretability of the analysis.
Edit intent: fluency
Original: As an equilibrium refinement of the Nash equilibrium, evolutionarily stable strategy (ESS) is a key concept in evolutionary game theory and has attracted growing interests .
Revised: As an equilibrium refinement of the Nash equilibrium, evolutionarily stable strategy (ESS) is a key concept in evolutionary game theory and has attracted growing interest .
Edit intent: fluency
Original:  Even though the randomness is allowed in mixed strategy, however, the selecting probability of pure strategy in a mixed strategy may be fluctuating due to the impact of many factors.
Revised:  Even though the randomness is allowed in mixed strategy, the selection probability of pure strategy in a mixed strategy may be fluctuating due to the impact of many factors.
Edit intent: coherence
Original:  Even though the randomness is allowed in mixed strategy, however, the selecting probability of pure strategy in a mixed strategy may be fluctuating due to the impact of many factors.
Revised:  Even though the randomness is allowed in mixed strategy, however, the selecting probability of pure strategy in a mixed strategy may fluctuate due to the impact of many factors.
Edit intent: coherence
Original:  The fluctuation leads to more uncertainty.
Revised:  The fluctuation can lead to more uncertainty.
Edit intent: clarity
Original:  The belief strategy and belief-based ESS can totally reduced to the mixed strategy and mixed ESS, which provide more realistic and powerful tools to describe interactions among two or more agents.
Revised:  The belief strategy and belief-based ESS can reduce to the mixed strategy and mixed ESS, which provide more realistic and powerful tools to describe interactions among two or more agents.
Edit intent: coherence
Original:  The belief strategy and belief-based ESS can totally reduced to the mixed strategy and mixed ESS, which provide more realistic and powerful tools to describe interactions among two or more agents.
Revised:  The belief strategy and belief-based ESS can totally reduced to the mixed strategy and mixed ESS, which provide more realistic and powerful tools to describe interactions among agents.
Edit intent: clarity
Original:  A number of methods for community detection have been proposed , including spectral clustering, modularity, and likelihood-based methods.
Revised:  A number of methods have been proposed , including spectral clustering, modularity, and likelihood-based methods.
Edit intent: clarity
Original:  Some fast  algorithms have been proposed for specific methods or models have been proposed , but only on a case by case basis.
Revised:  Some fast algorithms have been proposed for specific methods or models , but only on a case by case basis.
Edit intent: fluency
Original:  Some fast  algorithms have been proposed for specific methods or models have been proposed , but only on a case by case basis.
Revised:  Some fast algorithms have been proposed for specific methods or models have been proposed , but only on a case-by-case basis.
Edit intent: fluency
Original:  Here we propose a general approach for maximizing a function of a network adjacency matrix over discrete labels by projecting the set of labels onto a subspace spanned by leading eigenvectors of the  adjacency matrix.
Revised:  Here we propose a general approach for maximizing a function of a network adjacency matrix over discrete labels by projecting the set of labels onto a subspace approximating the leading eigenvectors of the adjacency matrix.
Edit intent: clarity
Original:  The main idea is that projection onto a low-dimensional space makes the feasible set of labels much smaller and the optimization problem much easier.
Revised:  This projection onto a low-dimensional space makes the feasible set of labels much smaller and the optimization problem much easier.
Edit intent: coherence
Original:  We prove a general result on this method and show how to apply it to several previously proposed community detection criteria, establishing its consistency for label estimation in each case  . Simulations and applications to real-world data are included to demonstrate our method performs well for multiple problems over a wide range of parameters.
Revised:  We prove a general result about this method and show how to apply it to several previously proposed community detection criteria, establishing its consistency for label estimation in each case . Simulations and applications to real-world data are included to demonstrate our method performs well for multiple problems over a wide range of parameters.
Edit intent: clarity
Original:  We show that, for a wide variety of connectivity patterns, a linear theory based on firing rates correctly predicts the outcome of direct numerical simulations of networks of spiking neurons.
Revised:  We show that, for a wide variety of connectivity patterns, a linear theory based on firing rates accurately approximates the outcome of direct numerical simulations of networks of spiking neurons.
Edit intent: clarity
Original:  Distance dependent connectivity in networks with a more biologically realistic structure does not compromise our predictions , as long as the dynamics remain stable.
Revised:  Distance dependent connectivity in networks with a more biologically realistic structure does not compromise our linear analysis , as long as the dynamics remain stable.
Edit intent: clarity
Original:  This hypothesis could not be verified, so far, because of the lack of network datasets with ground truth information on the classification of the nodes.
Revised:  This hypothesis could not be verified, so far, because of the lack of network datasets with information on the classification of the nodes.
Edit intent: clarity
Original:  Our results show that there is a marked separation between structural and annotated clusters , in line with recent findings.
Revised:  Our results show that there is a marked separation between structural communities and metadata groups , in line with recent findings.
Edit intent: clarity
Original:  That means that either our current modeling of community structure has to be substantially modified, or that annotated clusters may not be recoverable from topology alone.
Revised:  That means that either our current modeling of community structure has to be substantially modified, or that metadata groups may not be recoverable from topology alone.
Edit intent: clarity
Original:  In particular  our method works when the set of underlying objects is entirely unstructured.
Revised:  In particular , our method works when the set of underlying objects is entirely unstructured.
Edit intent: fluency
Original:  Our work is inspired by Moser's entropic method proof of the Lov\'{a}sz Local Lemma  for satisfiability and completely bypasses the Probabilistic Method formulation of the LLL.
Revised:  Our work is inspired by Moser's entropic method proof of the Lov\'{a}sz Local Lemma (LLL) for satisfiability and completely bypasses the Probabilistic Method formulation of the LLL.
Edit intent: clarity
Original:  In particular, our method works when the set of underlying objects is entirely unstructured.
Revised:  In particular, our method works when the underlying state space is entirely unstructured.
Edit intent: clarity
Original:  Similarly to Moser's argument, the key point is that algorithmic progress is measured in terms of entropy rather than energy (number of violated constraints) so that termination can be established even under the proliferation of states in which every step of the algorithm (random walk ) increases the total number of violated constraints .
Revised:  Similarly to Moser's argument, the key point is that the inevitability of reaching a sink is established by bounding the entropy of the walk as a function of time .
Edit intent: clarity
Original: Understanding the regulation and structure of the eukaryotic ribosome is essential to understanding protein synthesis and its deregulation in disease.
Revised: Understanding the regulation and structure of ribosomes is essential to understanding protein synthesis and its deregulation in disease.
Edit intent: clarity
Original:  Traditionally ribosomes are believed to have a fixed stoichiometry among their core ribosomal proteins (RPs), but recent experiments suggest a more variable composition.
Revised:  While ribosomes are believed to have a fixed stoichiometry among their core ribosomal proteins (RPs), but recent experiments suggest a more variable composition.
Edit intent: coherence
Original:  Traditionally ribosomes are believed to have a fixed stoichiometry among their core ribosomal proteins (RPs), but recent experiments suggest a more variable composition.
Revised:  Traditionally ribosomes are believed to have a fixed stoichiometry among their core ribosomal proteins (RPs), some experiments suggest a more variable composition.
Edit intent: coherence
Original:  Reconciling these views requires direct and precise quantification of RPs.
Revised:  Testing such variability requires direct and precise quantification of RPs.
Edit intent: clarity
Original:  We used mass-spectrometry to directly quantify RPs across monosomes and polysomes of budding yeast and mouse embryonic stem cells (ESC)
Revised:  We used mass-spectrometry to directly quantify RPs across monosomes and polysomes of mouse embryonic stem cells (ESC)
Edit intent: clarity
Original:  The first introduced method is based on binned coincidence count ( Gr\"un } , 1996) and can be applied on two or more simultaneously recorded neurons.
Revised:  The first introduced method is based on binned coincidence count ( Gr } , 1996) and can be applied on two or more simultaneously recorded neurons.
Edit intent: fluency
Original:  The first introduced method is based on binned coincidence count ( Gr\"un } , 1996) and can be applied on two or more simultaneously recorded neurons.
Revised:  The first introduced method is based on binned coincidence count ( Gr\"un }n , 1996) and can be applied on two or more simultaneously recorded neurons.
Edit intent: fluency
Original:  This multiple shift coincidence count has recently been transposed in the continuous time framework } (Tuleau-Malot and others , 2014) with the notion of delayed coincidence count (also for two neurons ) .
Revised:  A transposition to the continuous framework has recently been transposed in the continuous time framework } (Tuleau-Malot and others , 2014) with the notion of delayed coincidence count (also for two neurons ) .
Edit intent: clarity
Original:  This multiple shift coincidence count has recently been transposed in the continuous time framework } (Tuleau-Malot and others , 2014) with the notion of delayed coincidence count (also for two neurons ) .
Revised:  This multiple shift coincidence count has recently been transposed in the continuous time framework } (Tuleau-Malot et al. , 2014) with the notion of delayed coincidence count (also for two neurons ) .
Edit intent: clarity
Original:  This multiple shift coincidence count has recently been transposed in the continuous time framework } (Tuleau-Malot and others , 2014) with the notion of delayed coincidence count (also for two neurons ) .
Revised:  This multiple shift coincidence count has recently been transposed in the continuous time framework } (Tuleau-Malot and others , 2014) for two neurons ) .
Edit intent: clarity
Original:  This multiple shift coincidence count has recently been transposed in the continuous time framework } (Tuleau-Malot and others , 2014) with the notion of delayed coincidence count (also for two neurons ) .
Revised:  This multiple shift coincidence count has recently been transposed in the continuous time framework } (Tuleau-Malot and others , 2014) with the notion of delayed coincidence count (also for two neurons .
Edit intent: fluency
Original:  The extension of this count to more than two neurons has not been investigated until the present work  } .
Revised:  The extension of this study to more than two neurons has not been investigated until the present work } .
Edit intent: clarity
Original:  The extension of this count to more than two neurons has not been investigated until the present work  } .
Revised:  The extension of this count to more than two neurons has not been performed until the present work } .
Edit intent: clarity
Original:  The extension of this count to more than two neurons has not been investigated until the present work  } .
Revised:  The extension of this count to more than two neurons has not been investigated until the present work \"u} .
Edit intent: fluency
Original:  The first introduced method is based on binned coincidence count (Gr \"u%DIFDELCMD < }%%% n, 1996) and can be applied on two or more simultaneously recorded neurons.
Revised:  The first introduced method is based on binned coincidence count \"u%DIFDELCMD < }%%% n, 1996) and can be applied on two or more simultaneously recorded neurons.
Edit intent: coherence
Original:  The first introduced method is based on binned coincidence count (Gr \"u%DIFDELCMD < }%%% n, 1996) and can be applied on two or more simultaneously recorded neurons.
Revised:  The first introduced method is based on binned coincidence count (Gr %DIFDELCMD < }%%% n, 1996) and can be applied on two or more simultaneously recorded neurons.
Edit intent: fluency
Original:  This counting method is known to be subject to loss in synchrony detection (Gr \"u%DIFDELCMD < }%%% n et al., 1999).
Revised:  \"u%DIFDELCMD < }%%% n et al., 1999).
Edit intent: coherence
Original:  This counting method is known to be subject to loss in synchrony detection (Gr \"u%DIFDELCMD < }%%% n et al., 1999).
Revised:  This counting method is known to be subject to loss in synchrony detection (Gr %DIFDELCMD < }%%% n et al., 1999).
Edit intent: fluency
Original:  This defect has been corrected by the multiple shift coincidence count (Gr \"u%DIFDELCMD < }%%% n et al., 1999) for discrete time recordings of two simultaneously recorded neurons.
Revised:  This defect has been corrected by the multiple shift coincidence count (Gr %DIFDELCMD < }%%% n et al., 1999) for discrete time recordings of two simultaneously recorded neurons.
Edit intent: fluency