wanyu/IteraTeR_v2 huggingface dataset:
Original:  By means of Le Cam's inequality and Chen-Stein method, we establish bounds in total variation norm between the distribution of the number of balls drawn with a given color and the Poisson distribution with the same mean  .
Revised:  By means of Le Cam's inequality and Chen-Stein method, we establish bounds in total variation norm between the distribution of the number of balls drawn with a given color and the Poisson distribution with the same mean are obtained .
Edit intent: clarity
Original:  We then show , under the assumption of heavy tailed distributions, that the distribution of the number of balls drawn with a given color has the same tail as that of the original number of balls.
Revised:  We then show that the distribution of the number of balls drawn with a given color has the same tail as that of the original number of balls.
Edit intent: clarity
Original:  Nevertheless, in the second part of the paper we present a very fast approximation algorithm for this problem.
Revised:  Nevertheless, in the second part of the paper we present a fast approximation algorithm for this problem.
Edit intent: clarity
Original: Linear systems with large differences between coefficients ("discontinuous coefficients") arise in many cases in which partial differential equations  model physical phenomena involving heterogeneous media.
Revised: Linear systems with large differences between coefficients ("discontinuous coefficients") arise in many cases in which partial differential equations (PDEs) model physical phenomena involving heterogeneous media.
Edit intent: clarity
Original:  The standard approach to solving such problems is to use domain decomposition (DD) techniques, with domain boundaries conforming to the boundaries between the different media.
Revised:  The standard approach to solving such problems is to use domain decomposition techniques, with domain boundaries conforming to the boundaries between the different media.
Edit intent: clarity
Original:  Although scaling is mentioned in the literature in several places as a means of improving the convergenceproperties of some algorithms in some cases, there is no study on the general usefulness of this approach for discontinuous coefficients.
Revised:  It has long been known that diagonal scaling can be useful in improving convergence, but there is no study on the general usefulness of this approach for discontinuous coefficients.
Edit intent: clarity
Original:  Restarted GMRES and Bi-CGSTAB, with and without the ILUT preconditioner, were tested on several well-known problems, on the original and on the scaled systems .
Revised:  GS was tested on several well-known problems, on the original and on the scaled systems .
Edit intent: coherence
Original:  It is shown that GS improves the convergence properties of these methods.
Revised:  It is shown that GS improved the convergence properties of these methods.
Edit intent: fluency
Original: In this paper we develop an algorithm to calculate  prices and Greeks of barrier options driven by a class of additive processes.
Revised: In this paper we develop an algorithm to calculate the prices and Greeks of barrier options driven by a class of additive processes.
Edit intent: fluency
Original:  We obtain an explicit semi-analytical expression for the first-passage probability of an additive process with hyper-exponential jumps .
Revised:  We obtain an explicit semi-analytical expression for the first-passage probability .
Edit intent: clarity
Original:  The solution rests on a randomization and an explicit matrix Wiener- Hopf factorization.
Revised:  The solution rests on a randomization and an explicit matrix Wiener-Hopf factorization.
Edit intent: fluency
Original:  Employing this result we derive explicit expressions for the Laplace(-Fourier) transforms of prices and Greeks of digital and barrier options.
Revised:  Employing this result we derive explicit expressions for the Laplace-Fourier transforms of the prices and Greeks of digital and barrier options.
Edit intent: fluency
Original:  Employing this result we derive explicit expressions for the Laplace(-Fourier) transforms of prices and Greeks of digital and barrier options.
Revised:  Employing this result we derive explicit expressions for the Laplace(-Fourier) transforms of prices and Greeks of barrier options.
Edit intent: clarity
Original:  A complete time-graph of order n is the cartesian product of a complete graph of order n and a linear graph with n vertices.
Revised:  A complete time-graph of order n is the cartesian product of a complete graph with n vertices and a linear graph with n vertices.
Edit intent: fluency
Original:  The notion of a hamiltonian time-graph is defined in a natural way and we define the hamiltonian time-graph problem (HAMTG) as : Given a time-graph is it hamiltonian ?
Revised:  The notion of a hamiltonian time-graph is defined in a natural way and we define the Hamiltonian time-graph problem (HAMTG) as : Given a time-graph is it hamiltonian ?
Edit intent: fluency
Original:  We give two conjectures about these spaces and prove that if any one of these conjectures is true, we get a polynomial time algorithm for the hamiltonian path problem.
Revised:  We give two conjectures about these spaces and prove that if any one of these conjectures is true, we get a polynomial time algorithm for the Hamiltonian path problem.
Edit intent: fluency
Original:  Since the hamiltonian path problem is NP-complete we obtain the proof of P = NP provided any one of the two conjectures is true.
Revised:  Since the Hamiltonian path problem is NP-complete we obtain the proof of P = NP provided any one of the two conjectures is true.
Edit intent: fluency
Original: Quantitative scaling relationships among body mass, temperature and metabolic rate of organisms are still controversial, while resolution may be further complicated through the use of different or possibly inappropriate philosophical approaches to statistical analysis.
Revised: Quantitative scaling relationships among body mass, temperature and metabolic rate of organisms are still controversial, while resolution may be further complicated through the use of different and possibly inappropriate approaches to statistical analysis.
Edit intent: clarity
Original:  We propose the first application of a modelling strategy based on the theoretical approach of Akaike's information criteria and , accordingly, modelled the individual metabolism of Antarctic microarthropods as a function of body mass , temperature, life stage, species identity and high rank taxa to which species belong .
Revised:  We propose the application of a modelling strategy based on the theoretical approach of Akaike's information criteria and , accordingly, modelled the individual metabolism of Antarctic microarthropods as a function of body mass , temperature, life stage, species identity and high rank taxa to which species belong .
Edit intent: clarity
Original:  We propose the first application of a modelling strategy based on the theoretical approach of Akaike's information criteria and , accordingly, modelled the individual metabolism of Antarctic microarthropods as a function of body mass , temperature, life stage, species identity and high rank taxa to which species belong .
Revised:  We propose the first application of a modelling strategy based on Akaike's information criteria and , accordingly, modelled the individual metabolism of Antarctic microarthropods as a function of body mass , temperature, life stage, species identity and high rank taxa to which species belong .
Edit intent: clarity
Original:  We propose the first application of a modelling strategy based on the theoretical approach of Akaike's information criteria and , accordingly, modelled the individual metabolism of Antarctic microarthropods as a function of body mass , temperature, life stage, species identity and high rank taxa to which species belong .
Revised:  We propose the first application of a modelling strategy based on the theoretical approach of Akaike's information criteria and , accordingly, modelled the individual metabolism of Antarctic microarthropods as a function of body mass (M), temperature (T), species identity (S) and high rank taxa to which species belong .
Edit intent: clarity
Original: This paper provides an introduction to the Text Encoding Initiative (TEI), focused at bringing in newcomers who have to deal with a digital document project and are looking at the capacity that the TEI environment may have to fulfil his needs.
Revised: This paper provides an introduction to the Text Encoding Initia-tive (TEI), focused at bringing in newcomers who have to deal with a digital document project and are looking at the capacity that the TEI environment may have to fulfil his needs.
Edit intent: fluency
Original:  Greedy geometric routing is not always possible in fixed-dimensional Euclidean spaces, of course, as is the case, for example, with star graphs.
Revised:  Greedy drawings are not always possible in fixed-dimensional Euclidean spaces, of course, as is the case, for example, with star graphs.
Edit intent: clarity
Original:  Nevertheless, we show that such greedy geometric routing schemes exist in R^2, for 3-connected planar graphs, using the standard Euclidean metric, with coordinates that can be represented succinctly, that is, with O(log n) bits.
Revised:  Nevertheless, we show that such greedy drawings exist in R^2, for 3-connected planar graphs, using the standard Euclidean metric, with coordinates that can be represented succinctly, that is, with O(log n) bits.
Edit intent: clarity
Original:  Nevertheless, we show that such greedy drawings exist in R^2, for 3-connected planar graphs, using the standard Euclidean metric, with coordinates that can be represented succinctly, that is, with O(log n) bits  .
Revised:  Nevertheless, we show that such greedy drawings exist in R^2, for 3-connected planar graphs, with coordinates that can be represented succinctly, that is, with O(log n) bits .
Edit intent: clarity
Original:  In this paper we consider\emph{ \emph{  the problem of sorting unsigned permutations by prefix reversals and prefix transpositions , where a prefix reversal or a prefix transposition is applied always at the unsorted suffix of the given permutation.
Revised:  In this paper we consider\emph{ \emph{sorting by prefix reversals the problem of sorting unsigned permutations by prefix reversals and prefix transpositions , where a prefix reversal or a prefix transposition is applied always at the unsorted suffix of the given permutation.
Edit intent: clarity
Original:  We show that the problem of computing the partition function (the sum of the weights of all possible variable assignments) is computable in polynomial time if either every weight function can be defined by a "pure affine" magnitude with a quadratic sign polynomial or every function can be defined by a magnitude of "product type" with a linear sign polynomial.
Revised:  We show that the problem of computing the partition function (the sum of the weights of all possible variable assignments) is in polynomial time if either every weight function can be defined by a "pure affine" magnitude with a quadratic sign polynomial or every function can be defined by a magnitude of "product type" with a linear sign polynomial.
Edit intent: clarity
Original:  While it is uncommon for the genotype data to be pooled from multiple ethnically distinct populations, few existing programs have explicitly leverage the individual ethnic information for haplotype inference.
Revised:  While it is uncommon for the genotype data to be pooled from multiple ethnically distinct populations, few existing programs have explicitly leveraged the individual ethnic information for haplotype inference.
Edit intent: fluency
Original:  In this paper , we present a new haplotype inference program, Haploi, which makes use of such information and is readily applicable to genotype sequences with thousands of SNPs from heterogeneous populations, with competent and sometimes superior speed and accuracy comparing to the state-of-the-art programs.
Revised:  In this paper we present a new haplotype inference program, Haploi, which makes use of such information and is readily applicable to genotype sequences with thousands of SNPs from heterogeneous populations, with competent and sometimes superior speed and accuracy comparing to the state-of-the-art programs.
Edit intent: fluency
Original:  The macroscopic dynamics are derived from the stochastic process using a systematic expansion of the master equation, and lead to an equation for the dynamics which we call the deterministic jump-growth equation .
Revised:  Using a systematic expansion of the master equation, and lead to an equation for the dynamics which we call the deterministic jump-growth equation .
Edit intent: coherence
Original:  The macroscopic dynamics are derived from the stochastic process using a systematic expansion of the master equation, and lead to an equation for the dynamics which we call the deterministic jump-growth equation .
Revised:  The macroscopic dynamics are derived from the stochastic process using a systematic expansion of the master equation, we derive a deterministic equation for the dynamics which we call the deterministic jump-growth equation .
Edit intent: coherence
Original:  The macroscopic dynamics are derived from the stochastic process using a systematic expansion of the master equation, and lead to an equation for the dynamics which we call the deterministic jump-growth equation .
Revised:  The macroscopic dynamics are derived from the stochastic process using a systematic expansion of the master equation, and lead to an equation for the macroscopic dynamics, which we call the deterministic jump-growth equation .
Edit intent: fluency
Original:  The behaviour of the stochastic process, the deterministic jump-growth equation and the McKendrick--von Foerster equation are compared using numerical methods.
Revised:  The behaviours of the stochastic process, the deterministic jump-growth equation and the McKendrick--von Foerster equation are compared using numerical methods.
Edit intent: fluency
Original:  The numerical analysis shows two classes of attractor : steady states and travelling waves.
Revised:  The numerical analysis shows two classes of attractors : steady states and travelling waves.
Edit intent: fluency
Original: In this paper we investigate the problem of optimal dividend distribution  in the presence of regime shifts.
Revised: We investigate the problem of optimal dividend distribution in the presence of regime shifts.
Edit intent: coherence
Original:  The objective is to maximize the expected cumulative discounted dividend payments until the moment of bankruptcy, which occurs the first time that the cash reserves (the cumulative net revenues minus cumulative dividend payments) hit zero.
Revised:  The objective is to maximize the expected cumulative discounted dividend payments until the moment of bankruptcy, which occurs the first time that the cash reserves (the cumulative net revenues minus cumulative dividend payments) are zero.
Edit intent: clarity
Original:  In the case that the drift is small and negative in some regime , the optimal strategy takes a different form, which we explicitly identify in the case that there are two regimes.
Revised:  In the case that the drift is small and negative in one state , the optimal strategy takes a different form, which we explicitly identify in the case that there are two regimes.
Edit intent: clarity
Original:  In the case that the drift is small and negative in some regime , the optimal strategy takes a different form, which we explicitly identify in the case that there are two regimes.
Revised:  In the case that the drift is small and negative in some regime , the optimal strategy takes a different form, which we explicitly identify if there are two regimes.
Edit intent: coherence
Original: Alexandrov's Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of some convex polyhedron.
Revised: Alexandrov's Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of a unique convex polyhedron.
Edit intent: clarity
Original:  Recent work by Bobenko and Izmestiev describes a differential equation whose solution is the polyhedron corresponding to a given metric.
Revised:  Recent work by Bobenko and Izmestiev describes a differential equation whose solution leads to the polyhedron corresponding to a given metric.
Edit intent: clarity
Original:  While there is a rich literature in estimating a static or temporally invariant network from observation data, little has been done towards estimating time-varying networks from time series of entity attributes.
Revised:  While there is a rich literature in estimating a static or temporally invariant network from observation data, little has been done toward estimating time-varying networks from time series of entity attributes.
Edit intent: fluency
Original: For a graph G let L(G) and l(G) denote the size of the largest and smallest maximum matching of graphs obtained from G by removing its maximum matchings .
Revised: For a graph G let L(G) and l(G) denote the size of the largest and smallest maximum matching of a graph obtained from G by removing its maximum matchings .
Edit intent: style
Original: For a graph G let L(G) and l(G) denote the size of the largest and smallest maximum matching of graphs obtained from G by removing its maximum matchings .
Revised: For a graph G let L(G) and l(G) denote the size of the largest and smallest maximum matching of graphs obtained from G by removing a maximum matching of G .
Edit intent: clarity
Original:  We also characterize the class of graphs for with L(G)=2l(G).
Revised:  We also characterize the class of graphs for which L(G)=2l(G).
Edit intent: fluency
Original: In a dynamic social or biological environment, the interactions between the underlying actors can undergo large and systematic changes.
Revised: In a dynamic social or biological environment, the interactions between the actors can undergo large and systematic changes.
Edit intent: clarity
Original:  In both cases, our model reveals interesting patterns of the dynamic roles of the actors.
Revised:  In all cases, our model reveals interesting patterns of the dynamic roles of the actors.
Edit intent: clarity
Original:  This is achieved by our newly constructed nonheuristic potential function that facilitates a purely probabilistic interpretation of the channel mode.
Revised:  This is achieved by constructing a potential function facilitating a purely probabilistic interpretation of the channel mode.
Edit intent: clarity
Original: We address the problem of semantic access to relational databases in the form of answering queries modulo knowledge bases using very expressive knowledge representation formalisms, such as full first-order logic or its various fragments.
Revised: We address the problem of semantic querying of relational databases (RDB) modulo knowledge bases using very expressive knowledge representation formalisms, such as full first-order logic or its various fragments.
Edit intent: clarity
Original:  We propose to use a first-order logic (FOL) reasoner for computing generic answers to deductive queries, with the subsequent instantiation of these generic answers using a conventional relational DBMS. In this research note, we outline the main idea of this technique -- using abstractions of databases and constrained clauses for deriving generic answers.
Revised:  We propose to use a first-order logic (FOL) reasoner for computing schematic answers to deductive queries, with the subsequent instantiation of these generic answers using a conventional relational DBMS. In this research note, we outline the main idea of this technique -- using abstractions of databases and constrained clauses for deriving generic answers.
Edit intent: fluency
Original:  We propose to use a first-order logic (FOL) reasoner for computing generic answers to deductive queries, with the subsequent instantiation of these generic answers using a conventional relational DBMS. In this research note, we outline the main idea of this technique -- using abstractions of databases and constrained clauses for deriving generic answers.
Revised:  We propose to use a first-order logic (FOL) reasoner for computing generic answers to deductive queries, with the subsequent instantiation of these schematic answers using a conventional relational DBMS. In this research note, we outline the main idea of this technique -- using abstractions of databases and constrained clauses for deriving generic answers.
Edit intent: fluency
Original:  We propose to use a first-order logic (FOL) reasoner for computing generic answers to deductive queries, with the subsequent instantiation of these generic answers using a conventional relational DBMS. In this research note, we outline the main idea of this technique -- using abstractions of databases and constrained clauses for deriving generic answers.
Revised:  We propose to use a first-order logic (FOL) reasoner for computing generic answers to deductive queries, with the subsequent instantiation of these generic answers using a conventional relational DBMS. In this research note, we outline the main idea of this technique -- using abstractions of databases and constrained clauses for deriving schematic answers.
Edit intent: fluency
Original:  The proposed method can be directly used to enhance the conventional RDBtechnology .
Revised:  The proposed method can be directly used with regular RDB, including legacy databases .
Edit intent: clarity
Original:  Using linear hierarchical modeling, we observe that organism characteristics associate with these metrics, surprisingly well.
Revised:  Using hierarchical linear modeling, we observe that organism characteristics associate with these metrics, surprisingly well.
Edit intent: fluency
Original:  Guided by such work, we propose methods to associate organism characteristics with network topology by analyzing a large number of architectural patterns .
Revised:  Guided by such work, we propose methods to assess the association of various microbe characteristics and phenotypes with the topology of their networks .
Edit intent: clarity
Original: We study the cyclic dominance of three species on two dimensional constrained Newman-Watts networks with a four-state variant of the rock-paper-scissors game.
Revised: We study the cyclic dominance of three species in two-dimensional constrained Newman-Watts networks with a four-state variant of the rock-paper-scissors game.
Edit intent: clarity
Original:  By limiting the maximal connection distance R_{max} on Newman-Watts networks with the long-rang connection probability p, we depict  the stochastic interactions among species of ecosystemswith much more reality.
Revised:  By limiting the maximal connection distance R_{max} in Newman-Watts networks with the long-rang connection probability p, we depict the stochastic interactions among species of ecosystemswith much more reality.
Edit intent: fluency
Original:  By limiting the maximal connection distance R_{max} on Newman-Watts networks with the long-rang connection probability p, we depict  the stochastic interactions among species of ecosystemswith much more reality.
Revised:  By limiting the maximal connection distance R_{max} on Newman-Watts networks with the long-rang connection probability p, we depict more realistically the stochastic interactions among species of ecosystemswith much more reality.
Edit intent: clarity
Original:  The Monte Carlo simulations show that the spiral waves grow in size, and the systems become unstable and the biodiversity is lost with increasing p or R_{max}.
Revised:  The Monte Carlo simulations show that the spiral waves grow in size, and the system becomes unstable and biodiversity is lost with increasing p or R_{max}.
Edit intent: fluency