wanyu/IteraTeR_v2 huggingface dataset:
Original:  We further study ATLAS in more dynamic networks and show that it keeps up with topology changes , and load changes  sufficient for TCP to sustain multi-hop flows, a struggle in IEEE 802.11 networks.
Revised:  We further study ATLAS in more dynamic networks and show that it keeps up with changes sufficient for TCP to sustain multi-hop flows, a struggle in IEEE 802.11 networks.
Edit intent: clarity
Original:  The predictable performance of ATLAS supports the design of higher-layer services that inform, and are informed by, the underlying communication network.
Revised:  The stable performance of ATLAS supports the design of higher-layer services that inform, and are informed by, the underlying communication network.
Edit intent: clarity
Original:  For the differential diagnosis , the best solution based on the given database collected by PetScreen has, for the clinically suspected patients, sensitivity 83.5\% , and specificity is 77\% ( three input features, two biomarkers and a standard clinical symptom).
Revised:  For the differential diagnosis the best solution based on the given database collected by PetScreen has, for the clinically suspected patients, sensitivity 83.5\% , and specificity is 77\% ( three input features, two biomarkers and a standard clinical symptom).
Edit intent: fluency
Original:  For the differential diagnosis , the best solution based on the given database collected by PetScreen has, for the clinically suspected patients, sensitivity 83.5\% , and specificity is 77\% ( three input features, two biomarkers and a standard clinical symptom).
Revised:  For the differential diagnosis , the best solution gave a sensitivity and specificity of 83.5\% , and specificity is 77\% ( three input features, two biomarkers and a standard clinical symptom).
Edit intent: clarity
Original:  For the differential diagnosis , the best solution based on the given database collected by PetScreen has, for the clinically suspected patients, sensitivity 83.5\% , and specificity is 77\% ( three input features, two biomarkers and a standard clinical symptom).
Revised:  For the differential diagnosis , the best solution based on the given database collected by PetScreen has, for the clinically suspected patients, sensitivity 83.5\% and 77\% ( three input features, two biomarkers and a standard clinical symptom).
Edit intent: coherence
Original:  For the differential diagnosis , the best solution based on the given database collected by PetScreen has, for the clinically suspected patients, sensitivity 83.5\% , and specificity is 77\% ( three input features, two biomarkers and a standard clinical symptom).
Revised:  For the differential diagnosis , the best solution based on the given database collected by PetScreen has, for the clinically suspected patients, sensitivity 83.5\% , and specificity is 77\% , respectively (using three input features, two biomarkers and a standard clinical symptom).
Edit intent: clarity
Original:  The sensitivity of this screening method is 81.4\% and specificity is >99\%  .
Revised:  The sensitivity of this screening method is 81.4\% and >99\% .
Edit intent: clarity
Original:  Two protein peaks, with the highest diagnostic power, were selected and further identified as acute phase proteins , C-Reactive Protein and Haptoglobin . Data mining methods were then applied to the collected data for the development of an online computer-assisted veterinary diagnostic tool.
Revised:  Two protein peaks, with the highest diagnostic power, were selected and further identified as acute phase proteins ( C-Reactive Protein and Haptoglobin . Data mining methods were then applied to the collected data for the development of an online computer-assisted veterinary diagnostic tool.
Edit intent: fluency
Original:  Three methods, decision trees, kNN and probability density evaluation , were used for classification and risk estimation and several pre-processing approaches were implemented  to create the diagnostic system.
Revised:  Three methods, decision trees, kNN and probability density evaluation , were used for classification and risk estimation . Several pre-processing approaches were implemented to create the diagnostic system.
Edit intent: coherence
Original:  For the differential diagnosis the best solution gave a sensitivity and specificity of 83.5\% and 77\%, respectively (using three input features, CRP, Haptoglobin and standard clinical symptom).
Revised:  For the differential diagnosis the best solution gives the sensitivity and specificity of 83.5\% and 77\%, respectively (using three input features, CRP, Haptoglobin and standard clinical symptom).
Edit intent: fluency
Original:  For the screening task, the decision tree method provided the best result, with sensitivity and specificity of 81.4\% and >99\%, respectively (using the same input features).
Revised:  For the screening task, the decision tree method provides the best result, with sensitivity and specificity of 81.4\% and >99\%, respectively (using the same input features).
Edit intent: fluency
Original:  Our findings demonstrate that neglecting local population structure on reaction-diffusion processes in metapopulation networks is a valid approximation, which implies a major simplification in the application of this framework to the study of realistic problems .
Revised:  The analysis of several variations of the reaction-diffusion processes in metapopulation networks is a valid approximation, which implies a major simplification in the application of this framework to the study of realistic problems .
Edit intent: clarity
Original: Using the Helmholtz decomposition of the vector field of folding fluxes in a reduced space of collective variables, a potential of the driving force for protein folding is determined .
Revised: Using the Helmholtz decomposition of the vector field of folding fluxes in a reduced space of collective variables, a potential of the driving force for protein folding is introduced .
Edit intent: clarity
Original:  The potential has two components and can be written as a complex function .
Revised:  The potential has two components .
Edit intent: clarity
Original: Models of Stock Recruitment Relationships (SRRs) are  used to predict fish population dynamics.
Revised: Models of Stock Recruitment Relationships (SRRs) are often used to predict fish population dynamics.
Edit intent: coherence
Original:  Here we introduce a generalized modeling framework to show that the degree of compensation can be related directly to the functional elasticity of growth, which is a general quantity that measures the change in recruitment relative to a change in biomass, irrespective of the specific SRR that is used .
Revised:  Here we use a generalized modeling framework to show that the degree of compensation can be related directly to the functional elasticity of growth, which is a general quantity that measures the change in recruitment relative to a change in biomass, irrespective of the specific SRR that is used .
Edit intent: coherence
Original:  Here we introduce a generalized modeling framework to show that the degree of compensation can be related directly to the functional elasticity of growth, which is a general quantity that measures the change in recruitment relative to a change in biomass, irrespective of the specific SRR that is used .
Revised:  Here we introduce a generalized modeling framework to show that the degree of compensation can be related directly to the functional elasticity of growth, which is a general quantity that measures the change in recruitment relative to a change in biomass, irrespective of the specific SRR .
Edit intent: clarity
Original:  This framework may be particularly useful if fisheries time-series data are limited, and not conducive to determining functional relationships using traditional methods of statistical best-fit . Finally, we show that the Beverton-Holt SRR is qualitatively different than either Ricker-like or Cushing-like SRRs, and that it is impossible for a Beverton-Holt SRR to exist in nature .
Revised:  This framework may be particularly useful if fisheries time-series data are limited, and not conducive to determining functional relationships using traditional methods of statistical best-fit .
Edit intent: coherence
Original:  The starting questions were %DIFDELCMD < \\ %%%  1) Why do we have a crisis?
Revised:  The starting questions were %DIFDELCMD < \\ %%% : 1) Why do we have a crisis?
Edit intent: fluency
Original: For a predicate f: \{ -1,1 \}^k \mapsto \{ 0,1 \} with \rho(f) = |f^{-1(1)| , we call the predicate strongly approximation resistant{\it  if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment such that the fraction of constraints satisfied is outside the range \rho(f) -\Omega(1), \rho(f) +\Omega(1)  . We present a characterization of strongly approximation resistant predicates under the Unique Games Conjecture.
Revised: A predicate f: \{ -1,1 \}^k \mapsto \{ 0,1 \} with \rho(f) = |f^{-1(1)| , we call the predicate strongly approximation resistant{\it if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment such that the fraction of constraints satisfied is outside the range \rho(f) -\Omega(1), \rho(f) +\Omega(1) . We present a characterization of strongly approximation resistant predicates under the Unique Games Conjecture.
Edit intent: fluency
Original: For a predicate f: \{ -1,1 \}^k \mapsto \{ 0,1 \} with \rho(f) = |f^{-1(1)| , we call the predicate strongly approximation resistant{\it  if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment such that the fraction of constraints satisfied is outside the range \rho(f) -\Omega(1), \rho(f) +\Omega(1)  . We present a characterization of strongly approximation resistant predicates under the Unique Games Conjecture.
Revised: For a predicate f: -1,1 \}^k \mapsto \{ 0,1 \} with \rho(f) = |f^{-1(1)| , we call the predicate strongly approximation resistant{\it if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment such that the fraction of constraints satisfied is outside the range \rho(f) -\Omega(1), \rho(f) +\Omega(1) . We present a characterization of strongly approximation resistant predicates under the Unique Games Conjecture.
Edit intent: fluency
Original: For a predicate f: \{ -1,1 \}^k \mapsto \{ 0,1 \} with \rho(f) = |f^{-1(1)| , we call the predicate strongly approximation resistant{\it  if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment such that the fraction of constraints satisfied is outside the range \rho(f) -\Omega(1), \rho(f) +\Omega(1)  . We present a characterization of strongly approximation resistant predicates under the Unique Games Conjecture.
Revised: For a predicate f: \{ -1,1 ^k -> 0,1 \} with \rho(f) = |f^{-1(1)| , we call the predicate strongly approximation resistant{\it if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment such that the fraction of constraints satisfied is outside the range \rho(f) -\Omega(1), \rho(f) +\Omega(1) . We present a characterization of strongly approximation resistant predicates under the Unique Games Conjecture.
Edit intent: coherence
Original: For a predicate f: \{ -1,1 \}^k \mapsto \{ 0,1 \} with \rho(f) = |f^{-1(1)| , we call the predicate strongly approximation resistant{\it  if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment such that the fraction of constraints satisfied is outside the range \rho(f) -\Omega(1), \rho(f) +\Omega(1)  . We present a characterization of strongly approximation resistant predicates under the Unique Games Conjecture.
Revised: For a predicate f: \{ -1,1 \}^k \mapsto \{ 0,1 , we call the predicate strongly approximation resistant{\it if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment such that the fraction of constraints satisfied is outside the range \rho(f) -\Omega(1), \rho(f) +\Omega(1) . We present a characterization of strongly approximation resistant predicates under the Unique Games Conjecture.
Edit intent: coherence
Original: For a predicate f: \{ -1,1 \}^k \mapsto \{ 0,1 \} with \rho(f) = |f^{-1(1)| , we call the predicate strongly approximation resistant{\it  if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment such that the fraction of constraints satisfied is outside the range \rho(f) -\Omega(1), \rho(f) +\Omega(1)  . We present a characterization of strongly approximation resistant predicates under the Unique Games Conjecture.
Revised: For a predicate f: \{ -1,1 \}^k \mapsto \{ 0,1 \} with \rho(f) = |f^{-1(1)| is called{\it if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment such that the fraction of constraints satisfied is outside the range \rho(f) -\Omega(1), \rho(f) +\Omega(1) . We present a characterization of strongly approximation resistant predicates under the Unique Games Conjecture.
Edit intent: fluency
Original: For a predicate f: \{ -1,1 \}^k \mapsto \{ 0,1 \} with \rho(f) = |f^{-1(1)| , we call the predicate strongly approximation resistant{\it  if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment such that the fraction of constraints satisfied is outside the range \rho(f) -\Omega(1), \rho(f) +\Omega(1)  . We present a characterization of strongly approximation resistant predicates under the Unique Games Conjecture.
Revised: For a predicate f: \{ -1,1 \}^k \mapsto \{ 0,1 \} with \rho(f) = |f^{-1(1)| , we call the predicate strongly approximation resistant{\it if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment that satisfies at least \rho(f) -\Omega(1), \rho(f) +\Omega(1) . We present a characterization of strongly approximation resistant predicates under the Unique Games Conjecture.
Edit intent: clarity
Original: For a predicate f: \{ -1,1 \}^k \mapsto \{ 0,1 \} with \rho(f) = |f^{-1(1)| , we call the predicate strongly approximation resistant{\it  if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment such that the fraction of constraints satisfied is outside the range \rho(f) -\Omega(1), \rho(f) +\Omega(1)  . We present a characterization of strongly approximation resistant predicates under the Unique Games Conjecture.
Revised: For a predicate f: \{ -1,1 \}^k \mapsto \{ 0,1 \} with \rho(f) = |f^{-1(1)| , we call the predicate strongly approximation resistant{\it if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment such that the fraction of constraints satisfied is outside the range \rho(f) +\Omega(1) . We present a characterization of strongly approximation resistant predicates under the Unique Games Conjecture.
Edit intent: fluency
Original: For a predicate f: \{ -1,1 \}^k \mapsto \{ 0,1 \} with \rho(f) = |f^{-1(1)| , we call the predicate strongly approximation resistant{\it  if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment such that the fraction of constraints satisfied is outside the range \rho(f) -\Omega(1), \rho(f) +\Omega(1)  . We present a characterization of strongly approximation resistant predicates under the Unique Games Conjecture.
Revised: For a predicate f: \{ -1,1 \}^k \mapsto \{ 0,1 \} with \rho(f) = |f^{-1(1)| , we call the predicate strongly approximation resistant{\it if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment such that the fraction of constraints satisfied is outside the range \rho(f) -\Omega(1), \rho(f) +\Omega(1) . We present a complete characterization of approximation resistant predicates under the Unique Games Conjecture.
Edit intent: clarity
Original:  We also present characterizations in the mixed {\it  linear and semi-definite programming hierarchy and the Sherali-Adams linear programming hierarchy.
Revised:  We also present characterizations in the {\it linear and semi-definite programming hierarchy and the Sherali-Adams linear programming hierarchy.
Edit intent: clarity
Original:  In this paper, we propose a novel conceptual framework where a centralized system, classifies the road based upon the level of damage.
Revised:  In this paper, we propose a conceptual framework where a centralized system, classifies the road based upon the level of damage.
Edit intent: clarity
Original:  The system also sends a feedback to the concerned authorities for a quick response to the condition of the roads.
Revised:  The system sends a feedback to the concerned authorities for a quick response to the condition of the roads.
Edit intent: clarity
Original:  Visualizations of the degree of overlap between the top 100 list of most controversial articles in different languages and the content related  geographical locations will be presented.
Revised:  Visualizations of the degree of overlap between the top 100 lists of most controversial articles in different languages and the content related geographical locations will be presented.
Edit intent: fluency
Original:  Visualizations of the degree of overlap between the top 100 list of most controversial articles in different languages and the content related  geographical locations will be presented.
Revised:  Visualizations of the degree of overlap between the top 100 list of most controversial articles in different languages and the content related to geographical locations will be presented.
Edit intent: fluency
Original:  We discuss what the presented analysis and visualizations can tell us about the multicultural aspects of Wikipedia , and , in general, about cultures of peer-production with focus on universal and specifically, local features.
Revised:  We discuss what the presented analysis and visualizations can tell us about the multicultural aspects of Wikipedia and practices of peer-production with focus on universal and specifically, local features.
Edit intent: clarity
Original: In this paper we propose an extension of the popular leader-follower framework for multi-agent collective tracking and formation maintenance .
Revised: The goal of this work is to propose an extension of the popular leader-follower framework for multi-agent collective tracking and formation maintenance .
Edit intent: clarity
Original:  We introduce a new paradigm, the online leaderselection, which allows the agent group to persistently select the identity of the current leader in order to maximize the  tracking performance of an exogenous  velocity command while maintaining a given formation and across a (possibly time-varying) communication-graph topology.
Revised:  We introduce a new paradigm, the online leaderselection, which allows the agent group to persistently select the identity of the current leader in order to maximize the tracking performance of an exogenous velocity command while also maintaining a desired formation via a given formation and across a (possibly time-varying) communication-graph topology.
Edit intent: clarity
Original:  We introduce a new paradigm, the online leaderselection, which allows the agent group to persistently select the identity of the current leader in order to maximize the  tracking performance of an exogenous  velocity command while maintaining a given formation and across a (possibly time-varying) communication-graph topology.
Revised:  We introduce a new paradigm, the online leaderselection, which allows the agent group to persistently select the identity of the current leader in order to maximize the tracking performance of an exogenous velocity command while maintaining a (possibly time-varying) communication-graph topology.
Edit intent: clarity
Original:  By employing two of the most widely used fully-decentralized multi- agent coordination schemes (a first-order and second-order ones), we theoretically analyze the effects of a leader change and propose two corresponding error metrics able to adequately characterize the tracking performance of the multi-agent group.
Revised:  The effects of a leader change and propose two corresponding error metrics able to adequately characterize the tracking performance of the multi-agent group.
Edit intent: clarity
Original:  By employing two of the most widely used fully-decentralized multi- agent coordination schemes (a first-order and second-order ones), we theoretically analyze the effects of a leader change and propose two corresponding error metrics able to adequately characterize the tracking performance of the multi-agent group.
Revised:  By employing two of the most widely used fully-decentralized multi- agent coordination schemes (a first-order and second-order ones), we theoretically analyze the effects of a change in the leader identity are theoretically analyzed and exploited for defining a suitable error metric able to capture the tracking performance of the multi-agent group.
Edit intent: clarity
Original:  By employing two of the most widely used fully-decentralized multi- agent coordination schemes (a first-order and second-order ones), we theoretically analyze the effects of a leader change and propose two corresponding error metrics able to adequately characterize the tracking performance of the multi-agent group.
Revised:  By employing two of the most widely used fully-decentralized multi- agent coordination schemes (a first-order and second-order ones), we theoretically analyze the effects of a leader change and propose two corresponding error metrics able to adequately characterize the tracking performance of the multi- agent group.
Edit intent: fluency
Original:  Both the group performance and the choice of the right metrics are found to depend upon the spectral properties of a special directed graph induced by the identity of the chosen leader.
Revised:  Both the group performance and the metric design are found to depend upon the spectral properties of a special directed graph induced by the identity of the chosen leader.
Edit intent: clarity
Original:  By exploiting the proposed analysis and distributed estimation techniques, we then detail two fully-decentralized adaptive controllers able to periodically select  the best leader among the neighbors of the current leader.
Revised:  By exploiting these results, as well as distributed estimation techniques, we then detail two fully-decentralized adaptive controllers able to periodically select the best leader among the neighbors of the current leader.
Edit intent: clarity
Original:  By exploiting the proposed analysis and distributed estimation techniques, we then detail two fully-decentralized adaptive controllers able to periodically select  the best leader among the neighbors of the current leader.
Revised:  By exploiting the proposed analysis and distributed estimation techniques, we are then able to detail a fully-decentralized adaptive controllers able to periodically select the best leader among the neighbors of the current leader.
Edit intent: clarity
Original:  Numerical simulations show that the application of the proposed technique results in an clear improvement of the overall performance of the group behavior  .
Revised:  Numerical simulations show that the application of the proposed technique results in an improvement of the overall performance of the group behavior .
Edit intent: clarity
Original:  The availability of high-throughput data generated by microarray experiments fuelled researchers to use whole-genome gene expression profiles to understand cancer and to reconstruct key cancer-specific gene regulatory network.
Revised:  The availability of high-throughput data generated by microarray experiments fueled researchers to use whole-genome gene expression profiles to understand cancer and to reconstruct key cancer-specific gene regulatory network.
Edit intent: fluency
Original:  First, significant genes differentially expressing them self in the disease condition (colon cancer) has been identified using a two-stage filtering approach t-test and fold-change measure.
Revised:  First, significant genes differentially expressing them self in the disease condition has been identified using a two-stage filtering approach t-test and fold-change measure.
Edit intent: clarity