wanyu/IteraTeR_v2 huggingface dataset:
Original:  We consider an enzyme solution is an ensemble of individual molecules with different values of the activation barrier energy described by the distribution.
Revised:  We consider an enzyme solution as an ensemble of individual molecules with different values of the activation barrier energy described by the distribution.
Edit intent: fluency
Original:  From  solvent viscosity effect on the preexponent we derive the integral equation for the distribution and find its approximate solution.
Revised:  From the solvent viscosity effect on the preexponent we derive the integral equation for the distribution and find its approximate solution.
Edit intent: fluency
Original:  Firstly it yields a simple interpretation of  solvent viscosity dependence for enzymatic/protein reactions that requires neither a modification of the Kramers' theory nor that of the Stokes law.
Revised:  Firstly it yields a simple interpretation of the solvent viscosity dependence for enzymatic/protein reactions that requires neither a modification of the Kramers' theory nor that of the Stokes law.
Edit intent: fluency
Original:  Secondly our approach enables us to deduce the form of the distribution over activation barrier energies.
Revised:  On the other hand our approach enables us to deduce the form of the distribution over activation barrier energies.
Edit intent: coherence
Original:  The obtained function has a familiar bell-shaped form and is in qualitative agreement with  results of single enzyme kinetics measurements.
Revised:  The obtained function has a familiar bell-shaped form and is in qualitative agreement with the results of single enzyme kinetics measurements.
Edit intent: fluency
Original:  To reproduce these collective downturns, we propose a self-organized model of cascade spreading based on a probabilistic response of the system 's elements to stress conditions.
Revised:  To reproduce these collective downturns, we propose a self-organized model of cascade spreading based on a probabilistic response of the system elements to stress conditions.
Edit intent: fluency
Original:  In this study, we investigate betweenness centrality, entropy, the Gini coefficient  , and more recently proposed measures for diversity that combine the statistics of vectors and distances in networks, in terms of their potential to fill this gap .
Revised:  In this study, we investigate betweenness centrality, entropy, the Gini coefficient ) , and more recently proposed measures for diversity that combine the statistics of vectors and distances in networks, in terms of their potential to fill this gap .
Edit intent: fluency
Original:  The effects of various normalizations are specified and measured using the matrix of 8,207 journals contained in the Journal Citation Reports of the (Social) Science Citation Index . Betweenness centrality in  (1-mode) affiliations networks provides an indicator outperforming betweenness in the  (2-mode) citation network.
Revised:  The effects of various normalizations are specified and measured using the matrix of 8,207 journals contained in the Journal Citation Reports of the (Social) Science Citation Index . Betweenness centrality in symmetrical (1-mode) affiliations networks provides an indicator outperforming betweenness in the (2-mode) citation network.
Edit intent: clarity
Original:  The effects of various normalizations are specified and measured using the matrix of 8,207 journals contained in the Journal Citation Reports of the (Social) Science Citation Index . Betweenness centrality in  (1-mode) affiliations networks provides an indicator outperforming betweenness in the  (2-mode) citation network.
Revised:  The effects of various normalizations are specified and measured using the matrix of 8,207 journals contained in the Journal Citation Reports of the (Social) Science Citation Index . Betweenness centrality in (1-mode) affiliations networks provides an indicator outperforming betweenness in the asymmetrical (2-mode) citation network.
Edit intent: clarity
Original:  Entropy as a vector-based indicator performs better than the Gini coefficient, but is sensitive to size.
Revised:  Among the vector-based indicator performs better than the Gini coefficient, but is sensitive to size.
Edit intent: clarity
Original:  The new diversity measure provides reasonable results when (1 - cosine) is assumed as a measure for the distance, but results using Euclidean distances are difficult to interpret.
Revised:  The new diversity measure provides reasonable results when (1 - cosine) is assumed as a measure for the distance, but results using Euclidean distances were difficult to interpret.
Edit intent: fluency
Original:  This problem typically occurs in assembly lines in sheltered work centers for the disabled and differs from the classical simple assembly line balancing problem in the fact that task execution times vary according to the assigned worker.
Revised:  This problem typically occurs in assembly lines in sheltered work centers for the disabled . Different from the classical simple assembly line balancing problem in the fact that task execution times vary according to the assigned worker.
Edit intent: coherence
Original:  This problem typically occurs in assembly lines in sheltered work centers for the disabled and differs from the classical simple assembly line balancing problem in the fact that task execution times vary according to the assigned worker.
Revised:  This problem typically occurs in assembly lines in sheltered work centers for the disabled and differs from the classical simple assembly line balancing problem , the task execution times vary according to the assigned worker.
Edit intent: coherence
Original:  We develop a constructive heuristic  based on task assignment priority rules defining the order the tasks should be assigned to the workstations.
Revised:  We develop a constructive heuristic framework based on task assignment priority rules defining the order the tasks should be assigned to the workstations.
Edit intent: clarity
Original:  We develop a constructive heuristic  based on task assignment priority rules defining the order the tasks should be assigned to the workstations.
Revised:  We develop a constructive heuristic based on task assignment priority rules defining the order in which the tasks and workers should be assigned to the workstations.
Edit intent: clarity
Original:  Four of these rules are presented and the performance of the method is analyzed in terms of its computational complexity and also via a set of computational experiments used to evaluate the practical efficiency of the heuristic as a stand-alone method as well as its ability to speed-up the convergence of two more elaborate metaheuristic approaches.
Revised:  We present a number of such rules and compare their performance across three possible uses: as a stand-alone method as well as its ability to speed-up the convergence of two more elaborate metaheuristic approaches.
Edit intent: clarity
Original:  Our results show that the heuristics are extremely fast, they obtain compatible results as a stand-alone method and are efficient when used as a initial solution generator or as a solution decoder within more elaborate approaches.
Revised:  Our results show that the heuristics are fast, they obtain compatible results as a stand-alone method and are efficient when used as a initial solution generator or as a solution decoder within more elaborate approaches.
Edit intent: clarity
Original:  Our results show that the heuristics are extremely fast, they obtain compatible results as a stand-alone method and are efficient when used as a initial solution generator or as a solution decoder within more elaborate approaches.
Revised:  Our results show that the heuristics are extremely fast, they obtain good results as a stand-alone method and are efficient when used as a initial solution generator or as a solution decoder within more elaborate approaches.
Edit intent: clarity
Original: It has been suggested that marked point processes might be good candidates for the modeling of financial high-frequency data.
Revised: It has been suggested that marked point processes might be good candidates for the modelling of financial high-frequency data.
Edit intent: fluency
Original:  In this paper, we propose to enhance a basic  order book simulator with  limit and market orders arrival times following mutually ( unsymmetrically ) exciting Hawkes processes.
Revised:  In this paper, we propose to enhance a basic order book simulator with limit and market orders following mutually ( unsymmetrically ) exciting Hawkes processes.
Edit intent: clarity
Original:  In this paper, we propose to enhance a basic  order book simulator with  limit and market orders arrival times following mutually ( unsymmetrically ) exciting Hawkes processes.
Revised:  In this paper, we propose to enhance a basic order book simulator with limit and market orders arrival times following mutually ( asymmetrically ) exciting Hawkes processes.
Edit intent: fluency
Original:  Modeling is based on empirical observations on interval times between orders that we verify on several markets (equity, bond futures, index futures).
Revised:  Modelling is based on empirical observations on interval times between orders that we verify on several markets (equity, bond futures, index futures).
Edit intent: fluency
Original:  Modeling is based on empirical observations on interval times between orders that we verify on several markets (equity, bond futures, index futures).
Revised:  Modeling is based on empirical observations on time intervals between orders that we verify on several markets (equity, bond futures, index futures).
Edit intent: fluency
Original: Bulatov (2008) has given a dichotomy for the counting constraint satisfaction problem ( #CSP ) . A problem from #CSP is characterised by a constraint language,  a fixed, finite set of relations over a finite domain  .
Revised: Bulatov (2008) gave a dichotomy for the counting constraint satisfaction problem ( #CSP ) . A problem from #CSP is characterised by a constraint language, a fixed, finite set of relations over a finite domain .
Edit intent: coherence
Original: Bulatov (2008) has given a dichotomy for the counting constraint satisfaction problem ( #CSP ) . A problem from #CSP is characterised by a constraint language,  a fixed, finite set of relations over a finite domain  .
Revised: Bulatov (2008) has given a dichotomy for the counting constraint satisfaction problem #CSP ) . A problem from #CSP is characterised by a constraint language, a fixed, finite set of relations over a finite domain .
Edit intent: clarity
Original: Bulatov (2008) has given a dichotomy for the counting constraint satisfaction problem ( #CSP ) . A problem from #CSP is characterised by a constraint language,  a fixed, finite set of relations over a finite domain  .
Revised: Bulatov (2008) has given a dichotomy for the counting constraint satisfaction problem ( #CSP . A problem from #CSP is characterised by a constraint language, a fixed, finite set of relations over a finite domain .
Edit intent: fluency
Original: Bulatov (2008) has given a dichotomy for the counting constraint satisfaction problem ( #CSP ) . A problem from #CSP is characterised by a constraint language,  a fixed, finite set of relations over a finite domain  .
Revised: Bulatov (2008) has given a dichotomy for the counting constraint satisfaction problem ( #CSP ) . A problem from #CSP is characterised by a constraint language, which is a fixed, finite set of relations over a finite domain .
Edit intent: coherence
Original:  En route, we give a simplification of a decision algorithm for strongly rectangular constraint languages  due to Bulatov and Dalmau (2006)  .
Revised:  En route, we give a simplification of a decision algorithm for strongly rectangular constraint languages , due to Bulatov and Dalmau (2006) .
Edit intent: fluency
Original:  These algorithms and the biological requirement of more reliable interactions motivate to utilize the additional information contained in multiple sequence alignments and to generalize the above framework to the partition functionand base pairing probabilities for multiple sequence alignments.  
Revised:  The requirement of more reliable interactions motivate to utilize the additional information contained in multiple sequence alignments and to generalize the above framework to the partition functionand base pairing probabilities for multiple sequence alignments. 
Edit intent: coherence
Original:  These algorithms and the biological requirement of more reliable interactions motivate to utilize the additional information contained in multiple sequence alignments and to generalize the above framework to the partition functionand base pairing probabilities for multiple sequence alignments.  
Revised:  These algorithms and the biological requirement of more reliable interactions motivate to utilize the additional information contained in multiple sequence alignments and to generalize the above framework to the partition functionand base pairing probabilities for multiple sequence alignments.rip 
Edit intent: fluency
Original:  These algorithms and the biological requirement of more reliable interactions motivate to utilize the additional information contained in multiple sequence alignments and to generalize the above framework to the partition functionand base pairing probabilities for multiple sequence alignments.  
Revised:  These algorithms and the biological requirement of more reliable interactions motivate to utilize the additional information contained in multiple sequence alignments and to generalize the above framework to the partition functionand base pairing probabilities for multiple sequence alignments. rip 
Edit intent: fluency
Original:  We present a dynamic programming algorithm (rip ) for computing  the partition function, base pairing and hybrid loop probabilitiesfor canonical RNA-RNA interaction structures, i.e. structures without isolated interactions.
Revised:  We present a dynamic programming algorithm ( ) for computing the partition function, base pairing and hybrid loop probabilitiesfor canonical RNA-RNA interaction structures, i.e. structures without isolated interactions.
Edit intent: fluency
Original:  We present a dynamic programming algorithm (rip ) for computing  the partition function, base pairing and hybrid loop probabilitiesfor canonical RNA-RNA interaction structures, i.e. structures without isolated interactions.
Revised:  We present a dynamic programming algorithm (rip . the partition function, base pairing and hybrid loop probabilitiesfor canonical RNA-RNA interaction structures, i.e. structures without isolated interactions.
Edit intent: clarity
Original:  The algorithm takes a set of aligned RNA sequences as input and incorporates pre-processed alignment corrections as well as input constraints, similar toRNAfold .
Revised:  The algorithm takes a set of RNAfold .
Edit intent: clarity
Original:  The algorithm takes a set of aligned RNA sequences as input and incorporates pre-processed alignment corrections as well as input constraints, similar toRNAfold .
Revised:  The algorithm takes a set of aligned RNA sequences as input and incorporates pre-processed alignment corrections as well as input constraints, similar to .
Edit intent: clarity
Original:  The hybrid probabilities allow us to derive the probabilities of contact regions  .
Revised:  The hybrid probabilities allow us to derive the probabilities of contact regionsrip .
Edit intent: fluency
Original:  The hybrid probabilities allow us to derive the probabilities of contact regions  .
Revised:  The hybrid probabilities allow us to derive the probabilities of contact regions, .
Edit intent: fluency
Original:  The source code ofrip can freely be downloaded from URL \section{ \texttt{
Revised:  The rip can freely be downloaded from URL \section{ \texttt{
Edit intent: clarity
Original:  The source code ofrip can freely be downloaded from URL \section{ \texttt{
Revised:  The source code ofrip can freely be downloaded from URL \section{Contact \texttt{
Edit intent: fluency
Original: CG, SYMMLQ, and MINRES are Krylov subspace methods for solving large symmetric systems of linear equations.
Revised: CG, SYMMLQ, and MINRES are Krylov subspace methods for solving symmetric systems of linear equations.
Edit intent: clarity
Original:  CG (the conjugate-gradient method) is reliable on positive-definite systems, while SYMMLQ and MINRES are designed for indefinite systems.
Edit intent: coherence
Original:  When these methods are applied to an incompatible system (that is, a singular symmetric least-squares problem), CG could break down and SYMMLQ's solution could explode, while MINRES would give a least-squares solution but not necessarily the minimum-length solution (often called the pseudoinversesolution) .
Revised:  When these methods are applied to an incompatible system (that is, a singular symmetric least-squares problem), CG could break down and SYMMLQ's solution could explode, while MINRES would give a least-squares solution but not necessarily the minimum-length (pseudoinverse) solution .
Edit intent: clarity
Original:  Our algorithm uses a QLP decomposition (where rotations on the right reduce R to lower-tridiagonal form) , and so we call it MINRES-QLP.
Revised:  MINRES-QLP uses a QLP decomposition (where rotations on the right reduce R to lower-tridiagonal form) , and so we call it MINRES-QLP.
Edit intent: clarity
Original:  Comparison of the analytic argument with the mean asphericity and the mean nature of asphericity confirms our reasoning to explain polymer ring conformations in the stiff regime, where elastic response prevails.
Revised:  Comparison of the analytic argument with the mean asphericity and the mean nature of asphericity confirm our reasoning to explain polymer ring conformations in the stiff regime, where elastic response prevails.
Edit intent: fluency
Original:  A refinement of the procedure yields D for some important LULU-operators S. Properties of D can also be used to characterize smoothing properties of a nonlinear operator S.
Revised:  A refinement of the procedure yields D for some important LULU-operators S. Properties of D can also be used to characterize smoothing properties of S.
Edit intent: clarity
Original: We demonstrate deterministic extensive spatio-temporal chaos in the dynamics of spiking neuron networks in the balanced state.
Revised: We demonstrate deterministic extensive chaos in the dynamics of spiking neuron networks in the balanced state.
Edit intent: clarity
Original:  Extensive chaos is found in purely inhibitory networks and becomes more intense when an excitatory population is included.
Revised:  Extensive chaos is found in inhibitory networks and becomes more intense when an excitatory population is included.
Edit intent: clarity
Original:  We find a strikingly high rate of entropy production that would limit information representation in cortical spiking patterns to the immediate stimulus response.
Revised:  We find a strikingly high rate of entropy production that would limit information representation in cortical spike patterns to the immediate stimulus response.
Edit intent: fluency
Original:  The concentrations of water-soluble, blood-borne substances in exhaled breath are influenced by: - breathing patterns affecting gas exchange in the conducting airways - the concentrations in the tracheo-bronchial lining fluid - the alveolar and systemic concentrations of the compound.
Revised:  The concentrations of water-soluble, blood-borne substances in exhaled breath are influenced by: - breathing patterns affecting gas exchange in the conducting airways - the concentrations in the tracheo-bronchial lining fluid ; (iii) the alveolar and systemic concentrations of the compound.
Edit intent: coherence
Original:  A number of different representations and algorithms for constructing such representations are discussed.
Edit intent: coherence
Original:  Two new algorithms are presented: the first constructs the  interpolation incrementally and can be used to update or downdate (i.e. add or remove a node) the interpolation.
Revised:  Two new algorithms are presented: the first constructs the interpolation incrementally and can be used to update the coefficients whenever a nodes is added to or removed from the interpolation.
Edit intent: clarity
Original:  The second algorithm, which constructs the interpolation  by decomposing the Vandermonde-like matrix iteratively yet can not be used to update or downdate an interpolation,  is more numerically stable than the first algorithm and is more efficient when  multiple interpolations are to be computed over the same set of nodes.
Revised:  The second algorithm, which constructs the interpolation by decomposing the Vandermonde-like matrix iteratively , can not be used to update or downdate an interpolation, is more numerically stable than the first algorithm and is more efficient when multiple interpolations are to be computed over the same set of nodes.
Edit intent: coherence
Original:  The second algorithm, which constructs the interpolation  by decomposing the Vandermonde-like matrix iteratively yet can not be used to update or downdate an interpolation,  is more numerically stable than the first algorithm and is more efficient when  multiple interpolations are to be computed over the same set of nodes.
Revised:  The second algorithm, which constructs the interpolation by decomposing the Vandermonde-like matrix iteratively yet can not be used to update or downdate an interpolation, yet is more numerically stable than the first algorithm and is more efficient when multiple interpolations are to be computed over the same set of nodes.
Edit intent: fluency
Original:  The second algorithm, which constructs the interpolation  by decomposing the Vandermonde-like matrix iteratively yet can not be used to update or downdate an interpolation,  is more numerically stable than the first algorithm and is more efficient when  multiple interpolations are to be computed over the same set of nodes.
Revised:  The second algorithm, which constructs the interpolation by decomposing the Vandermonde-like matrix iteratively yet can not be used to update or downdate an interpolation, is more numerically stable than the first algorithm and is more efficient when the coefficients of multiple interpolations are to be computed over the same set of nodes.
Edit intent: clarity
Original:  The paper is written in a semitutorial style, and targets readers with no prior familiarity with Computability Logic.
Revised:  The paper targets readers with no prior familiarity with Computability Logic.
Edit intent: coherence
Original: "Clarithmetic" is a generic name for formal number theories similar to Peano arithmetic, but based on Computability Logic (see URL instead of the more traditional classical or intuitionistic logics.
Revised: "Clarithmetic" is a generic name for formal number theories similar to Peano arithmetic, but based on computability logic (see URL instead of the more traditional classical or intuitionistic logics.
Edit intent: fluency
Original:  The paper  targets readers with no prior familiarity with Computability Logic .
Revised:  The paper targets readers with no prior familiarity with computability logic .
Edit intent: fluency
Original: The leaves are packed in the buds, occupying the whole bud volume.
Revised: Leaves are packed in the buds, occupying the whole bud volume.
Edit intent: fluency
Original:  Folded leaves always present veins on the abaxial side, creating a protection of the lamina, turned toward the adaxial side.
Edit intent: coherence
Original:  The  first general consequence  is the presence of symmetries on the leaf shape, but also quantitative relationships between lobes and sinus sizes.
Revised:  The first general consequence of the folds is the presence of symmetries on the leaf shape, but also quantitative relationships between lobes and sinus sizes.
Edit intent: clarity