wanyu/IteraTeR_v2 huggingface dataset:
Original:  The algorithms also allow to prescribe the coloring for a bounded number of vertices.
Revised:  The algorithms also allow to prescribe the coloring of a bounded number of vertices.
Edit intent: fluency
Original:  It is one of the biggest problems in bibliometrics that there are several variants of the same CR in the WoS.
Revised:  It is a serious problem in bibliometrics that there are several variants of the same CR in the WoS.
Edit intent: clarity
Original:  We derive sufficient conditions for the model to be arbitrage-free , which are easily verifiable, and for the LIBOR rates to be true martingales under the respective forward measures.
Revised:  We derive sufficient conditions for the model to be arbitrage-free which are easily verifiable, and for the LIBOR rates to be true martingales under the respective forward measures.
Edit intent: fluency
Original: Social network platforms can archive data produced by their users and re-use the data to serve the usersbetter .
Revised: Social network platforms can archive data produced by their users . Then, the archived data is used to provide better services to the users .
Edit intent: clarity
Original:  Recommendation systems can predict the future preferences of the users using various different techniques.
Revised:  Recommendation systems can predict the future preferences of users using various different techniques.
Edit intent: fluency
Original:  Similarly  word embedding methods from natural language processing literature learn low-dimensional vector space representation of input elements.
Revised:  Similarly , word embedding methods from natural language processing literature learn low-dimensional vector space representation of input elements.
Edit intent: fluency
Original:  Noticing the similarities among word embedding and matrix factorization techniques and based on the previous works that apply techniques from text processing for recommendation, Word2Vec's skip-gram technique is employed to make recommendations.
Revised:  Noticing the similarities among word embedding and matrix factorization techniques and based on the previous works that apply techniques from text processing to recommendation, Word2Vec's skip-gram technique is employed to make recommendations.
Edit intent: fluency
Original:   Unlike previous works that use Word2Vec for recommendation,  non-textual features are used.
Revised:  Unlike previous works that use Word2Vec for recommendation, in this work non-textual features are used.
Edit intent: clarity
Original:  The aim of this work is to make recommendation on next check-in venues and a Foursquare check-in dataset is used for this purpose .
Revised:  For the experiments, a Foursquare check-in dataset is used for this purpose .
Edit intent: clarity
Original:  The aim of this work is to make recommendation on next check-in venues and a Foursquare check-in dataset is used for this purpose .
Revised:  The aim of this work is to make recommendation on next check-in venues and a Foursquare check-in dataset is used .
Edit intent: clarity
Original:  The results showed that use of vector space representations of items modelled by skip-gram technique is promising for making recommendations.
Revised:  The results show that use of vector space representations of items modelled by skip-gram technique is promising for making recommendations.
Edit intent: fluency
Original:  The results showed that use of vector space representations of items modelled by skip-gram technique is promising for making recommendations.
Revised:  The results showed that use of vector space representations of items modeled by skip-gram technique is promising for making recommendations.
Edit intent: fluency
Original: Social network platforms can archive data produced by their users .
Revised: Social network platforms can use the data produced by their users .
Edit intent: clarity
Original:  One of the services that these platforms provide is the recommendation service.
Revised:  One of the services these platforms provide is the recommendation service.
Edit intent: fluency
Original:  One of the services that these platforms provide is the recommendation service.
Revised:  One of the services that these platforms provide is recommendation service.
Edit intent: fluency
Original:  The aim of this work is to make recommendation on next check-in venues . Unlike previous works that use Word2Vec for recommendation, in this work non-textual features are used .
Revised:  The aim of this work is to make recommendation on next check-in venues . Unlike previous works that use Word2Vec for recommendation, this work uses non-textual features are used .
Edit intent: clarity
Original:  The neural computations underlying action recognition, however, are still poorly understood.
Revised:  The neural computations underlying action recognition, however, the underlying neural computations remain poorly understood.
Edit intent: clarity
Original:  We use magnetoencephalography (MEG) decoding and a computational model to study action recognition from a novel dataset of well-controlled, naturalistic videos of five actions (run, walk, jump, eat  drink) performed by five actors at five viewpoints .
Revised:  We use magnetoencephalography (MEG) decoding and a dataset of well-controlled, naturalistic videos of five actions (run, walk, jump, eat drink) performed by five actors at five viewpoints .
Edit intent: clarity
Original:  We use magnetoencephalography (MEG) decoding and a computational model to study action recognition from a novel dataset of well-controlled, naturalistic videos of five actions (run, walk, jump, eat  drink) performed by five actors at five viewpoints .
Revised:  We use magnetoencephalography (MEG) decoding and a computational model to study action recognition from a novel dataset of well-controlled, naturalistic videos of five actions (run, walk, jump, eat , drink) performed by five actors at five viewpoints .
Edit intent: fluency
Original:  Since the core is typically smaller than the original tensor, this property leads to considerable computational advantages , as confirmed by our numerical experiments.
Revised:  When the core tensor is smaller than the original tensor, this property leads to considerable computational advantages , as confirmed by our numerical experiments.
Edit intent: clarity
Original:  Since the core is typically smaller than the original tensor, this property leads to considerable computational advantages , as confirmed by our numerical experiments.
Revised:  Since the core is typically smaller than the original tensor, this property leads to considerable computational advantages as confirmed by our numerical experiments.
Edit intent: fluency
Original:  In our analysis, we in fact work with a generalized Tucker-like decomposition that can accommodate any full column-rank factorization matrices.
Revised:  In our analysis, we in fact work with a generalized Tucker-like decomposition that can accommodate any full column-rank factor matrices.
Edit intent: clarity
Original:  Zygomaticus major (ZYG ;
Revised:  Zygomaticus major (ZYG ,
Edit intent: fluency
Original:  "smiling" muscle) activity, corrugator supercilii (COR ;
Revised:  "smiling" muscle) activity, corrugator supercilii (COR ,
Edit intent: fluency
Original:  "frowning" muscle ) activity, and phasic skin conductance (PHSC ;
Revised:  "frowning" bmuscle ) activity, and phasic skin conductance (PHSC ;
Edit intent: fluency
Original:  "frowning" muscle ) activity, and phasic skin conductance (PHSC ;
Revised:  "frowning" muscle ) activity, and phasic skin conductance (PHSC ,
Edit intent: fluency
Original:  Our statistical analysis shows that the scaling exponents enable discrimination between extreme valences and other values in ZYG and COR , as well as indicate the decreasing trend in arousal for these signals.
Revised:  Our statistical analysis shows that the scaling exponents enable identification of high valence and arousal levels in ZYG and COR , as well as indicate the decreasing trend in arousal for these signals.
Edit intent: clarity
Original:  Our statistical analysis shows that the scaling exponents enable discrimination between extreme valences and other values in ZYG and COR , as well as indicate the decreasing trend in arousal for these signals.
Revised:  Our statistical analysis shows that the scaling exponents enable discrimination between extreme valences and other values in ZYG and COR signals.
Edit intent: clarity
Original:  These results are often intuitive, but providing exact proofs for them is far from trivial.
Revised:  While these results are often intuitive, but providing exact proofs for them is far from trivial.
Edit intent: coherence
Original:  These results are often intuitive, but providing exact proofs for them is far from trivial.
Revised:  These results are often intuitive, providing exact proofs for them is far from trivial.
Edit intent: fluency
Original:  Finally we show that for any \ell\geq 3 and any k\geq 2\ell-2 there is a bipartite graph which is \ell-choosable with k colors but not with k+1.
Edit intent: coherence
Original:  We here propose a new matrix invariant, the rank profile matrix, summarizing all information on the row andcolumn rank profiles of all the leading sub-matrices.
Revised:  We here propose a new matrix invariant, the rank profile matrix, summarizing all information on the row and column rank profiles of all the leading sub-matrices.
Edit intent: fluency
Original:  With matrices of very small rank, we also generalize the techniques ofStorjohann and Yang to the computation of the rank profile matrix, achieving an (r^\omega+mn)^{1+o(1)} time complexity for an m \times n matrix of rank r, where \omega is the exponent of matrix multiplication.
Revised:  With matrices of very small rank, we also generalize the techniques of Storjohann and Yang to the computation of the rank profile matrix, achieving an (r^\omega+mn)^{1+o(1)} time complexity for an m \times n matrix of rank r, where \omega is the exponent of matrix multiplication.
Edit intent: fluency
Original:  Finally, by give connections to the Bruhat decomposition, and severalof its variants and generalizations.
Revised:  Finally, by give connections to the Bruhat decomposition, and several of its variants and generalizations.
Edit intent: fluency
Original:  Thus, our algorithmicimprovements for the PLUQ factorization, and their implementations, directly apply to these decompositions.
Revised:  Thus, our algorithmic improvements for the PLUQ factorization, and their implementations, directly apply to these decompositions.
Edit intent: fluency
Original:  In particular, we show how a PLUQ decomposition revealing the rankprofile matrix also reveals both a row and a column echelon form ofthe input matrix or of any of its leading sub-matrices, by a simplepost-processing made of row and column permutations.
Revised:  In particular, we show how a PLUQ decomposition revealing the rank profile matrix also reveals both a row and a column echelon form ofthe input matrix or of any of its leading sub-matrices, by a simplepost-processing made of row and column permutations.
Edit intent: fluency
Original:  In particular, we show how a PLUQ decomposition revealing the rankprofile matrix also reveals both a row and a column echelon form ofthe input matrix or of any of its leading sub-matrices, by a simplepost-processing made of row and column permutations.
Revised:  In particular, we show how a PLUQ decomposition revealing the rankprofile matrix also reveals both a row and a column echelon form of the input matrix or of any of its leading sub-matrices, by a simplepost-processing made of row and column permutations.
Edit intent: fluency
Original:  In particular, we show how a PLUQ decomposition revealing the rankprofile matrix also reveals both a row and a column echelon form ofthe input matrix or of any of its leading sub-matrices, by a simplepost-processing made of row and column permutations.
Revised:  In particular, we show how a PLUQ decomposition revealing the rankprofile matrix also reveals both a row and a column echelon form ofthe input matrix or of any of its leading sub-matrices, by a simple post-processing made of row and column permutations.
Edit intent: fluency
Original: We describe an algorithm for computing the outer common tangents of two disjoint simple polygons using linear time and only constant workspace.
Revised: We describe the first algorithm to compute the outer common tangents of two disjoint simple polygons using linear time and only constant workspace.
Edit intent: clarity
Original: We describe the first algorithm to compute the outer common tangents of two disjoint simple polygons using linear time and only constant workspace.
Revised: We provide a remarkably simple algorithm to compute the outer common tangents of two disjoint simple polygons using linear time and only constant workspace.
Edit intent: clarity
Original: A walk W in edge-colored graph is called properly colored (PC) if every pair of consecutive edges in W is of different color.
Revised: A walk W in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in W is of different color.
Edit intent: fluency
Original:  The first three types are equivalent to the absence of PC cycles, PC trails, and PC walks  .
Revised:  The first three types are equivalent to the absence of PC cycles, PC trails, and PC walks , respectively .
Edit intent: clarity
Original:  Here we use ideas from statistical physics and machine learning to provide a solution to the inverse problem of learning a stochastic reaction diffusion process to data.
Revised:  Here we use ideas from statistical physics and machine learning to provide a solution to the inverse problem of learning a stochastic reaction-diffusion process from data.
Edit intent: fluency
Original:  Our solution relies on a novel, non-trivial connection between stochastic reaction-diffusion processes and spatio-temporal Cox processes, a well-studied class of models from computational statistics.
Revised:  Our solution relies on a non-trivial connection between stochastic reaction-diffusion processes and spatio-temporal Cox processes, a well-studied class of models from computational statistics.
Edit intent: clarity
Original:  We develop an efficient and flexible algorithm which shows excellent accuracy on numeric and real data examples from systems biology and epidemiology.
Revised:  We develop an efficient and flexible algorithm for parameter inference and model selection. Our approach shows excellent accuracy on numeric and real data examples from systems biology and epidemiology.
Edit intent: clarity
Original:  By using ideas from multiple disciplines, our approach provides both new and fundamental insights into spatio-temporal stochastic systems, and a practical solution to a long-standing problem in computational modelling.
Revised:  Our work provides both insights into spatio-temporal stochastic systems, and a practical solution to a long-standing problem in computational modelling.
Edit intent: clarity
Original:  The tag system's evolution is  divided into stages called ' epochs' in which the tag system evolves monotonously.
Revised:  A tag system's evolution is divided into stages called ' epochs' in which the tag system evolves monotonously.
Edit intent: fluency
Original:  The tag system's evolution is  divided into stages called ' epochs' in which the tag system evolves monotonously.
Revised:  The tag system's evolution is first divided into stages called ' epochs' in which the tag system evolves monotonously.
Edit intent: coherence
Original:  The tag system's evolution is  divided into stages called ' epochs' in which the tag system evolves monotonously.
Revised:  The tag system's evolution is divided into stages called ` epochs' in which the tag system evolves monotonously.
Edit intent: fluency
Original:  The distribution of strings of symbols in the queue at the beginning of an epoch determines the  large-scale behavior of the tag systemduring that epoch, including its growth rate .
Revised:  The distribution of symbols in the queue at the beginning of an epoch determines the large-scale behavior of the tag systemduring that epoch, including its growth rate .
Edit intent: clarity
Original:  The distribution of strings of symbols in the queue at the beginning of an epoch determines the  large-scale behavior of the tag systemduring that epoch, including its growth rate .
Revised:  The distribution of strings of symbols in the queue at the beginning of each epoch determines the large-scale behavior of the tag systemduring that epoch, including its growth rate .
Edit intent: clarity
Original:  The distribution of strings of symbols in the queue at the beginning of an epoch determines the  large-scale behavior of the tag systemduring that epoch, including its growth rate .
Revised:  The distribution of strings of symbols in the queue at the beginning of an epoch determines the tag system's large-scale behavior of the tag systemduring that epoch, including its growth rate .
Edit intent: clarity
Original:  We compare the values predicted by this method to  simulations and find that great prediction accuracy is retained over several epochs.
Revised:  We compare the values predicted by this method to simulations and find that it retains great accuracy over several epochs.
Edit intent: clarity
Original:  The measurement of titration curves eliminates the confounding effects of antibody expression and stability inherent to standard deep mutational scanning assays.
Revised:  The measurement of titration curves eliminates the confounding effects of antibody expression and stability that arise in standard deep mutational scanning assays.
Edit intent: clarity
Original:  Our data sheds light on the structural basis for antigen binding affinity , and suggests a dominant role for CDR1H in establishing antibody stability.
Revised:  Our data shed light on the structural basis for antigen binding affinity , and suggests a dominant role for CDR1H in establishing antibody stability.
Edit intent: fluency
Original:  Our data sheds light on the structural basis for antigen binding affinity , and suggests a dominant role for CDR1H in establishing antibody stability.
Revised:  Our data sheds light on the structural basis for antigen binding affinity and suggests a dominant role for CDR1H in establishing antibody stability.
Edit intent: fluency
Original:  Finally, we formulate a calculus  that is complete for finite support distributions, and that can be compiled to a restricted class of CRNs that at steady state realize those distributions .
Revised:  Finally, we formulate a calculus that is complete for finite support distributions, and can be compiled to a restricted class of CRNs that at steady state realize those distributions .
Edit intent: fluency
Original:  A simple taxonomy of Phi-measures is presented where they are each characterized by their choice of factorization method (5 options), choice of probability distributions to compare ( 3\times 4 options) and choice of measure for comparing probability distributions (7 options).
Revised:  A simple taxonomy of Phi-measures is presented where they are each characterized by their choice of factorization method (5 options), choice of probability distributions to compare ( 3x4 options) and choice of measure for comparing probability distributions (7 options).
Edit intent: fluency
Original: - in particular, detection is possible for k \ge 5 in the disassortative case \lambda < 0 and for k \ge 11 in the assortative case \lambda > 0.  Below this threshold, we use recent results of Neeman and Netrapalli ( generalizing arguments of Mossel, Neeman, and Sly) to show that no algorithm can label the vertices better than chance, or even distinguish the block model from an Erdos-R\'enyi random graph with high probability.
Revised: - in particular, detection is possible for k \ge 5 in the disassortative case \lambda < 0 and for k \ge 11 in the assortative case \lambda > 0. Below this threshold, we use recent results of Neeman and Netrapalli ( who generalized arguments of Mossel, Neeman, and Sly) to show that no algorithm can label the vertices better than chance, or even distinguish the block model from an Erdos-R\'enyi random graph with high probability.
Edit intent: fluency
Original: We are currently witnessing an increasing number of energy-bound devices , including in some cases mission critical systems , for which there is a need to optimize their energy consumption and  verify that they will perform their function within the available energy budget.
Revised: The ever increasing number and complexity of energy-bound devices , including in some cases mission critical systems , for which there is a need to optimize their energy consumption and verify that they will perform their function within the available energy budget.
Edit intent: clarity
Original: We are currently witnessing an increasing number of energy-bound devices , including in some cases mission critical systems , for which there is a need to optimize their energy consumption and  verify that they will perform their function within the available energy budget.
Revised: We are currently witnessing an increasing number of energy-bound devices , including in some cases mission critical systems , for which there is a need to optimize their energy consumption and to verify that they will perform their function within the available energy budget.
Edit intent: fluency
Original:  In this work we  propose a novel parametric approach to estimating tight energy bounds (both upper and lower) that are practical for  energy verification and optimization applications in embedded systems .
Revised:  In this work we propose a novel parametric approach to estimating tight energy bounds (both upper and lower) that are practical for their application to energy verification and optimization applications in embedded systems .
Edit intent: clarity
Original:  In this work we  propose a novel parametric approach to estimating tight energy bounds (both upper and lower) that are practical for  energy verification and optimization applications in embedded systems .
Revised:  In this work we propose a novel parametric approach to estimating tight energy bounds (both upper and lower) that are practical for energy verification and optimization .
Edit intent: clarity
Original:  Our approach consists in dividing a program into basic ( "branchless") blocks , establishing the maximal (resp. minimal )  energy consumption for each block using an evolutionary algorithm , and combining the obtained values according to the program control flow, using static analysis, to produce energy bound functions .
Revised:  Our approach divides a program into basic ( "branchless") blocks , establishing the maximal (resp. minimal ) energy consumption for each block using an evolutionary algorithm , and combining the obtained values according to the program control flow, using static analysis, to produce energy bound functions .
Edit intent: clarity
Original:  Our approach consists in dividing a program into basic ( "branchless") blocks , establishing the maximal (resp. minimal )  energy consumption for each block using an evolutionary algorithm , and combining the obtained values according to the program control flow, using static analysis, to produce energy bound functions .
Revised:  Our approach consists in dividing a program into basic ( branchless ) energy consumption for each block using an evolutionary algorithm , and combining the obtained values according to the program control flow, using static analysis, to produce energy bound functions .
Edit intent: clarity