wanyu/IteraTeR_v2 huggingface dataset:
Original:  We propose Flow-GANs, a generative adversarial network with the generator specified as a normalizing flow model which can perform exact likelihood evaluation .
Revised:  We propose Flow-GANs, a generative adversarial network for which we can perform exact likelihood evaluation .
Edit intent: clarity
Original: Understanding the flow of incompressible fluids through porous media plays a crucial role in many technological applications such as enhanced oil recovery and geological carbon-dioxide sequestration.
Revised: The flow of incompressible fluids through porous media plays a crucial role in many technological applications such as enhanced oil recovery and geological carbon-dioxide sequestration.
Edit intent: clarity
Original:  Several natural and synthetic porous materials exhibit multiple pore-networks, and the classical Darcy equations are not adequate to describe the flow of fluids in these porous materials.
Revised:  The flow within numerous natural and synthetic porous materials exhibit multiple pore-networks, and the classical Darcy equations are not adequate to describe the flow of fluids in these porous materials.
Edit intent: clarity
Original:  Several natural and synthetic porous materials exhibit multiple pore-networks, and the classical Darcy equations are not adequate to describe the flow of fluids in these porous materials.
Revised:  Several natural and synthetic porous materials that contain multiple scales of pores cannot be adequately described by the classical Darcy equations are not adequate to describe the flow of fluids in these porous materials.
Edit intent: clarity
Original:  Mathematical models that adequately describe the flow of fluids in porous media with multiple pore-networks have been proposed in the literature.
Revised:  Mathematical models that adequately describe the flow of fluids in porous media with multiple scales of pores have been proposed in the literature.
Edit intent: clarity
Original:  But these models are analytically intractable , especially for realistic problems.
Revised:  However, these models are analytically intractable , especially for realistic problems.
Edit intent: coherence
Original:  But these models are analytically intractable , especially for realistic problems.
Revised:  But these models are analytically intractable for realistic problems.
Edit intent: coherence
Original:  Under the proposed mixed formulation, the equal-order interpolation for all the field variables , which is computationally the most convenient, is shown to be stable.
Revised:  Under the proposed mixed formulation, the equal-order interpolation of all the field variables , which is computationally the most convenient, is shown to be stable.
Edit intent: fluency
Original:  Under the proposed mixed formulation, the equal-order interpolation for all the field variables , which is computationally the most convenient, is shown to be stable.
Revised:  Under the proposed mixed formulation, the equal-order interpolation for all the field variables is shown to be stable.
Edit intent: coherence
Original:  A systematic error analysis is also performed on the resulting stabilized weak formulation.
Revised:  A systematic error analysis is performed on the resulting stabilized weak formulation.
Edit intent: clarity
Original:  Several representative problems, patch tests and numerical convergence analysis are performed to illustrate the performance and convergence behavior of the proposed mixed formulation in the discrete setting.
Revised:  Representative problems, patch tests and numerical convergence analysis are performed to illustrate the performance and convergence behavior of the proposed mixed formulation in the discrete setting.
Edit intent: clarity
Original:  Several representative problems, patch tests and numerical convergence analysis are performed to illustrate the performance and convergence behavior of the proposed mixed formulation in the discrete setting.
Revised:  Several representative problems, patch tests and numerical convergence analyses are performed to illustrate the performance and convergence behavior of the proposed mixed formulation in the discrete setting.
Edit intent: fluency
Original:  The accuracy of numerical solutions is assessed using the mathematical properties satisfied by the solutions of the double porosity/permeability model (e. g., reciprocal relation).
Revised:  The accuracy of numerical solutions is assessed using the mathematical properties satisfied by the solutions of this double porosity/permeability model (e. g., reciprocal relation).
Edit intent: fluency
Original:  The accuracy of numerical solutions is assessed using the mathematical properties satisfied by the solutions of the double porosity/permeability model (e. g., reciprocal relation).
Revised:  The accuracy of numerical solutions is assessed using the mathematical properties satisfied by the solutions of the double porosity/permeability model .
Edit intent: coherence
Original:  Moreover, it is shown that the proposed framework can nicely perform under the transient condition and it can capture well-known instabilities in the fluid mechanics such as viscous fingering.
Revised:  Moreover, it is shown that the proposed framework can perform well under transient conditions and that it can capture well-known instabilities in the fluid mechanics such as viscous fingering.
Edit intent: clarity
Original:  Moreover, it is shown that the proposed framework can nicely perform under the transient condition and it can capture well-known instabilities in the fluid mechanics such as viscous fingering.
Revised:  Moreover, it is shown that the proposed framework can nicely perform under the transient condition and it can capture well-known instabilities such as viscous fingering.
Edit intent: clarity
Original:  We report compilation results from several state-of-the-art temporal planners on this test set . compile circuits of various sizes to a realistic hardware .
Revised:  We report compilation results from several state-of-the-art temporal planners on this test set .
Edit intent: clarity
Original: We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are periodic away from a finite set . Using methods from ergodic theory, we are able to partially resolve this conjecture, proving that any hypothetical counterexample is periodic away from a very sparse and structured set.
Revised: We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are ultimately periodic . Using methods from ergodic theory, we are able to partially resolve this conjecture, proving that any hypothetical counterexample is periodic away from a very sparse and structured set.
Edit intent: clarity
Original:  We also obtain a conditional result, where we prove the conjecture under the assumption that the characteristic sequence of the set of powers of an integer k\geq 2 is not given by a generalised polynomial.
Revised:  We also prove that the conjecture is equivalent to the claim that the set of powers of an integer k\geq 2 is not given by a generalised polynomial.
Edit intent: clarity
Original:  We empirically evaluate the proposed class of neural architectures on standard applications such as language modeling and molecular graph regression, achieving state-of-the-art or competitive results across these applications .
Revised:  We empirically evaluate the proposed class of neural architectures on standard applications such as language modeling and molecular graph regression, achieving state-of-the-art results across these applications .
Edit intent: clarity
Original:  We extend such relations to k-tuples of consecutive terminal symbols, by using the model of strictly locally testable regular languages of order k %DIFDELCMD < \ge %DIFDELCMD < %%%  3. The new corresponding class of Higher-order Operator Precedence languages (HOP) properly includes the OP languages, and it is still included in the deterministic (also in reverse) context free family.
Revised:  We extend such relations to k-tuples of consecutive terminal symbols, by using the model of strictly locally testable regular languages of order k %DIFDELCMD < \ge %DIFDELCMD < %%% at least 3. The new corresponding class of Higher-order Operator Precedence languages (HOP) properly includes the OP languages, and it is still included in the deterministic (also in reverse) context free family.
Edit intent: clarity
Original:  Rev. A 70(052328), 2004: to implement a general stabilizer circuit, we reduce their 11-stage computation -H-C-P-C-P-C-H-P-C-P-C- over the gate set consisting of Hadamard, Controlled-NOT, and Phase gates, into a 7-stage computation of the form -C-CZ-P-H-P-CZ-C-.
Revised:  Rev. A 70(052328), 2004: to obtain a general stabilizer circuit, we reduce their 11-stage computation -H-C-P-C-P-C-H-P-C-P-C- over the gate set consisting of Hadamard, Controlled-NOT, and Phase gates, into a 7-stage computation of the form -C-CZ-P-H-P-CZ-C-.
Edit intent: clarity
Original:  In particular, we show that the parameterized problem of deciding whether a general graph is well-covered parameterized by \alpha can be reduced to the WC(0,\ell)G problem parameterized by \ell , and we prove that this latter problem is in XP but does not admit polynomial kernels unless coNP \subseteq NP/poly ] .
Revised:  In particular, we show that the parameterized problem of deciding whether a general graph is well-covered parameterized by \alpha can be reduced to the WC(0,\ell)G problem parameterized by \ell . In addition, we prove that this latter problem is in XP but does not admit polynomial kernels unless coNP \subseteq NP/poly ] .
Edit intent: coherence
Original:  For neural latent variable models, optimizing the ELBO jointly in the variational posterior and model parameters produces state-of-the-art results.
Revised:  For neural latent variable models, the evidence lower bound (ELBO) produces state-of-the-art results.
Edit intent: clarity
Original:  Inspired by the success of the ELBO as a surrogate MLE objective , we consider the extension of the ELBO to a family of lower bounds defined by a Monte Carlo estimator of the marginal likelihood .
Revised:  Inspired by this , we consider the extension of the ELBO to a family of lower bounds defined by a Monte Carlo estimator of the marginal likelihood .
Edit intent: clarity
Original:  We introduce a special case , the filtering variational objectives (FIVOs) , which takes the same arguments as the ELBO and passes them through a particle filter to form a tighter bound.
Revised:  We introduce a special case , the filtering variational objectives (FIVOs) . FIVOs take the same arguments as the ELBO and passes them through a particle filter to form a tighter bound.
Edit intent: coherence
Original: We study nowhere dense classes of graphs , recently introduced by Nesetril and Ossona de Mendez .\bar \bar  and a subset of its nodes A, the number of subsets of A^{|\bar y|} which are of the form \{}\bar \, }\colon\bar \bar \bar \bar ), for every \epsilon>0.
Revised: We study nowhere dense classes of graphs , recently introduced by Nesetril and Ossona de Mendez .\bar \bar and a subset of its nodes A, the number of subsets of A^{|\bar y|} which are of the form \{}\bar \, }\colon\bar u,\bar \bar \bar ), for every \epsilon>0.
Edit intent: clarity
Original: We study nowhere dense classes of graphs , recently introduced by Nesetril and Ossona de Mendez .\bar \bar  and a subset of its nodes A, the number of subsets of A^{|\bar y|} which are of the form \{}\bar \, }\colon\bar \bar \bar \bar ), for every \epsilon>0.
Revised: We study nowhere dense classes of graphs , recently introduced by Nesetril and Ossona de Mendez .\bar \bar and a subset of its nodes A, the number of subsets of A^{|\bar y|} which are of the form \{}\bar \, }\colon\bar \bar \bar u of\bar ), for every \epsilon>0.
Edit intent: clarity
Original:  } Firstly, we provide a new proof for the fact that these classes are uniformly quasi-wide, improving previously known bounds between the two equivalent notions.
Revised:  } Firstly, we provide a new proof of the fact that these classes are uniformly quasi-wide, improving previously known bounds between the two equivalent notions.
Edit intent: fluency
Original:  Secondly, we give a new combinatorial proof of the result of Adler and Adler stating that nowhere dense classes of graphs are stable.
Revised:  Secondly, we give a new combinatorial proof of the result of Adler and Adler stating that every nowhere dense class of graphs is stable.
Edit intent: clarity
Original:  However,  the problem is shown to be NP-hard  in { %DIFDELCMD < \IR%%%  }^2.
Revised:  However, we show that the problem is shown to be NP-hard in { %DIFDELCMD < \IR%%% }^2.
Edit intent: coherence
Original:  However,  the problem is shown to be NP-hard  in { %DIFDELCMD < \IR%%%  }^2.
Revised:  However, the problem is NP-hard in { %DIFDELCMD < \IR%%% }^2.
Edit intent: coherence
Original:  These approximation results are extendible to higher dimension .
Revised:  These approximation results are extendible to higher dimensions .
Edit intent: fluency
Original:  We consider a huge data set in an ad hoc network without a central processor, where each node has access only to one chunk of the data set .
Revised:  We consider a huge dataset in an ad hoc network without a central processor, where each node has access only to one chunk of the data set .
Edit intent: fluency
Original:  We consider a huge data set in an ad hoc network without a central processor, where each node has access only to one chunk of the data set .
Revised:  We consider a huge data set in an ad hoc network without a central processor, where each node has access only to one chunk of the dataset .
Edit intent: fluency
Original:  We assume that part of the whole data set lies around a low-dimensional subspace and the other part is composed of outliers that lie away from that subspace.
Revised:  We assume that part of the whole dataset lies around a low-dimensional subspace and the other part is composed of outliers that lie away from that subspace.
Edit intent: clarity
Original:  The goal is to recover the underlying subspace for the whole data set , without transferring the data itself between the nodes.
Revised:  The goal is to recover the underlying subspace for the whole dataset , without transferring the data itself between the nodes.
Edit intent: clarity
Original:  We apply the Consensus Based Gradient method for the Geometric Median Subspace algorithm for RSR. We propose an iterative solution for the local dual minimization problem and establish its r-linear convergence .
Revised:  We apply the Consensus-Based Gradient method for the Geometric Median Subspace algorithm for RSR. We propose an iterative solution for the local dual minimization problem and establish its r-linear convergence .
Edit intent: fluency
Original: We study Robust Subspace Recovery (RSR) in distributed settings.
Revised: We propose distributed solutions to the problem of Robust Subspace Recovery (RSR) in distributed settings.
Edit intent: clarity
Original:  We assume that part of the whole dataset lies around a low-dimensional subspace and the other part is composed of outliers that lie away from that subspace.
Revised:  Furthermore, part of the whole dataset lies around a low-dimensional subspace and the other part is composed of outliers that lie away from that subspace.
Edit intent: coherence
Original:  We  apply the Consensus-Based Gradient method for the Geometric Median Subspace algorithm for RSR. We propose an iterative solution for the local dual minimization problem and establish its r-linear convergence.
Revised:  We first apply the Consensus-Based Gradient method for the Geometric Median Subspace algorithm for RSR. We propose an iterative solution for the local dual minimization problem and establish its r-linear convergence.
Edit intent: coherence
Original:  We  apply the Consensus-Based Gradient method for the Geometric Median Subspace algorithm for RSR. We propose an iterative solution for the local dual minimization problem and establish its r-linear convergence.
Revised:  We apply the Consensus-Based Gradient method to the Geometric Median Subspace algorithm for RSR. We propose an iterative solution for the local dual minimization problem and establish its r-linear convergence.
Edit intent: fluency
Original:  We  apply the Consensus-Based Gradient method for the Geometric Median Subspace algorithm for RSR. We propose an iterative solution for the local dual minimization problem and establish its r-linear convergence.
Revised:  We apply the Consensus-Based Gradient method for the Geometric Median Subspace algorithm for RSR. For this purpose, we propose an iterative solution for the local dual minimization problem and establish its r-linear convergence.
Edit intent: coherence
Original:  We also explain how to distributedly implement the Reaper and Fast Median Subspace algorithms for RSR. We demonstrate the competitive performance of our algorithms for both synthetic and real data.
Revised:  We then explain how to distributedly implement the Reaper and Fast Median Subspace algorithms for RSR. We demonstrate the competitive performance of our algorithms for both synthetic and real data.
Edit intent: coherence
Original:  We also explain how to distributedly implement the Reaper and Fast Median Subspace algorithms for RSR. We demonstrate the competitive performance of our algorithms for both synthetic and real data.
Revised:  We also explain how to distributedly implement the Reaper and Fast Median Subspace algorithms for RSR. The proposed algorithms display competitive performance on both synthetic and real data.
Edit intent: clarity
Original:  In this paper we propose a method to study a simple vector-hosts mathematical model based on a system of ordinary differential equations to show how the loss of biodiversity could influence the dynamics of  the disease in different scenarios determined by the resistance of the hosts.
Revised:  In this paper we propose a method to study a simple vector-hosts mathematical model in order to explain how the changes in biodiversity could influence the dynamics of the disease in different scenarios determined by the resistance of the hosts.
Edit intent: clarity
Original:  Based on our model, we find that if the number of contacts are diluted by the whole amount of hosts, the presence of a competent host is a necessary condition for the existence of an endemic state.
Revised:  Based on our model, we find that if the number of contacts are diluted by the total population of hosts, the presence of a competent host is a necessary condition for the existence of an endemic state.
Edit intent: clarity
Original:  In previous work  we obtained theoretical results on the verification of a rich model incorporating core elements of IBM's successful Guard-Stage- Milestone (GSM) artifact model.
Revised:  In previous work , we obtained theoretical results on the verification of a rich model incorporating core elements of IBM's successful Guard-Stage- Milestone (GSM) artifact model.
Edit intent: fluency
Original:  In previous work  we obtained theoretical results on the verification of a rich model incorporating core elements of IBM's successful Guard-Stage- Milestone (GSM) artifact model.
Revised:  In previous work we obtained theoretical results on the verification of a rich model incorporating core elements of IBM's successful Guard-Stage-Milestone (GSM) artifact model.
Edit intent: fluency
Original:  The results showed decidability of verification of temporal properties of a large class of GSM workflows , and established its complexity.
Revised:  The results showed decidability of verification of temporal properties of a large class of GSM workflows and established its complexity.
Edit intent: fluency
Original:  Following up on these results, the present paper presents a practical implementation of a verifier relying on Spin, the classical model-checking tool  .
Revised:  Following up on these results, the present paper presents a practical implementation of a verifier relying on Spin, the classical model-checking tool Spin .
Edit intent: fluency
Original:  The implementation includes nontrivial optimizations and achieves satisfactory performance in real-world business process examples.
Revised:  The implementation includes nontrivial optimizations and achieves good performance on real-world business process examples.
Edit intent: clarity
Original:  The deviation of the proposed approximation from Monte Carlo simulations is negligible, improving significantly on the state of the art performance bound .
Revised:  The deviation of the proposed approximation from Monte Carlo simulations is negligible, improving significantly on the state of the art performance bounds .
Edit intent: fluency
Original:  it is claimed that the reduction of substrate concentration accelerates a reaction , even at the single-molecule limit.
Revised:  it is claimed that the reduction of substrate concentration increases reaction rate , even at the single-molecule limit.
Edit intent: clarity
Original:  This near-homeopathic argument contradicts the law of mass action.
Revised:  This near-homoeopathic mechanism contradicts the law of mass action.
Edit intent: clarity
Original:  Further details of the assay appear to be incompatible with settled chemical knowledge, in particular the claim of detection of tiny numbers of silver atoms on a background of the classic 'silver mirror reaction'.
Revised:  Further details of the assay appear to be incompatible with settled chemical knowledge, in particular the detection of tiny numbers of silver atoms on a background of the classic 'silver mirror reaction'.
Edit intent: clarity
Original: Provisioning of high throughput millimetre-wave signal to indoor areas that potentially serve  large number of users, such as transportation hubs or convention centres, will require dedicated indoor millimetre-wave access point deployments.
Revised: Provisioning of high throughput millimetre-wave signal to indoor areas that potentially serve a large number of users, such as transportation hubs or convention centres, will require dedicated indoor millimetre-wave access point deployments.
Edit intent: fluency
Original:  In this article  we study dense deployments of millimetre-wave access points mounted on the ceiling , and illuminating selected spots on the ground with the use of fixed directional antennas.
Revised:  In this article , we study dense deployments of millimetre-wave access points mounted on the ceiling , and illuminating selected spots on the ground with the use of fixed directional antennas.
Edit intent: fluency
Original:  In this article  we study dense deployments of millimetre-wave access points mounted on the ceiling , and illuminating selected spots on the ground with the use of fixed directional antennas.
Revised:  In this article we study dense deployments of millimetre-wave access points mounted on the ceiling and illuminating selected spots on the ground with the use of fixed directional antennas.
Edit intent: fluency
Original:  We evaluate our system under a number of scenarios that take into account beamwidth of the main-lobe, access point density, and positioning of a mobile device with respect to the user's body.
Revised:  We evaluate our system under a number of scenarios that take into account beamwidth of the main-lobe, access point density, and positioning of the mobile device with respect to the user's body.
Edit intent: fluency
Original:  Furthermore, we observe a trade-off in beamwidth design, as the optimal beamwidth maximizes either coverage or area spectral efficiency  but not both.
Revised:  Furthermore, we observe a trade-off in beamwidth design, as the optimal beamwidth maximizes either coverage or area spectral efficiency , but not both.
Edit intent: fluency