wanyu/IteraTeR_v2 huggingface dataset:
Original: Recently, we proposed a method to estimate parameters in stochastic dynamics models based on the linear response statistics.
Revised: Recently, we proposed a method to estimate parameters of stochastic dynamics based on the linear response statistics.
Edit intent: clarity
Original:  The technique rests upon a nonlinear least-squares problem that takes into account the response properties that stem from the Fluctuation-Dissipation Theory.
Revised:  The method rests upon a nonlinear least-squares problem that takes into account the response properties that stem from the Fluctuation-Dissipation Theory.
Edit intent: clarity
Original:  The effectiveness of the parameter estimation approach is demonstrated in the context of molecular dynamics models (Langevin dynamics)  , where the modeling error is due to coarse-graining, and a PDE (non-Langevin dynamics) that exhibits spatiotemporal chaos, where the model error arises from severe spectral truncations .
Revised:  The effectiveness of the parameter estimation approach is demonstrated in the context of molecular dynamical models (Langevin dynamics) , where the modeling error is due to coarse-graining, and a PDE (non-Langevin dynamics) that exhibits spatiotemporal chaos, where the model error arises from severe spectral truncations .
Edit intent: clarity
Original:  The effectiveness of the parameter estimation approach is demonstrated in the context of molecular dynamics models (Langevin dynamics)  , where the modeling error is due to coarse-graining, and a PDE (non-Langevin dynamics) that exhibits spatiotemporal chaos, where the model error arises from severe spectral truncations .
Revised:  The effectiveness of the parameter estimation approach is demonstrated in the context of molecular dynamics models (Langevin dynamics) , where the modeling error is due to coarse-graining, and a PDE (non-Langevin dynamics) that exhibits spatiotemporal chaos, where the model error arises from a severe spectral truncation .
Edit intent: fluency
Original: A track layout of a graph consists of a vertex coloring and of a total order of each color class, such that the edges between each pair of colors form a non-crossing set .
Revised: A track layout of a graph consists of a vertex coloring and a total order of each color class, such that the edges between each pair of colors form a non-crossing set .
Edit intent: fluency
Original: A track layout of a graph consists of a vertex coloring and of a total order of each color class, such that the edges between each pair of colors form a non-crossing set .
Revised: A track layout of a graph consists of a vertex coloring and of a total order of each color class, such that no two edges cross between any two color classes .
Edit intent: clarity
Original:  Then we show that there exist outerplanar graphs whose track number is 5, which leads  the best known lower bound of 8 for planar graphs.
Revised:  Then we show that there exist outerplanar graphs whose track number is 5, which leads to the best known lower bound of 8 for planar graphs.
Edit intent: fluency
Original:  Our  goal is the robust control of the blood-glucose (BG) level of individuals to a desired healthy range, by means of adjusting the amount of nutrition and/or external insulin appropriately.
Revised:  Our ultimate goal is the robust control of the blood-glucose (BG) level of individuals to a desired healthy range, by means of adjusting the amount of nutrition and/or external insulin appropriately.
Edit intent: clarity
Original:  Our  goal is the robust control of the blood-glucose (BG) level of individuals to a desired healthy range, by means of adjusting the amount of nutrition and/or external insulin appropriately.
Revised:  Our goal is the robust control of the blood glucose (BG) level of individuals to a desired healthy range, by means of adjusting the amount of nutrition and/or external insulin appropriately.
Edit intent: fluency
Original:  The model has the form of a linear stochastic differential equation (SDE) to describe the evolution of the blood glucose (BG ) level.
Revised:  The model has the form of a linear stochastic differential equation (SDE) to describe the evolution of the BG level.
Edit intent: fluency
Original:  The resulting model leads to  prediction of the BG level as an expected value accompanied by a band around this value which accounts for uncertainties in prediction .
Revised:  The resulting model leads to the prediction of the BG level as an expected value accompanied by a band around this value which accounts for uncertainties in prediction .
Edit intent: fluency
Original: We introduce the game of Surrounding Cops and Robber on a graph, as a variant of the traditional game of Cops and Robber .
Revised: We introduce the game of Surrounding Cops and Robbers on a graph, as a variant of the traditional game of Cops and Robber .
Edit intent: fluency
Original: We introduce the game of Surrounding Cops and Robber on a graph, as a variant of the traditional game of Cops and Robber .
Revised: We introduce the game of Surrounding Cops and Robber on a graph, as a variant of the traditional game of Cops and Robbers .
Edit intent: fluency
Original:  In contrast to the traditional game in which the cops win by occupying the same vertex as the robber, they now win by occupying each of the robber's neighbouring vertices.
Revised:  In contrast to the original game in which the cops win by occupying the same vertex as the robber, they now win by occupying each of the robber's neighbouring vertices.
Edit intent: clarity
Original:  We denote by \sigma(G) the {\em surrounding copnumber } of G, namely the least number of cops required to surround a robber in the graph G. We present a number of results regarding this parameter, including general bounds as well as exact values for several classes of graphs.
Revised:  We denote by \sigma(G) the {\em surrounding cop number } of G, namely the least number of cops required to surround a robber in the graph G. We present a number of results regarding this parameter, including general bounds as well as exact values for several classes of graphs.
Edit intent: fluency
Original: Deep learning is increasingly used for state estimation problems such as tracking, navigation, and pose estimation.
Revised: Deep learning has the potential to dramatically impact navigation and tracking state estimation problems such as tracking, navigation, and pose estimation.
Edit intent: clarity
Original:  For many scenarios this assumption is inaccurate, leading to worse subsequent filtered state estimates .
Revised:  This assumption is risky, particularly for "black box" deep learning models, in which uncertainty can vary dramatically and unexpectedly. Accurate quantification of multivariate uncertainty will allow for the full potential of deep learning to be used more safely and reliably in these applications .
Edit intent: clarity
Original:  We experimentally show in a visual tracking problem the large impact that accurate multivariate uncertainty quantification can have on Kalman filter estimation for both in-domain and out-of-domain evaluation data  .
Revised:  We experimentally show in a visual tracking problem the large impact that accurate multivariate uncertainty quantification can have on Kalman filter performance for both in-domain and out-of-domain evaluation data .
Edit intent: clarity
Original:  In this paper we take this computational approach using a simple bit string model of coevolving agents and their parasites.
Revised:  Here we take this computational approach using a simple bit string model of coevolving agents and their parasites.
Edit intent: coherence
Original:  Though identical at the mean-field level, the three models exhibit drastically different behavior leading to different optimal strategies for survival .
Revised:  Though identical at the mean-field level, the three models exhibit drastically different behaviour leading to different optimal strategies for survival .
Edit intent: fluency
Original:  For the discretization of the differential operator, we use a recently proposed scheme which is based on a partial discrete analogue of a symmetrization of the subdifferential.
Revised:  For the discretization of the differential operator, we use a discrete analogue of the subdifferential.
Edit intent: clarity
Original:  To remedy this we extend the standard model of CKA, namely pomsets, with a new feature, called boxes, which can specify that part of the system is protect from outside interference.
Revised:  To remedy this we extend the standard model of CKA, namely pomsets, with a new feature, called boxes, which can specify that part of the system is protected from outside interference.
Edit intent: fluency
Original:  We provide a logic, ` pomset logic', that is an assertion language for specifying such properties, and which is interpreted on pomsets with boxes.
Revised:  We provide a logic, ' pomset logic', that is an assertion language for specifying such properties, and which is interpreted on pomsets with boxes.
Edit intent: fluency
Original:  We are given a convex body K of unit diameter in Euclidean d-dimensional space (where d is a constant) along with an error parameter \varepsilon > 0.
Revised:  Given a convex body K of unit diameter in Euclidean d-dimensional space (where d is a constant) along with an error parameter \varepsilon > 0.
Edit intent: coherence
Original:  We are given a convex body K of unit diameter in Euclidean d-dimensional space (where d is a constant) along with an error parameter \varepsilon > 0.
Revised:  We are given a convex body K of unit diameter in Euclidean d-dimensional space (where d is a constant) and an error parameter \varepsilon > 0.
Edit intent: coherence
Original:  By combinatorial complexity we mean the total number of faces of all dimensions of the polytope.
Revised:  By combinatorial complexity we mean the total number of faces of all dimensions of the polytope.
Edit intent: fluency
Original:  In such models, each node of a network is associated to a value (or opinion), which is updated, at each iteration, to a convex combination of itself and the opinions of the neighboring nodes .
Revised:  In such models, each node of a network is associated to a value (or opinion), which is updated, at each iteration, to a weighted average of itself and the opinions of the neighboring nodes .
Edit intent: clarity
Original:  In such models, each node of a network is associated to a value (or opinion), which is updated, at each iteration, to a convex combination of itself and the opinions of the neighboring nodes .
Revised:  In such models, each node of a network is associated to a value (or opinion), which is updated, at each iteration, to a convex combination of itself and of the values of the adjacent agents .
Edit intent: clarity
Original:  It is well known that, under natural assumptions on the network's graph connectivity, this local averaging procedure eventually leads to global consensus of opinions at all nodes.
Revised:  It is well known that, under natural assumptions on the network's graph connectivity, this local averaging procedure eventually leads to global consensus , or synchronization of the values at all nodes.
Edit intent: clarity
Original:  The idea of iterative averaging actually lies at the heart of many algorithms for distributed optimization, for solution of linear and nonlinear equations, for multi-agent coordination and for opinion formation in social groups.
Revised:  Applications of iterative averaging actually lies at the heart of many algorithms for distributed optimization, for solution of linear and nonlinear equations, for multi-agent coordination and for opinion formation in social groups.
Edit intent: clarity
Original:  The idea of iterative averaging actually lies at the heart of many algorithms for distributed optimization, for solution of linear and nonlinear equations, for multi-agent coordination and for opinion formation in social groups.
Revised:  The idea of iterative averaging include, but are not limited to, algorithms for distributed optimization, for solution of linear and nonlinear equations, for multi-agent coordination and for opinion formation in social groups.
Edit intent: clarity
Original:  The idea of iterative averaging actually lies at the heart of many algorithms for distributed optimization, for solution of linear and nonlinear equations, for multi-agent coordination and for opinion formation in social groups.
Revised:  The idea of iterative averaging actually lies at the heart of many algorithms for distributed optimization, for solution of linear and nonlinear equations, for multi-robot coordination and for opinion formation in social groups.
Edit intent: clarity
Original:  Although these algorithms have similar structures, the mathematical techniques used for their analysis are manifold, and the conditions for their convergence and stability differ from case to case.
Revised:  Although these algorithms have similar structures, the mathematical techniques used for their analysis are diverse, and conditions for their convergence and stability differ from case to case.
Edit intent: clarity
Original:  Although these algorithms have similar structures, the mathematical techniques used for their analysis are manifold, and the conditions for their convergence and stability differ from case to case.
Revised:  Although these algorithms have similar structures, the mathematical techniques used for their analysis are manifold, and the conditions for their convergence and differ from case to case.
Edit intent: clarity
Original:  We show in this paperthat the properties of such algorithms can be analyzed in a unified way by using a novel tool based on recurrent averaging inequalities ( RAI).
Revised:  In this paper, we review many of these algorithms and we show that their properties can be analyzed in a unified way by using a novel tool based on recurrent averaging inequalities ( RAI).
Edit intent: clarity
Original:  In this paper, we develop a theory for RAI, and apply it to the analysis of several important multi-agent algorithms and models of opinion formation recently proposed in the literature.
Revised:  In this paper, we develop a theory of RAIs and apply it to the analysis of several important multi-agent algorithms and models of opinion formation recently proposed in the literature.
Edit intent: fluency
Original:  In this paper, we develop a theory for RAI, and apply it to the analysis of several important multi-agent algorithms and models of opinion formation recently proposed in the literature.
Revised:  In this paper, we develop a theory for RAI, and apply it to the analysis of several important multi-agent algorithms recently proposed in the literature.
Edit intent: clarity
Original:  Under favorable environmental conditions flightless juveniles may overpopulate and aggregate into coherent, aligned swarms referred to as hopper bands.
Revised:  Under favorable environmental conditions flightless juveniles may aggregate into coherent, aligned swarms referred to as hopper bands.
Edit intent: clarity
Original:  A tantalizing and common observation is that these fronts slow and steepen in the presence of lush, edible vegetation.
Revised:  A tantalizing and common observation is that these fronts slow and steepen in the presence of green vegetation.
Edit intent: clarity
Original:  Resources decrease with foraging .
Revised:  Resources decrease with feeding .
Edit intent: clarity
Original:  The rate at which locusts transition between moving and stationary (and vice versa) is enhanced (diminished) by resources abundance.
Revised:  The rate at which locusts transition between moving and stationary (and vice versa) is enhanced (diminished) by resource abundance.
Edit intent: fluency
Original:  Sobol sensitivity analysis yields insight into how the band's macroscopic characteristics vary with changes in the input parameters.
Revised:  Sobol sensitivity analysis yields insight into how the band's collective characteristics vary with changes in the input parameters.
Edit intent: clarity
Original:  This work suggests that foraging should be an intrinsic part of future modeling efforts.
Revised:  This work suggests that feeding behaviors should be an intrinsic part of future modeling efforts.
Edit intent: clarity
Original:  To address this issue, several  approaches have recently been proposed to formally verify them .
Revised:  To address this issue, several approaches have recently been proposed .
Edit intent: coherence
Original:  However, network size is often a bottleneck for such approaches and it can be difficult to apply them to large networks  .
Revised:  However, these approaches afford limited scalability, and applying them to large networks .
Edit intent: clarity
Original: One of the reasons for the success of convolutional networks is their equivariance/invariance under translations.
Revised: Convolutional networks are successful due to their equivariance/invariance under translations.
Edit intent: clarity
Original:  However, rotatable data such as molecules, living cells, everyday objects, or galaxies require processing with equivariance/invariance under rotations in cases where the rotation of the coordinate system does not affect the meaning of the data (e.g. object classification).
Revised:  However, rotatable data such as molecules, living cells, everyday objects, or galaxies require processing with equivariance/invariance under rotations in cases where the rotational orientation of the coordinate system does not affect the meaning of the data (e.g. object classification).
Edit intent: clarity
Original:  Here we provide an overview of existing methods, both for 2D and 3D rotations (and translations), and identify commonalities and links between them , in the hope that our insights will be useful for choosing and perfecting the methods .
Revised:  Here we provide an overview of existing methods, both for 2D and 3D rotations (and translations), and identify commonalities and links between them .
Edit intent: coherence
Original:  While most existing metrics assume that the underlying sets of the partial order are identical, and only the relationships between elements can differ, the metric defined here allows the partially ordered sets to be of differentsizes .
Revised:  While most existing metrics assume that the underlying sets of the partial order are identical, and only the relationships between elements can differ, the metric defined here allows the partially ordered sets to be different .
Edit intent: clarity
Original:  Although this extension can be used directly to compute the metric  , it is computationally feasible only for sparse graphs.
Revised:  Although this extension can be used to compute the metric , it is computationally feasible only for sparse graphs.
Edit intent: clarity
Original:  We provide algorithms for computing the metric for dense graphs and transitively closedgraphs .
Revised:  We provide an alternative techniques for computing the metric for dense graphs and transitively closedgraphs .
Edit intent: clarity
Original:  Since the edge minimization problem is connected to the BWT compression technique called tunneling , the paper also describes a way to minimize the length of a tunneled BWT in such a way that useful properties for sequence analysis are preserved.
Revised:  Since the edge minimization problem is connected to the BWT compression technique called "tunneling" , the paper also describes a way to minimize the length of a tunneled BWT in such a way that useful properties for sequence analysis are preserved.
Edit intent: fluency
Original:  Although not being a complete solution , this is a significant and practically usable progress on the open problem of finding optimal disjoint blocks that minimize space, as stated in Alanko et al. (DCC 2019).
Revised:  Although being a restriction , this is a significant and practically usable progress on the open problem of finding optimal disjoint blocks that minimize space, as stated in Alanko et al. (DCC 2019).
Edit intent: clarity
Original:  Although not being a complete solution , this is a significant and practically usable progress on the open problem of finding optimal disjoint blocks that minimize space, as stated in Alanko et al. (DCC 2019).
Revised:  Although not being a complete solution , this is significant progress towards a solution to the open problem of finding optimal disjoint blocks that minimize space, as stated in Alanko et al. (DCC 2019).
Edit intent: clarity
Original: As UASs increasingly integrate in to the US national airspace system, there is  increasing need to characterize how  UAS may encounter each other.
Revised: As UASs increasingly integrate in to the US national airspace system, there is an increasing need to characterize how UAS may encounter each other.
Edit intent: fluency
Original:  To inform the development of V2V and other safety critical technologies, we demonstrate a methodology to analytically calculate all potential relative geometries between different UAS operations performing inspection missions along three different types of linear infrastructure .
Revised:  To inform the development and evaluation of safety critical technologies, we demonstrate a methodology to analytically calculate all potential relative geometries between different UAS operations performing inspection missions along three different types of linear infrastructure .
Edit intent: clarity
Original:  To inform the development of V2V and other safety critical technologies, we demonstrate a methodology to analytically calculate all potential relative geometries between different UAS operations performing inspection missions along three different types of linear infrastructure .
Revised:  To inform the development of V2V and other safety critical technologies, we demonstrate a methodology to analytically calculate all potential relative geometries between different UAS operations performing inspection missions .
Edit intent: clarity
Original: As UASs increasingly integrate in to the US national airspace system, there is an increasing need to characterize how commercial and recreational UAS may encounter each other.
Revised: As unmanned aerial systems (UASs) increasingly integrate into the US national airspace system, there is an increasing need to characterize how commercial and recreational UAS may encounter each other.
Edit intent: clarity
Original: As UASs increasingly integrate in to the US national airspace system, there is an increasing need to characterize how commercial and recreational UAS may encounter each other.
Revised: As UASs increasingly integrate in to the US national airspace system, there is an increasing need to characterize how commercial and recreational UASs may encounter each other.
Edit intent: fluency
Original:  Furthermore, the number of absorbed molecules at each RX for continuous emission at the TX is obtained.
Edit intent: coherence
Original:  Simulations also  demonstrate that the mutual influence of two active RXs reduces to zero when the two RXs are sufficiently far from each other .
Revised:  Simulations also demonstrate that the mutual imfluence of two active RXs reduces to zero when the two RXs are sufficiently far from each other .
Edit intent: fluency
Original: Motivation: Long non-coding RNAs (lncRNAs) are a diverse class of RNA molecules with a length above 200 nucleotides that do not encode proteins.
Revised: Motivation: Since long non-coding RNAs (lncRNAs) are a diverse class of RNA molecules with a length above 200 nucleotides that do not encode proteins.
Edit intent: coherence
Original:  Since lncRNAs have involved in a wide range of functions in cellular and developmental processes, an increasing number of methods or tools for distin-guishing lncRNAs from coding RNAs have been proposed .
Revised:  Since lncRNAs have involved in a wide range of functions in cellular and developmental processes, an increasing number of methods have been proposed for distinguishing lncRNAs from coding RNAs have been proposed .
Edit intent: clarity