wanyu/IteraTeR_v2 huggingface dataset:
Original:  We show that the graph classes of H for which we obtain a fully polynomial randomized approximation scheme for almost all G includes graphs of degree at most two, bounded-degree forests, bounded-width grid graphs, subdivision of bounded-degree graphs, and major subclasses of outerplanar graphs, series-parallel graphs and planar graphs, whereas unbounded-width grid graphs are excluded .
Revised:  We show that the graph classes of H for which we obtain a fully polynomial randomized approximation scheme for almost all G includes graphs of degree at most two, bounded-degree forests, bounded-length grid graphs, subdivision of bounded-degree graphs, and major subclasses of outerplanar graphs, series-parallel graphs and planar graphs, whereas unbounded-width grid graphs are excluded .
Edit intent: clarity
Original:  We show that the graph classes of H for which we obtain a fully polynomial randomized approximation scheme for almost all G includes graphs of degree at most two, bounded-degree forests, bounded-width grid graphs, subdivision of bounded-degree graphs, and major subclasses of outerplanar graphs, series-parallel graphs and planar graphs, whereas unbounded-width grid graphs are excluded .
Revised:  We show that the graph classes of H for which we obtain a fully polynomial randomized approximation scheme for almost all G includes graphs of degree at most two, bounded-degree forests, bounded-width grid graphs, subdivision of bounded-degree graphs, and major subclasses of outerplanar graphs, series-parallel graphs and planar graphs, whereas unbounded-length grid graphs are excluded .
Edit intent: clarity
Original:  Moreover, the coupling between exposition time (\omega) and agent-agent contact rate (CR) becomes crucial to understand the excitation dynamics, which exhibits three regimes with CR: no excitation for low CR, an excited regime in which the number of quiescent agents (S) is inversely proportional to CR, and for high CR, a novel third regime, model dependent, where S scales with an exponent \xi -1, with \xi being the scaling exponent of \omega with CR.
Revised:  Moreover, the coupling between exposition time (\omega) and agent-agent contact rate (CR) becomes crucial to understand the excitation dynamics, which exhibits three regimes with CR: no excitation for low CR, an excited regime in which the number of quiescent agents (S) is inversely proportional to CR, and for high CR, a novel third regime, model dependent, here S scales with an exponent \xi -1, with \xi being the scaling exponent of \omega with CR.
Edit intent: coherence
Original:  As a tool designed to tackle this issue, RAId_deNovo can generate , for a given tandem mass spectrum, the score distribution resulting from scoring all possible peptides under a certain class of scoring functions.
Revised:  As a tool designed to tackle this issue, RAId_deNovo circumvents these issues. We show , for a given tandem mass spectrum, the score distribution resulting from scoring all possible peptides under a certain class of scoring functions.
Edit intent: clarity
Original:  As a tool designed to tackle this issue, RAId_deNovo can generate , for a given tandem mass spectrum, the score distribution resulting from scoring all possible peptides under a certain class of scoring functions.
Revised:  As a tool designed to tackle this issue, RAId_deNovo can generate , for a class of scoring functions, how RAId_deNovo uses the respective score histograms from scoring all possible peptides under a certain class of scoring functions.
Edit intent: clarity
Original:  Availability: The webserver link is URL . Relevant binaries for Linux, Windows, and Mac OS X are available from the same page.
Revised:  Availability: The webserver link is URL Relevant binaries for Linux, Windows, and Mac OS X are available from the same page.
Edit intent: fluency
Original: Comparing or combining results of peptide identification from different search methods with firm foundation is impeded by the lack of a universal statistical standard.
Revised: Statistically meaningful comparison/combination of peptide identification from different search methods with firm foundation is impeded by the lack of a universal statistical standard.
Edit intent: clarity
Original: Comparing or combining results of peptide identification from different search methods with firm foundation is impeded by the lack of a universal statistical standard.
Revised: Comparing or combining results of peptide identification results from various search methods is impeded by the lack of a universal statistical standard.
Edit intent: clarity
Original:  Providing an E-value calibration protocol, we demonstrated earlier the possiblity to translate either the score or heuristic E-value reported by any method into the textbook-defined E-value, which may serve as the universal statistical standard.
Revised:  Providing an E-value calibration protocol, we demonstrated earlier the feasibility of translating either the score or heuristic E-value reported by any method into the textbook-defined E-value, which may serve as the universal statistical standard.
Edit intent: clarity
Original:  We show, for a class of scoring functions , how RAId_deNovo uses the respective score histograms from scoring all possible de novo peptides to assign accurate, spectrum-specific E-values , thereby creating a calibration-free protocol for accurate significance assignment and for combining search results.
Revised:  We show, for a class of scoring functions , how RAId_deNovo uses the respective score histograms from scoring all possible de novo peptides to assign accurate, spectrum-specific E-values enables a calibration-free protocol for accurate significance assignment and for combining search results.
Edit intent: clarity
Original:  RAId_deNovo features four different modes: (i) compute the total number of possible peptides for a given molecular mass range, (ii) generate the score histogram given a MS/MS spectrum and a scoring function, (iii) reassign E-values for a list of candidate peptides given a MS/MS spectrum and the scoring functions chosen, and (iv) perform database searches using user-selected scoring functions.
Revised:  RAId_deNovo features four different modes: (i) compute the total number of possible peptides for a given molecular mass range, (ii) generate the score histogram given a MS/MS spectrum and a scoring function, (iii) reassign E-values for a list of candidate peptides given a MS/MS spectrum and the scoring functions chosen, and (iv) perform database searches using selected scoring functions.
Edit intent: clarity
Original: Contact networks form the substrate along which infectious diseases spread.
Revised: Networks of person-person contacts form the substrate along which infectious diseases spread.
Edit intent: clarity
Original:  Most network-based studies of the spread have only considered the impact of variations in node degrees .
Revised:  Most network-based studies of the spread focus on the impact of variations in node degrees .
Edit intent: clarity
Original:  Most network-based studies of the spread have only considered the impact of variations in node degrees .
Revised:  Most network-based studies of the spread have only considered the impact of variations in degree (the number of contacts an individual has) .
Edit intent: clarity
Original:  However, a number of other effects such as clustering, variations in infectiousness or susceptibility, or variations in closeness of contacts are expected to play a significant role.
Revised:  However, other effects such as clustering, variations in infectiousness or susceptibility, or variations in closeness of contacts are expected to play a significant role.
Edit intent: clarity
Original:  However, a number of other effects such as clustering, variations in infectiousness or susceptibility, or variations in closeness of contacts are expected to play a significant role.
Revised:  However, a number of other effects such as clustering, variations in infectiousness or susceptibility, or variations in closeness of contacts may play a significant role.
Edit intent: clarity
Original:  We find analytic techniques to predict how these effects alter the growth rate, probability, and size of epidemics which we validate for a realistic social network.
Revised:  We develop analytic techniques to predict how these effects alter the growth rate, probability, and size of epidemics which we validate for a realistic social network.
Edit intent: clarity
Original:  We find analytic techniques to predict how these effects alter the growth rate, probability, and size of epidemics which we validate for a realistic social network.
Revised:  We find analytic techniques to predict how these effects alter the growth rate, probability, and size of epidemics and validate the predictions with a realistic social network.
Edit intent: clarity
Original:  Our  results have a number of implications for  design of interventions.
Revised:  Our results have a number of implications for the design of interventions.
Edit intent: fluency
Original: We present a simple agent-based model to study how the proximate triggering factor of a crash or a rally might relate to its fundamental mechanism, and vice versa.
Revised: We present a simple agent-based model to study how the proximate triggering factor of a crash or a rally might relate to their fundamental mechanism, and vice versa.
Edit intent: fluency
Original:  Agents use Bayesian learning to adapt their strategy according to the past relevance of the three sources of information  .
Revised:  Our bounded rational agents continuously adapt their trading strategy to the current market regime by weighting each of these sources of information .
Edit intent: clarity
Original:  We find that rallies and crashes occur as amplifications of random lucky or unlucky streak of news, due to the feedback of  these news on the agents' strategies into collective transient herding regimes.
Revised:  We find that bubbles originate from a random lucky streak of these news on the agents' strategies into collective transient herding regimes.
Edit intent: clarity
Original: We study an S-I type epidemic model in an age-structured population, with mortality due to the disease.
Revised: We study an S--I type epidemic model in an age-structured population, with mortality due to the disease.
Edit intent: fluency
Original:  A threshold quantity is found that controls the stability of the disease-free equilibrium , and guarantees the existence of an endemic equilibrium.
Revised:  A threshold quantity is found that controls the stability of the disease-free equilibrium and guarantees the existence of an endemic equilibrium.
Edit intent: fluency
Original:  Conditions on the age-dependence of the susceptibility to infection are obtained that imply the uniqueness of the endemic equilibrium.
Revised:  We obtain conditions on the age-dependence of the susceptibility to infection are obtained that imply the uniqueness of the endemic equilibrium.
Edit intent: clarity
Original:  Conditions on the age-dependence of the susceptibility to infection are obtained that imply the uniqueness of the endemic equilibrium.
Revised:  Conditions on the age-dependence of the susceptibility to infection that imply the uniqueness of the endemic equilibrium.
Edit intent: clarity
Original: The paper is devoted to a problem inspired by the ``Minesweeper'' computer game.
Revised: The paper is devoted to a problem inspired by the "Minesweeper" computer game.
Edit intent: fluency
Original:  It is shown that certain configurations of open cells guarantee the existence and the uniqueness of the solution.
Revised:  It is shown that certain configurations of open cells guarantee the existence and the uniqueness of solution.
Edit intent: fluency
Original:  We consider various exactly solvable limits of a stochastic multi-particle model before focusing on the biologically relevant low-motor-density regime.
Revised:  We consider various exactly solvable limits of a stochastic multi-particle model before focusing on the low-motor-density regime.
Edit intent: clarity
Original:  Finally, we discuss the  physiological implications of our results.
Revised:  Finally, we discuss the possible physiological implications of our results.
Edit intent: clarity
Original: The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data.
Revised: The (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data.
Edit intent: clarity
Original:  As underlying calculi we consider MA, a subcalculus called MAsIF in which an image-finiteness condition holds and that we prove to be Turing complete , and their synchronous variants .
Revised:  As underlying calculi besides MA we consider a subcalculus in which an image-finiteness condition holds and that we prove to be Turing complete , and their synchronous variants .
Edit intent: clarity
Original:  As underlying calculi we consider MA, a subcalculus called MAsIF in which an image-finiteness condition holds and that we prove to be Turing complete , and their synchronous variants .
Revised:  As underlying calculi we consider MA, a subcalculus called MAsIF in which an image-finiteness condition holds and that we prove to be Turing complete . Synchronous variants of these calculi are studied as well .
Edit intent: clarity
Original:  In these calculi, we provide  operational characterisations of =L, both coinductive (as a form of bisimilarity) and inductive (based on structual properties of processes) , and show that =L is stricly finer than barbed congruence .
Revised:  In these calculi, we provide two operational characterisations of =L, both coinductive (as a form of bisimilarity) and inductive (based on structual properties of processes) , and show that =L is stricly finer than barbed congruence .
Edit intent: fluency
Original:  In these calculi, we provide  operational characterisations of =L, both coinductive (as a form of bisimilarity) and inductive (based on structual properties of processes) , and show that =L is stricly finer than barbed congruence .
Revised:  In these calculi, we provide operational characterisations of =L, both coinductive (as a form of bisimilarity) and an inductive one (based on structual properties of processes) , and show that =L is stricly finer than barbed congruence .
Edit intent: clarity
Original:  On MAsIF (both the asynchronous and the synchronous versions)we establish axiomatisations of =L, and then we use them to relate = L to structural congruence.
Revised:  On MAsIF (both the asynchronous and the synchronous version), enabling us to relate _= L to structural congruence.
Edit intent: clarity
Original:  This result improves over the data structure of Alstrup, Brodal, and Rauhe (FOCS 2000) that uses O(n\log^{1+\eps} n) space and supports queries in O(\log n+k) time and the data structure of Nekrich (SoCG'07) that uses O(n\log^{ 4 } n) space and supports queries in O(\log \log U + (\log \log n)^2 + k) time  n) space and also supports queries in O(\log \log U + (\log \log n)^2 + k) time but relies on randomization during the preprocessing stage} .
Revised:  This result improves over the data structure of Alstrup, Brodal, and Rauhe (FOCS 2000) that uses O(n\log^{1+\eps} n) space and supports queries in O(\log n+k) time , the data structure of Nekrich (SoCG'07) that uses O(n\log^{ 4 } n) space and supports queries in O(\log \log U + (\log \log n)^2 + k) time n) space and also supports queries in O(\log \log U + (\log \log n)^2 + k) time but relies on randomization during the preprocessing stage} .
Edit intent: coherence
Original:  In this article we describe an approach, called the concept-oriented programming ( CoP ), which focuses on modelling references assuming that they also possess application-specific structure and behaviour accounting for a great deal or even most of the overall program complexity.
Revised:  In this article we describe an approach, called concept-oriented programming ( CoP ), which focuses on modelling references assuming that they also possess application-specific structure and behaviour accounting for a great deal or even most of the overall program complexity.
Edit intent: fluency
Original:  In this article we describe an approach, called the concept-oriented programming ( CoP ), which focuses on modelling references assuming that they also possess application-specific structure and behaviour accounting for a great deal or even most of the overall program complexity.
Revised:  In this article we describe an approach, called the concept-oriented programming ( COP ), which focuses on modelling references assuming that they also possess application-specific structure and behaviour accounting for a great deal or even most of the overall program complexity.
Edit intent: clarity
Original:  Thus references in CoP are completely legalized and get the same status as objects while the functions are distributed among both objects and references.
Revised:  References in COP are completely legalized and get the same status as objects while the functions are distributed among both objects and references.
Edit intent: clarity
Original:  The main advantage of CoP is that it allows programmers to describe two sides of any program: explicitly used functions of objects and intermediate functionality of references having cross-cutting nature and executed implicitly behind the scenes during object access.
Revised:  The main advantage of COP is that it allows programmers to describe two sides of any program: explicitly used functions of objects and intermediate functionality of references having cross-cutting nature and executed implicitly behind the scenes during object access.
Edit intent: clarity
Original:  Individual use of these predictors has a performance comparable or even better than other proposed methods : gVSL2 reaches a sensitivity (S_n) of 0.81, a specificity (S_p) of 0.89 and a level of false predictions (f_p) of 0.11.
Revised:  These predictors have an individual performance comparable or even better than other proposed methods : gVSL2 reaches a sensitivity (S_n) of 0.81, a specificity (S_p) of 0.89 and a level of false predictions (f_p) of 0.11.
Edit intent: clarity
Original:  We introduce a strictly unanimous combination score S_{SU} and a new score S_0, combining 10 dichotomic predictors.
Revised:  We introduce a strictly unanimous score S_{SU} and a new score S_0, combining 10 dichotomic predictors.
Edit intent: clarity
Original:  comparable, but not coincident with similar previous determinations.
Revised:  compatible with previous determinations.
Edit intent: clarity
Original:  a first estimate of the critical exponent is 1.95 %DIFDELCMD < \pm %%%  0.21 .
Revised:  a first estimate of the critical exponent is 1.95 %DIFDELCMD < \pm %%% 0.21 
Edit intent: fluency
Original: We study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P such that no path in X is a subpath of P. Path P is allowed to repeat vertices and edges.
Revised: In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P such that no path in X is a subpath of P. Path P is allowed to repeat vertices and edges.
Edit intent: clarity
Original: A model is introduced  in which there is a small agent who is more susceptible to the flow of information in the market than the general market participant, and who tries to implement strategies based on the additional information.
Revised: A model is introduced for the situation in which there is a small agent who is more susceptible to the flow of information in the market than the general market participant, and who tries to implement strategies based on the additional information.
Edit intent: clarity
Original:  The precision of the asymptotic  depends on the joint spectral radius of the linear representation of the sequence , and the coefficients are obtained through some dilation equations.
Revised:  The precision of the asymptotic depends on the joint spectral radius of the linear representation of the sequence ; the coefficients are obtained through some dilation equations.
Edit intent: coherence
Original:  The simulations agree with the experimental observations very well, especially in some details .
Revised:  The simulations agree with the experimental observations very well, not only in the variation trends but also in some fine structures .
Edit intent: clarity
Original:  Inversely, the genomic data of contemporary species can help reconstruct the genetic code chronology and amino acid chronology in early time .
Revised:  Inversely, the genomic data of contemporary species can help reconstruct the genetic code chronology and amino acid chronology in primordial period .
Edit intent: clarity
Original:  Our results are helpful to understand the intrinsic mechanism of the evolution of life more profoundly .
Revised:  Our results may shed light on the intrinsic mechanism of the evolution of life more profoundly .
Edit intent: clarity
Original: Most of real life systems have a random component: the multitude of endogenous and exogenous factors influencing them result in stochastic fluctuations of the parameters influencing their dynamics.
Revised: Most real life systems have a random component: the multitude of endogenous and exogenous factors influencing them result in stochastic fluctuations of the parameters influencing their dynamics.
Edit intent: clarity
Original: Most of real life systems have a random component: the multitude of endogenous and exogenous factors influencing them result in stochastic fluctuations of the parameters influencing their dynamics.
Revised: Most of real life systems have a random component: the multitude of endogenous and exogenous factors influencing them result in stochastic fluctuations of the parameters determining their dynamics.
Edit intent: clarity
Original:  While in the physical systems the random component is usually additive (e.g. molecules can absorb or emit spontaneously energy quanta), in biological, social, economic and financial systems the noise is mainly multiplicative .
Revised:  These empirical systems are in many cases subject to noise of multiplicative nature .
Edit intent: clarity
Original:  The special properties of multiplicative noise as opposed to the additive noise have been noticed for a long while.
Revised:  The special properties of multiplicative noise as opposed to additive noise have been noticed for a long while.
Edit intent: fluency
Original:  In the present paper we study in some detail the difference between the emergence of cooperation in additive vs. multiplicative random environments.
Edit intent: coherence
Original:  In this paper,we explore the relationship between input current and the firing rate (f-I curve) in the presence of background synaptic inputs.
Revised:  In this paper,we explore the relationship between the input and the firing rate (f-I curve) in the presence of background synaptic inputs.
Edit intent: clarity
Original:  In this paper,we explore the relationship between input current and the firing rate (f-I curve) in the presence of background synaptic inputs.
Revised:  In this paper,we explore the relationship between input current and the firing rate of a neuron, in the presence of background synaptic inputs.
Edit intent: clarity
Original:  We find that the leaky integrate-and-fire neuron cannot reproduce the f-I curves of a cortical neuron, while the leaky integrate-and-fire neuron with an adapting threshold reproduce these curves very well.
Revised:  First, we found that the leaky integrate-and-fire neuron cannot reproduce the f-I curves of a cortical neuron, while the leaky integrate-and-fire neuron with an adapting threshold reproduce these curves very well.
Edit intent: coherence