wanyu/IteraTeR_v2 huggingface dataset:
Original: We compare three different model order reduction techniques with Galerkin projection : the proper orthogonal decomposition (POD), POD-DEIM ( discrete empirical interpolation ) and POD-DMD ( dynamic mode decomposition ) for solving optimal control problems governed by the convective FitzHugh-Nagumo (FHN) equation .
Revised: In this paper, we compare three model order reduction techniques with Galerkin projection : the proper orthogonal decomposition (POD), POD-DEIM ( discrete empirical interpolation ) and POD-DMD ( dynamic mode decomposition ) for solving optimal control problems governed by the convective FitzHugh-Nagumo (FHN) equation .
Edit intent: clarity
Original: We compare three different model order reduction techniques with Galerkin projection : the proper orthogonal decomposition (POD), POD-DEIM ( discrete empirical interpolation ) and POD-DMD ( dynamic mode decomposition ) for solving optimal control problems governed by the convective FitzHugh-Nagumo (FHN) equation .
Revised: We compare three different model order reduction methods : the proper orthogonal decomposition (POD), POD-DEIM ( discrete empirical interpolation ) and POD-DMD ( dynamic mode decomposition ) for solving optimal control problems governed by the convective FitzHugh-Nagumo (FHN) equation .
Edit intent: clarity
Original: We compare three different model order reduction techniques with Galerkin projection : the proper orthogonal decomposition (POD), POD-DEIM ( discrete empirical interpolation ) and POD-DMD ( dynamic mode decomposition ) for solving optimal control problems governed by the convective FitzHugh-Nagumo (FHN) equation .
Revised: We compare three different model order reduction techniques with Galerkin projection : the proper orthogonal decomposition (POD), discrete empirical interpolation ) and POD-DMD ( dynamic mode decomposition ) for solving optimal control problems governed by the convective FitzHugh-Nagumo (FHN) equation .
Edit intent: clarity
Original: We compare three different model order reduction techniques with Galerkin projection : the proper orthogonal decomposition (POD), POD-DEIM ( discrete empirical interpolation ) and POD-DMD ( dynamic mode decomposition ) for solving optimal control problems governed by the convective FitzHugh-Nagumo (FHN) equation .
Revised: We compare three different model order reduction techniques with Galerkin projection : the proper orthogonal decomposition (POD), POD-DEIM ( discrete empirical interpolation method (DEIM) and dynamic mode decomposition ) for solving optimal control problems governed by the convective FitzHugh-Nagumo (FHN) equation .
Edit intent: clarity
Original: We compare three different model order reduction techniques with Galerkin projection : the proper orthogonal decomposition (POD), POD-DEIM ( discrete empirical interpolation ) and POD-DMD ( dynamic mode decomposition ) for solving optimal control problems governed by the convective FitzHugh-Nagumo (FHN) equation .
Revised: We compare three different model order reduction techniques with Galerkin projection : the proper orthogonal decomposition (POD), POD-DEIM ( discrete empirical interpolation ) and POD-DMD ( dynamic mode decomposition (DMD) for the optimal control of the convective FitzHugh-Nagumo (FHN) equation .
Edit intent: clarity
Original: We compare three different model order reduction techniques with Galerkin projection : the proper orthogonal decomposition (POD), POD-DEIM ( discrete empirical interpolation ) and POD-DMD ( dynamic mode decomposition ) for solving optimal control problems governed by the convective FitzHugh-Nagumo (FHN) equation .
Revised: We compare three different model order reduction techniques with Galerkin projection : the proper orthogonal decomposition (POD), POD-DEIM ( discrete empirical interpolation ) and POD-DMD ( dynamic mode decomposition ) for solving optimal control problems governed by the convective FitzHugh-Nagumo (FHN) equations .
Edit intent: coherence
Original:  The convective FHN equation consists of the semilinear activator and the linear inhibitor equation, modelling blood coagulation in moving excitable media.
Revised:  The convective FHN equations consists of the semilinear activator and the linear inhibitor equation, modelling blood coagulation in moving excitable media.
Edit intent: fluency
Original:  The convective FHN equation consists of the semilinear activator and the linear inhibitor equation, modelling blood coagulation in moving excitable media.
Revised:  The convective FHN equation consists of the semi-linear activator and the linear inhibitor equation, modelling blood coagulation in moving excitable media.
Edit intent: fluency
Original:  The convective FHN equation consists of the semilinear activator and the linear inhibitor equation, modelling blood coagulation in moving excitable media.
Revised:  The convective FHN equation consists of the semilinear activator and the linear inhibitor equations, modeling blood coagulation in moving excitable media.
Edit intent: fluency
Original:  The POD and POD-DEIM reduced optimal control problems are non-convex due to the nonlinear activator equation . DMD is an equation-free, data-driven method which extracts dynamically relevant information content without explicitly knowing the dynamical operator.
Revised:  The POD and POD-DEIM reduced optimal control problems are non-convex due to the nonlinear activator equation . 
Edit intent: coherence
Original:  We compare the accuracy and CPU times of three reduced order methods(ROM) with respect to the full order discontinuous Galerkin finite element solutions for convection dominated wave type solutions with terminal controls.
Revised:  We compare the accuracy and computational times of three reduced order methods(ROM) with respect to the full order discontinuous Galerkin finite element solutions for convection dominated wave type solutions with terminal controls.
Edit intent: clarity
Original:  We compare the accuracy and CPU times of three reduced order methods(ROM) with respect to the full order discontinuous Galerkin finite element solutions for convection dominated wave type solutions with terminal controls.
Revised:  We compare the accuracy and CPU times of three reduced-order optimal control solutions with the full order discontinuous Galerkin finite element solutions for convection dominated wave type solutions with terminal controls.
Edit intent: clarity
Original: Adaptation in a fluctuating environment is a process of fueling information about environment to gain fitness.
Revised: Adaptation in a fluctuating environment is a process of fueling environmental information to gain fitness.
Edit intent: clarity
Original: No. We prove that Erd\"os- R\'enyi Random Graphs are not topologically random.
Revised: No. We prove that Erdos- Renyi Random Graphs are not topologically random.
Edit intent: fluency
Original:  When focusing on the spacers (between the repeats), new elements enter a CRISPR array at rate \theta /2 at the leader end of the array, while all spacers present are lost at rate \rho /2 along the phylogeny relating the sample.
Revised:  When focusing on the spacers (between the repeats), new elements enter a CRISPR array at rate \theta at the leader end of the array, while all spacers present are lost at rate \rho /2 along the phylogeny relating the sample.
Edit intent: fluency
Original:  When focusing on the spacers (between the repeats), new elements enter a CRISPR array at rate \theta /2 at the leader end of the array, while all spacers present are lost at rate \rho /2 along the phylogeny relating the sample.
Revised:  When focusing on the spacers (between the repeats), new elements enter a CRISPR array at rate \theta /2 at the leader end of the array, while all spacers present are lost at rate \rho along the phylogeny relating the sample.
Edit intent: fluency
Original:  As long as we consider different borrowing/lending rates, XVA problem becomes a non-linear equa- tion and this makes finding explicit solution of XVA difficult.
Revised:  As long as we consider different borrowing/lending rates, pricing derivatives encounters a non-linear equa- tion and this makes finding explicit solution of XVA difficult.
Edit intent: clarity
Original:  As long as we consider different borrowing/lending rates, XVA problem becomes a non-linear equa- tion and this makes finding explicit solution of XVA difficult.
Revised:  As long as we consider different borrowing/lending rates, XVA problem becomes a non-linear equation and this makes finding explicit solution of XVA difficult.
Edit intent: fluency
Original:  Moreover, the conditions mentioned above is mild in the sense that it can be obtained by choosing adequate covenants between the investor and counterparty .
Revised:  Moreover, the conditions are mild in the sense that it can be obtained by choosing adequate covenants between the investor and counterparty .
Edit intent: clarity
Original:  Moreover, the conditions mentioned above is mild in the sense that it can be obtained by choosing adequate covenants between the investor and counterparty .
Revised:  Moreover, the conditions mentioned above is mild in the sense that it is often satisfied in practice .
Edit intent: clarity
Original: We discuss a binary nature of funding impacts .
Revised: We discuss the binary nature of funding impacts .
Edit intent: fluency
Original:  Under some conditions, funding is either cost or benefit, i.e., one of the lending/borrowing rates does not play any role in pricing derivatives.
Revised:  Under some conditions, funding is either a cost or a benefit, i.e., one of the lending/borrowing rates does not play any role in pricing derivatives.
Edit intent: fluency
Original:  Under some conditions, funding is either cost or benefit, i.e., one of the lending/borrowing rates does not play any role in pricing derivatives.
Revised:  Under some conditions, funding is either cost or benefit, i.e., one of the lending/borrowing rates does not play a role in pricing derivatives.
Edit intent: clarity
Original:  When we price derivatives , considering different lending/borrowing rates leads to semi-linear BSDEs and PDEs, so we need to solve the equations numerically.
Revised:  When derivatives are priced , considering different lending/borrowing rates leads to semi-linear BSDEs and PDEs, so we need to solve the equations numerically.
Edit intent: clarity
Original:  When we price derivatives , considering different lending/borrowing rates leads to semi-linear BSDEs and PDEs, so we need to solve the equations numerically.
Revised:  When we price derivatives , considering different lending/borrowing rates leads to semi-linear BSDEs and PDEs, and thus it is necessary to solve the equations numerically.
Edit intent: coherence
Original:  However, once we can guarantee that only one of the rates affects pricing, we can recover linear equations and derive analytic formulae .
Revised:  However, once it can be guaranteed that only one of the rates affects pricing, we can recover linear equations and derive analytic formulae .
Edit intent: coherence
Original:  However, once we can guarantee that only one of the rates affects pricing, we can recover linear equations and derive analytic formulae .
Revised:  However, once we can guarantee that only one of the rates affects pricing, linear equations can be recovered and analytical formulae can be derived .
Edit intent: coherence
Original:  Moreover, as a byproduct, our results explain how debt value adjustment (DVA) and funding benefits are different .
Revised:  Moreover, as a byproduct, our results explain how debt value adjustment (DVA) and funding benefits are dissimilar .
Edit intent: clarity
Original:  We will see later that FBA occurs where the payoff is non-increasing , but this relationship becomes weaken as the funding choices of underlying assets are transferred to repo markets.
Revised:  We find that funding benefit is related to the decreasing property of the payoff function , but this relationship becomes weaken as the funding choices of underlying assets are transferred to repo markets.
Edit intent: clarity
Original:  We will see later that FBA occurs where the payoff is non-increasing , but this relationship becomes weaken as the funding choices of underlying assets are transferred to repo markets.
Revised:  We will see later that FBA occurs where the payoff is non-increasing , but this relationship decreases as the funding choices of underlying assets are transferred to repo markets.
Edit intent: clarity
Original:  Under a large population-long chromosome limit, we show that the genetic distance between two subpopulations converges to a deterministic quantity that can asymptotically be expressed in terms of the hitting time between two random walks in the metapopulation graph.
Revised:  Under a large population-long chromosome limit, the genetic distance between two subpopulations converges to a deterministic quantity that can asymptotically be expressed in terms of the hitting time between two random walks in the metapopulation graph.
Edit intent: coherence
Original:  However, individual-level neutrality in nature is also broken by differences between conspecific individuals at different life stages, which in many communities may vastly exceed interspecific differences between individuals at similar stages.
Revised:  However, neutrality in nature is also broken by differences between conspecific individuals at different life stages, which in many communities may vastly exceed interspecific differences between individuals at similar stages.
Edit intent: clarity
Original:  Here we present a two-stage neutral model , where both fecundity and mortality are allowed to change as an individual moves from a stage to the other.
Revised:  Here we present a two-stage neutral model where fecundity and mortality are allowed to change as an individual moves from a stage to the other.
Edit intent: clarity
Original:  Here we present a two-stage neutral model , where both fecundity and mortality are allowed to change as an individual moves from a stage to the other.
Revised:  Here we present a two-stage neutral model , where both fecundity and mortality change as an individual moves from a stage to the other.
Edit intent: clarity
Original:  Here we present a two-stage neutral model , where both fecundity and mortality are allowed to change as an individual moves from a stage to the other.
Revised:  Here we present a two-stage neutral model , where both fecundity and mortality are allowed to change as an individual transitions from one stage to the other.
Edit intent: clarity
Original:  We find that abundance distributions are  robust to this kind of stage structure, but only so long as subpopulations at different stages fluctuate in synchrony.
Revised:  We find that abundance distributions are generally robust to this kind of stage structure, but only so long as subpopulations at different stages fluctuate in synchrony.
Edit intent: clarity
Original:  Our findings potentially explain power law-like abundance distributions in systems with strong demographic structure, such as eusocial insects and human given names, and may partially rehabilitate species abundance distributions from past criticisms as to their inability to distinguish between biological mechanisms.
Revised:  Our findings potentially explain power law-like abundance distributions in organisms with strong demographic structure, such as eusocial insects and human given names, and may partially rehabilitate species abundance distributions from past criticisms as to their inability to distinguish between biological mechanisms.
Edit intent: clarity
Original:  Our findings potentially explain power law-like abundance distributions in systems with strong demographic structure, such as eusocial insects and human given names, and may partially rehabilitate species abundance distributions from past criticisms as to their inability to distinguish between biological mechanisms.
Revised:  Our findings potentially explain power law-like abundance distributions in systems with strong demographic structure, such as eusocial insects and humans, and partially rehabilitate species abundance distributions from past criticisms as to their inability to distinguish between biological mechanisms.
Edit intent: clarity
Original:  Dynamic Continuous Indexing (DCI) offers a promising way of circumventing the curse by avoiding space partitioning and achieves a query time that grows sublinearly in the intrinsic dimensionality .
Revised:  Dynamic Continuous Indexing (DCI) offers a promising way of circumventing the curse and successfully reduces the dependence of query time on intrinsic dimensionality from exponential to sublinear .
Edit intent: clarity
Original:  In this paper, we develop a variant of DCI, which we call Prioritized DCI, and show a further improvement in the dependence on the intrinsic dimensionalitycompared to standard DCI, thereby improving the performance of DCI on datasets with high intrinsic dimensionality .
Revised:  In this paper, we propose a variant of DCI, which we call Prioritized DCI, and show a further improvement in the dependence on the intrinsic dimensionalitycompared to standard DCI, thereby improving the performance of DCI on datasets with high intrinsic dimensionality .
Edit intent: clarity
Original:  In this paper, we develop a variant of DCI, which we call Prioritized DCI, and show a further improvement in the dependence on the intrinsic dimensionalitycompared to standard DCI, thereby improving the performance of DCI on datasets with high intrinsic dimensionality .
Revised:  In this paper, we develop a variant of DCI, which we call Prioritized DCI, and show a remarkable improvement in the dependence on the intrinsic dimensionalitycompared to standard DCI, thereby improving the performance of DCI on datasets with high intrinsic dimensionality .
Edit intent: clarity
Original:  We also demonstrate empirically that Prioritized DCI compares favourably to standard DCI and Locality-Sensitive Hashing (LSH) both in terms of running time and space consumption at all levels of approximation quality .
Revised:  We also demonstrate empirically that Prioritized DCI significantly outperforms prior methods .
Edit intent: clarity
Original:  While crowd sourcing provides a platform to acquire ground truth, sound approaches to sampling must drive labelling efforts.
Revised:  While crowdsourcing platforms acquire ground truth, sound approaches to sampling must drive labelling efforts.
Edit intent: clarity
Original:  In ER, extreme class imbalance between matching and non-matching records can lead to enormous labelling requirements when seeking statistically consistent estimates of population parameters .
Revised:  In ER, extreme class imbalance between matching and non-matching records can lead to enormous labelling requirements when seeking statistically consistent estimates for rigorous evaluation .
Edit intent: clarity
Original:  OASIS draws samples from a (biased) instrumental distribution, chosen to have optimal asymptotic variance.
Revised:  OASIS draws samples from a (biased) instrumental distribution, chosen to ensure estimators with optimal asymptotic variance.
Edit intent: clarity
Original:  As new labels are collected OASIS updates this instrumental distribution via a Bayesian latent variable model of the annotator oracle, to quickly focus on regions providing more information.
Revised:  As new labels are collected OASIS updates this instrumental distribution via a Bayesian latent variable model of the annotator oracle, to quickly focus on unlabelled items providing more information.
Edit intent: clarity
Original: Session types are behavioural types for guaranteeing that some programs are free from basic communication errors.
Revised: Session types are behavioural types for guaranteeing that concurrent programs are free from basic communication errors.
Edit intent: clarity
Original:  Recent work has shown that the notion of asynchronous subtyping for session types is undecidable.
Revised:  Recent work has shown that asynchronous session subtyping is undecidable.
Edit intent: clarity
Original:  *K-means is essentially deterministic without specifying initial centers, etc.
Revised:  *K-means is statistically deterministic without specifying initial centers, etc.
Edit intent: clarity
Original: Bayesian matrix factorization (BMF) is a powerful tool for producing low-rank representations of matrices and for predicting missing values and their confidence intervals.
Revised: Bayesian matrix factorization (BMF) is a powerful tool for producing low-rank representations of matrices and for predicting missing values and providing confidence intervals.
Edit intent: clarity
Original:  Embarrassingly parallel inference would remove the communication needed, by using completely independent computations on different data subsets, but  suffers from the inherent unidentifiability of BMF solutions.
Revised:  Embarrassingly parallel inference would remove the communication needed, by using completely independent computations on different data subsets, but it suffers from the inherent unidentifiability of BMF solutions.
Edit intent: coherence
Original:  Using an efficient approximate implementation, we show  empirically on both real and simulated data that our distributed approach is able to achieve a speed-up of almost an order of magnitude  , with a negligible effect on predictive accuracy  .
Revised:  Using an efficient approximate implementation, we show empirically on both real and simulated data . Our distributed approach is able to achieve a speed-up of almost an order of magnitude , with a negligible effect on predictive accuracy .
Edit intent: coherence
Original:  Such a programme require monitoring of end-use appliances energy consumption in real-time .
Revised:  Such a program require monitoring of end-use appliances energy consumption in real-time .
Edit intent: fluency
Original:  We investigate the dynamics of the quantum correlations generated through two hydrogen bonds between a prototypical enzyme and a substrate , and discuss the possibility of utilizing these correlationsas a resource in the catalytic power of the enzyme .
Revised:  We consider the quantum correlations generated through two hydrogen bonds between a prototypical enzyme and a substrate , and discuss the possibility of utilizing these correlationsas a resource in the catalytic power of the enzyme .
Edit intent: clarity
Original:  We investigate the dynamics of the quantum correlations generated through two hydrogen bonds between a prototypical enzyme and a substrate , and discuss the possibility of utilizing these correlationsas a resource in the catalytic power of the enzyme .
Revised:  We investigate the dynamics of the quantum correlations generated through two hydrogen bonds between a prototypical enzyme and a substrate , and discuss how the enzyme can derive its catalytic potency from these correlations .
Edit intent: clarity
Original:  If the enzyme suddenly returns to its initial state after the binding stage, the substrate ends in a quantum superposition state.
Revised:  If the enzyme rapidly returns to its initial state after the binding stage, the substrate ends in a quantum superposition state.
Edit intent: clarity
Original:  Environmental effects can then naturally drive the reaction in the forward direction from the substrate to the product without needing the additional catalytic stage that is usually assumed to follow the binding stage .
Revised:  Environmental effects can then naturally drive the reaction in the forward direction from the major tautomeric form to the minor tautomeric form without needing any additional catalytic activity .
Edit intent: clarity
Original: Aim: To develop a generalised flow cytometry protocol that uses reference beads for the enumeration of live and dead bacteria present in a mixture.
Revised: Aim: To evaluate a flow cytometry protocol that uses reference beads for the enumeration of live and dead bacteria present in a mixture.
Edit intent: clarity
Original:  These samples were stained using SYTO 9 and propidium iodide and 6 {\mu}m beads reference beads were added.
Revised:  These samples were stained using SYTO 9 and propidium iodide and 6 {\mu}m reference beads were added.
Edit intent: fluency