wanyu/IteraTeR_v2 huggingface dataset:
Original:  Here we extend evolutionary game theory by allowing players' strategies as well as their payoffs to evolve , in response to selection on heritable mutations.
Revised:  Here we extend evolutionary game theory by allowing players' strategies as well as their payoffs to evolve in response to selection on heritable mutations.
Edit intent: fluency
Original:  We show that, as payoffs evolve, a tradeoff between the benefits and costs of cooperation precipitates a dramatic loss of cooperation under the Iterated Prisoner's Dilemma;
Revised:  We show that, as payoffs evolve, a trade-off between the benefits and costs of cooperation precipitates a dramatic loss of cooperation under the Iterated Prisoner's Dilemma;
Edit intent: fluency
Original:  We show that both Matrix-F5 and the signature-preserving Matrix-F5 are available to tropical computation with respective modifications.
Revised:  Two variants of the Matrix-F5 and the signature-preserving Matrix-F5 are available to tropical computation with respective modifications.
Edit intent: clarity
Original:   Our study is performed both over any exact field with valuation and some inexact fields like Q _p or \mathbb{F t\_q }\llbracket \rrbracket .
Revised:  Our study is performed both over any exact field with valuation and some inexact fields like Q t\_q }\llbracket \rrbracket .
Edit intent: clarity
Original:   Our study is performed both over any exact field with valuation and some inexact fields like Q _p or \mathbb{F t\_q }\llbracket \rrbracket .
Revised:  Our study is performed both over any exact field with valuation and some inexact fields like Q _p or \mathbb{F t\_q }\llbracket t\rrbracket .
Edit intent: clarity
Original:  Given a set of landmark correspondences, our algorithm produces an optimal diffeomorphism that matches prescribed landmark constraints.
Revised:  Given a set of feature correspondences, our algorithm produces an optimal diffeomorphism that matches prescribed landmark constraints.
Edit intent: clarity
Original:  Results show that our proposed model is efficient to obtain a diffeomorphic registration between n-dimensional data with large deformations.
Revised:  Results show the efficacy of our proposed model is efficient to obtain a diffeomorphic registration between n-dimensional data with large deformations.
Edit intent: clarity
Original:  Results show that our proposed model is efficient to obtain a diffeomorphic registration between n-dimensional data with large deformations.
Revised:  Results show that our proposed model to obtain a diffeomorphic registration between n-dimensional data with large deformations.
Edit intent: clarity
Original:  Results show that our proposed model is efficient to obtain a diffeomorphic registration between n-dimensional data with large deformations.
Revised:  Results show that our proposed model is efficient to obtain a diffeomorphic registration between n-dimensional spaces with large deformations.
Edit intent: clarity
Original:  We develop a Bayesian nonparametric Markov switching process that allows for (i) shared dynamic regimes between a variable numbers of channels, (ii) asynchronous regime-switching, and (iii) an unknown dictionary of dynamic regimes.
Revised:  We develop a Bayesian nonparametric Markov switching process that allows for (i) shared dynamic regimes between a variable number of channels, (ii) asynchronous regime-switching, and (iii) an unknown dictionary of dynamic regimes.
Edit intent: fluency
Original:  We study the performance of these solutions by means of simulations and modeling.
Edit intent: coherence
Original:  Roughly speaking, this amounts to computing in a semigroup algebra, i.e. an algebra generated by a subset of Laurent monomials.
Revised:  Roughly speaking, this amounts to computing in a semigroup algebra, i.e. an algebra generated by a subset of Laurent monomials.
Edit intent: fluency
Original:  Our prototype '' proof-of-concept '' implementation shows large speed-ups (more than 100 for some examples) compared to optimized (classical) Gr\"obner bases software.
Revised:  Our prototype " proof-of-concept '' implementation shows large speed-ups (more than 100 for some examples) compared to optimized (classical) Gr\"obner bases software.
Edit intent: fluency
Original:  Our prototype '' proof-of-concept '' implementation shows large speed-ups (more than 100 for some examples) compared to optimized (classical) Gr\"obner bases software.
Revised:  Our prototype '' proof-of-concept " implementation shows large speed-ups (more than 100 for some examples) compared to optimized (classical) Gr\"obner bases software.
Edit intent: fluency
Original:  These bounds yield new estimates on the complexity of solving 0-dimensional systems via Gr\"obner bases when all polynomials share the same Newton polytope (unmixed case).
Revised:  These bounds yield new estimates on the complexity of solving 0-dim systems where all polynomials share the same Newton polytope (unmixed case).
Edit intent: clarity
Original:  For instance, we generalize the bound \min(n_1,n_2)+1 on the maximal degree in a Gr\"obner basis of a 0-dimensional bilinear system with blocks of variables of sizes (n_1,n_2) to the multilinear case: \sum n_i - \max(n_i)+1.
Revised:  For instance, we generalize the bound \min(n_1,n_2)+1 on the maximal degree in a Gr\"obner basis of a 0-dim. bilinear system with blocks of variables of sizes (n_1,n_2) to the multilinear case: \sum n_i - \max(n_i)+1.
Edit intent: fluency
Original:  Moreover, in the case where the generating subset of monomials corresponds to the points with integer coordinates in a normal lattice polytope %DIFDELCMD < \polytope%%% \subset%DIFDELCMD < \R%%%  ^n and under regularity assumptions, we prove complexity bounds which depend on the combinatorial properties of %DIFDELCMD < \polytope%%%  . These bounds yield new estimates on the complexity of solving 0-dim systems where all polynomials share the same Newton polytope (unmixed case).
Revised:  Moreover, in the case where the generating subset of monomials corresponds to the points with integer coordinates in a normal lattice polytope %DIFDELCMD < \polytope%%% %DIFDELCMD < \R%%% ^n and under regularity assumptions, we prove complexity bounds which depend on the combinatorial properties of %DIFDELCMD < \polytope%%% . These bounds yield new estimates on the complexity of solving 0-dim systems where all polynomials share the same Newton polytope (unmixed case).
Edit intent: coherence
Original:  We  prove an analogous result for sparse Erdos-R\'{e}nyi graphs, and provide upper and lower bounds for the largest size density on random 3-regular graphs.
Revised:  We also prove an analogous result for sparse Erdos-R\'{e}nyi graphs, and provide upper and lower bounds for the largest size density on random 3-regular graphs.
Edit intent: coherence
Original:  We  prove an analogous result for sparse Erdos-R\'{e}nyi graphs, and provide upper and lower bounds for the largest size density on random 3-regular graphs.
Revised:  We prove an analogous result for sparse Erdos-R\'{e}nyi graphs.
Edit intent: clarity
Original: We consider the problem of finding an induced subgraph in a random d-regular graph such that its components have bounded size as the size of the graph gets arbitrarily large.
Revised: Consider the problem of finding an induced subgraph in a random d-regular graph such that its components have bounded size as the size of the graph gets arbitrarily large.
Edit intent: clarity
Original: We consider the problem of finding an induced subgraph in a random d-regular graph such that its components have bounded size as the size of the graph gets arbitrarily large.
Revised: We consider the problem of determining the maximal induced subgraph in a random d-regular graph such that its components have bounded size as the size of the graph gets arbitrarily large.
Edit intent: clarity
Original: We consider the problem of finding an induced subgraph in a random d-regular graph such that its components have bounded size as the size of the graph gets arbitrarily large.
Revised: We consider the problem of finding an induced subgraph in a random d-regular graph such that its components remain bounded as the size of the graph gets arbitrarily large.
Edit intent: clarity
Original: We consider the problem of finding an induced subgraph in a random d-regular graph such that its components have bounded size as the size of the graph gets arbitrarily large.
Revised: We consider the problem of finding an induced subgraph in a random d-regular graph such that its components have bounded size as the size of the graph becomes arbitrarily large.
Edit intent: fluency
Original:  We show that for any threshold \tau, the largest size density of such an induced subgraph with component sizes bounded by \tau is at most 2(\log d)/d for asymptotically large d . A matching lower bound is known for independent sets.
Revised:  We show , for asymptotically large d, that any such induced subgraph has size density at most 2(\log d)/d for asymptotically large d . A matching lower bound is known for independent sets.
Edit intent: clarity
Original:  We also prove an analogous result for sparse Erdos-R\'{e}nyi graphs.
Revised:  We also prove the analogous result for sparse Erdos-R\'{e}nyi graphs.
Edit intent: fluency
Original: Parkinson's disease , an idiopathic and degenerative disorder of the central nervous system, is characterized by increased reaction times (by as much as 0.1 sec) in voluntary movements and often results in among other symptoms unintended tremulous (oscillatory) motion of body parts not in action, termed as Parkinsonian tremor .
Revised: Parkinson's disease (PD) is a neurodegenerative disorder and patients suffering from PD experience a variety of biomechanical symptoms including tremors, stooping, rigidity, and gait instability. PD is also characterized by a permanent increase in response time in both voluntary and involuntary motor responses. Although the deterioration in biomechanical control can intuitively be related to sluggish response times, how the increase in response time leads to such biomechanical symptoms such as tremor and stooping is not yet understood. In fact, the implicit assumption has been that the increased response time is an independent symptom separate from the biomechanical symptoms .
Edit intent: coherence
Original: Parkinson's disease (PD) is a neurodegenerative disorder and patients suffering from PD experience a variety of biomechanical symptoms including tremors, stooping , rigidity, and gait instability.
Revised: Parkinson's disease (PD) is a neurodegenerative disorder and patients suffering from PD experience a variety of biomechanical symptoms such as tremors, stooping , rigidity, and gait instability.
Edit intent: clarity
Original: Parkinson's disease (PD) is a neurodegenerative disorder and patients suffering from PD experience a variety of biomechanical symptoms including tremors, stooping , rigidity, and gait instability.
Revised: Parkinson's disease (PD) is a neurodegenerative disorder and patients suffering from PD experience a variety of biomechanical symptoms including tremors, stooping and gait instability.
Edit intent: clarity
Original:  PD is also characterized by a permanent increase in response time in both voluntary and involuntary motor responses.
Edit intent: coherence
Original:  Although the deterioration in biomechanical control can intuitively be related to sluggish response times, how the increase in response time leads to such biomechanical symptoms such as tremor and stooping is not yet understood.
Revised:  Although the deterioration in biomechanical control can intuitively be related to sluggish response times, how the delay leads to such biomechanical symptoms such as tremor and stooping is not yet understood.
Edit intent: clarity
Original:  Although the deterioration in biomechanical control can intuitively be related to sluggish response times, how the increase in response time leads to such biomechanical symptoms such as tremor and stooping is not yet understood.
Revised:  Although the deterioration in biomechanical control can intuitively be related to sluggish response times, how the increase in response time leads to such biomechanical symptoms as tremor is not yet understood.
Edit intent: clarity
Original:  The risk-subjective measure provides an internal consistency in pricing and hedging contingent claims and  explains the phenomena.
Revised:  The risk-subjective measure provides an internal consistency in pricing and hedging contingent claims and importantly explains the phenomena.
Edit intent: clarity
Original:  We propose that the market is incomplete and postulate the existence of an intrinsic risk in every contingent claim as a basis for understanding the phenomena.
Revised:  We propose that the market is incomplete and postulate the existence of an intrinsic risk in every contingent claim as a basis for understanding these phenomena.
Edit intent: fluency
Original:  The risk-subjective measure and the measure of intrinsic risk provide an internal consistency in pricing and hedging contingent claims and importantly explains the phenomena .
Revised:  The risk-subjective measure and the measure of intrinsic risk is a crucial ingredient for explaining these phenomena, and in consequence proposes a new approach to pricing and hedging contingent claims and importantly explains the phenomena .
Edit intent: coherence
Original: We examine the nature of some well-known phenomena such as volatility smiles, convexity adjustments and parallel derivative markets.
Revised: We review the nature of some well-known phenomena such as volatility smiles, convexity adjustments and parallel derivative markets.
Edit intent: fluency
Original:  We propose that the market is incomplete and postulate the existence of an intrinsic risk in every contingent claim as a basis for understanding these phenomena.
Revised:  We propose that the market is incomplete and postulate the existence of intrinsic risks in every contingent claim as a basis for understanding these phenomena.
Edit intent: fluency
Original: Source-sensitive  routing is a routing technique where routing decisions are made according to both the source and the destination address of a packet.
Revised: Source-sensitive routing is a routing technique where routing decisions depend on both the source and the destination address of a packet.
Edit intent: clarity
Original:  This is a slight refinement of ordinary next-hop routing, as used in the Global Internet, where packets are routed according to their destination only.
Edit intent: coherence
Original: Source-sensitive (or source address-dependent) routing is a routing technique where routing decisions depend on both the source and the destination address of a packet.
Revised: Source-specific (or source address-dependent) routing is a routing technique where routing decisions depend on both the source and the destination address of a packet.
Edit intent: clarity
Original:  Source-sensitive routing solves some difficult problems related to multihoming in some topologies , and is therefore a useful addition to the multihoming toolbox.
Revised:  Source-specific routing solves some difficult problems related to multihoming in some topologies , and is therefore a useful addition to the multihoming toolbox.
Edit intent: clarity
Original:  In this paper, we describe the semantics of source-sensitive packet forwarding, and describe our implementation of a source-sensitive extension to the Babel routing protocol --- to our knowledge, the first complete implementation of source-sensitive routing ---, including a disambiguation algorithm that makes our implementation work over standard networking APIs.
Revised:  In this paper, we describe the semantics of source-specific packet forwarding, and describe our implementation of a source-sensitive extension to the Babel routing protocol --- to our knowledge, the first complete implementation of source-sensitive routing ---, including a disambiguation algorithm that makes our implementation work over standard networking APIs.
Edit intent: clarity
Original:  In this paper, we describe the semantics of source-sensitive packet forwarding, and describe our implementation of a source-sensitive extension to the Babel routing protocol --- to our knowledge, the first complete implementation of source-sensitive routing ---, including a disambiguation algorithm that makes our implementation work over standard networking APIs.
Revised:  In this paper, we describe the semantics of source-sensitive packet forwarding, and describe our implementation of a source-sensitive extension to the Babel routing protocol --- to our knowledge, the first complete implementation of source-sensitive routing ---, including a disambiguation algorithm that makes our implementation work over widely available networking APIs.
Edit intent: clarity
Original: Source-specific (or source address-dependent) routing is a routing technique where routing decisions depend on both the source and the destination address of a packet.
Revised: Source-specific routing (not to be confused with source routing) is a routing technique where routing decisions depend on both the source and the destination address of a packet.
Edit intent: clarity
Original:  In this paper, we describe the semantics of source-specific packet forwarding, and describe our implementation of a source-specific extension to the Babel routing protocol --- to our knowledge, the first complete implementation of  source-specific routing --- , including a disambiguation algorithm that makes our implementation work over widely available networking APIs.
Revised:  In this paper, we describe the semantics of source-specific packet forwarding, and describe our implementation of a source-specific extension to the Babel routing protocol --- to our knowledge, the first complete implementation of a source-specific routing --- , including a disambiguation algorithm that makes our implementation work over widely available networking APIs.
Edit intent: fluency
Original:  This generalizes a result obtained by Huber, Krokhin and Powell for finite-valued CSP . We consider operations called weighted polymorphisms, that are known to determine the complexity of VCSPs . We introduce notions of weighted algebra and weighted variety, and show a connection, with respect to the complexity of the associated languages, between a weighted algebra and a weighted variety it generates ] ]  ivn\'y 2013}] .
Revised:  This generalizes a result obtained by Huber, Krokhin and Powell for finite-valued CSP . We consider operations called weighted polymorphisms, that are known to determine the complexity of VCSPs . We introduce notions of weighted algebra and weighted variety, and show a connection, with respect to the complexity of the associated languages, between a weighted algebra and a weighted variety it generates ], finite-valued VCSPs ] ivn\'y 2013}] .
Edit intent: fluency
Original:  prove the hardness direction and verify that it agrees with known results for VCSPs on two-element sets [Cohen et al. 2006], finite-valued VCSPs [Thapper and \v{Zivn\'y }  2013] and conservative VCSPs [Kolmogorov and \v{Zivn\'y }  2013].
Revised:  prove the hardness direction and verify that it agrees with known results for VCSPs on two-element sets [Cohen et al. 2006], finite-valued VCSPs [Thapper and ivn\'y } 2013] and conservative VCSPs [Kolmogorov and \v{Zivn\'y } 2013].
Edit intent: fluency
Original:  prove the hardness direction and verify that it agrees with known results for VCSPs on two-element sets [Cohen et al. 2006], finite-valued VCSPs [Thapper and \v{Zivn\'y }  2013] and conservative VCSPs [Kolmogorov and \v{Zivn\'y }  2013].
Revised:  prove the hardness direction and verify that it agrees with known results for VCSPs on two-element sets [Cohen et al. 2006], finite-valued VCSPs [Thapper and \v{Zivn\'y } 2013] and conservative VCSPs [Kolmogorov and ivn\'y } 2013].
Edit intent: fluency
Original:  prove the hardness direction and verify that it agrees with known results for VCSPs on two-element sets [Cohen et al. 2006], finite-valued VCSPs [Thapper and \v{Zivn\'y }  2013] and conservative VCSPs [Kolmogorov and \v{Zivn\'y }  2013].
Revised:  prove the hardness direction and verify that it agrees with known results for VCSPs on two-element sets [Cohen et al. 2006], finite-valued VCSPs [Thapper and \v{Zivn\'y } 2013] and conservative VCSPs [Kolmogorov and \v{Zivn\'y } Zivny 2013].
Edit intent: clarity
Original:  Both constructions are built on the level of spaces, i.e. as sequences of simplicial complexes induced by nerves.
Revised:  Both are constructed on the level of spaces, i.e. as sequences of simplicial complexes induced by nerves.
Edit intent: clarity
Original:  A prominent example is of weighted disks in the plane for which, after a series of papers, Varadarajan ~\mbox{ V09  Chan \etal~ \mbox{ CGKS12 a O(1)-approximation algorithm for computing minimum-weight set-covers.
Revised:  One is that of weighted disks in the plane for which, after a series of papers, Varadarajan ~\mbox{ V09 Chan \etal~ \mbox{ CGKS12 a O(1)-approximation algorithm for computing minimum-weight set-covers.
Edit intent: clarity
Original:  For the fundamental class of objects called pseudodisks (  disks, unit-height rectangles, translates of a convex set) , even a PTAS for the unweighted case is a long-standing open problem .
Revised:  For the fundamental class of objects called pseudodisks ( which includes disks, unit-height rectangles, translates of a convex set) , even a PTAS for the unweighted case is a long-standing open problem .
Edit intent: clarity
Original:  In this paper, our main result is presenting a QPTAS for both these problems based on the framework of Adamaszek and Weise~\mbox{ \cite{AW13, AW14}\hspace{0pt} , }  who recently obtained  QPTAS for weighted independent set of polygonal regions.
Revised:  In this paper, we present a QPTAS for both these problems based on the framework of Adamaszek and Weise~\mbox{ \cite{AW13, AW14}\hspace{0pt} , } who recently obtained QPTAS for weighted independent set of polygonal regions.
Edit intent: coherence
Original:  In this paper, our main result is presenting a QPTAS for both these problems based on the framework of Adamaszek and Weise~\mbox{ \cite{AW13, AW14}\hspace{0pt} , }  who recently obtained  QPTAS for weighted independent set of polygonal regions.
Revised:  In this paper, our main result is presenting a QPTAS for both these problems based on the }\hspace{0pt} , } who recently obtained QPTAS for weighted independent set of polygonal regions.
Edit intent: clarity
Original:  In this paper, our main result is presenting a QPTAS for both these problems based on the framework of Adamaszek and Weise~\mbox{ \cite{AW13, AW14}\hspace{0pt} , }  who recently obtained  QPTAS for weighted independent set of polygonal regions.
Revised:  In this paper, our main result is presenting a QPTAS for both these problems based on the framework of Adamaszek and Weise~\mbox{ \cite{AW13, AW14}\hspace{0pt} , } who recently obtained a QPTAS for weighted independent set of polygonal regions.
Edit intent: fluency
Original:  however their relevance to\textbf{} \nsubseteq \textbf{  set-cover was surprising to us .
Revised:  however their relevance to\textbf{} \nsubseteq \textbf{ set-cover problems .
Edit intent: clarity
Original: In financial markets, the order flow, defined as the process assuming value one for buy market order and minus one for sell market orders, displays  very slowly decaying autocorrelation function.
Revised: In financial markets, the order flow, defined as the process assuming value one for buy market orders and minus one for sell market orders, displays very slowly decaying autocorrelation function.
Edit intent: fluency
Original: In financial markets, the order flow, defined as the process assuming value one for buy market order and minus one for sell market orders, displays  very slowly decaying autocorrelation function.
Revised: In financial markets, the order flow, defined as the process assuming value one for buy market order and minus one for sell market orders, displays a very slowly decaying autocorrelation function.
Edit intent: fluency