wanyu/IteraTeR_v2 huggingface dataset:
Original:  We find that  in addition to the fraction of hydrophobic patches their spatial distribution along the backbone of the chain play a major role in altering its mechanical response.
Revised:  We find that in addition to the fraction of hydrophobic patches f play a major role in altering its mechanical response.
Edit intent: clarity
Original:  These results are discussed in light of the helix-coil model for biopolymers    .
Revised:  In particular, we show a plethora of equilibrium morphologies for this system, .
Edit intent: coherence
Original:  These results are discussed in light of the helix-coil model for biopolymers    .
Revised:  These results are discussed in light of the helix-coil model for biopolymers etc. .
Edit intent: coherence
Original:  Despite this critical role, a kinetic model of the underlying mechanism has not been developed and corroborated .
Revised:  Despite this critical role, a kinetic model of the underlying mechanism has not been developed and validated .
Edit intent: clarity
Original:  the estimated parameters are corroborated using six additional data curves.
Revised:  the estimated parameters are validated using six additional data curves.
Edit intent: clarity
Original: The Induced H-Matching problem asks to find k disjoint , induced subgraphs isomorphic to  H in a given graph G such that there are no edges between vertices of different subgraphs.
Revised: The Induced Graph Matching problem asks to find k disjoint , induced subgraphs isomorphic to H in a given graph G such that there are no edges between vertices of different subgraphs.
Edit intent: clarity
Original: The Induced H-Matching problem asks to find k disjoint , induced subgraphs isomorphic to  H in a given graph G such that there are no edges between vertices of different subgraphs.
Revised: The Induced H-Matching problem asks to find k disjoint induced subgraphs isomorphic to H in a given graph G such that there are no edges between vertices of different subgraphs.
Edit intent: fluency
Original: The Induced H-Matching problem asks to find k disjoint , induced subgraphs isomorphic to  H in a given graph G such that there are no edges between vertices of different subgraphs.
Revised: The Induced H-Matching problem asks to find k disjoint , induced subgraphs isomorphic to a given graph H in a given graph G such that there are no edges between vertices of different subgraphs.
Edit intent: fluency
Original:  We show that Induced H-Matching is fixed-parameter tractable in k on claw-free graphs when H is a fixed connected graph of constant size , and even admits a polynomial kernel when H is a clique .
Revised:  We show that Induced Graph Matching is fixed-parameter tractable in k on claw-free graphs when H is a fixed connected graph of constant size , and even admits a polynomial kernel when H is a clique .
Edit intent: clarity
Original:  We show that Induced H-Matching is fixed-parameter tractable in k on claw-free graphs when H is a fixed connected graph of constant size , and even admits a polynomial kernel when H is a clique .
Revised:  We show that Induced H-Matching is fixed-parameter tractable in k on claw-free graphs when H is a fixed connected graph , and even admits a polynomial kernel when H is a clique .
Edit intent: clarity
Original:  We show that Induced H-Matching is fixed-parameter tractable in k on claw-free graphs when H is a fixed connected graph of constant size , and even admits a polynomial kernel when H is a clique .
Revised:  We show that Induced H-Matching is fixed-parameter tractable in k on claw-free graphs when H is a fixed connected graph of constant size , and even admits a polynomial kernel when H is a complete graph .
Edit intent: clarity
Original:  To show the fixed-parameter tractability of the problem, we additionally apply the color-coding technique in a nontrivial way.
Edit intent: coherence
Original:  Complementing the above two positive results, we prove the W[1]-hardness of Induced H-Matching for graphs excluding K1 ,4 as an induced subgraph  .
Revised:  Complementing the above positive results, we prove the W[1]-hardness of Induced H-Matching for graphs excluding K1 ,4 as an induced subgraph .
Edit intent: clarity
Original:  Complementing the above two positive results, we prove the W[1]-hardness of Induced H-Matching for graphs excluding K1 ,4 as an induced subgraph  .
Revised:  Complementing the above two positive results, we prove W[1]-hardness of Induced H-Matching for graphs excluding K1 ,4 as an induced subgraph .
Edit intent: fluency
Original:  In particular, personal information is increasingly being exchanged in Identity Management (IdM) systems to satisfy the increasing need for reliable on-line identification and authentication.
Edit intent: coherence
Original:  One of the key principles in protecting privacy is data minimization .
Revised:  One of the key principles in protecting privacy is data minimisation .
Edit intent: fluency
Original:  This principle states that only the minimum amount of information necessary to accomplish a certain goal should be collected .
Revised:  This principle requires that only the minimum amount of information necessary to accomplish a certain goal should be collected .
Edit intent: clarity
Original:  Several " privacy-enhancing " IdM systems have been proposed to guarantee data minimization .
Revised:  Several " Privacy-enhancing " IdM systems have been proposed to guarantee data minimization .
Edit intent: fluency
Original:  Several " privacy-enhancing " IdM systems have been proposed to guarantee data minimization .
Revised:  Several " privacy-enhancing " communication protocols have been proposed to guarantee data minimization .
Edit intent: clarity
Original:  Then, we apply the formal method to studyfour IdM systems , representative of different research streams, analyse the results in a broad context, and suggest improvements.
Edit intent: coherence
Original:  Finally, we discuss the completeness and (re)usability of the proposed method .
Revised:  Finally, we discuss the completeness and (re)usability of the proposed framework .
Edit intent: clarity
Original:  Then we introduce a model that accurately predicts the performance of TCP on such environments . Based on this model, we propose a local resource allocation algorithm ( minmax disconnection time) that minimizes this TCP degradation with a very low computational cost.
Revised:  Then we introduce a model that accurately predicts the performance of TCP on such environments . Based on this model, we propose a resource allocation algorithm ( minmax disconnection time) that minimizes this TCP degradation with a very low computational cost.
Edit intent: clarity
Original:  Then we introduce a model that accurately predicts the performance of TCP on such environments . Based on this model, we propose a local resource allocation algorithm ( minmax disconnection time) that minimizes this TCP degradation with a very low computational cost.
Revised:  Then we introduce a model that accurately predicts the performance of TCP on such environments . Based on this model, we propose a local resource allocation algorithm ( min-max disconnection time) that minimizes this TCP degradation with a very low computational cost.
Edit intent: fluency
Original:  We  show that the performance of the algorithm is very close to the theoretical upper-bound in several simulation scenarios.
Revised:  We also show that the performance of the algorithm is very close to the theoretical upper-bound in several simulation scenarios.
Edit intent: clarity
Original: The high bandwidth demand of internet applications has recently driven the need of increasing the  download speed.
Revised: The high bandwidth demand of Internet applications has recently driven the need of increasing the download speed.
Edit intent: fluency
Original:  A practical solution to the problem has been proposed bundling the ADSL backhauls in the neighborhood via 802.11 connections.
Revised:  A practical solution to the problem has been proposed aggregating the bandwidth of 802.11 Access Points (APs) backhauls in range via 802.11 connections.
Edit intent: clarity
Original: 11 APs and stations are usually singleradio , the communication to the set of APs naturally requires the introduction of a time-division multiple access (TDMA) policy  . Current investigation in this area supposes that there is a sufficient number of TCP flows to saturate the ADSL bandwidth .
Revised: 11 devices are usually single-radio , the communication to the set of APs naturally requires the introduction of a time-division multiple access (TDMA) policy . Current investigation in this area supposes that there is a sufficient number of TCP flows to saturate the ADSL bandwidth .
Edit intent: clarity
Original: 11 APs and stations are usually singleradio , the communication to the set of APs naturally requires the introduction of a time-division multiple access (TDMA) policy  . Current investigation in this area supposes that there is a sufficient number of TCP flows to saturate the ADSL bandwidth .
Revised: 11 APs and stations are usually singleradio , the communication to the set of APs naturally requires the introduction of a time-division multiple access (TDMA) policy . Current investigation in this area supposes that there is a sufficient number of TCP flows to saturate the Asymmetric Digital Subscriber Line (ADSL) behind the APs .
Edit intent: clarity
Original:  However, this may be not guarantee according to the user pattern, like can happen when the dominant traffic is http based .
Revised:  However, this may be not guaranteed according to the user pattern, like can happen when the dominant traffic is http based .
Edit intent: coherence
Original:  However, this may be not guarantee according to the user pattern, like can happen when the dominant traffic is http based .
Revised:  However, this may be not guarantee according to the user traffic pattern .
Edit intent: coherence
Original:  As a consequence, a TDMA approach introduces extra-delay in the end-to-end transmissions that will cause degradation in the TCP flows and an under-utilization of the end-to-end bottleneck .
Revised:  As a consequence, a TDMA policy introduces additional delays in the end-to-end transmissions that will cause degradation in the TCP flows and an under-utilization of the end-to-end bottleneck .
Edit intent: clarity
Original:  As a consequence, a TDMA approach introduces extra-delay in the end-to-end transmissions that will cause degradation in the TCP flows and an under-utilization of the end-to-end bottleneck .
Revised:  As a consequence, a TDMA approach introduces extra-delay in the end-to-end transmissions that will cause degradation of the TCP throughput and an under-utilization of the end-to-end bottleneck .
Edit intent: clarity
Original:  As a consequence, a TDMA approach introduces extra-delay in the end-to-end transmissions that will cause degradation in the TCP flows and an under-utilization of the end-to-end bottleneck .
Revised:  As a consequence, a TDMA approach introduces extra-delay in the end-to-end transmissions that will cause degradation in the TCP flows and an under-utilization of the AP backhauls .
Edit intent: clarity
Original:  In this paper, we first perform an in-depth experimental analysis with a customized MadWiFi driver of how the usage of multi-AP TDMA affects the observed round-trip time of TCP packets .
Revised:  In this paper, we first perform an in-depth experimental analysis with a customized MadWiFi driver of how the usage of multi-AP TDMA affects the observed Round-Trip-Time (RTT) of TCP flows .
Edit intent: clarity
Original:  Then, we introduce an analytic model that accurately predicts the RTT and the throughput of TCP when accessing the  medium with a TDMA approach . Based on this model, we propose a resource allocation algorithm (min-max disconnection time) that runs locally at the station and minimizes the end to end TCP delay with a very low computational cost.
Revised:  Then, we introduce a simple analytical model that accurately predicts the RTT and the throughput of TCP when accessing the medium with a TDMA approach . Based on this model, we propose a resource allocation algorithm (min-max disconnection time) that runs locally at the station and minimizes the end to end TCP delay with a very low computational cost.
Edit intent: clarity
Original:  Then, we introduce an analytic model that accurately predicts the RTT and the throughput of TCP when accessing the  medium with a TDMA approach . Based on this model, we propose a resource allocation algorithm (min-max disconnection time) that runs locally at the station and minimizes the end to end TCP delay with a very low computational cost.
Revised:  Then, we introduce an analytic model that accurately predicts the TCP RTT when accessing the medium with a TDMA approach . Based on this model, we propose a resource allocation algorithm (min-max disconnection time) that runs locally at the station and minimizes the end to end TCP delay with a very low computational cost.
Edit intent: clarity
Original:  Then, we introduce an analytic model that accurately predicts the RTT and the throughput of TCP when accessing the  medium with a TDMA approach . Based on this model, we propose a resource allocation algorithm (min-max disconnection time) that runs locally at the station and minimizes the end to end TCP delay with a very low computational cost.
Revised:  Then, we introduce an analytic model that accurately predicts the RTT and the throughput of TCP when accessing the wireless medium with a TDMA approach . Based on this model, we propose a resource allocation algorithm (min-max disconnection time) that runs locally at the station and minimizes the end to end TCP delay with a very low computational cost.
Edit intent: clarity
Original:  Then, we introduce an analytic model that accurately predicts the RTT and the throughput of TCP when accessing the  medium with a TDMA approach . Based on this model, we propose a resource allocation algorithm (min-max disconnection time) that runs locally at the station and minimizes the end to end TCP delay with a very low computational cost.
Revised:  Then, we introduce an analytic model that accurately predicts the RTT and the throughput of TCP when accessing the medium with a TDMA approach . Based on this model, we propose a resource allocation algorithm that runs locally at the station and minimizes the end to end TCP delay with a very low computational cost.
Edit intent: coherence
Original:  Then, we introduce an analytic model that accurately predicts the RTT and the throughput of TCP when accessing the  medium with a TDMA approach . Based on this model, we propose a resource allocation algorithm (min-max disconnection time) that runs locally at the station and minimizes the end to end TCP delay with a very low computational cost.
Revised:  Then, we introduce an analytic model that accurately predicts the RTT and the throughput of TCP when accessing the medium with a TDMA approach . Based on this model, we propose a resource allocation algorithm (min-max disconnection time) that runs locally at the station and it greatly reduces the observed TCP RTT with a very low computational cost.
Edit intent: clarity
Original:  We also show that the  performance of the algorithm is very close to the theoretical upper-bound in several simulation scenarios.
Revised:  We also show that the throughput performance of the algorithm is very close to the theoretical upper-bound in several simulation scenarios.
Edit intent: clarity
Original:  We also show that the  performance of the algorithm is very close to the theoretical upper-bound in several simulation scenarios.
Revised:  We also show that the performance of the algorithm is very close to the theoretical upper-bound in key simulation scenarios.
Edit intent: clarity
Original: Chordal graphs are intersection graphs of subtrees in a tree .
Revised: Chordal graphs are intersection graphs of subtrees of a tree T .
Edit intent: clarity
Original:  We investigate  complexity of the partial representation extension problem for chordal graphs.
Revised:  We investigate the complexity of the partial representation extension problem for chordal graphs.
Edit intent: fluency
Original:  A partial representation specifies a tree T' and some pre-drawn subtrees  .
Revised:  A partial representation specifies a tree T' and some pre-drawn subtrees of T' .
Edit intent: clarity
Original:  It asks whether it is possible to construct a representation inside a modified tree T which extends the partial representation (  keeps the pre-drawn subtrees unchanged).
Revised:  It asks whether it is possible to construct a representation inside a modified tree T which extends the partial representation ( i.e, keeps the pre-drawn subtrees unchanged).
Edit intent: coherence
Original:  In some cases, the problem is interesting even if just T' is given and no subtree is pre-drawn.
Revised:  In some cases, it is interesting to consider the complexity even if just T' is given and no subtree is pre-drawn.
Edit intent: clarity
Original:  The problem 3-Partition is used in the NP-completeness reductions.
Revised:  The problem Partition is used for all NP-completeness reductions.
Edit intent: clarity
Original:  The BinPacking problem is closely related to the extension of interval graphs when  space in T' is limited , and we obtain " equivalency " with BinPacking .
Revised:  The extension of interval graphs when space in T' is limited , and we obtain " equivalency " with BinPacking .
Edit intent: clarity
Original:  The BinPacking problem is closely related to the extension of interval graphs when  space in T' is limited , and we obtain " equivalency " with BinPacking .
Revised:  The BinPacking problem is closely related to the extension of interval graphs when the space in T' is limited , and we obtain " equivalency " with BinPacking .
Edit intent: fluency
Original:  The BinPacking problem is closely related to the extension of interval graphs when  space in T' is limited , and we obtain " equivalency " with BinPacking .
Revised:  The BinPacking problem is closely related to the extension of interval graphs when space in T' is limited is " equivalency " with BinPacking .
Edit intent: coherence
Original:  The BinPacking problem is closely related to the extension of interval graphs when  space in T' is limited , and we obtain " equivalency " with BinPacking .
Revised:  The BinPacking problem is closely related to the extension of interval graphs when space in T' is limited , and we obtain " equivalent " with BinPacking .
Edit intent: clarity
Original:  The BinPacking problem is closely related to the extension of interval graphs when  space in T' is limited , and we obtain " equivalency " with BinPacking .
Revised:  The BinPacking problem is closely related to the extension of interval graphs when space in T' is limited , and we obtain " equivalency " to the BinPacking problem .
Edit intent: clarity
Original:  DD95) which serves as the standard model of self-organized criticality .
Revised:  DD95) which serves as the standard model of self-organized criticality .
Edit intent: fluency
Original:  We demonstrate a large class of sandpile which have polynomially bound transience classes by identifying key graph properties that play a role in the rapid diffusion process.
Revised:  We demonstrate a class of sandpile which have polynomially bound transience classes by identifying key graph properties that play a role in the rapid diffusion process.
Edit intent: clarity
Original:  We prove the conser- vativeness of these extensions, and also prove that they work with any left-recursive PEG  .
Revised:  We prove the conservativeness of these extensions, and also prove that they work with any left-recursive PEG .
Edit intent: fluency
Original:  As a byproduct we show that the correlations produced by any entangled strategy which succeeds in the multilinearity test with high probability can always be closely approximated using shared randomness alone , and are thus restricted to being quasi-classical .
Revised:  As a byproduct we show that the correlations produced by any entangled strategy which succeeds in the multilinearity test with high probability can always be closely approximated using shared randomness alone .
Edit intent: coherence
Original:  We study the equilibrium distribution of the process in the regime where \ell\to+\infty, m\to+\infty, q \to0 \to 0, \ell q%DIFDELCMD < } \to %%% a\in  ]0,+\infty[, m/\ell{\ell}} \to\alpha\in [0,+\infty].
Revised:  We study the equilibrium distribution of the process in the regime where \ell\to+\infty, m\to+\infty, q \to0, \ell q \to 0, \ell q%DIFDELCMD < } \to %%% a\in ]0,+\infty[, m/\ell{\ell}} \to\alpha\in [0,+\infty].
Edit intent: fluency
Original:  We study the equilibrium distribution of the process in the regime where \ell\to+\infty, m\to+\infty, q \to0 \to 0, \ell q%DIFDELCMD < } \to %%% a\in  ]0,+\infty[, m/\ell{\ell}} \to\alpha\in [0,+\infty].
Revised:  We study the equilibrium distribution of the process in the regime where \ell\to+\infty, m\to+\infty, q \to0 \to \ell q%DIFDELCMD < } \to %%% a\in ]0,+\infty[, m/\ell{\ell}} \to\alpha\in [0,+\infty].
Edit intent: fluency
Original:  We study the equilibrium distribution of the process in the regime where \ell\to+\infty, m\to+\infty, q \to0 \to 0, \ell q%DIFDELCMD < } \to %%% a\in  ]0,+\infty[, m/\ell{\ell}} \to\alpha\in [0,+\infty].
Revised:  We study the equilibrium distribution of the process in the regime where \ell\to+\infty, m\to+\infty, q \to0 \to 0, %DIFDELCMD < } \to %%% a\in ]0,+\infty[, m/\ell{\ell}} \to\alpha\in [0,+\infty].
Edit intent: fluency
Original:  We study the equilibrium distribution of the process in the regime where \ell\to+\infty, m\to+\infty, q \to0 \to 0, \ell q%DIFDELCMD < } \to %%% a\in  ]0,+\infty[, m/\ell{\ell}} \to\alpha\in [0,+\infty].
Revised:  We study the equilibrium distribution of the process in the regime where \ell\to+\infty, m\to+\infty, q \to0 \to 0, \ell q%DIFDELCMD < } \to %%% a\in \, ]0,+\infty[, m/\ell{\ell}} \to\alpha\in [0,+\infty].
Edit intent: fluency
Original:  We observe the existence of a critical population size necessary for a quasispecies to emerge  and we recover the finite population counterpart of the error threshold.
Revised:  We observe the existence of a critical population size necessary for a quasispecies to emerge , and we recover the finite population counterpart of the error threshold.
Edit intent: fluency
Original:  The proof is more complex  and it relies on the Freidlin-Wentzell theory of random perturbations of dynamical systems.
Revised:  The proof is more complex , and it relies on the Freidlin-Wentzell theory of random perturbations of dynamical systems.
Edit intent: fluency
Original: Evidence from language , music and genomes suggests that the mean size of the parts tends to decrease as the number of parts increases in many situations.
Revised: Evidence from language , music and genomes as a tendency of the mean size of the parts tends to decrease as the number of parts increases in many situations.
Edit intent: clarity
Original: Evidence from language , music and genomes suggests that the mean size of the parts tends to decrease as the number of parts increases in many situations.
Revised: Evidence from language , music and genomes suggests that the mean size of the parts to decrease as the number of parts increases in many situations.
Edit intent: clarity
Original:  This statistical regularity , known as Menzerath's law, emerges in the context of genomes, for instance, as a tendency of species with more chromosomes to have a smaller mean chromosome size.
Revised:  This statistical regularity emerges also in the context of genomes, for instance, as a tendency of species with more chromosomes to have a smaller mean chromosome size.
Edit intent: clarity