wanyu/IteraTeR_v2 huggingface dataset:
Original:  In particular, they would like to see content providers  pay for use of the network, given the large amount of resources they use.
Revised:  In particular, they would like to see content providers (CPs) pay for use of the network, given the large amount of resources they use.
Edit intent: clarity
Original:  We introduce a model that includes the internaut' s behavior, the utilities of the ISP and of the content providers , and the monetary flow that involves the internauts , the ISP and content provider , and in particular, the content provider 's revenues from advertisements.
Revised:  We introduce a model that includes the users' behavior, the utilities of the ISP and of the content providers , and the monetary flow that involves the internauts , the ISP and content provider , and in particular, the content provider 's revenues from advertisements.
Edit intent: clarity
Original:  We introduce a model that includes the internaut' s behavior, the utilities of the ISP and of the content providers , and the monetary flow that involves the internauts , the ISP and content provider , and in particular, the content provider 's revenues from advertisements.
Revised:  We introduce a model that includes the internaut' s behavior, the utilities of the ISP and of the CPs , and the monetary flow that involves the internauts , the ISP and content provider , and in particular, the content provider 's revenues from advertisements.
Edit intent: clarity
Original:  We introduce a model that includes the internaut' s behavior, the utilities of the ISP and of the content providers , and the monetary flow that involves the internauts , the ISP and content provider , and in particular, the content provider 's revenues from advertisements.
Revised:  We introduce a model that includes the internaut' s behavior, the utilities of the ISP and of the content providers , and the monetary flow that involves the content users , the ISP and content provider , and in particular, the content provider 's revenues from advertisements.
Edit intent: clarity
Original:  We introduce a model that includes the internaut' s behavior, the utilities of the ISP and of the content providers , and the monetary flow that involves the internauts , the ISP and content provider , and in particular, the content provider 's revenues from advertisements.
Revised:  We introduce a model that includes the internaut' s behavior, the utilities of the ISP and of the content providers , and the monetary flow that involves the internauts , the ISP and CP , and in particular, the content provider 's revenues from advertisements.
Edit intent: clarity
Original:  We introduce a model that includes the internaut' s behavior, the utilities of the ISP and of the content providers , and the monetary flow that involves the internauts , the ISP and content provider , and in particular, the content provider 's revenues from advertisements.
Revised:  We introduce a model that includes the internaut' s behavior, the utilities of the ISP and of the content providers , and the monetary flow that involves the internauts , the ISP and content provider , and in particular, the CP 's revenues from advertisements.
Edit intent: clarity
Original:  We consider various game models and study the resulting equilibrium ;
Revised:  We consider various game models and study the resulting equilibria ;
Edit intent: fluency
Original:  they are all combinations of a noncooperative game (in which the service and content providers determine how much they will charge the internauts ) with a cooperative one - the content provider and the service provider bargain with each other over paymentsto one another .
Revised:  they are all combinations of a noncooperative game (in which the service and content providers determine how much they will charge the users ) with a cooperative one - the content provider and the service provider bargain with each other over paymentsto one another .
Edit intent: fluency
Original:  We include in our model a possible asymmetric bargaining power which is represented by a parameter (that varies between zero to one).
Revised:  We include in our model a possible asymmetric weighting parameter (that varies between zero to one).
Edit intent: clarity
Original:  We also study  two dynamic game models and study the convergence of prices to equilibrium value .
Revised:  We also study two dynamic game models and study the convergence of prices to the equilibrium values .
Edit intent: fluency
Original:  the offspring can be male or female with equal probabilities .
Revised:  the offspring can be male or female with equal probability .
Edit intent: fluency
Original:  Our goal is to provide system designers with concrete information to help them choose the most relevant parameters and code design for regenerating codes.
Revised:  Our goal is to provide system designers with concrete information to help them choose the best parameters and design for regenerating codes.
Edit intent: clarity
Original:  namely, there exists a function f depending only on H such that, for every graph G and every integer k\in%DIFDELCMD < \N%%% , either G has k vertex-disjoint subgraphs each containing H as a minor, or there exists a subset X of vertices of G with |X| \leq f(k) such that G - X has no H-minor.
Revised:  namely, there exists a function f depending only on H such that, for every graph G and every %DIFDELCMD < \N%%% , either G has k vertex-disjoint subgraphs each containing H as a minor, or there exists a subset X of vertices of G with |X| \leq f(k) such that G - X has no H-minor.
Edit intent: clarity
Original:  While the best function f currently known is super-exponential in k, a O(k \log k) bound is known in the special case where H is a forest.
Revised:  While the best function f currently known is exponential in k, a O(k \log k) bound is known in the special case where H is a forest.
Edit intent: clarity
Original:  This is best possible in the sense that no linear bound exists if H has a cycle.
Revised:  This is best possible in the sense that no linear bound is possible if H has a cycle.
Edit intent: clarity
Original:  The Boolean functions that appear in published models tend to have special properties, in particular the property of being nested canalizing, a property inspired by the concept of canalization in evolutionary biology.
Revised:  The Boolean functions that appear in published models tend to have special properties, in particular the property of being nested canalizing, a concept inspired by the concept of canalization in evolutionary biology.
Edit intent: fluency
Original:  Additional metrics analyzed include Hamming weight, the activity number of any variable, and the average sensitivity of the function.
Revised:  Additional metrics considered include Hamming weight, the activity number of any variable, and the average sensitivity of the function.
Edit intent: clarity
Original:  We present a fixed-parameter algorithm solving this problem with an exponential worst-case runtime of O* (1.79 ^run(T)), where run(T)}\cdot n\cdot k), where run} (T) denotes the number of alternating runs of T.
Revised:  In this paper, we present a fixed-parameter algorithm solving this problem with an exponential worst-case runtime of O* (1.79 ^run(T)), where run(T)}\cdot n\cdot k), where run} (T) denotes the number of alternating runs of T.
Edit intent: clarity
Original:  We present a fixed-parameter algorithm solving this problem with an exponential worst-case runtime of O* (1.79 ^run(T)), where run(T)}\cdot n\cdot k), where run} (T) denotes the number of alternating runs of T.
Revised:  We present a fixed-parameter algorithm solving this problem with a worst-case runtime of O* (1.79 ^run(T)), where run(T)}\cdot n\cdot k), where run} (T) denotes the number of alternating runs of T.
Edit intent: clarity
Original:  This is the first algorithm that improves upon the O*(\cdot n\cdot k) algorithm which is the first to beat the exponential } 2^n ) runtime required by brute-force search without imposing restrictions on P and T.
Revised:  This is the first algorithm that improves upon the O*(\cdot n\cdot k) algorithm which is the first to beat the exponential } 2^n runtime of brute-force search without imposing restrictions on P and T.
Edit intent: clarity
Original:  Furthermore we prove that -- under standard complexity theoretic assumptions -- such a fixed-parameter tractability result is not possible for run (P).
Revised:  Furthermore we prove that under standard complexity theoretic assumptions -- such a fixed-parameter tractability result is not possible for run (P).
Edit intent: fluency
Original:  Furthermore we prove that -- under standard complexity theoretic assumptions -- such a fixed-parameter tractability result is not possible for run (P).
Revised:  Furthermore we prove that -- under standard complexity theoretic assumptions such a fixed-parameter tractability result is not possible for run (P).
Edit intent: fluency
Original:  Mean-field approximations are often used to invert the relationship between the model parameters (external fields and couplings between spins) and observables (magnetisations and correlations)  , allowing to determine model parameters from data.
Revised:  Mean-field approximations are often used to invert the relationship between model parameters and observables (magnetisations and correlations) , allowing to determine model parameters from data.
Edit intent: clarity
Original:  Mean-field approximations are often used to invert the relationship between the model parameters (external fields and couplings between spins) and observables (magnetisations and correlations)  , allowing to determine model parameters from data.
Revised:  Mean-field approximations are often used to invert the relationship between the model parameters (external fields and couplings between spins) and observables (magnetisations and correlations) mean-field approximations are often used , allowing to determine model parameters from data.
Edit intent: coherence
Original:  In this note, we show how clustering spin configurations can approximate  thermodynamic states, and how mean-field methods applied to these thermodynamic states allow to reconstruct Ising models also at low temperatures.
Revised:  In this note, we show how clustering spin configurations can approximate these thermodynamic states, and how mean-field methods applied to these thermodynamic states allow to reconstruct Ising models also at low temperatures.
Edit intent: fluency
Original:  In this note, we show how clustering spin configurations can approximate  thermodynamic states, and how mean-field methods applied to these thermodynamic states allow to reconstruct Ising models also at low temperatures.
Revised:  In this note, we show how clustering spin configurations can approximate thermodynamic states, and how mean-field methods applied to thermodynamic states allow to reconstruct Ising models also at low temperatures.
Edit intent: clarity
Original:  In this note, we show how clustering spin configurations can approximate  thermodynamic states, and how mean-field methods applied to these thermodynamic states allow to reconstruct Ising models also at low temperatures.
Revised:  In this note, we show how clustering spin configurations can approximate thermodynamic states, and how mean-field methods applied to these thermodynamic states allow an efficient reconstruction of Ising models also at low temperatures.
Edit intent: clarity
Original: We propose a pooling method to aggregate expert opinions.
Revised: An important question when eliciting opinions from experts is how to aggregate the reported opinions. In this paper, we propose a pooling method to aggregate expert opinions.
Edit intent: clarity
Original:  We prove that such an updating process leads to consensus, i.e. , the experts all converge towards the same opinion.
Revised:  We prove that such an updating process leads to consensus, i.e. , the experts all converge towards the same opinion.
Edit intent: fluency
Original:  Further, we show that if  experts are rewarded using the quadratic scoring rule, then the above mentioned assumption follows naturally.
Revised:  Further, we show that if rational experts are rewarded using the quadratic scoring rule, then the above mentioned assumption follows naturally.
Edit intent: clarity
Original:  We empirically demonstrate the efficacy of our method using real-world data.
Revised:  We empirically demonstrate the efficacy of the proposed method using real-world data.
Edit intent: clarity
Original: This paper proposes a method to find efficient bounded algorithms of NPC problems by machine enumeration.
Revised: This paper proposes a thought experiment to search for efficient bounded algorithms of NPC problems by machine enumeration.
Edit intent: clarity
Original:  The key contributions are: * On Universal Turing Machines, a program's time complexity should be characterized as: execution time(n) = loading time(n) + running time(n).
Revised:  The key contributions are: -- On Universal Turing Machines, a program's time complexity should be characterized as: execution time(n) = loading time(n) + running time(n).
Edit intent: clarity
Original:  * Introduces the concept of bounded algorithms;
Revised:  -- Introduces the concept of bounded algorithms;
Edit intent: fluency
Original:  * Introduces a new way to evaluate program complexity by using the growth rate characteristic function  , which is more easily machine checkable based on observations  .
Revised:  -- Introduces the growth rate characteristic function , which is more easily machine checkable based on observations .
Edit intent: coherence
Original:  * Introduces a new way to evaluate program complexity by using the growth rate characteristic function  , which is more easily machine checkable based on observations  .
Revised:  * Introduces a new way to evaluate program complexity by using the growth rate characteristic function to evaluate program complexity , which is more easily machine checkable based on observations .
Edit intent: clarity
Original: In this paper we demonstrate the capability of automatically deriving the discrete adjoint and tangent linear models from a forward model written in the high-level FEniCS finite element computing environment.
Revised: In this paper we demonstrate a new technique for deriving discrete adjoint and tangent linear models from a forward model written in the high-level FEniCS finite element computing environment.
Edit intent: clarity
Original:   Our approach to automated adjoint derivation relies on run-time annotation of the temporal structure of the model, and employs the same finite element form compiler to automatically generate the low-level code for the derived models.
Revised:  Our approach to automated adjoint derivation relies on run-time annotation of the temporal structure of the model, and employs the FEniCS finite element form compiler to automatically generate the low-level code for the derived models.
Edit intent: clarity
Original:  The generality and applicability of the approach is demonstrated with examples from a wide range of scientific applications.
Revised:  The generality , applicability and efficiency of the approach is demonstrated with examples from a wide range of scientific applications.
Edit intent: clarity
Original:  The generality and applicability of the approach is demonstrated with examples from a wide range of scientific applications.
Revised:  The generality and applicability of the approach are demonstrated with examples from a wide range of scientific applications.
Edit intent: fluency
Original: We explore a class of hybrid (piecewise deterministic) systems characterized by a relatively large number of individuals inhabiting an environment whose state is described by a set of continuous variables.
Revised: We explore a class of hybrid (piecewise deterministic) systems characterized by a large number of individuals inhabiting an environment whose state is described by a set of continuous variables.
Edit intent: clarity
Original:  We use analytical and numerical methods of nonequilibrium statistical mechanics to study the influence that intrinsic noise has on the qualitative behavior of the system.
Revised:  We use analytical and numerical methods from nonequilibrium statistical mechanics to study the influence that intrinsic noise has on the qualitative behavior of the system.
Edit intent: clarity
Original:  We discuss the application of these concepts to the case of semi-arid ecosystems.
Revised:  We discuss the application of these concepts to the case of semiarid ecosystems.
Edit intent: fluency
Original:  Using a system-size expansion we calculate the power spectrum of the fluctuations in the system which predicts the existence of noise-induced oscillations.
Revised:  Using a system-size expansion we calculate the power spectrum of the fluctuations in the system . This predicts the existence of noise-induced oscillations.
Edit intent: coherence
Original: In this paper we continue the study of the edge intersection graphs of single bend paths on a rectangular grid (i. e. , the edge intersection graphs where each vertex is represented by one of the following shapes: L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% ,%DIFDELCMD < \rfloor%%% ) \llcorner\ulcorner\urcorner\lrcorner\llcorners .
Revised: In this paper we continue the study of the edge intersection graphs of single bend paths on a rectangular grid . That is , the edge intersection graphs where each vertex is represented by one of the following shapes: L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% ,%DIFDELCMD < \rfloor%%% ) \llcorner\ulcorner\urcorner\lrcorner\llcorners .
Edit intent: coherence
Original: In this paper we continue the study of the edge intersection graphs of single bend paths on a rectangular grid (i. e. , the edge intersection graphs where each vertex is represented by one of the following shapes: L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% ,%DIFDELCMD < \rfloor%%% ) \llcorner\ulcorner\urcorner\lrcorner\llcorners .
Revised: In this paper we continue the study of the edge intersection graphs of single bend paths on a rectangular grid (i. e. , the edge intersection graphs where each vertex is represented by one of the following shapes: %DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% ,%DIFDELCMD < \rfloor%%% ) \llcorner\ulcorner\urcorner\lrcorner\llcorners .
Edit intent: coherence
Original: In this paper we continue the study of the edge intersection graphs of single bend paths on a rectangular grid (i. e. , the edge intersection graphs where each vertex is represented by one of the following shapes: L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% ,%DIFDELCMD < \rfloor%%% ) \llcorner\ulcorner\urcorner\lrcorner\llcorners .
Revised: In this paper we continue the study of the edge intersection graphs of single bend paths on a rectangular grid (i. e. , the edge intersection graphs where each vertex is represented by one of the following shapes: L,%DIFDELCMD < \lceil%%% %DIFDELCMD < \rceil%%% ,%DIFDELCMD < \rfloor%%% ) \llcorner\ulcorner\urcorner\lrcorner\llcorners .
Edit intent: fluency
Original: In this paper we continue the study of the edge intersection graphs of single bend paths on a rectangular grid (i. e. , the edge intersection graphs where each vertex is represented by one of the following shapes: L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% ,%DIFDELCMD < \rfloor%%% ) \llcorner\ulcorner\urcorner\lrcorner\llcorners .
Revised: In this paper we continue the study of the edge intersection graphs of single bend paths on a rectangular grid (i. e. , the edge intersection graphs where each vertex is represented by one of the following shapes: L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% %DIFDELCMD < \rfloor%%% ) \llcorner\ulcorner\urcorner\lrcorner\llcorners .
Edit intent: fluency
Original: In this paper we continue the study of the edge intersection graphs of single bend paths on a rectangular grid (i. e. , the edge intersection graphs where each vertex is represented by one of the following shapes: L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% ,%DIFDELCMD < \rfloor%%% ) \llcorner\ulcorner\urcorner\lrcorner\llcorners .
Revised: In this paper we continue the study of the edge intersection graphs of single bend paths on a rectangular grid (i. e. , the edge intersection graphs where each vertex is represented by one of the following shapes: L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% ,%DIFDELCMD < \rfloor%%% \llcorner\ulcorner\urcorner\lrcorner\llcorners .
Edit intent: fluency
Original: In this paper we continue the study of the edge intersection graphs of single bend paths on a rectangular grid (i. e. , the edge intersection graphs where each vertex is represented by one of the following shapes: L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% ,%DIFDELCMD < \rfloor%%% ) \llcorner\ulcorner\urcorner\lrcorner\llcorners .
Revised: In this paper we continue the study of the edge intersection graphs of single bend paths on a rectangular grid (i. e. , the edge intersection graphs where each vertex is represented by one of the following shapes: L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% ,%DIFDELCMD < \rfloor%%% ) \llcorner,\ulcorner\urcorner\lrcorner\llcorners .
Edit intent: fluency
Original: In this paper we continue the study of the edge intersection graphs of single bend paths on a rectangular grid (i. e. , the edge intersection graphs where each vertex is represented by one of the following shapes: L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% ,%DIFDELCMD < \rfloor%%% ) \llcorner\ulcorner\urcorner\lrcorner\llcorners .
Revised: In this paper we continue the study of the edge intersection graphs of single bend paths on a rectangular grid (i. e. , the edge intersection graphs where each vertex is represented by one of the following shapes: L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% ,%DIFDELCMD < \rfloor%%% ) \llcorner\ulcorner,\urcorner\lrcorner\llcorners .
Edit intent: fluency
Original: In this paper we continue the study of the edge intersection graphs of single bend paths on a rectangular grid (i. e. , the edge intersection graphs where each vertex is represented by one of the following shapes: L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% ,%DIFDELCMD < \rfloor%%% ) \llcorner\ulcorner\urcorner\lrcorner\llcorners .
Revised: In this paper we continue the study of the edge intersection graphs of single bend paths on a rectangular grid (i. e. , the edge intersection graphs where each vertex is represented by one of the following shapes: L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% ,%DIFDELCMD < \rfloor%%% ) \llcorner\ulcorner\urcorner,\lrcorner\llcorners .
Edit intent: fluency
Original:  We focus on the class L%DIFDELCMD < ] %%% (the edge intersection graphs of L-shapes) and show that testing for membership in L%DIFDELCMD < ] %%% is NP-complete.
Revised:  We L%DIFDELCMD < ] %%% (the edge intersection graphs of L-shapes) and show that testing for membership in L%DIFDELCMD < ] %%% is NP-complete.
Edit intent: coherence
Original:  We focus on the class L%DIFDELCMD < ] %%% (the edge intersection graphs of L-shapes) and show that testing for membership in L%DIFDELCMD < ] %%% is NP-complete.
Revised:  We focus on the class %DIFDELCMD < ] %%% (the edge intersection graphs of L-shapes) and show that testing for membership in L%DIFDELCMD < ] %%% is NP-complete.
Edit intent: fluency
Original:  We focus on the class L%DIFDELCMD < ] %%% (the edge intersection graphs of L-shapes) and show that testing for membership in L%DIFDELCMD < ] %%% is NP-complete.
Revised:  We focus on the class L%DIFDELCMD < ] %%% L%DIFDELCMD < ] %%% is NP-complete.
Edit intent: coherence
Original:  We focus on the class L%DIFDELCMD < ] %%% (the edge intersection graphs of L-shapes) and show that testing for membership in L%DIFDELCMD < ] %%% is NP-complete.
Revised:  We focus on the class L%DIFDELCMD < ] %%% (the edge intersection graphs of L-shapes) and show that testing for membership in %DIFDELCMD < ] %%% is NP-complete.
Edit intent: fluency