wanyu/IteraTeR_v2 huggingface dataset:
Original: In evolutionary dynamics, a key measure of a mutant trait's success is its fixation probability---the probability that it takes over the population given some initial mutant-appearance distribution.
Revised: In evolutionary dynamics, a key measure of a mutant trait's success is the probability that it takes over the population given some initial mutant-appearance distribution.
Edit intent: clarity
Original:  This fixation probability is difficult to compute in general, as it depends on the mutation's effect on the organism as well as the population's spatial structure, mating patterns, and other factors.
Revised:  This "fixation probability" is difficult to compute in general, as it depends on the mutation's effect on the organism as well as the population's spatial structure, mating patterns, and other factors.
Edit intent: fluency
Original:  Here we consider weak selection, meaning the mutation's effect on the organism is small.
Revised:  In this study, we consider weak selection, meaning the mutation's effect on the organism is small.
Edit intent: clarity
Original:  Here we consider weak selection, meaning the mutation's effect on the organism is small.
Revised:  Here we consider weak selection, which means that the mutation's effect on the organism is small.
Edit intent: coherence
Original:  We apply method to obtain new results for well-studied models of evolutionary dynamics on graphs.
Revised:  We conclude by applying these methods to obtain new results for well-studied models of evolutionary dynamics on graphs.
Edit intent: clarity
Original:  We apply method to obtain new results for well-studied models of evolutionary dynamics on graphs.
Revised:  We apply method to obtain new results for evolutionary dynamics on graphs.
Edit intent: clarity
Original:  Here, we present SODECL, {\bf   a software library that utilises such devices to calculate multiple orbits of an SDE model.
Revised:  Here, we present {\bf a software library that utilises such devices to calculate multiple orbits of an SDE model.
Edit intent: clarity
Original:  Here, we present SODECL, {\bf   a software library that utilises such devices to calculate multiple orbits of an SDE model.
Revised:  Here, we present SODECL, {\bf URL a software library that utilises such devices to calculate multiple orbits of an SDE model.
Edit intent: fluency
Original:  A common (but  inadequate) assumption of these models is the sampling of edges in different layers independently, conditioned on  community labels of the nodes.
Revised:  A common (but potentially inadequate) assumption of these models is the sampling of edges in different layers independently, conditioned on community labels of the nodes.
Edit intent: clarity
Original:  A common (but  inadequate) assumption of these models is the sampling of edges in different layers independently, conditioned on  community labels of the nodes.
Revised:  A common (but inadequate) assumption of these models is the sampling of edges in different layers independently, conditioned on the community labels of the nodes.
Edit intent: fluency
Original: In the error analysis of finite element methods, the shape-regularity assumption on triangulations is usually imposed to obtain anticipated error estimations.
Revised: In the error analysis of finite element methods, the shape regularity assumption on triangulations is usually imposed to obtain anticipated error estimations.
Edit intent: fluency
Original: In the error analysis of finite element methods, the shape-regularity assumption on triangulations is usually imposed to obtain anticipated error estimations.
Revised: In the error analysis of finite element methods, the shape-regularity assumption on triangulations is typically imposed to obtain anticipated error estimations.
Edit intent: style
Original: In the error analysis of finite element methods, the shape-regularity assumption on triangulations is usually imposed to obtain anticipated error estimations.
Revised: In the error analysis of finite element methods, the shape-regularity assumption on triangulations is usually imposed to obtain a priori error estimations.
Edit intent: clarity
Original:  In this manuscript, we will try to establish an error analysis without the shape-regularity assumption on triangulations.
Revised:  In this manuscript, we attempt to establish an error analysis without the shape-regularity assumption on triangulations.
Edit intent: clarity
Original:  In this manuscript, we will try to establish an error analysis without the shape-regularity assumption on triangulations.
Revised:  In this manuscript, we will try to establish an error analysis approach without the shape regularity assumption on triangulations.
Edit intent: clarity
Original:  The authors have presented several papers on  error analysis of finite eleemnt methods on non-regular triangulation .
Revised:  We have presented several papers on error analysis of finite eleemnt methods on non-regular triangulation .
Edit intent: clarity
Original:  The authors have presented several papers on  error analysis of finite eleemnt methods on non-regular triangulation .
Revised:  The authors have presented several papers on the error analysis of finite eleemnt methods on non-regular triangulation .
Edit intent: fluency
Original:  The authors have presented several papers on  error analysis of finite eleemnt methods on non-regular triangulation .
Revised:  The authors have presented several papers on error analysis of finite element methods on non-shape regular triangulations .
Edit intent: fluency
Original:  The main points of those papers are that  in the error estimates of finite element methods, the circumradius of the triangles is one of the most important factors.
Revised:  The main points in these papers are that in the error estimates of finite element methods, the circumradius of the triangles is one of the most important factors.
Edit intent: clarity
Original:  The main points of those papers are that  in the error estimates of finite element methods, the circumradius of the triangles is one of the most important factors.
Revised:  The main points of those papers are that , in the error estimates of finite element methods, the circumradius of the triangles is one of the most important factors.
Edit intent: fluency
Original:  The purpose of this manuscript is to provide a simple and plain explanation of the results to researchers and, in particular, to graduate students who are interested in the subject.
Revised:  The purpose of this manuscript is to provide a simple and plain explanation of the results to researchers and, in particular, graduate students who are interested in the subject.
Edit intent: fluency
Original:  Therefore, the manuscript is not intended as a research paper.
Revised:  Therefore, this manuscript is not intended as a research paper.
Edit intent: style
Original:  Therefore, the manuscript is not intended as a research paper.
Revised:  Therefore, the manuscript is not intended to be a research paper.
Edit intent: fluency
Original:  The authors hope that it will be merged into a textbook on the mathematical theory of the finite element methods in future .
Revised:  We hope that, in the future, it will be merged into a textbook on the mathematical theory of the finite element methods in future .
Edit intent: clarity
Original:  The authors hope that it will be merged into a textbook on the mathematical theory of the finite element methods in future .
Revised:  The authors hope that it will be merged into a textbook on the mathematical theory of the finite element methods .
Edit intent: clarity
Original:  We present a quantum algorithm that estimates the volume of an n-dimensional convex body within multiplicative error \epsilon using O(n^{ 3.5 }+n^{2.5}/\epsilon) queries to a membership oracle and O(n^{ 5.5 }+n^{4.5}/\epsilon) additional arithmetic operations.
Revised:  We present a quantum algorithm that estimates the volume of an n-dimensional convex body within multiplicative error \epsilon using O(n^{ 3 }+n^{2.5}/\epsilon) queries to a membership oracle and O(n^{ 5.5 }+n^{4.5}/\epsilon) additional arithmetic operations.
Edit intent: fluency
Original:  We present a quantum algorithm that estimates the volume of an n-dimensional convex body within multiplicative error \epsilon using O(n^{ 3.5 }+n^{2.5}/\epsilon) queries to a membership oracle and O(n^{ 5.5 }+n^{4.5}/\epsilon) additional arithmetic operations.
Revised:  We present a quantum algorithm that estimates the volume of an n-dimensional convex body within multiplicative error \epsilon using O(n^{ 3.5 }+n^{2.5}/\epsilon) queries to a membership oracle and O(n^{ 5 }+n^{4.5}/\epsilon) additional arithmetic operations.
Edit intent: fluency
Original: The coded trace reconstruction problem asks to construct a code C\subset \{0,1\}^n such that any x\in C is recoverable from independent outputs ("traces") of x from a binary deletion channel (BDC).
Revised: The coded trace reconstruction problem asks to construct a code C\subset \{0,1\}^n such that any x\in C is recoverable from independent outputs ("traces") of x from a binary deletion channel (BDC).
Edit intent: fluency
Original: This paper studies graph-based recommendation, where an interaction graph is constructed built from historical records and is lever-aged to alleviate data sparsity and cold start problems.
Revised: This paper studies graph-based recommendation, where an interaction graph is constructed from historical records and is lever-aged to alleviate data sparsity and cold start problems.
Edit intent: fluency
Original: Brains perform intelligent tasks with extremely low energy consumption , probably to a large extent because they merge computation and memory entirely, and because they function using low precision computation.
Revised: The brain performs intelligent tasks with extremely low energy consumption , probably to a large extent because they merge computation and memory entirely, and because they function using low precision computation.
Edit intent: clarity
Original: Brains perform intelligent tasks with extremely low energy consumption , probably to a large extent because they merge computation and memory entirely, and because they function using low precision computation.
Revised: Brains perform intelligent tasks with extremely low energy consumption . This work takes inspiration from two strategies used by the brain to achieve this energy efficiency: the absence of separation between computing and memory functions, and the reliance on low precision computation.
Edit intent: clarity
Original:  The emergence of resistive memory technologies  provides an opportunity to integrate logic and memory tightly in hardware.
Revised:  The emergence of resistive memory technologies indeed provides an opportunity to integrate logic and memory tightly in hardware.
Edit intent: clarity
Original:  The emergence of resistive memory technologies  provides an opportunity to integrate logic and memory tightly in hardware.
Revised:  The emergence of resistive memory technologies provides an opportunity to co-integrate tightly logic and memory tightly in hardware.
Edit intent: clarity
Original:  The emergence of resistive memory technologies  provides an opportunity to integrate logic and memory tightly in hardware.
Revised:  The emergence of resistive memory technologies provides an opportunity to integrate logic and memory in hardware.
Edit intent: clarity
Original:  In parallel, the recently proposed concept of Binarized Neural Network, where multiplications are replaced by exclusive NOR  logic gates, shows a way to implement artificial intelligence using very low precision computation.
Revised:  In parallel, the recently proposed concept of Binarized Neural Network, where multiplications are replaced by exclusive NOR logic gates, offers a way to implement artificial intelligence using very low precision computation.
Edit intent: clarity
Original:  We evidence that its energy consumption is attractive with regards to more standard approaches, and that it can use the memory devices in regimes where they exhibit particularly low programming energy and high endurance .
Revised:  We evidence that its energy consumption is attractive compared to more standard approaches, and that it can use the memory devices in regimes where they exhibit particularly low programming energy and high endurance .
Edit intent: coherence
Original:  Our results indicate that \%, among the factors studied, publication venue, author team's past citations, paper length, the number of references, and the recency of references are the most influential factors on the number of citations to SE papers.
Revised:  Our results indicate that publication venue, author team's past citations, paper length, the number of references, and the recency of references are the most influential factors on the number of citations to SE papers.
Edit intent: clarity
Original: In this article , we present  fast computational algorithms for  Jacobi sums of orders l^2 and 2l ^2 with odd prime l . Cyclotomic numbers play a crucial rule in implementing these algorithms.
Revised: In this paper , we present fast computational algorithms for Jacobi sums of orders l^2 and 2l ^2 with odd prime l . Cyclotomic numbers play a crucial rule in implementing these algorithms.
Edit intent: fluency
Original: In this article , we present  fast computational algorithms for  Jacobi sums of orders l^2 and 2l ^2 with odd prime l . Cyclotomic numbers play a crucial rule in implementing these algorithms.
Revised: In this article , we present the fast computational algorithms for Jacobi sums of orders l^2 and 2l ^2 with odd prime l . Cyclotomic numbers play a crucial rule in implementing these algorithms.
Edit intent: fluency
Original: In this article , we present  fast computational algorithms for  Jacobi sums of orders l^2 and 2l ^2 with odd prime l . Cyclotomic numbers play a crucial rule in implementing these algorithms.
Revised: In this article , we present fast computational algorithms for the Jacobi sums of orders l^2 and 2l ^2 with odd prime l . Cyclotomic numbers play a crucial rule in implementing these algorithms.
Edit intent: fluency
Original:  To validate these expressions, we implement two additional algorithms which demonstrate the minimality of cyclotomic numbers required for the determination of all Jacobi sums of orders l^2 and 2l^2 respectively .
Revised:  To validate these expressions, we implement two additional algorithms which demonstrate the minimality of cyclotomic numbers required .
Edit intent: clarity
Original:  These timescales give rise to a cellular memory that plays a pivotal role in controlling cellular behaviour.
Revised:  These timescales give rise to a memory that impacts cellular behaviour.
Edit intent: clarity
Original:  The improvement is maximal when the cellular memory is comparable to the timescale of the fluctuations perceived during swimming.
Revised:  The improvement is maximal when the cellular memory is comparable to the time scale of fluctuations as perceived during swimming.
Edit intent: clarity
Original:  We then extend coarse-grained population models and derive an analytical approximation for the drift velocity in rugged landscapes that includes the relevant time and length scales.
Revised:  We derive an analytical approximation for the drift velocity in rugged landscapes that includes the relevant time and length scales.
Edit intent: coherence
Original:  Our numerics also show that cellular memory can be used to induce bet-hedging at the population level by developing distinct sub-populations in response to heterogeneous chemoattractant landscapes.
Revised:  Our numerics also show that cellular memory can induce bet-hedging at the population level by developing distinct sub-populations in response to heterogeneous chemoattractant landscapes.
Edit intent: clarity
Original: We study the problem of persistent monitoring of  finite number of inter-connected geographical nodes for event detection via a group of heterogeneous mobile agents.
Revised: We study the problem of persistent monitoring of a finite number of inter-connected geographical nodes for event detection via a group of heterogeneous mobile agents.
Edit intent: fluency
Original: We study the problem of persistent monitoring of  finite number of inter-connected geographical nodes for event detection via a group of heterogeneous mobile agents.
Revised: We study the problem of persistent monitoring of finite number of inter-connected geographical nodes by a group of heterogeneous mobile agents.
Edit intent: clarity
Original:  We show that the design of an optimal monitoring policy to maximize the utility of event detection over a mission horizonis an NP-hard problem .
Revised:  We show that this optimization problem is NP-hard problem .
Edit intent: clarity
Original:  To reduce the time complexity of constructing the feasible search set and also to induce robustness to changes in event occurrence and other operational factors, we preform our suboptimal policy design in a receding horizon setting.
Revised:  To reduce the time complexity of constructing the feasible search set and also to induce robustness to changes in the operational factors, we preform our suboptimal policy design in a receding horizon setting.
Edit intent: clarity
Original:  To reduce the time complexity of constructing the feasible search set and also to induce robustness to changes in event occurrence and other operational factors, we preform our suboptimal policy design in a receding horizon setting.
Revised:  To reduce the time complexity of constructing the feasible search set and also to induce robustness to changes in event occurrence and other operational factors, we perform our suboptimal policy design in a receding horizon setting.
Edit intent: fluency
Original:  This added term provides a measure of importance for nodes beyond the receding horizon's sight , and is meant to give the policy design an intuition to steer the agents towards areas with higher importance on the global map . Finally, we discuss how our proposed algorithm can be implemented in a decentralized manner.
Revised:  This added term provides a measure of nodal importance beyond the receding horizon's sight , and is meant to give the policy design an intuition to steer the agents towards areas with higher importance on the global map . Finally, we discuss how our proposed algorithm can be implemented in a decentralized manner.
Edit intent: clarity
Original:  This added term provides a measure of importance for nodes beyond the receding horizon's sight , and is meant to give the policy design an intuition to steer the agents towards areas with higher importance on the global map . Finally, we discuss how our proposed algorithm can be implemented in a decentralized manner.
Revised:  This added term provides a measure of importance for nodes beyond the receding horizon's sight . This term gives the policy design an intuition to steer the agents towards areas with higher importance on the global map . Finally, we discuss how our proposed algorithm can be implemented in a decentralized manner.
Edit intent: coherence
Original:  This added term provides a measure of importance for nodes beyond the receding horizon's sight , and is meant to give the policy design an intuition to steer the agents towards areas with higher importance on the global map . Finally, we discuss how our proposed algorithm can be implemented in a decentralized manner.
Revised:  This added term provides a measure of importance for nodes beyond the receding horizon's sight , and is meant to give the policy design an intuition to steer the agents towards the nodes with higher rewards on the patrolling graph . Finally, we discuss how our proposed algorithm can be implemented in a decentralized manner.
Edit intent: clarity
Original:  We demonstrate our results through a simulation study .
Revised:  A simulation study demonstrates our results .
Edit intent: clarity
Original:  Then, we design the optimal dispatch policy of what nodes to visit at what time and by what agent by finding a policy set that maximizes a utility that is defined as the total reward collected at visit times.
Revised:  Then, we design the optimal dispatch policy of which nodes to visit at what time and by what agent by finding a policy set that maximizes a utility that is defined as the total reward collected at visit times.
Edit intent: fluency
Original:  For this, we adapted genetic algorithms to multiobjective case.
Revised:  For this, we adapted genetic algorithms to multi-objective case.
Edit intent: fluency
Original: Entity linking  is a fundamental database problem with applicationsin data integration, data cleansing, information retrieval, knowledge fusion, and knowledge-base population.
Revised: Entity linking is a fundamental database problem with applications in data integration, data cleansing, information retrieval, knowledge fusion, and knowledge-base population.
Edit intent: fluency
Original:  It is the task of accurately identifying multiple, differing, and possibly contradictingrepresentations of the same real-world entity in data.
Revised:  It is the task of accurately identifying multiple, differing, and possibly contradicting representations of the same real-world entity in data.
Edit intent: fluency
Original:  In this work, we propose an entity linking  system capable of linking entitiesacross different databases and mentioned-entities extracted fromtext data.
Revised:  In this work, we propose an entity linking system capable of linking entities across different databases and mentioned-entities extracted fromtext data.
Edit intent: fluency
Original:  In this work, we propose an entity linking  system capable of linking entitiesacross different databases and mentioned-entities extracted fromtext data.
Revised:  In this work, we propose an entity linking system capable of linking entitiesacross different databases and mentioned-entities extracted from text data.
Edit intent: fluency
Original:  The graph model is versatile, thus, it is capable of handling multiple values for an attributeor a relationship, as well as the provenance descriptions of thevalues . Provenance descriptions of a value provide the settings ofthe value, such as validity periods, sources, security requirements, etc.
Revised:  The graph model is versatile, thus, it is capable of handling multiple values for an attribute or a relationship, as well as the provenance descriptions of thevalues . Provenance descriptions of a value provide the settings ofthe value, such as validity periods, sources, security requirements, etc.
Edit intent: fluency
Original:  The graph model is versatile, thus, it is capable of handling multiple values for an attributeor a relationship, as well as the provenance descriptions of thevalues . Provenance descriptions of a value provide the settings ofthe value, such as validity periods, sources, security requirements, etc.
Revised:  The graph model is versatile, thus, it is capable of handling multiple values for an attributeor a relationship, as well as the provenance descriptions of the values . Provenance descriptions of a value provide the settings ofthe value, such as validity periods, sources, security requirements, etc.
Edit intent: fluency
Original:  The graph model is versatile, thus, it is capable of handling multiple values for an attributeor a relationship, as well as the provenance descriptions of thevalues . Provenance descriptions of a value provide the settings ofthe value, such as validity periods, sources, security requirements, etc.
Revised:  The graph model is versatile, thus, it is capable of handling multiple values for an attributeor a relationship, as well as the provenance descriptions of thevalues . Provenance descriptions of a value provide the settings of the value, such as validity periods, sources, security requirements, etc.
Edit intent: fluency