wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our results establish that stability and consistency can be maintained even with one-way updating and randomized pairwise averaging, thus providing a scalable low complexity alternative to the synchronous decentralized estimation algorithm studied in Tsiligkaridis et al 1 . We illustrate the effectiveness and robustness of our algorithm for random network topologies.
Revised:  Our results establish that stability and consistency can be maintained even with one-way updating and randomized pairwise averaging, thus providing a scalable low complexity 1 . We illustrate the effectiveness and robustness of our algorithm for random network topologies.
Edit intent: clarity
Original:  Our results establish that stability and consistency can be maintained even with one-way updating and randomized pairwise averaging, thus providing a scalable low complexity alternative to the synchronous decentralized estimation algorithm studied in Tsiligkaridis et al 1 . We illustrate the effectiveness and robustness of our algorithm for random network topologies.
Revised:  Our results establish that stability and consistency can be maintained even with one-way updating and randomized pairwise averaging, thus providing a scalable low complexity alternative to the synchronous decentralized estimation algorithm studied in Tsiligkaridis et al 1 . We illustrate the effectiveness of our algorithm for random network topologies.
Edit intent: clarity
Original:  This motivates the argument that microblog Analysis be established as a foundationally independent programme, examining the organizational characteristics of microblogging from the ground up.
Revised:  This motivates the argument that Microblog Analysis be established as a foundationally independent programme, examining the organizational characteristics of microblogging from the ground up.
Edit intent: fluency
Original: The monoid problem , also called the integer Carath\'eodory problem, is to decide if a given integer vector is a finite nonnegative integer combination of a given set of integer vectors  , and find such a decomposition if one exists.
Revised: The monoid problem , also called the integer Carath\'eodory problem, is to decide if a given integer vector is a finite nonnegative integer combination of a set of integer vectors , and find such a decomposition if one exists.
Edit intent: fluency
Original:  It was very recently shown that for fixed dimension the problem can be solved in polynomial time which is doubly exponential in the dimension.
Revised:  It was very recently shown that in fixed dimension the problem can be solved in polynomial time which is doubly exponential in the dimension.
Edit intent: clarity
Original:  It was very recently shown that for fixed dimension the problem can be solved in polynomial time which is doubly exponential in the dimension.
Revised:  It was very recently shown that for fixed dimension the problem is solvable in polynomial time which is doubly exponential in the dimension.
Edit intent: clarity
Original:  It was very recently shown that for fixed dimension the problem can be solved in polynomial time which is doubly exponential in the dimension.
Revised:  It was very recently shown that for fixed dimension the problem can be solved in polynomial time doubly exponential in the dimension.
Edit intent: clarity
Original:  Here we show that when the set of integer points is defined by a totally unimodular matrix, the problem in fixed dimension can be solved much faster, in quadratic time , and with the dimensionas a parameter, the problem is fixed parameter tractable.
Revised:  Here we show that when the set of integer points is defined by a totally unimodular matrix, the problem can be solved much faster, in quadratic time , and with the dimensionas a parameter, the problem is fixed parameter tractable.
Edit intent: clarity
Original:  Recently, the problem was shown to be fixed parameter tractable on l,m.
Revised:  Recently, the problem was shown to be fixed-parameter tractable with parameters l,m.
Edit intent: clarity
Original:  Here we extend this and show that the huge version of the problem, where the variable side n is a huge number encoded in binary, is also fixed parameter tractable on l,m.
Revised:  Here we extend this and show that the huge version of the problem, where the variable side n is a huge number encoded in binary, is also fixed-parameter tractable with parameters l,m.
Edit intent: clarity
Original:  The monoid problem is to decide if a given integer vector is a finite nonnegative integer combination of a  set of integer vectors given implicitly by an inequality system , and find such a decomposition if one exists.
Revised:  The monoid problem is to decide if a given integer vector is a finite nonnegative integer combination of a given set of integer vectors given implicitly by an inequality system , and find such a decomposition if one exists.
Edit intent: fluency
Original:  The monoid problem is to decide if a given integer vector is a finite nonnegative integer combination of a  set of integer vectors given implicitly by an inequality system , and find such a decomposition if one exists.
Revised:  The monoid problem is to decide if a given integer vector is a finite nonnegative integer combination of a set of integer vectors , and find such a decomposition if one exists.
Edit intent: clarity
Original:  It was recently shown that in fixed dimension the problem is solvable in polynomial time doubly exponential in the dimension.
Revised:  It was recently shown that in fixed dimension the problem is solvable in polynomial time with degree which is exponential in the dimension.
Edit intent: clarity
Original: An important theoretical question in evolutionary computation is how good solutions evolutionary algorithms can produce.
Revised: An important question in evolutionary computation is how good solutions evolutionary algorithms can produce.
Edit intent: clarity
Original:  This paper aims to provide an analytic analysis of solution quality of evolutionary algorithms in terms of the performance rate , which is defined by the difference between 1 and the approximation ratio of the best solution found in each generation.
Revised:  This paper aims to provide an analytic analysis of solution quality in terms of the performance rate , which is defined by the difference between 1 and the approximation ratio of the best solution found in each generation.
Edit intent: clarity
Original:  This paper aims to provide an analytic analysis of solution quality of evolutionary algorithms in terms of the performance rate , which is defined by the difference between 1 and the approximation ratio of the best solution found in each generation.
Revised:  This paper aims to provide an analytic analysis of solution quality of evolutionary algorithms in terms of the performance rate , which is defined by the error between 1 and the approximation ratio of the best solution found in each generation.
Edit intent: clarity
Original:  For the first time , an analytic expression for calculating the performance rate is presented in this paper for a class of evolutionary algorithms, that is, (1+1) strictly elitist evolution algorithms.
Revised:  In this paper , an analytic expression for calculating the performance rate is presented in this paper for a class of evolutionary algorithms, that is, (1+1) strictly elitist evolution algorithms.
Edit intent: clarity
Original:  Furthermore, analytic expressions for calculate the fitness value and the average convergence rate in each generation are also derived for this class of evolutionary algorithms.
Revised:  Furthermore, analytic expressions of the fitness value and the average convergence rate in each generation are also derived for this class of evolutionary algorithms.
Edit intent: clarity
Original: In last decades, diversity and accuracy have been regarded as two essential measures in evaluating recommender systems .
Revised: In last decades, diversity and accuracy have been regarded as two important measures in evaluating recommender systems .
Edit intent: clarity
Original: In last decades, diversity and accuracy have been regarded as two essential measures in evaluating recommender systems .
Revised: In last decades, diversity and accuracy have been regarded as two essential measures in evaluating a recommendation model .
Edit intent: clarity
Original:  However, a clear concern is that a model focusing excessively on one measure will put the other one at risk, which means that it is not easy to greatly improve diversity and accuracy simultaneously.
Revised:  However, a clear concern is that a model focusing excessively on one measure will put the other one at risk, thus it is not easy to greatly improve diversity and accuracy simultaneously.
Edit intent: coherence
Original:  The main idea is to enhance the RA similarity of objects in the transfer equations , by giving a tuneable exponent on the shoulder of RA similarity, to intentionally regulate the resource allocation on objects of different degrees . Experiments on three benchmark data sets, MovieLens, Netflix, and RYM show that the modified algorithms can yield remarkable performance improvement compared with the original models .
Revised:  The main idea is to enhance the RA similarity of objects in the transfer equations , by giving a tunable exponent to the RA similarity, to intentionally regulate the resource allocation on objects of different degrees . Experiments on three benchmark data sets, MovieLens, Netflix, and RYM show that the modified algorithms can yield remarkable performance improvement compared with the original models .
Edit intent: clarity
Original:  The main idea is to enhance the RA similarity of objects in the transfer equations , by giving a tuneable exponent on the shoulder of RA similarity, to intentionally regulate the resource allocation on objects of different degrees . Experiments on three benchmark data sets, MovieLens, Netflix, and RYM show that the modified algorithms can yield remarkable performance improvement compared with the original models .
Revised:  The main idea is to enhance the RA similarity of objects in the transfer equations , by giving a tuneable exponent on the shoulder of RA similarity, to intentionally regulate the resource allocation on objects of different degrees . Experiments on three benchmark data sets, MovieLens, Netflix, and RYM show that the modified models can yield remarkable performance improvement compared with the original models .
Edit intent: clarity
Original:  The main idea is to enhance the RA similarity of objects in the transfer equations , by giving a tuneable exponent on the shoulder of RA similarity, to intentionally regulate the resource allocation on objects of different degrees . Experiments on three benchmark data sets, MovieLens, Netflix, and RYM show that the modified algorithms can yield remarkable performance improvement compared with the original models .
Revised:  The main idea is to enhance the RA similarity of objects in the transfer equations , by giving a tuneable exponent on the shoulder of RA similarity, to intentionally regulate the resource allocation on objects of different degrees . Experiments on three benchmark data sets, MovieLens, Netflix, and RYM show that the modified algorithms can yield remarkable performance improvement compared with the original ones .
Edit intent: clarity
Original: We utilize the asymmetric random telegraph wave-based instantaneous noise-base logic scheme to represent the problem of drawing numbers from a hat, and we consider two identical hats with the first 2N integer numbers.
Revised: We utilize the asymmetric random telegraph wave-based instantaneous noise-base logic scheme to represent the problem of drawing numbers from a hat, and we consider two identical hats with the first 2^N integer numbers.
Edit intent: clarity
Original: Determinisation is an important concept in the theory of finite tree automata .
Revised: Determinisation and completion of finite tree automata .
Edit intent: clarity
Original:  However the complexity of the textbook procedure for determinisation is such that it is not viewed as a being a practical procedure for manipulating tree automata , even fairly small ones.
Revised:  However the complexity of the textbook procedure for determinisation is such that it is not viewed as a being a practical procedure for manipulating tree automata beyond very small ones.
Edit intent: clarity
Original:  The computational problems are exacerbated when an automaton has to be both determinised and completed, for instance to compute the complement of an automaton.
Edit intent: coherence
Original:  In this paper we develop an algorithm for determinisation and completion of finite tree automata, whose worst-case complexity remains unchanged, but which performs dramatically better than existing algorithms in practice.
Revised:  In this paper we develop an algorithm for determinisation and completion of finite tree automata, whose worst-case complexity remains unchanged, but which performs far better than existing algorithms in practice.
Edit intent: clarity
Original:  The paper contains an experimental evaluation of the algorithm on a large set of tree automata examples . Applications of the algorithm include static analysis of term rewriting systems and logic programs, and checking containment of languages defined by tree automata such as XML schemata .
Revised:  The paper contains an experimental evaluation of the algorithm on a large set of tree automata examples .
Edit intent: clarity
Original: The increasing popularity of academic social networking sites (ASNSs) requires studies on the usage of ASNSs among scholars , and evaluations of the effectiveness of these ASNSs. However, it is unclear whether current ASNSs have fulfilled their design goal, as scholars' actual online interactions on these platforms remain unexplored.
Revised: The increasing popularity of academic social networking sites (ASNSs) requires studies on the usage of ASNSs among scholars and evaluations of the effectiveness of these ASNSs. However, it is unclear whether current ASNSs have fulfilled their design goal, as scholars' actual online interactions on these platforms remain unexplored.
Edit intent: fluency
Original:  To fill the gap, this paper presents a study based on data collected from ResearchGate.
Revised:  To fill the gap, this article presents a study based on data collected from ResearchGate.
Edit intent: fluency
Original:  Adopting a mixed-method design by conducting qualitative content analysis and statistical analysis on 1128 posts collected from ResearchGate Q&A, we examine how scholars exchange information and resources, and how their practices vary across three distinct disciplines: Library and Information Services, History of Art, and Astrophysics .
Revised:  Adopting a mixed-method design by conducting qualitative content analysis and statistical analysis on 1,128 posts collected from ResearchGate Q&A, we examine how scholars exchange information and resources, and how their practices vary across three distinct disciplines: Library and Information Services, History of Art, and Astrophysics .
Edit intent: fluency
Original:  Adopting a mixed-method design by conducting qualitative content analysis and statistical analysis on 1128 posts collected from ResearchGate Q&A, we examine how scholars exchange information and resources, and how their practices vary across three distinct disciplines: Library and Information Services, History of Art, and Astrophysics .
Revised:  Adopting a mixed-method design by conducting qualitative content analysis and statistical analysis on 1128 posts collected from ResearchGate Q&A, we examine how scholars exchange information and resources, and how their practices vary across three distinct disciplines: library and information services, history of art, and astrophysics .
Edit intent: fluency
Original:  Our results show that the effect of a questioner'  intention (i.e., seeking information or discussion) is greater than discipline in some circumstances.
Revised:  Our results show that the effect of a questioner' s intention (i.e., seeking information or discussion) is greater than discipline in some circumstances.
Edit intent: clarity
Original:  Our results show that the effect of a questioner'  intention (i.e., seeking information or discussion) is greater than discipline in some circumstances.
Revised:  Our results show that the effect of a questioner' intention (i.e., seeking information or discussion) is greater than disciplinary factors in some circumstances.
Edit intent: clarity
Original:  Across the three disciplines, responses to these questions all provide various resources, including experts' contact details, citations, links to Wikipedia, images, etc .
Revised:  Across the three disciplines, responses to questions provide various resources, including experts' contact details, citations, links to Wikipedia, images, etc .
Edit intent: clarity
Original:  Across the three disciplines, responses to these questions all provide various resources, including experts' contact details, citations, links to Wikipedia, images, etc .
Revised:  Across the three disciplines, responses to these questions all provide various resources, including experts' contact details, citations, links to Wikipedia, images, and so on .
Edit intent: fluency
Original:  We further discuss several implications to the understanding of scholarly information exchange and the design of better academic social networking interfaces, which should aim to stimulate scholarly interactions by minimizing confusion, improving the clarity of questions, and promote scholarly content management.
Revised:  We further discuss several implications of the understanding of scholarly information exchange and the design of better academic social networking interfaces, which should aim to stimulate scholarly interactions by minimizing confusion, improving the clarity of questions, and promote scholarly content management.
Edit intent: fluency
Original:  We further discuss several implications to the understanding of scholarly information exchange and the design of better academic social networking interfaces, which should aim to stimulate scholarly interactions by minimizing confusion, improving the clarity of questions, and promote scholarly content management.
Revised:  We further discuss several implications to the understanding of scholarly information exchange and the design of better academic social networking interfaces, which should stimulate scholarly interactions by minimizing confusion, improving the clarity of questions, and promote scholarly content management.
Edit intent: clarity
Original:  We further discuss several implications to the understanding of scholarly information exchange and the design of better academic social networking interfaces, which should aim to stimulate scholarly interactions by minimizing confusion, improving the clarity of questions, and promote scholarly content management.
Revised:  We further discuss several implications to the understanding of scholarly information exchange and the design of better academic social networking interfaces, which should aim to stimulate scholarly interactions by minimizing confusion, improving the clarity of questions, and promoting scholarly content management.
Edit intent: fluency
Original: We study the system-level effects of the introduction of large populations of Electric Vehicles in power and transportation networks.
Revised: We study the system-level effects of the introduction of large populations of Electric Vehicles on the power and transportation networks.
Edit intent: clarity
Original:  This individual decision is affected by traffic congestion in the transportation network  as well as nodal electricity prices that change as a result of congestion in the power grid  .
Revised:  This individual decision is affected by traffic congestion in the transportation network as well as as congestion in the power grid .
Edit intent: clarity
Original:  This individual decision is affected by traffic congestion in the transportation network, affecting travel times, as well as as congestion in the power grid, resulting in spatial variations in electricity prices for battery charging.
Revised:  This individual decision takes into account traffic congestion in the transportation network, affecting travel times, as well as as congestion in the power grid, resulting in spatial variations in electricity prices for battery charging.
Edit intent: clarity
Original:  In contrast to the commutative case, which has an efficient probabilistic algorithm, the best previous algorithm for the non-commutative setting required exponential time IQS15 (whether or not randomization is allowed).
Revised:  In contrast to the commutative case, which has an efficient probabilistic algorithm, the best previous algorithm for the non-commutative setting required exponential time (whether or not randomization is allowed).
Edit intent: clarity
Original:  The main (and simple) technical contribution of this paper is an analysis of an existing algorithm due to Gurvits which solved the same problem in some special cases.
Revised:  The main contribution of this paper is an analysis of an existing algorithm due to Gurvits which solved the same problem in some special cases.
Edit intent: clarity
Original:  We extend the algorithm to actually approximate capacity to any accuracy in polynomial time, and use this analysis to give quantitative bounds on the continuity of capacity (the later is used in a subsequent paper on Brascamp-Lieb inequalities).
Revised:  We extend the algorithm to actually approximate capacity to any accuracy in polynomial time, and use this analysis to give quantitative bounds on the continuity of capacity (the latter is used in a subsequent paper on Brascamp-Lieb inequalities).
Edit intent: fluency
Original:  We exhibit a simple analytic model of absolute discrimination displaying ligand antagonism, where antagonism strength is linear in distance from  threshold.
Revised:  We exhibit a simple analytic model of discrimination displaying antagonism, where antagonism strength is linear in distance from threshold.
Edit intent: clarity
Original:  We exhibit a simple analytic model of absolute discrimination displaying ligand antagonism, where antagonism strength is linear in distance from  threshold.
Revised:  We exhibit a simple analytic model of absolute discrimination displaying ligand antagonism, where antagonism strength is linear in distance from detection threshold.
Edit intent: clarity
Original:  This contrasts with  proofreading based models , where antagonism vanishes far from threshold and thus displays an inverted hierarchy of antagonism compared to simple model .
Revised:  This contrasts with proofreading based models where antagonism vanishes far from threshold and thus displays an inverted hierarchy of antagonism compared to simple model .
Edit intent: fluency
Original:  This contrasts with  proofreading based models , where antagonism vanishes far from threshold and thus displays an inverted hierarchy of antagonism compared to simple model .
Revised:  This contrasts with proofreading based models , where antagonism vanishes far from threshold and thus displays an inverted hierarchy of antagonism compared to simpler models .
Edit intent: fluency
Original:  The phenotypic spandrel studied here is expected to structure many decision pathways such as immune detection mediated by TCRs and Fc \epsilonRIs  .
Revised:  The phenotypic spandrel studied here is expected to structure many decision pathways such as immune detection mediated by TCRs and FC \epsilonRIs .
Edit intent: fluency
Original:  By contrast, natural scientists focus primarily on searching and modeling network characteristics that are independent of context, since their focus is to identify universal characteristics of systems that are independent of context, instead of context specific mechanisms.
Revised:  By contrast, natural scientists focus primarily on modeling network characteristics that are independent of context, since their focus is to identify universal characteristics of systems that are independent of context, instead of context specific mechanisms.
Edit intent: clarity