wanyu/IteraTeR_v2 huggingface dataset:
Original: A representative investor who sells the market asset if it has two consecutive upticks or two consecutive downticks, and buys otherwise, generates realistic and complex security price paths if his order is delayed a few ticks .
Revised: A representative investor who sells the market asset if it has two consecutive upticks or two consecutive downticks, then sell, and otherwise buy .
Edit intent: clarity
Original:  We propose a model of a deterministic walker, visiting sites randomly distributed on the plane and with varying weight or attractiveness.
Revised:  In this work we study a model of a deterministic walker, visiting sites randomly distributed on the plane and with varying weight or attractiveness.
Edit intent: clarity
Original:  At each step, the walker minimises a function that depends on the distance to the next unvisited target (cost) and on the weight of that target (gain).
Revised:  At each step, the walker minimizes a function that depends on the distance to the next unvisited target (cost) and on the weight of that target (gain).
Edit intent: fluency
Original:  If the target weight distribution is a power-law, p(k)\sim k^{-\beta}, in some range of the exponent \beta, the foraging medium induces movements that are similar to L\'evy flights and are characterised by non-trivial exponents.
Revised:  If the target weight distribution is a power-law, p(k)\sim k^{-\beta}, in some range of the exponent \beta, the foraging medium induces movements that are similar to L\'evy flights and are characterized by non-trivial exponents.
Edit intent: fluency
Original:  Moreover, for several classes of proto-graphs we present explicit QC LDPC code constructions that achieve (or come close ) to the respective minimum Hamming distance upper bounds  .
Revised:  Moreover, for several classes of proto-graphs we present explicit QC LDPC code constructions that achieve (or come close to) the respective minimum Hamming distance upper bounds .
Edit intent: fluency
Original:  It can be adapted to e.g.  generate all maximum cardinality anticliques, or just one maximum anticlique.
Revised:  It can e.g. generate all maximum cardinality anticliques, or just one maximum anticlique.
Edit intent: clarity
Original:  The latter is our main achievement and was programmed using the Mathematica 6.0 code.
Revised:  The latter was programmed using the Mathematica 6.0 code.
Edit intent: coherence
Original:  The standard algorithm generates all N anticliques of a graph with v vertices in time O( N^v 2 ).
Revised:  The standard algorithm generates all N anticliques of a graph with v vertices in time O( 2 ).
Edit intent: clarity
Original:  For a random (45, 92)-graph G a maximum anticlique of size 21 was found in 1.344 sec, whereas the "hardwired" Mathematica command MaximumIndependentSet G%DIFDELCMD < ] %%% clocked in at 155838 sec, which is five orders of magnitude slower.{\it  
Revised:  For a random (45, 92)-graph G a maximum anticlique of size 21 was found in 1.344 sec, whereas the "hardwired" Mathematica command MaximumIndependentSet %DIFDELCMD < ] %%% clocked in at 155838 sec, which is five orders of magnitude slower.{\it 
Edit intent: fluency
Original:  For a random (45, 92)-graph G a maximum anticlique of size 21 was found in 1.344 sec, whereas the "hardwired" Mathematica command MaximumIndependentSet G%DIFDELCMD < ] %%% clocked in at 155838 sec, which is five orders of magnitude slower.{\it  
Revised:  For a random (45, 92)-graph G a maximum anticlique of size 21 was found in 1.344 sec, whereas the "hardwired" Mathematica command MaximumIndependentSet G%DIFDELCMD < ] %%% clocked in at 155838 sec, which is five orders of magnitude slower.{\it all 
Edit intent: clarity
Original: An odd cycle cover is a vertex set whose removal makes a graph bipartie .
Revised: An odd cycle cover is a vertex set whose removal makes a graph bipartite .
Edit intent: fluency
Original:  Generating {\it all}  N' anticliques (maximum or not) is easier and works for arbitrary graphs in time O(N'w^2).
Revised:  Generating {\it all} \ N' anticliques (maximum or not) is easier and works for arbitrary graphs in time O(N'w^2).
Edit intent: fluency
Original:  In fact the use of wildcards allows to compactly generate the anticliques in clusters 
Revised:  In fact the use of wildcards allows to compactly generate the anticliques in clusters .
Edit intent: fluency
Original: Transport of excitations through networked systems plays an important role in many areas of physics, chemistry, and biology.
Revised: Excitation transfer through interacting systems plays an important role in many areas of physics, chemistry, and biology.
Edit intent: clarity
Original:  Here we identify key mechanisms through which dephasing noise , contrary to expectation, may actually aid transport through a dissipative network .
Revised:  Here we identify key mechanisms through which dephasing noise , may actually aid transport through a dissipative network .
Edit intent: clarity
Original:  These are processes that lead to the suppression of destructive interference and exploitation of line broadening  .
Revised:  These are processes that lead to the inhibition of destructive interference and exploitation of line broadening .
Edit intent: clarity
Original:  These are processes that lead to the suppression of destructive interference and exploitation of line broadening  .
Revised:  These are processes that lead to the suppression of destructive interference and exploitation of line broadening effects .
Edit intent: clarity
Original:  In this paper we suggest a new application of these ideas in the context of the splicing process, a crucial step of mRNA maturation in Eukaryotes.
Revised:  In this paper we suggest a new application of these ideas in the context of the splicing process, a crucial step of messanger RNA maturation in Eukaryotes.
Edit intent: clarity
Original: Arrow's Impossibility Theorem states that any constitution which satisfies Transitivity, Independence of Irrelevant Alternatives and Unanimity has to be a dictator .
Revised: Arrow's Impossibility Theorem states that any constitution which satisfies Transitivity, Independence of Irrelevant Alternatives (IIA) and Unanimity is a dictatorship .
Edit intent: clarity
Original:  In fact even a weaker condition we call Weak Non Imposition suffices .
Revised:  In fact even a weaker condition we call Weak Non Imposition .
Edit intent: clarity
Original:  The Weak Non Imposition condition states that for every two alternatives a and b, there exists a profile of preferences where the social outcome ranks a above b  .
Revised:  The Weak Non Imposition condition states that for every two alternatives a and b, there exists a profile of preferences where the constitution ranks a above b .
Edit intent: clarity
Original: Arrow's Impossibility Theorem states that any constitution which satisfies Transitivity, Independence of Irrelevant Alternatives (IIA) and Unanimity is a dictatorship.
Revised: Arrow's Impossibility Theorem states that any constitution which satisfies Transitivity, Independence of Irrelevant Alternatives and Unanimity is a dictatorship.
Edit intent: clarity
Original:  The matrix is represented as a black-box, i.e., by a function to compute it's matrix-vector product.
Revised:  The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product.
Edit intent: fluency
Original: Inspired by problems in biochemical kinetics, we study statistical properties of an overdamped Langevin processes with the friction coefficient depending on the state of a similar, unobserved , process.
Revised: Inspired by problems in biochemical kinetics, we study statistical properties of an overdamped Langevin process whose friction coefficient depends on the state of a similar, unobserved , process.
Edit intent: clarity
Original: Inspired by problems in biochemical kinetics, we study statistical properties of an overdamped Langevin processes with the friction coefficient depending on the state of a similar, unobserved , process.
Revised: Inspired by problems in biochemical kinetics, we study statistical properties of an overdamped Langevin processes with the friction coefficient depending on the state of a similar, unobserved process.
Edit intent: fluency
Original:  Integrating out the latter, we derive the long time behavior of the mean square displacement.
Revised:  Integrating out the latter, we derive the long time behaviour of the mean square displacement.
Edit intent: fluency
Original:  Anomalous diffusion is found where the diffusion exponent can not be predicted using a simple scaling argument, and anomalous scaling appears as well.
Revised:  Anomalous diffusion is found . Since the diffusion exponent can not be predicted using a simple scaling argument, and anomalous scaling appears as well.
Edit intent: coherence
Original:  Anomalous diffusion is found where the diffusion exponent can not be predicted using a simple scaling argument, and anomalous scaling appears as well.
Revised:  Anomalous diffusion is found where the diffusion exponent can not be predicted using a simple scaling argument, anomalous scaling appears as well.
Edit intent: coherence
Original:  The findings caution against treating biochemical systems  with unobserved dynamical degrees of freedom by means of standard, diffusive Langevin description .
Revised:  The findings caution against treating biochemical systems coupled with unobserved dynamical degrees of freedom by means of standard, diffusive Langevin description .
Edit intent: clarity
Original:  The findings caution against treating biochemical systems  with unobserved dynamical degrees of freedom by means of standard, diffusive Langevin description .
Revised:  The findings caution against treating biochemical systems with unobserved dynamical degrees of freedom by means of standard, diffusive Langevin descriptions .
Edit intent: fluency
Original: One way to handle heterogeneous interfaces providing the same functionality is to use interface adapters to convert one interface into another.
Revised: Despite providing similar functionality, multiple network services may require the use of different interfaces to access the functionality, and this problem will only get worse with the widespread deployment of ubiquitous computing environments. One way around this problem is to use interface adapters to convert one interface into another.
Edit intent: clarity
Original: One way to handle heterogeneous interfaces providing the same functionality is to use interface adapters to convert one interface into another.
Revised: One way to handle heterogeneous interfaces providing the same functionality is to use interface adapters that adapt one interface into another.
Edit intent: clarity
Original: We develop in this paper an adaptive algorithm based on Bloom filters in order to identify large flows .
Revised: We propose in this paper an adaptive algorithm based on Bloom filters in order to identify large flows .
Edit intent: clarity
Original:  When tested against real traffic traces, the proposed  algorithm performs well in the sense that a high percentage of large flows in traffic are detected by the algorithm .
Revised:  When tested against real traffic traces, the proposed algorithm performs well in the sense that the detection ratio of long flows by the algorithm .
Edit intent: clarity
Original:  Since elephant detection issue is very close to flood attack detection, we adapt the proposed algorithm in order to detect SYN and volume flood attack in Internet traffic .
Revised:  Since elephant detection issue is very close to flood attack detection, we adapt the proposed algorithm in order to detect SYN and volume flood anomalies in Internet traffic .
Edit intent: clarity
Original:  The initial condition for a dynamic model, evolving towards the steady dependency distribution , determines the saturation properties of the mature scale-free network .
Revised:  The initial condition for a dynamic model, evolving towards the steady dependency distribution , determines the finite limit to the number of top nodes that the mature out-directed network can have .
Edit intent: clarity
Original:  the richest nodes, as well as the weakest nodes, deviate from this trend , and exhibit a saturation behaviour arising from the finiteness of semantic possibilities in the network.
Revised:  the most richly linked nodes, as well as the weakest nodes, deviate from this trend , and exhibit a saturation behaviour arising from the finiteness of semantic possibilities in the network.
Edit intent: clarity
Original:  the richest nodes, as well as the weakest nodes, deviate from this trend , and exhibit a saturation behaviour arising from the finiteness of semantic possibilities in the network.
Revised:  the richest nodes, as well as the most poorly linked nodes, deviate from this trend , and exhibit a saturation behaviour arising from the finiteness of semantic possibilities in the network.
Edit intent: clarity
Original: A continuum model has been proposed to fit the data pertaining to the directed networks in free and open-source software.
Revised: We propose a continuum model for the degree distribution of directed networks in free and open-source software.
Edit intent: clarity
Original:  Dynamic evolution of free software releases shows that the finite-size properties of the in-directed and out-directed networks are opposite in nature.
Edit intent: coherence
Original:  For the out-degree distribution, the initial condition for a dynamic evolution also corresponds to the limiting count of rich nodes that the mature out-directed network can  have.
Revised:  For the out-degree distribution, the initial condition for a dynamic evolution corresponds to the limiting count of rich nodes that the mature out-directed network can have.
Edit intent: clarity
Original:  For the out-degree distribution, the initial condition for a dynamic evolution also corresponds to the limiting count of rich nodes that the mature out-directed network can  have.
Revised:  For the out-degree distribution, the initial condition for a dynamic evolution also corresponds to the limiting count of the most heavily liked nodes that the mature out-directed network can have.
Edit intent: clarity
Original:  For the out-degree distribution, the initial condition for a dynamic evolution also corresponds to the limiting count of rich nodes that the mature out-directed network can  have.
Revised:  For the out-degree distribution, the initial condition for a dynamic evolution also corresponds to the limiting count of rich nodes that the out-directed network can have.
Edit intent: clarity
Original:  For the out-degree distribution, the initial condition for a dynamic evolution also corresponds to the limiting count of rich nodes that the mature out-directed network can  have.
Revised:  For the out-degree distribution, the initial condition for a dynamic evolution also corresponds to the limiting count of rich nodes that the mature out-directed network can finally have.
Edit intent: clarity
Original:  The number of nodes contributing out-directed links grows with each passing generation of software release, but this growth ultimately saturates towards a finite value due to the finiteness of semantic possibilities in the network.
Revised:  The number of nodes contributing out-directed links grows with every generation of software release, but this growth ultimately saturates towards a finite value due to the finiteness of semantic possibilities in the network.
Edit intent: clarity
Original:  The number of nodes contributing out-directed links grows with each passing generation of software release, but this growth ultimately saturates towards a finite value due to the finiteness of semantic possibilities in the network.
Revised:  The number of nodes contributing out-directed links grows with each passing generation of software release, but this growth ultimately saturates towards a terminal value due to the finiteness of semantic possibilities in the network.
Edit intent: clarity
Original:  We show how these properties are reflected in the prices of spread options and the put-call symmetry property in view of the well-known  duality principle in option pricing.
Revised:  We show how these properties are reflected in the prices of spread options and the put-call symmetry property in view of the well-known put-call symmetry property and the duality principle in option pricing.
Edit intent: coherence
Original:  Based on this, concrete semi-static hedging techniques for multiasset barrier options, such as certain weighted barrier spread options, weighted barrier swap options or weighted barrier quanto-swap options are suggested.
Revised:  Based on this, concrete semi-static hedging techniques for multi-asset barrier options, such as certain weighted barrier spread options, weighted barrier swap options or weighted barrier quanto-swap options are suggested.
Edit intent: fluency
Original: We study the complexity of Nash equilibria in simple stochastic multiplayer games.
Revised: We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games.
Edit intent: clarity
Original:  In particular, we prove the undecidability of the following problem : Given a game G, does there exist a pure-strategy Nash equilibrium of G where player 0 wins with probability 1.
Revised:  In particular, we prove that the following problem is undecidable : Given a game G, does there exist a pure-strategy Nash equilibrium of G where player 0 wins with probability 1.
Edit intent: clarity
Original:  One way to obtain a provably decidable variant of the problem is to restrict the strategies to be positional or stationary.
Revised:  One way to obtain a provably decidable variant of the problem is restricting the strategies to be positional or stationary.
Edit intent: fluency
Original: A well-known challenge with local (adaptive) histogram equalization (LHE) is over-enhancement (  generation of spurious details) in smooth areas .
Revised: A well-known issue of local (adaptive) histogram equalization (LHE) is over-enhancement ( generation of spurious details) in smooth areas .
Edit intent: clarity
Original: A well-known challenge with local (adaptive) histogram equalization (LHE) is over-enhancement (  generation of spurious details) in smooth areas .
Revised: A well-known challenge with local (adaptive) histogram equalization (LHE) is over-enhancement ( i.e., generation of spurious details) in smooth areas .
Edit intent: coherence
Original: A well-known challenge with local (adaptive) histogram equalization (LHE) is over-enhancement (  generation of spurious details) in smooth areas .
Revised: A well-known challenge with local (adaptive) histogram equalization (LHE) is over-enhancement ( generation of spurious details) in homogenous areas of the image .
Edit intent: clarity
Original:  Index Terms: perceptual image processing, block overlapped histogram modification or specification, contrast enhancement , propagation filtering.
Revised:  Index Terms: histogram modification or specification, contrast enhancement , propagation filtering.
Edit intent: clarity
Original:  Index Terms: perceptual image processing, block overlapped histogram modification or specification, contrast enhancement , propagation filtering.
Revised:  Index Terms: perceptual image processing, block overlapped histogram modification or specification, contrast enhancement 
Edit intent: coherence
Original: The acoustic field propagating in the early hot (p=\epsilon/ 3 ) universe of arbitrary space curvature (K=0, \pm 1) is considered.
Revised: In this paper the acoustic field propagating in the early hot (p=\epsilon/ 3 ) universe of arbitrary space curvature (K=0, \pm 1) is considered.
Edit intent: clarity
Original: We examine the computational complexity of context-free languages, mainly concentrating on two well-known structural properties--immunity and pseudorandomness.
Revised: We discuss the computational complexity of context-free languages, mainly concentrating on two well-known structural properties--immunity and pseudorandomness.
Edit intent: clarity
Original: We examine the computational complexity of context-free languages, mainly concentrating on two well-known structural properties--immunity and pseudorandomness.
Revised: We examine the computational complexity of context-free languages, concentrating on two well-known structural properties--immunity and pseudorandomness.
Edit intent: coherence
Original: We examine the computational complexity of context-free languages, mainly concentrating on two well-known structural properties--immunity and pseudorandomness.
Revised: We examine the computational complexity of context-free languages, mainly concentrating on two well-known structural properties---immunity and pseudorandomness.
Edit intent: fluency
Original:  We further prove that (iv) there is a context-free language that is REG/n-bi-primeimmune but not even REG-immune . Concerning pseudorandomness of context-free languages, we show that (v) CFL contains REG/n-pseudorandom languages.
Revised:  We further prove that (iv) there is a context-free language that is REG/n-bi-primeimmune . Concerning pseudorandomness of context-free languages, we show that (v) CFL contains REG/n-pseudorandom languages.
Edit intent: coherence
Original:  Finally, we prove that (vi) against REG/n, there exists an almost 1-1 pseudorandom generator computable in nondeterministic pushdown automata equipped with a write-only output tape and (vii) against REG, there is no almost 1-1 weak pseudorandom generator computable deterministically in linear time by a single-tape Turing machine.
Revised:  Finally, we prove that (vi) against REG/n, there exists an almost 1-1 pseudorandom generator computable in nondeterministic pushdown automata equipped with a write-only output tape and (vii) against REG, there is no almost 1-1 weakly pseudorandom generator computable deterministically in linear time by a single-tape Turing machine.
Edit intent: fluency
Original: We consider a simple market where a vendor offers multiple variants of a certain product . Preferences of the vendor and of potential buyers are heterogeneous and often antagonistic.
Revised: We consider a simple market where a vendor offers multiple variants of a certain product and preferences of both the vendor and of potential buyers are heterogeneous and often antagonistic.
Edit intent: clarity
Original: We consider a simple market where a vendor offers multiple variants of a certain product . Preferences of the vendor and of potential buyers are heterogeneous and often antagonistic.
Revised: We consider a simple market where a vendor offers multiple variants of a certain product . Preferences of the vendor and potential buyers are heterogeneous and often antagonistic.
Edit intent: fluency
Original: We consider a simple market where a vendor offers multiple variants of a certain product . Preferences of the vendor and of potential buyers are heterogeneous and often antagonistic.
Revised: We consider a simple market where a vendor offers multiple variants of a certain product . Preferences of the vendor and of potential buyers are heterogeneous and possibly even antagonistic.
Edit intent: clarity
Original:  We compare  optimal solutions found with and without a matchmaker, examine the resulting inequality between the market participants, and study the influence of correlations .
Revised:  We compare the optimal solutions found with and without a matchmaker, examine the resulting inequality between the market participants, and study the influence of correlations .
Edit intent: fluency
Original:  We compare  optimal solutions found with and without a matchmaker, examine the resulting inequality between the market participants, and study the influence of correlations .
Revised:  We compare optimal solutions found with and without a matchmaker, examine the resulting inequality between the market participants, and study the impact of correlations on the system .
Edit intent: clarity