wanyu/IteraTeR_v2 huggingface dataset:
Original:  These are: 1 - fast oscillations are always supercritical for realistic transfer functions.
Revised:  These are: 1 - Fast oscillations are always supercritical for realistic transfer functions.
Edit intent: fluency
Original: \pairGU{\tt  {\tt  {\tt  {\tt   Results: In this paper we present the inverse folding algorithm {\tt inv } as well as two applications .
Revised: \pairGU{\tt {\tt {\tt {\tt Inv Results: In this paper we present the inverse folding algorithm {\tt inv } as well as two applications .
Edit intent: fluency
Original: \pairGU{\tt  {\tt  {\tt  {\tt   Results: In this paper we present the inverse folding algorithm {\tt inv } as well as two applications .
Revised: \pairGU{\tt {\tt {\tt {\tt Results: In this paper we present the inverse folding algorithm {\tt Inv } as well as two applications .
Edit intent: fluency
Original: \pairGU{\tt  {\tt  {\tt  {\tt   Results: In this paper we present the inverse folding algorithm {\tt inv } as well as two applications .
Revised: \pairGU{\tt {\tt {\tt {\tt Results: In this paper we present the inverse folding algorithm {\tt inv } .
Edit intent: coherence
Original:  We give a detailed analysis of {\tt inv }, including pseudocodes.
Revised:  We give a detailed analysis of {\tt Inv }, including pseudocodes.
Edit intent: fluency
Original:  The algorithm is freely available at URL We show , using 3-noncrossing nonplanar RNA pseudoknot structures as an example, that {\tt inv } allows to design specific 3-noncrossing  RNA structures.
Revised:  We show that {\tt inv } allows to design specific 3-noncrossing RNA structures.
Edit intent: clarity
Original:  The algorithm is freely available at URL We show , using 3-noncrossing nonplanar RNA pseudoknot structures as an example, that {\tt inv } allows to design specific 3-noncrossing  RNA structures.
Revised:  The algorithm is freely available at URL We show , using 3-noncrossing nonplanar RNA pseudoknot structures as an example, that {\tt Inv } allows to design specific 3-noncrossing RNA structures.
Edit intent: fluency
Original:  The algorithm is freely available at URL We show , using 3-noncrossing nonplanar RNA pseudoknot structures as an example, that {\tt inv } allows to design specific 3-noncrossing  RNA structures.
Revised:  The algorithm is freely available at URL We show , using 3-noncrossing nonplanar RNA pseudoknot structures as an example, that {\tt inv } allows to design in particular 3-noncrossing RNA structures.
Edit intent: clarity
Original:  Furthermore we use {\tt inv } for estimating the distance of the neutral networks.
Revised:  Furthermore we use {\tt Inv } for estimating the distance of the neutral networks.
Edit intent: fluency
Original:  Conclusions: The algorithm {\tt inv } extends inverse folding capabilities to RNA pseudoknot structures.
Revised:  Conclusions: The algorithm {\tt Inv } extends inverse folding capabilities to RNA pseudoknot structures.
Edit intent: fluency
Original:  In comparison with {\tt RNAinverse} it uses new ideas, for instance by taking sets of competing structures into consideration .
Revised:  In comparison with {\tt RNAinverse} it uses new ideas, for instance by considering sets of competing structures into consideration .
Edit intent: clarity
Original:  In comparison with {\tt RNAinverse} it uses new ideas, for instance by taking sets of competing structures into consideration .
Revised:  In comparison with {\tt RNAinverse} it uses new ideas, for instance by taking sets of competing structures .
Edit intent: clarity
Original:  As a result, {\tt inv } is  able to find novel sequences even for RNA secondary structures  .
Revised:  As a result, {\tt Inv } is able to find novel sequences even for RNA secondary structures .
Edit intent: fluency
Original:  In one and two dimensions, we find a linear and a square-root dependence of the wave velocity on the particle density.
Revised:  In one and two dimensions, we find a linear and a square-root dependence of the speed on the particle density.
Edit intent: clarity
Original: The Brownian dynamics of a single bacterium coupled by chemotaxis to a diffusing concentration field which is secreted by the particle itself is studied by computer simulations in spatial dimensions d=1,2,3.
Revised: The Brownian dynamics of a single microorganism coupled by chemotaxis to a diffusing concentration field which is secreted by the particle itself is studied by computer simulations in spatial dimensions d=1,2,3.
Edit intent: clarity
Original: The Brownian dynamics of a single bacterium coupled by chemotaxis to a diffusing concentration field which is secreted by the particle itself is studied by computer simulations in spatial dimensions d=1,2,3.
Revised: The Brownian dynamics of a single bacterium coupled by chemotaxis to a diffusing concentration field which is secreted by the microorganism itself is studied by computer simulations in spatial dimensions d=1,2,3.
Edit intent: clarity
Original:  For a chemoattractant, we find a transient dynamical arrest until the particle diffuses for long times.
Revised:  For a chemoattractant, we find a transient dynamical arrest until the microorganism diffuses for long times.
Edit intent: clarity
Original:  The upper bound uses a probabilistic construction , and we have no explicit construction coming even close to it.
Revised:  The upper bound uses probabilistic means , and we have no explicit construction coming even close to it.
Edit intent: clarity
Original:  We give some arguments why it is difficult to find explicit constructions : First, any treelike resolution refutation of any unsatisfiable linear k-CNF formula has size at least 2^(2^( (k-1) / 2)-1).
Revised:  We give some arguments why it is difficult to find explicit constructions : First, any treelike resolution refutation of any unsatisfiable linear k-CNF formula has size at least 2^(2^( k / 2)-1).
Edit intent: coherence
Original: ^a clauses, where a is roughly 2 and the size of this tower is roughly k.
Revised: ^a clauses, where a is approximately 2 and the size of this tower is roughly k.
Edit intent: clarity
Original:  In this paper, the authors try to find the evidence to prove that entropy is related to ACO convergence , especially to the estimation of optimal iteration number .
Revised:  In this paper, the authors try to find the evidence to prove that entropy is related to the convergence of ACO , especially to the estimation of optimal iteration number .
Edit intent: fluency
Original:  We show they admit the same limit dynamics in the regime of low fluctuations of the volatility process, under which we derive the expressions of the characteristic function and the first four cumulants for the risk neutral probability measure.
Revised:  We show they admit the same limit dynamics in the regime of low fluctuations of the volatility process, under which we derive the expressions of the characteristic function associated to the risk neutral probability measure.
Edit intent: clarity
Original:  We implement a conceptually simple two steps calibration procedure which considerably reduces the computational burden and we test it against a data set of options traded on the Milan Stock Exchange.
Revised:  We implement a conceptually simple two steps calibration procedure . It has been tested against a data set of options traded on the Milan Stock Exchange.
Edit intent: coherence
Original:  Our results show a good agreement with the market data for all the considered models.
Revised:  The analysis we present reveals a good agreement with the market data for all the considered models.
Edit intent: clarity
Original:  Its knowledge allows us to compute option prices exploiting  Lewis and Lipton formula .
Revised:  Its knowledge allows us to compute option prices exploiting a formula derived by Lewis and Lipton formula .
Edit intent: clarity
Original:  Its knowledge allows us to compute option prices exploiting  Lewis and Lipton formula .
Revised:  Its knowledge allows us to compute option prices exploiting Lewis and Lipton .
Edit intent: clarity
Original:  We also compute the analytical expressions of the first four cumulants, being crucial to implement a simple two steps calibration procedure.
Revised:  We also compute the analytical expressions of the first four cumulants, that are crucial to implement a simple two steps calibration procedure.
Edit intent: coherence
Original:  The analysis we present reveals a good agreement with the market implied surfaces and corroborates the accuracy of the linear approximation.
Revised:  The data analysis that we present reveals a good agreement with the market implied surfaces and corroborates the accuracy of the linear approximation.
Edit intent: clarity
Original:  The analysis we present reveals a good agreement with the market implied surfaces and corroborates the accuracy of the linear approximation.
Revised:  The analysis we present reveals a good fit with the market implied surfaces and corroborates the accuracy of the linear approximation.
Edit intent: clarity
Original:  It is based on the cavity method and is used to study the maximum-clique and  graph-alignment problems for random graphs.
Revised:  It is based on the cavity method and is used to study the maximum-clique and the graph-alignment problems for random graphs.
Edit intent: fluency
Original:  It is based on the cavity method and is used to study the maximum-clique and  graph-alignment problems for random graphs.
Revised:  It is based on the cavity method and is used to study the maximum-clique and graph-alignment problems in random graphs.
Edit intent: fluency
Original:  The algorithm can be used to analyze large graphs and may find applications in fields such as computational biology.
Revised:  The algorithm allows to analyze large graphs and may find applications in fields such as computational biology.
Edit intent: clarity
Original:  Choosing human face recognition as a test task, we show that, under the condition of open-end unsupervised incremental learning, the system is able to form memory traces for individual faces in a parts-based fashion.
Revised:  Choosing human face recognition as a test task, we show that, under the condition of open-ended, unsupervised incremental learning, the system is able to form memory traces for individual faces in a parts-based fashion.
Edit intent: fluency
Original: We study the spread of susceptible-infected-recovered (SIR) infectious diseases where an individual's infectiousness and probability of recovery depend on his/her ``age'' of infection.
Revised: We study the spread of susceptible-infected-recovered (SIR) infectious diseases where an individual's infectiousness and probability of recovery depend on his/her "age" of infection.
Edit intent: fluency
Original:  We introduce a ``memoryless'' ODE system which approximates the true solutions.
Revised:  We introduce a "memoryless" ODE system which approximates the true solutions.
Edit intent: fluency
Original: We prove that the Castelnuovo-Mumford regularity of the sheaf of differential p-forms on a smooth complex projective variety X is bounded by p(e +1)D \dim X , where e  and D are the maximal codimension resp. degree of all irreducible components of X.
Revised: We prove that the Castelnuovo-Mumford regularity of the sheaf of differential p-forms on X is bounded by p(e +1)D \dim X , where e and D are the maximal codimension resp. degree of all irreducible components of X.
Edit intent: clarity
Original: We prove that the Castelnuovo-Mumford regularity of the sheaf of differential p-forms on a smooth complex projective variety X is bounded by p(e +1)D \dim X , where e  and D are the maximal codimension resp. degree of all irreducible components of X.
Revised: We prove that the Castelnuovo-Mumford regularity of the sheaf of differential p-forms on a smooth complex projective variety X is bounded by p(e +1)D , where e and D are the maximal codimension resp. degree of all irreducible components of X.
Edit intent: coherence
Original:  This result allows us to give a parallel polynomial time algorithm for computing the algebraic de Rham cohomology of X . We also include a test whether a projective variety is smooth running in parallel polynomial time .
Revised:  This result allows us to give a parallel polynomial time algorithm for computing the algebraic de Rham cohomology of X . We also include a test whether a projective variety is smooth .
Edit intent: clarity
Original:  Our main theoretical result is that the Castelnuovo-Mumford regularity of the sheaf of differential p-forms on X is bounded by ~ p(em+1)D, where e, m, and D are the maximal codimension, dimension, and degree, respectively, of all irreducible components of X.
Revised:  Our main theoretical result is that the Castelnuovo-Mumford regularity of the sheaf of differential p-forms on X is bounded by p(em+1)D, where e, m, and D are the maximal codimension, dimension, and degree, respectively, of all irreducible components of X.
Edit intent: coherence
Original:  Suppose that ne paths are corrupted by the omniscient adversary , under our proposed protocol, the errors can be corrected at all the end nodes with 4ne protection paths.
Revised:  Suppose that ne paths are corrupted by the omniscient adversary . Under our proposed protocol, the errors can be corrected at all the end nodes with 4ne protection paths.
Edit intent: fluency
Original:  More generally, if there are ne adversarial errors and nf failures, 4ne + 2nf protection paths are sufficient.
Revised:  More generally, if there are ne adversarial errors and nf failures, 4ne + 2n_f protection paths are sufficient.
Edit intent: clarity
Original:  On the basis of results of the previous work arXiv:0904.1198%DIFDELCMD < ] %%% the analytical expression of energy of a molecule in considered area has been obtained.
Revised:  On the basis of results of the previous work %DIFDELCMD < ] %%% the analytical expression of energy of a molecule in considered area has been obtained.
Edit intent: clarity
Original:  Numerical scenarios confirm that such correction can be non-negligible , thus making unadjusted double-curve prices, in principle, not arbitrage free  .
Revised:  Numerical scenarios confirm that such correction can be non negligible , thus making unadjusted double-curve prices, in principle, not arbitrage free .
Edit intent: fluency
Original: Many cortical areas increase considerably in size during postnatal development, progressively displacing neuronal cell bodies from each other.
Revised: Many cortical areas increase in size considerably during postnatal development, progressively displacing neuronal cell bodies from each other.
Edit intent: fluency
Original:  At present it is unclear to what extent this requires remodeling of neuronal circuits.
Revised:  At present , little is known about how cortical growth affects the development of neuronal circuits.
Edit intent: clarity
Original:  Here, in acute and chronic experiments, we study the layout of ocular dominance columns (OD)  in cat primary visual cortex (V1) during a period of substantial postnatal growth.
Revised:  Here, in acute and chronic experiments, we study the layout of ocular dominance (OD) in cat primary visual cortex (V1) during a period of substantial postnatal growth.
Edit intent: clarity
Original:  Here, in acute and chronic experiments, we study the layout of ocular dominance columns (OD)  in cat primary visual cortex (V1) during a period of substantial postnatal growth.
Revised:  Here, in acute and chronic experiments, we study the layout of ocular dominance columns (OD) columns in cat primary visual cortex (V1) during a period of substantial postnatal growth.
Edit intent: fluency
Original:  We find that OD columns reorganize such that the spacing between columns is largely unaffected, despite a considerable size increase of V1 . We show that the observed mode of reorganization can be explained by a fundamental mechanism of growth induced reorganization inherent to a very general class of models of activity-dependent formation of OD columns  .
Revised:  We find that despite a considerable size increase of V1 . We show that the observed mode of reorganization can be explained by a fundamental mechanism of growth induced reorganization inherent to a very general class of models of activity-dependent formation of OD columns .
Edit intent: clarity
Original:  We find that OD columns reorganize such that the spacing between columns is largely unaffected, despite a considerable size increase of V1 . We show that the observed mode of reorganization can be explained by a fundamental mechanism of growth induced reorganization inherent to a very general class of models of activity-dependent formation of OD columns  .
Revised:  We find that OD columns reorganize such that the spacing between columns is largely unaffected, despite a considerable size increase of V1 . We show that the observed mode of reorganization can be explained by a fundamental mechanism of growth induced reorganization inherent to a wide class of models of activity-dependent formation of OD columns .
Edit intent: clarity
Original:  We find that OD columns reorganize such that the spacing between columns is largely unaffected, despite a considerable size increase of V1 . We show that the observed mode of reorganization can be explained by a fundamental mechanism of growth induced reorganization inherent to a very general class of models of activity-dependent formation of OD columns  .
Revised:  We find that OD columns reorganize such that the spacing between columns is largely unaffected, despite a considerable size increase of V1 . We show that the observed mode of reorganization can be explained by a fundamental mechanism of growth induced reorganization inherent to a very general class of models for the activity-dependent formation of OD columns .
Edit intent: clarity
Original: We report on a computational study showing that the leak conductance density, GL \GL , in the squid giant axon appears to be optimal for the action potential firing frequency.
Revised: We report on a computational study showing that the leak conductance density, \GL , in the squid giant axon appears to be optimal for the action potential firing frequency.
Edit intent: clarity
Original:  More precisely, a conservative set of assumptions about the nature of the leak channel lead to the result that the experimental value for GL \GL is very close to the theoretical value which minimizes the absolute refractory period of the action potential, and thereby maximizes the maximum firing frequency .
Revised:  More precisely, a conservative set of assumptions about the nature of the leak channel lead to the result that the experimental value for \GL is very close to the theoretical value which minimizes the absolute refractory period of the action potential, and thereby maximizes the maximum firing frequency .
Edit intent: clarity
Original:  More precisely, a conservative set of assumptions about the nature of the leak channel lead to the result that the experimental value for GL \GL is very close to the theoretical value which minimizes the absolute refractory period of the action potential, and thereby maximizes the maximum firing frequency .
Revised:  More precisely, a conservative set of assumptions about the nature of the leak channel lead to the result that the experimental value for GL \GL is very close to the theoretical value which minimizes the absolute refractory period of the action potential, thereby maximizing the maximum firing frequency .
Edit intent: coherence
Original:  The marking process has a "product form" stationary distribution if the probability of viewing a given marking can be decomposed as the product over places of terms depending only on the local marking.
Revised:  The marking process has a ``product form'' stationary distribution if the probability of viewing a given marking can be decomposed as the product over places of terms depending only on the local marking.
Edit intent: fluency
Original:  The marking process has a ``product form'' stationary distribution if the probability of viewing a given marking can be decomposed as the product over places of terms depending only on the local marking.
Revised:  The marking process has a "product form" stationary distribution if the probability of viewing a given marking can be decomposed as the product over places of terms depending only on the local marking.
Edit intent: fluency
Original:  Varying the intensity of the input noise varies the mean of the output noise after the passage through the filter, which causes a change of stability properties of the system.
Revised:  Varying input noise intensity varies the mean of the output noise after the passage through the filter, which causes a change of stability properties of the system.
Edit intent: clarity
Original:  Varying the intensity of the input noise varies the mean of the output noise after the passage through the filter, which causes a change of stability properties of the system.
Revised:  Varying the intensity of the input noise varies the mean of the noise after the passage through the filter, which causes a change of stability properties of the system.
Edit intent: clarity
Original:  Varying the intensity of the input noise varies the mean of the output noise after the passage through the filter, which causes a change of stability properties of the system.
Revised:  Varying the intensity of the input noise varies the mean of the output noise after the passage through the filter, which changes the stability properties of the system.
Edit intent: clarity
Original:  I demonstrate this by an example of two different models of lac operon .
Revised:  We test the predictions on two models of lac operon .
Edit intent: clarity
Original:  We construct a hexagonal lattice with repressilators on each triangle, and use this as a model system for multiple interacting feed-back loops.
Revised:  We construct a hexagonal lattice with repressilators on each triangle, and use this as a model system for multiple interacting feedback loops.
Edit intent: fluency
Original:  As an illustration, we show how choices of functions based on biological considerations give rise to network evolution which is in good agreement with data on brain development .
Revised:  As an illustration, we show how choices of functions based on biological considerations give rise to network evolution which is in good agreement with experimental data .
Edit intent: clarity
Original:  In particular, the phenomenon known as synaptic pruning and the emergence of highly heterogeneous, small--world topologies are features well described, while the critical point exhibits a peak in unsynchronizability .
Revised:  In particular, many nontrivial topological features of the worm's brain arise naturally at a critical point .
Edit intent: clarity
Original: As an alternative to parsimony analyses, stochastic models have been proposed (Lewis  2001), (Nylander, et al.  2004) for morphological characters, so that maximum likelihood or Bayesian analyses may be used for phylogenetic inference.
Revised: As an alternative to parsimony analyses, stochastic models have been proposed (Lewis , 2001), (Nylander, et al. 2004) for morphological characters, so that maximum likelihood or Bayesian analyses may be used for phylogenetic inference.
Edit intent: fluency
Original: As an alternative to parsimony analyses, stochastic models have been proposed (Lewis  2001), (Nylander, et al.  2004) for morphological characters, so that maximum likelihood or Bayesian analyses may be used for phylogenetic inference.
Revised: As an alternative to parsimony analyses, stochastic models have been proposed (Lewis 2001), (Nylander, et al. , 2004) for morphological characters, so that maximum likelihood or Bayesian analyses may be used for phylogenetic inference.
Edit intent: fluency
Original:  Or in other words, whether\textit{weak evolvability is equivalent tostrong evolvability .
Revised:  Or in other words, whether\textit{weak evolvability strong evolvability .
Edit intent: clarity
Original:  Or in other words, whether\textit{weak evolvability is equivalent tostrong evolvability .
Revised:  Or in other words, whether\textit{weak evolvability is equivalent to .
Edit intent: fluency