wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our experimental results on chemometrics and social network datasets demonstrate that the new InfTucker model achieves significantly higher prediction accuracy than several state-of-art tensor decomposition approaches including High Order Singular Value Decomposition (HOSVD), Weighted CP, and nonnegative tensor decomposition.
Revised:  Our experimental results on chemometrics and social network datasets demonstrate that the new InfTucker model achieves significantly higher prediction accuracy than the most state-of-art tensor decomposition approaches including High Order Singular Value Decomposition (HOSVD), Weighted CP, and nonnegative tensor decomposition.
Edit intent: clarity
Original:  Our experimental results on chemometrics and social network datasets demonstrate that the new InfTucker model achieves significantly higher prediction accuracy than several state-of-art tensor decomposition approaches including High Order Singular Value Decomposition (HOSVD), Weighted CP, and nonnegative tensor decomposition.
Revised:  Our experimental results on chemometrics and social network datasets demonstrate that the new InfTucker model achieves significantly higher prediction accuracy than several state-of-art tensor decomposition 
Edit intent: clarity
Original: The World Wide Web currently evolves into a Web of Linked Data where content providers publish and link data as they have done with hypertext for the last 20 years.
Revised: The World Wide Web currently evolves into a Web of Linked Data where content providers publish and link data as they have done with hypertext for the last 20 years.
Edit intent: fluency
Original: The World Wide Web currently evolves into a Web of Linked Data where content providers publish and link data as they have done with hypertext for the last 20 years.
Revised: Query execution over the Web of Linked Data where content providers publish and link data as they have done with hypertext for the last 20 years.
Edit intent: clarity
Original:  We model a Web of Linked Data as an infinite structure of documents that contain triple-based data and that are interlinked via this data.
Revised:  While several authors study possibilities to implement the idea of link traversal based query execution and to optimize query execution in this context, no work exists that discusses the theoretical foundations of the approach in general. Our paper fills this gap. We introduce a well-defined semantics for queries that may be executed using the link traversal based approach. Based on this semantics we formally analyze properties of such queries. In particular, we study the computability of queries as well as the implications of querying a potentially infinite Web of Linked Data as an infinite structure of documents that contain triple-based data and that are interlinked via this data.
Edit intent: clarity
Original:  We present a query model that introduces a well-defined semantics for conjunctive queries over data in such a Web . Furthermore, we define an abstract execution model for integrating the traversal of data links into the query execution process.
Revised:  We present a query model that introduces a well-defined semantics for conjunctive queries over data in such a Web . Furthermore, we define an abstract execution model that captures the integration of link traversal into the query execution process.
Edit intent: clarity
Original:  We prove the soundness and completeness of this execution model.
Revised:  Based on this model we prove the soundness and completeness of this execution model.
Edit intent: clarity
Original:  However, there are some fundamental problems and imprecision in the algorithms and theorems given in that paper.
Edit intent: coherence
Original: The paper "Stack-based Algorithms for Pattern Matching on DAGs" proposed PathStackD, TwigStackD and DagStackD, generalized from the classical holistic twig join algorithms , to respectively evaluate path, twig and DAG pattern queries on directed acyclic graphs.
Revised: The paper "Stack-based Algorithms for Pattern Matching on DAGs" generalizes the classical holistic twig join algorithms , to respectively evaluate path, twig and DAG pattern queries on directed acyclic graphs.
Edit intent: coherence
Original: The paper "Stack-based Algorithms for Pattern Matching on DAGs" proposed PathStackD, TwigStackD and DagStackD, generalized from the classical holistic twig join algorithms , to respectively evaluate path, twig and DAG pattern queries on directed acyclic graphs.
Revised: The paper "Stack-based Algorithms for Pattern Matching on DAGs" proposed PathStackD, TwigStackD and DagStackD, generalized from the classical holistic twig join algorithms and proposes PathStackD, TwigStackD and DagStackD to respectively evaluate path, twig and DAG pattern queries on directed acyclic graphs.
Edit intent: coherence
Original:  In this paper, we make a thorough study on that paper, pointing out the fundamental errors in it as well as making important corrections .
Revised:  In this paper, we investigate the major results of that paper, pointing out the fundamental errors in it as well as making important corrections .
Edit intent: clarity
Original:  In this paper, we make a thorough study on that paper, pointing out the fundamental errors in it as well as making important corrections .
Revised:  In this paper, we make a thorough study on that paper, pointing out several discrepancies and proposing solutions to resolving them .
Edit intent: clarity
Original:  We show that the three algorithms are incapable of finding particular types of  solutions that are common in practice to a pattern query .
Revised:  We show that the three algorithms are incapable of finding particular types of query solutions that are common in practice to a pattern query .
Edit intent: clarity
Original:  We show that the three algorithms are incapable of finding particular types of  solutions that are common in practice to a pattern query .
Revised:  We show that the three algorithms are incapable of finding particular types of solutions that are common in practice .
Edit intent: clarity
Original:  We also make a discussion on the pre-filtering process that the original work proposed to prune redundant nodes.
Revised:  We also make a discussion on the pre-filtering process that the original work proposes to prune redundant nodes.
Edit intent: fluency
Original:  We finally conduct an experimental study to support our claims and substantiate our conclusions.
Revised:  Our experimental study on both real and synthetic data substantiates our conclusions.
Edit intent: clarity
Original:  However, for Homo sapiens sequences, with the largest available statistics, the diffusion rate converges to a finite value on distances larger than million base pairs  .
Revised:  However, for Homo sapiens sequences, with the largest available statistics, the diffusion coefficient converges to a finite value on distances larger than million base pairs .
Edit intent: clarity
Original:  In this paper, }  a necessary condition of positively terminating of a general successive difference substitution algorithm (KSDS) for an input f is obtained by using a majorization order on monomials.
Revised:  In this paper, } a necessary condition on the positive termination of a general successive difference substitution algorithm (KSDS) for an input f is obtained by using a majorization order on monomials.
Edit intent: fluency
Original:  Given a probability distribution for the inputs, can one find-possibly small-collections of input nodes that determine the states of most other nodes in the network?
Revised:  Given a probability distribution on the inputs, can one find-possibly small-collections of input nodes that determine the states of most other nodes in the network?
Edit intent: clarity
Original:  Given a probability distribution for the inputs, can one find-possibly small-collections of input nodes that determine the states of most other nodes in the network?
Revised:  Given a probability distribution for the inputs, can one find, possibly small, collections of input nodes that determine the states of most other nodes in the network?
Edit intent: fluency
Original:  To identify these nodes , a notion that quantifies the determinative power of an input over states in the network is needed.
Revised:  To answer this question , a notion that quantifies the determinative power of an input over states in the network is needed.
Edit intent: clarity
Original:  To identify these nodes , a notion that quantifies the determinative power of an input over states in the network is needed.
Revised:  To identify these nodes , a notion that quantifies the determinative power of an input over the states of the nodes in the network is needed.
Edit intent: clarity
Original:  To study the relation of determinative power to sensitivity to perturbations , we relate the MI to measures of perturbations, such as the influence of a variable, in terms of inequalities.
Revised:  We compare the determinative power of a set of inputs to the sensitivity to perturbations , we relate the MI to measures of perturbations, such as the influence of a variable, in terms of inequalities.
Edit intent: clarity
Original:  The result shows that, maybe surprisingly, an input that has large influence does not necessarily have large determinative power.
Revised:  The result shows that, maybe surprisingly, an input that has large sensitivity to perturbations does not necessarily have large determinative power.
Edit intent: clarity
Original:  The network is also found to be tolerant to perturbations of its inputs , which can be seen from the Fourier spectrum of its functions .
Revised:  The network is also found to be tolerant to perturbations of its inputs .
Edit intent: clarity
Original:  It is based on the idea that the purchase process consists of first purchase and repurchase.
Revised:  The theory is based on the idea that the purchase process consists of first purchase and repurchase.
Edit intent: clarity
Original:  It is based on the idea that the purchase process consists of first purchase and repurchase.
Revised:  It is based on the idea that the sales dynamics is determined by a meeting process of demanded with supplied product units. Taking advantage from the Bass model for first purchase and repurchase.
Edit intent: clarity
Original:  Availability: The implementation of the transcriptome expression estimation and differential expression analysis, BitSeq, have been written in C++ and Python .
Revised:  Availability: The implementation of the transcriptome expression estimation and differential expression analysis, BitSeq, has been written in C++ and Python .
Edit intent: fluency
Original:  Availability: The implementation of the transcriptome expression estimation and differential expression analysis, BitSeq, have been written in C++ and Python .
Revised:  Availability: The implementation of the transcriptome expression estimation and differential expression analysis, BitSeq, have been written in C++ .
Edit intent: clarity
Original: We build a statistical ensemble representation of an economic system which can be interpreted as a simplified credit market.
Revised: We build a statistical ensemble representation of two economic models describing respectively, in simplified terms, a payment system and a credit market.
Edit intent: clarity
Original:  Finally  we study the statistical ensemble for the Pareto distribution.
Revised:  Finally , we study the statistical ensemble for the Pareto distribution.
Edit intent: coherence
Original:  By using the fluctuation identities for the spectrally negative Levy processes , we obtain a candidate bankruptcy level as well as a sufficient condition for optimality.
Revised:  By using the fluctuation identities for the spectrally negative Levy process , we obtain a candidate bankruptcy level as well as a sufficient condition for optimality.
Edit intent: fluency
Original:  This paper generalizes the problem by allowing the values of bankruptcy costs , coupon rates and tax benefits dependent on the firm's asset value.
Revised:  This paper generalizes the problem by allowing the values of bankruptcy costs and tax benefits dependent on the firm's asset value.
Edit intent: clarity
Original:  This paper incorporates the scale effects by allowing the values of bankruptcy costs and tax benefits  dependent on the firm's asset value.
Revised:  This paper incorporates the scale effects by allowing the values of bankruptcy costs and tax benefits to be dependent on the firm's asset value.
Edit intent: coherence
Original:  These effects have been empirically shown, among others, in Warner (1976), Ang et al. (1982), and Graham and Smith (1999).
Edit intent: coherence
Original: In Monte-Carlo codessuch as Geant4 , it is often important to adjust reaction cross sections to reduce the variance of calculations of relatively rare events, in a technique known as non-analogous Monte-Carlo .
Revised: In Monte-Carlo codessuch as Geant4 , it is often important to adjust reaction cross sections to reduce the variance of calculations of relatively rare events, in a technique known as non-analogous Monte Carlo .
Edit intent: fluency
Original:  This allows us to increase the cross section of nuclear reactions by factors exceeding 10 ^{4 (in appropriate cases), without distorting the results of energy deposition calculations or coincidence rates.
Revised:  This makes it possible to increase the cross section of nuclear reactions by factors exceeding 10 ^{4 (in appropriate cases), without distorting the results of energy deposition calculations or coincidence rates.
Edit intent: clarity
Original:  This allows us to increase the cross section of nuclear reactions by factors exceeding 10 ^{4 (in appropriate cases), without distorting the results of energy deposition calculations or coincidence rates.
Revised:  This allows us to increase the cross section of nuclear reactions by factors exceeding 10 ^4 (in appropriate cases), without distorting the results of energy deposition calculations or coincidence rates.
Edit intent: fluency
Original:  The procedure is also valid for bias factors less than unity, which is useful, for example, in problems which involve computation of particle penetration deep into a target, such as occurs in atmospheric showers or in shielding.
Revised:  The procedure is also valid for bias factors less than unity, which is useful, for example, in problems that involve computation of particle penetration deep into a target, such as occurs in atmospheric showers or in shielding.
Edit intent: fluency
Original:  Stability bounds are also shown in order to get maximum e?cffiency out of the method.
Revised:  Stability bounds are also shown in order to get maximum efficiency out of the method.
Edit intent: fluency
Original:  When predicting a shape, our approach finds an initial solution using a variant of feature analysis and refines the solution to fit the measurements using non-linear optimization.
Revised:  When predicting a shape, our approach finds an initial solution using a variant of feature analysis and refines the solution to fit the measurement data using nonlinear optimization.
Edit intent: clarity
Original:  This way, we can predict likely human shapes with local variations that are outside the shape space spanned by the database used for learning .
Revised:  This method ensures that the generated shape is both human-like and satisfies the measurement conditions. We demonstrate the effectiveness of the method and compare it to existing approaches through extensive experiments, using both synthetic data and real human measurements .
Edit intent: coherence
Original: Number of citations is a widely used metric to evaluate the scientific credit of papers, scientists and journals.
Revised: The number of citations is a widely used metric to evaluate the scientific credit of papers, scientists and journals.
Edit intent: fluency
Original:  However, we all have experiences that a paper with fewer citations from prestige scientists may be of higher influence than some papers with more citations.
Revised:  However, it does happen that a paper with fewer citations from prestige scientists may be of higher influence than some papers with more citations.
Edit intent: clarity
Original:  However, we all have experiences that a paper with fewer citations from prestige scientists may be of higher influence than some papers with more citations.
Revised:  However, we all have experiences that a paper with fewer citations from prestigious scientists is of higher influence than some papers with more citations.
Edit intent: coherence
Original:  However, we all have experiences that a paper with fewer citations from prestige scientists may be of higher influence than some papers with more citations.
Revised:  However, we all have experiences that a paper with fewer citations from prestige scientists may be of higher influence than papers with more citations.
Edit intent: clarity
Original:  We thus argue that who cited the paper may be more important than how many citations.
Revised:  In this paper, we argue that from whom the paper is being cited is of higher significance than merely the number of received citations.
Edit intent: clarity
Original:  (ii) it considers the interrelationship between the prestige of scientists and the quality of their publications.
Revised:  (ii) it considers the relationship between the prestige of scientists and the quality of their publications.
Edit intent: clarity
Original:  We implement real experiment on publications in econophysics, and further apply this method to evaluate the influences of related scientific journals.
Revised:  We conducted real experiments on publications in econophysics, and further apply this method to evaluate the influences of related scientific journals.
Edit intent: clarity
Original:  We implement real experiment on publications in econophysics, and further apply this method to evaluate the influences of related scientific journals.
Revised:  We implement real experiment on publications in econophysics, and applied this method to evaluate the influences of related scientific journals.
Edit intent: clarity
Original:  The discrepancies between the rankings by our method and simple citation counting suggest that our method is effective to distinguish prestige from popularity.
Revised:  The comparisons between the rankings by our method and simple citation counting suggest that our method is effective to distinguish prestige from popularity.
Edit intent: clarity
Original:  The discrepancies between the rankings by our method and simple citation counting suggest that our method is effective to distinguish prestige from popularity.
Revised:  The discrepancies between the rankings by our method and simple citation counts suggest that our method is effective to distinguish prestige from popularity.
Edit intent: fluency
Original: We present a hierarchical MPC approach for large-scale systems based on dual decomposition.
Revised: We present a hierarchical model predictive control approach for large-scale systems based on dual decomposition.
Edit intent: clarity
Original: We develop a new technique for the decidability of the Regular Post Embedding Problem .
Revised: The Regular Post Embedding Problem .
Edit intent: coherence
Original:  One of fundamental questions on BP (and message-passing algorithms in general) is about its convergence: when it does converges ? and how fast it converges?
Revised:  One of fundamental questions on BP (and message-passing algorithms in general) is about its convergence: when it does converge ? and how fast it converges?
Edit intent: fluency
Original:  In this paper, we fix this convergence issue via developing a deterministic, iterative algorithm for forcing fast-convergence of BP to its fixed point in a polynomial number of iterations for arbitrary sparse graphical models (i.e. bounded degrees in the underlying graph  ).
Revised:  In this paper, we fix the convergence issue via developing a deterministic, iterative algorithm for forcing fast-convergence of BP to its fixed point in a polynomial number of iterations for arbitrary sparse graphical models (i.e. bounded degrees in the underlying graph ).
Edit intent: fluency
Original:  In this paper, we fix this convergence issue via developing a deterministic, iterative algorithm for forcing fast-convergence of BP to its fixed point in a polynomial number of iterations for arbitrary sparse graphical models (i.e. bounded degrees in the underlying graph  ).
Revised:  In this paper, we fix this convergence issue via developing a deterministic, iterative algorithm for forcing fast-convergence of BP to its fixed point in a polynomial number of iterations for graphical models where the maximum degree in the underlying graph ).
Edit intent: clarity
Original:  Our algorithm is the first fully polynomial-time approximation scheme (FPTAS) for the BP fixed point computation in such a large class of  graphical models.
Revised:  Our algorithm is the first fully polynomial-time approximation scheme for the BP fixed point computation in such a large class of graphical models.
Edit intent: clarity
Original: The sum-product Belief Propagation (BP) algorithm has been a popular heuristic method for estimating marginal probabilities of a joint distribution of n random variables represented by a graphical model.
Revised: The sum-product Belief Propagation (BP) algorithm has been a popular heuristic method for estimating marginal distributions in a graphical model.
Edit intent: clarity
Original: This paper resolves a common complexity issue in the Bethe approximation of statistical physics and the sum-product Belief Propagation (BP) algorithm of artificial intelligence.
Revised: This paper resolves a common complexity issue in the Bethe approximation of statistical physics and the Belief Propagation (BP) algorithm of artificial intelligence.
Edit intent: clarity
Original:  The Bethe approximation reduces the problem of computing the partition function in a graphical model to that of solving a set of non-linear equations, so-called the Bethe equation.
Revised:  The Bethe approximation reduces the problem of computing the partition function in a graphical model to that of solving a set of non-linear equations, the so-called Bethe equation.
Edit intent: fluency
Original:  Although they are inspired and developed from different directions , Yedidia, Freeman and Weiss (2004) established a close connection: the BP algorithm solves the Bethe equation if it converges (however, it often does not).
Revised:  Although they are inspired and developed independently , Yedidia, Freeman and Weiss (2004) established a close connection: the BP algorithm solves the Bethe equation if it converges (however, it often does not).
Edit intent: clarity
Original:  Although they are inspired and developed from different directions , Yedidia, Freeman and Weiss (2004) established a close connection: the BP algorithm solves the Bethe equation if it converges (however, it often does not).
Revised:  Although they are inspired and developed from different directions , Yedidia, Freeman and Weiss (2004) showed that the BP algorithm solves the Bethe equation if it converges (however, it often does not).
Edit intent: clarity
Original:  This naturally motivates the following important question to understand their limitations and empirical successes : the Bethe equation is computationally easy to solve?
Revised:  This naturally motivates the following question to understand their limitations and empirical successes : the Bethe equation is computationally easy to solve?
Edit intent: clarity
Original:  This naturally motivates the following important question to understand their limitations and empirical successes : the Bethe equation is computationally easy to solve?
Revised:  This naturally motivates the following important question to understand limitations and empirical successes : the Bethe equation is computationally easy to solve?
Edit intent: clarity