wanyu/IteraTeR_v2 huggingface dataset:
Original:  Finally we begin to investigate the logic induced by the scalar type system, and prove a no-cloning theorem expressed solely in terms of the possible proof methods in this logic.
Revised:  Finally we begin to investigate the logic induced by the scalar type system, and prove a no-cloning theorem expressed solely in terms of the possible proof methods in the induced logic.
Edit intent: clarity
Original:  We discuss the potential connections with Linear Logic and Quantum Computation .
Revised:  We only mention the potential implications for probabilistic and quantum calculi .
Edit intent: clarity
Original: The algebraic lambda-calculus Vau07 and the linear-algebraic lambda-calculus AD08 extend the lambda-calculus with the possibility of making arbitrary linear combinations of lambda-calculus terms(preserving Sum ai.
Revised: The Algebraic lambda-calculus Vau07 and the linear-algebraic lambda-calculus AD08 extend the lambda-calculus with the possibility of making arbitrary linear combinations of lambda-calculus terms(preserving Sum ai.
Edit intent: fluency
Original: The algebraic lambda-calculus Vau07 and the linear-algebraic lambda-calculus AD08 extend the lambda-calculus with the possibility of making arbitrary linear combinations of lambda-calculus terms(preserving Sum ai.
Revised: The algebraic lambda-calculus Vau07 and the Linear-Algebraic lambda-calculus AD08 extend the lambda-calculus with the possibility of making arbitrary linear combinations of lambda-calculus terms(preserving Sum ai.
Edit intent: fluency
Original: The algebraic lambda-calculus Vau07 and the linear-algebraic lambda-calculus AD08 extend the lambda-calculus with the possibility of making arbitrary linear combinations of lambda-calculus terms(preserving Sum ai.
Revised: The algebraic lambda-calculus Vau07 and the linear-algebraic lambda-calculus extend the lambda-calculus with the possibility of making arbitrary linear combinations of lambda-calculus terms(preserving Sum ai.
Edit intent: clarity
Original:  Mi). In this paper we provide a fine-grained, System F-like type system for the linear-algebraic lambda-calculus (Lineal) .
Revised:  Mi). In this paper we provide a fine-grained, System F-like type system for the linear-algebraic lambda-calculus .
Edit intent: coherence
Original:  We show that this 'scalar' type system enjoys both the subject-reduction property and the strong-normalisation property, which constitute our main technical results.
Revised:  We show that this "scalar" type system enjoys both the subject-reduction property and the strong-normalisation property, which constitute our main technical results.
Edit intent: fluency
Original:  We show that this 'scalar' type system enjoys both the subject-reduction property and the strong-normalisation property, which constitute our main technical results.
Revised:  We show that this 'scalar' type system enjoys both the subject-reduction property and the strong-normalisation property, our main technical results.
Edit intent: clarity
Original:  But the more important, original feature of this scalar type system is that it keeps track of 'the amount of a type' that this present in each term.
Revised:  But the more important, original feature of this scalar type system is that it keeps track of 'the amount of a type' that is present in each term.
Edit intent: fluency
Original:  As an example of its use, we have demonstrated that this can serve as a guarantee that the normal form of a term is barycentric (Sum ai=1).
Revised:  As an example of its use, we shown that it can serve as a guarantee that the normal form of a term is barycentric (Sum ai=1).
Edit intent: clarity
Original: Error detectable and error correctable coding in Hamming space was researched to discover possible fault tolerant coding constellations, which can implement Boolean lattice with fault tolerant property.
Revised: Error detectable and error correctable coding in Hamming space was researched to discover possible fault tolerant coding constellations, which can implement Boolean logic with fault tolerant property.
Edit intent: clarity
Original:  Here, we construct a generic minimal model of the genetic regulatory network which naturally exhibits five elementary characteristics of cell differentiation: stability,  branching, exclusivity, directionality, and promiscuous expression.
Revised:  Here, we construct a generic minimal model of the genetic regulatory network which naturally exhibits five elementary characteristics of cell differentiation: stability, branching, exclusivity, and promiscuous expression.
Edit intent: clarity
Original:  We further argue that binary cell fate decisions are prevalent in cell differentiation due to general features of dynamical systems .
Revised:  We further argue that binary cell fate decisions are prevalent in cell differentiation due to general features of the underlying dynamical system .
Edit intent: clarity
Original:  This minimal model makes testable predictions about the structural basis for directional, discrete and diversifying cell phenotype development and thus , can guide the evaluation of real gene regulatory networks that govern differentiation.
Revised:  This minimal model makes testable predictions about the structural basis for directional, discrete and diversifying cell phenotype development and thus can guide the evaluation of real gene regulatory networks that govern differentiation.
Edit intent: fluency
Original: Multi-potent stem or progenitor cells undergo a sequential series of binary fate decisions, which ultimately generate the diversity of differentiated cells.
Revised: Multipotent stem or progenitor cells undergo a sequential series of binary fate decisions, which ultimately generate the diversity of differentiated cells.
Edit intent: fluency
Original:  Moreover, recent attacks on anonymization show that these techniques are not as secure as expected, even when only passive adversaries are considered.
Edit intent: coherence
Original:  To overcome these restrictions, we use multi-party computation techniques (MPC) for sharing network traffic data .
Revised:  To overcome these restrictions, we use multi-party computation techniques (MPC) for sharing network measurements .
Edit intent: clarity
Original: This paper investigates the practical usefulness of secure multiparty computation (MPC) techniques in multi-domain network management.
Revised: Secure multiparty computation (MPC) techniques in multi-domain network management.
Edit intent: clarity
Original:  We evaluate the running times and bandwidth requirements of our protocols with actual backbone traffic traces, both on a department-wide cluster and on PlanetLab .
Revised:  We evaluate the running time and bandwidth requirements of our protocols with actual backbone traffic traces, both on a department-wide cluster and on PlanetLab .
Edit intent: fluency
Original:  In particular, event correlation which takes 3 minutes with SEPIA, would require around 2 days using existing frameworks .
Revised:  In particular, event correlation which takes 3 minutes for a task that takes 2 days using existing frameworks .
Edit intent: clarity
Original:  The result holds for any choice of norms or Bregman divergencesor indeed any continues measure of proximity .
Revised:  The result holds for any choice of norms and, under a mild assumption, even Bregman divergences .
Edit intent: clarity
Original: We obtain the Maximum Entropy distribution for an asset from call and digital option prices.
Revised: We obtain the maximum entropy distribution for an asset from call and digital option prices.
Edit intent: fluency
Original:  A rigorous mathematical proof of its existence and exponential form is given, which can also be applied to legitimize a formal derivation by Buchen and Kelly.
Revised:  A rigorous mathematical proof of its existence and exponential form is given, which can also be applied to legitimise a formal derivation by Buchen and Kelly.
Edit intent: fluency
Original:  Finally, we present numerical results which show that our approach implies very realistic volatility surfaces even when calibrating only to at-the-money options   .
Revised:  We present numerical results which show that our approach implies very realistic volatility surfaces even when calibrating only to at-the-money options .
Edit intent: coherence
Original: Graph homomorphism problem has been studied intensively.
Revised: Graph homomorphism has been studied intensively.
Edit intent: clarity
Original:  Given an m-by-m symmetric matrix A, the graph homomorphism function is defined as Z_A(G) = f:V->[m] (u,v)\in E A_{f(u),f(v) \[Z_A (G) = f:V->[m] (u,v)\in E A_{f(u),f(v)}, \] where G = (V,E) is any undirected graph.
Revised:  Given an m x m symmetric matrix A, the graph homomorphism function is defined as Z_A(G) = f:V->[m] (u,v)\in E A_{f(u),f(v) \[Z_A (G) = f:V->[m] (u,v)\in E A_{f(u),f(v)}, \] where G = (V,E) is any undirected graph.
Edit intent: clarity
Original:  Given an m-by-m symmetric matrix A, the graph homomorphism function is defined as Z_A(G) = f:V->[m] (u,v)\in E A_{f(u),f(v) \[Z_A (G) = f:V->[m] (u,v)\in E A_{f(u),f(v)}, \] where G = (V,E) is any undirected graph.
Revised:  Given an m-by-m symmetric matrix A, the graph homomorphism function is defined as \[Z_A (G) = f:V->[m] (u,v)\in E A_{f(u),f(v)}, \] where G = (V,E) is any undirected graph.
Edit intent: fluency
Original:  The function Z_A (G) can encode many interesting graph properties, including counting vertex covers and k-colorings.
Revised:  The function Z_A can encode many interesting graph properties, including counting vertex covers and k-colorings.
Edit intent: clarity
Original: For a variety of regularization methods , algorithms computing the entire solution path have been developed recently.
Revised: For a variety of regularized optimization problems in machine learning , algorithms computing the entire solution path have been developed recently.
Edit intent: clarity
Original:  We prove that for the support vector machine this complexity can indeed be exponential in the number of training points in the worst case  } } .
Revised:  We prove that for the support vector machine this complexity can be exponential in the number of training points in the worst case } } .
Edit intent: clarity
Original:  More strongly, we construct a single instance of n input points in d dimensions for an SVM such that at least \Theta (2 ^n/2 ) = \Theta (2^d) many distinct subsets of support vectors occur as the regularization parameter changes.
Revised:  More strongly, we construct a single instance of n input points in d dimensions for an SVM such that at least \Theta (2 ^n/2 ) = \Theta (2^d) many distinct subsets of support vectors occur as the regularization parameter changes.
Edit intent: fluency
Original:  More strongly, we construct a single instance of n input points in d dimensions for an SVM such that at least \Theta (2 ^n/2 ) = \Theta (2^d) many distinct subsets of support vectors occur as the regularization parameter changes.
Revised:  More strongly, we construct a single instance of n input points in d dimensions for an SVM such that at least \Theta (2 ^{n/2 ) = \Theta (2^d) many distinct subsets of support vectors occur as the regularization parameter changes.
Edit intent: fluency
Original: It is well-known how to determine the price of perpetual American options if the underlying stock price is a time-homogeneous diffusion.
Revised: It is well known how to determine the price of perpetual American options if the underlying stock price is a time-homogeneous diffusion.
Edit intent: fluency
Original: This report presents analytical information regarding the transfer of TCP data flows on paths towards interconnected wireless systems, with emphasis on 3G cellular networks.
Revised: This review paper presents analytical information regarding the transfer of TCP data flows on paths towards interconnected wireless systems, with emphasis on 3G cellular networks.
Edit intent: clarity
Original:  The objective of this report is not to present an exhaustive review of the literature, but to filter out the causes of poor TCP performance in such systems and give a rationalized view of measures that can be taken against them.
Revised:  The objective of this paper is not to present an exhaustive review of the literature, but to filter out the causes of poor TCP performance in such systems and give a rationalized view of measures that can be taken against them.
Edit intent: clarity
Original:  Surprisingly, in combinatory logic (the translation of the lambda-calculus into combinators)  the result is exactly opposite.
Revised:  Surprisingly, in combinatory logic (the translation of the lambda-calculus into combinators) , the result is exactly opposite.
Edit intent: fluency
Original:  This  due to the fact that any fixed combinator almost always appears in a random combinator.
Revised:  This is due to the fact that any fixed combinator almost always appears in a random combinator.
Edit intent: fluency
Original: The differential reduction algorithmwhich allow one to express generalized hypergeometric functions with arbitrary values of parameters in terms of functions with fixed values of parameters differing from the original ones by integers  is discussed in a context of evaluation of Feynman diagrams.
Revised: The differential-reduction algorithm, which allows one to express generalized hypergeometric functions with arbitrary values of parameters in terms of functions with fixed values of parameters differing from the original ones by integers is discussed in a context of evaluation of Feynman diagrams.
Edit intent: fluency
Original: The differential reduction algorithmwhich allow one to express generalized hypergeometric functions with arbitrary values of parameters in terms of functions with fixed values of parameters differing from the original ones by integers  is discussed in a context of evaluation of Feynman diagrams.
Revised: The differential reduction algorithmwhich allow one to express generalized hypergeometric functions with parameters of arbitrary values in terms of functions with fixed values of parameters differing from the original ones by integers is discussed in a context of evaluation of Feynman diagrams.
Edit intent: clarity
Original: The differential reduction algorithmwhich allow one to express generalized hypergeometric functions with arbitrary values of parameters in terms of functions with fixed values of parameters differing from the original ones by integers  is discussed in a context of evaluation of Feynman diagrams.
Revised: The differential reduction algorithmwhich allow one to express generalized hypergeometric functions with arbitrary values of parameters in terms of such functions with parameters whose values differ from the original ones by integers is discussed in a context of evaluation of Feynman diagrams.
Edit intent: clarity
Original: The differential reduction algorithmwhich allow one to express generalized hypergeometric functions with arbitrary values of parameters in terms of functions with fixed values of parameters differing from the original ones by integers  is discussed in a context of evaluation of Feynman diagrams.
Revised: The differential reduction algorithmwhich allow one to express generalized hypergeometric functions with arbitrary values of parameters in terms of functions with fixed values of parameters differing from the original ones by integers , is discussed in a context of evaluation of Feynman diagrams.
Edit intent: fluency
Original: The differential reduction algorithmwhich allow one to express generalized hypergeometric functions with arbitrary values of parameters in terms of functions with fixed values of parameters differing from the original ones by integers  is discussed in a context of evaluation of Feynman diagrams.
Revised: The differential reduction algorithmwhich allow one to express generalized hypergeometric functions with arbitrary values of parameters in terms of functions with fixed values of parameters differing from the original ones by integers is discussed in the context of evaluating Feynman diagrams.
Edit intent: fluency
Original:  Where it is possiblewe make a comparison between our results and ones based on a standard technique .
Revised:  Where this is possible, we compare our results with those obtained using standard techniques .
Edit intent: clarity
Original:  As an application, we settle the next open case of the Big Line or Big Clique Conjecture of K\'ara, P\'or, and Wood [Discrete Comput.
Revised:  As an application, we settle the next open case of the "big line or big clique" conjecture of K\'ara, P\'or, and Wood [Discrete Comput.
Edit intent: clarity
Original:  Geom. 34(3):497--506, 2005] . En route to our main result, we prove a generalised Erdos-Szekeres Theorem: for all integers k%DIFDELCMD < \geq3 %%% and \ell \geq 2, every sufficiently large set of points in the plane contains \ell collinear points or k points in strictly convex position .
Revised:  Geom. 34(3):497--506, 2005] %DIFDELCMD < \geq3 %%% and \ell \geq 2, every sufficiently large set of points in the plane contains \ell collinear points or k points in strictly convex position .
Edit intent: coherence
Original: Homicide investigations often rely on the determination of a minimum post mortem interval (PMI) by forensic entomologists.
Revised: Homicide investigations often depend on the determination of a minimum post mortem interval (PMI) by forensic entomologists.
Edit intent: fluency
Original:  The age of the  insect larvae (mostly blowfly larvae) developed furthest provides a reasonable clue about the time a corpse has been infested by insects.
Revised:  The age of the most developed insect larvae (mostly blowfly larvae) developed furthest provides a reasonable clue about the time a corpse has been infested by insects.
Edit intent: clarity
Original:  We established a new simulation-based growth model calculating larval age based on the actual non-linear development and allowing to take into account uncertainties, e.g. for temperature values  .
Revised:  We established a new simulation-based growth model calculating larval age. This is based on the actual non-linear development and allowing to take into account uncertainties, e.g. for temperature values .
Edit intent: coherence
Original: Homicide investigations often depend on the determination of a minimum post mortem interval (PMI  ) by forensic entomologists.
Revised: Homicide investigations often depend on the determination of a minimum post-mortem interval (PMI ) by forensic entomologists.
Edit intent: fluency
Original:  The age of the most developed insect larvae (mostly blowfly larvae) gives reasonably reliable information about the minimum time a person has been dead.
Revised:  The age of the most developed insect larvae (mostly blow fly larvae) gives reasonably reliable information about the minimum time a person has been dead.
Edit intent: fluency
Original:  Methods such as Isomegalen-Diagrams or ADH-calculations have problems in their reliability, so we established in this study a new growth model to calculate the larval age of Lucilia sericata  .
Revised:  Methods such as isomegalen diagrams or ADH calculations can have problems in their reliability, so we established in this study a new growth model to calculate the larval age of Lucilia sericata .
Edit intent: clarity
Original:  This is based on the actual non-linear development of the blowfly and is designed to include uncertainties, e.g. for temperature values from the crime scene.
Revised:  This is based on the actual non-linear development of the blow fly and is designed to include uncertainties, e.g. for temperature values from the crime scene.
Edit intent: fluency
Original:  We used published data for the development of L. sericata (Meigen 1826) and found that PMI calculations based on mean temperatures differ by up to 65\% from PMIs based on the actual temperature . Differences of 2 ^\circC \degree  in the estimation of the crime scene temperature result in a deviation in PMI calculation of 15 - 30 \%.
Revised:  We used published data for the development of L. sericata (Meigen 1826) and found that PMI calculations based on one mean temperature value differ by up to 65\% from PMIs based on the actual temperature . Differences of 2 ^\circC \degree in the estimation of the crime scene temperature result in a deviation in PMI calculation of 15 - 30 \%.
Edit intent: clarity
Original:  We used published data for the development of L. sericata (Meigen 1826) and found that PMI calculations based on mean temperatures differ by up to 65\% from PMIs based on the actual temperature . Differences of 2 ^\circC \degree  in the estimation of the crime scene temperature result in a deviation in PMI calculation of 15 - 30 \%.
Revised:  We used published data for the development of L. sericata (Meigen 1826) and found that PMI calculations based on mean temperatures differ by up to 65\% from PMIs based on the actual temperature . Differences of 2 \degree in the estimation of the crime scene temperature result in a deviation in PMI calculation of 15 - 30 \%.
Edit intent: clarity
Original: It is now increasingly realized that the underlying mechanisms which govern aging (ageing) are a complex interplay of genetic regulation and damage accumulation.
Revised: It is now increasingly realized that the underlying mechanism which governs aging (ageing) are a complex interplay of genetic regulation and damage accumulation.
Edit intent: fluency
Original: It is now increasingly realized that the underlying mechanisms which govern aging (ageing) are a complex interplay of genetic regulation and damage accumulation.
Revised: It is now increasingly realized that the underlying mechanisms which govern aging (ageing) is a complex interplay of genetic regulation and damage accumulation.
Edit intent: fluency
Original: It is now increasingly realized that the underlying mechanisms which govern aging (ageing) are a complex interplay of genetic regulation and damage accumulation.
Revised: It is now increasingly realized that the underlying mechanisms which govern aging (ageing) are a complex interplay of genetic regulation and damage-accumulation. "
Edit intent: fluency
Original:  Aging as a result of accumulation of 'faults' on cellular and molecular levels  , has been proposed in the damage (fault)-accumulation theory by Kirkwood 2006.
Revised:  Aging as a result of accumulation of 'faults' on cellular and molecular levels " , has been proposed in the damage (fault)-accumulation theory by Kirkwood 2006.
Edit intent: fluency
Original:  Aging as a result of accumulation of 'faults' on cellular and molecular levels  , has been proposed in the damage (fault)-accumulation theory by Kirkwood 2006.
Revised:  Aging as a result of accumulation of 'faults' on cellular and molecular levels , has been proposed in the damage (fault)-accumulation theory .
Edit intent: coherence
Original:  Therefore we introduce here a specification of the underlying mechanism of aging and arrive at a novel theory: aging of the body is a result of the accumulation of Misrepair of tissue.
Revised:  Therefore we introduce some crucial modifications of this theory and arrive at a novel theory: aging of the body is a result of the accumulation of Misrepair of tissue.
Edit intent: clarity
Original:  Therefore we introduce here a specification of the underlying mechanism of aging and arrive at a novel theory: aging of the body is a result of the accumulation of Misrepair of tissue.
Revised:  Therefore we introduce here a specification of the underlying mechanism of aging and arrive at a novel theory: aging of the body is the result of accumulation of Misrepair of tissue.
Edit intent: fluency
Original:  and b) aging can occur at different levels, however aging of the body takes place at least on the tissue level, but not necessarily on cellular / molecular level.
Revised:  and b) aging can occur at different levels, however aging of the body takes place necessarily on the tissue level, but not necessarily on cellular / molecular level.
Edit intent: clarity