wanyu/IteraTeR_v2 huggingface dataset:
Original:  Interestingly, due to experimental design DNA contained pre-existing nicks in nearly all those experiments, while the potential effect of nicks have never been considered  .
Revised:  Interestingly, due to experimental design DNA contained pre-existing nicks in nearly all those experiments, while the potential effect of nicks have never been considered in the interpretation of experimental results .
Edit intent: clarity
Original:  Here, using full-atom molecular dynamics (MD) simulations, we show that nicks promote DNA basepair disruption at the nicked sites which drastically reduced DNA bending energy.
Revised:  Here, using full-atom molecular dynamics simulations, we show that nicks promote DNA basepair disruption at the nicked sites which drastically reduced DNA bending energy.
Edit intent: clarity
Original:  Here, using full-atom molecular dynamics (MD) simulations, we show that nicks promote DNA basepair disruption at the nicked sites which drastically reduced DNA bending energy.
Revised:  Here, using full-atom molecular dynamics (MD) simulations, we show that nicks promote DNA basepair disruption at the nicked sites , which drastically reduces DNA bending energy.
Edit intent: fluency
Original:  In the absence of nicks, basepair disruption can also occur , but it requires a higher level of DNA bending.
Revised:  In the absence of nicks, basepair disruption can also occur but requires a higher level of DNA bending.
Edit intent: coherence
Original:  It was well known that in large dimension p, a planted k-sparse unit vector can be {\em in principle} detected using only n \approx k\log p (Gaussian or Bernoulli) samples, but all {\em efficient} (polynomial time) algorithms known require n \approx k^2 \log p samples.
Revised:  It was well known that in large dimension p, a planted k-sparse unit vector can be {\em in principle} detected using only n \approx k\log p (Gaussian or Bernoulli) samples, but all {\em efficient} (polynomial time) algorithms known require n \approx k^2 samples.
Edit intent: fluency
Original:  However, what factors regulate this motion, and the implication of this motion if stopped, remains incompletely understood.
Revised:  However, factors regulating this motion, and the implication of this motion if stopped, remains incompletely understood.
Edit intent: coherence
Original:  However, what factors regulate this motion, and the implication of this motion if stopped, remains incompletely understood.
Revised:  However, what factors regulate this motion, and the implications of this motion if stopped, remains incompletely understood.
Edit intent: fluency
Original:  However, what factors regulate this motion, and the implication of this motion if stopped, remains incompletely understood.
Revised:  However, what factors regulate this motion, and the implication of this motion if perturbed remain incompletely understood.
Edit intent: clarity
Original:  In the current study, we address these questions using a cell center mechanics based model , wherein each cell represented by a point in physical space is motile, and interacts with neighboring cells via harmonic forces.
Revised:  In the current study, we address these questions using a cell-center based model in which cells are polarized, motile, and interacts with neighboring cells via harmonic forces.
Edit intent: clarity
Original:  In the current study, we address these questions using a cell center mechanics based model , wherein each cell represented by a point in physical space is motile, and interacts with neighboring cells via harmonic forces.
Revised:  In the current study, we address these questions using a cell center mechanics based model , wherein each cell represented by a point in physical space is motile, and interact with the neighboring cells via harmonic forces.
Edit intent: fluency
Original:  We demonstrate that a simple rule where the preferred direction of motion (i.e., polarization ) tends to orient with velocity vector, is capable of inducing coherent motion in geometrically confined environments.
Revised:  We demonstrate that a simple rule where the preferred direction of motion (i.e., polarization ) tends to orient with its velocity vector can induce coherent motion in geometrically confined environments.
Edit intent: clarity
Original:  We identify cell density as an important parameter dictating the pattern of rotation, with more solid-like tissue behavior at lower densities, and more fluid-like tissue behavior at high densities.
Revised:  In addition to recapitulating coherent rotational motion observed in experiments, our results also show the presence of radial movements and tissue behavior that can vary between solid-like and fluid-like tissue behavior at high densities.
Edit intent: clarity
Original:  Finally, we show that when confinement is removed,  the existing coherent motion leads to cell scattering with stiffness of cell-cell contacts dictating the invasion pattern , with a random scattering profile observed in cells with soft adhesions and a more collective scattering profile observed in cells with medium stiff adhesions .
Revised:  Finally, we show that when confinement is removed, we see that the existing coherent motion leads to cell scattering with stiffness of cell-cell contacts dictating the invasion pattern , with a random scattering profile observed in cells with soft adhesions and a more collective scattering profile observed in cells with medium stiff adhesions .
Edit intent: clarity
Original:  Finally, we show that when confinement is removed,  the existing coherent motion leads to cell scattering with stiffness of cell-cell contacts dictating the invasion pattern , with a random scattering profile observed in cells with soft adhesions and a more collective scattering profile observed in cells with medium stiff adhesions .
Revised:  Finally, we show that when confinement is removed, the existing coherent motion leads to cell scattering with stiffness of cell-cell contacts dictating the invasion pattern .
Edit intent: coherence
Original:  In summary, in addition to demonstrating the utility of using a velocity-polarization coupling in inducing coherent motion under confinement, our results, for the first time, implicate cell density, cell division and stiffness of cell-cell adhesions as three important factors regulating the dynamics of coherent angular motion, and may have important pathological implications.
Revised:  In summary, our study provides an in-depth understanding of the origin of coherent rotation in confined tissues, and extracts useful insights into the influence of various physical parameters on the pattern of such movements
Edit intent: clarity
Original:  In this research, we develop an algorithmic trading strategy to deal with the discrete optimal liquidation problem of large order trading with different market microstructures in an illiquid market.
Revised:  In this research, we develop a trading strategy for the discrete-time optimal liquidation problem of large order trading with different market microstructures in an illiquid market.
Edit intent: clarity
Original:  In this market, order flow can be viewed as a Point process with stochastic arrival intensity.
Revised:  In this framework, the flow of orders can be viewed as a Point process with stochastic arrival intensity.
Edit intent: clarity
Original:  In this market, order flow can be viewed as a Point process with stochastic arrival intensity.
Revised:  In this market, order flow can be viewed as a point process with stochastic arrival intensity.
Edit intent: fluency
Original:  Interaction between price impact and price dynamics can be modeled as a dynamic optimization problem with price impact as a linear function of the self-exciting dynamic process.
Revised:  Interaction between price impact and price dynamics can be modeled as a dynamic optimization problem with price impact as a linear function of a self-exciting dynamic process.
Edit intent: fluency
Original:  We show that navigability can be achieved by using only two ingredients present in majority of networks: network growth and local homophily, giving the answer why the navigation feature appears in real-life networks.
Revised:  We show that navigability can be achieved by using only two ingredients present in majority of networks: network growth and local homophily, giving a persuasive answer how the navigation appears in real-life networks.
Edit intent: clarity
Original:  Incremental insertion of metric elements in random order by adding connections to the closest neighbors produces a self-similar optimally wired navigable small world network with an exponential degree distribution .
Revised:  Incremental insertion of metric elements in random order by adding connections to the closest neighbors produces a self-similar optimally wired navigable small world networks with exponential degree distribution .
Edit intent: fluency
Original:  Several features of the proposed model are observed in real-life networks, in particular in the brain neural networks, supporting earlier suggestions that they are navigable  .
Revised:  Many features of the proposed model are observed in real-life networks, in particular in the brain neural networks, supporting earlier suggestions that they are navigable .
Edit intent: fluency
Original:  Several features of the proposed model are observed in real-life networks, in particular in the brain neural networks, supporting earlier suggestions that they are navigable  .
Revised:  Several features of the model are observed in real-life networks, in particular in the brain neural networks, supporting earlier suggestions that they are navigable .
Edit intent: clarity
Original: Navigability, an ability to find a logarithmically short path between elements using only local information  is one of the most fascinating properties of real-life networks.
Revised: Navigability, an ability to find a logarithmically short path between elements using only local information , is one of the most fascinating properties of real-life networks.
Edit intent: fluency
Original:  However  the exact mechanism responsible for the formation of navigation properties remained unknown.
Revised:  However , the exact mechanism responsible for the formation of navigation properties remained unknown.
Edit intent: coherence
Original:  We show that navigability can be achieved by using only two ingredients present in  majority of networks: network growth and local homophily, giving a persuasive answer how the navigation appears in real-life networks.
Revised:  We show that navigability can be achieved by using only two ingredients present in the majority of networks: network growth and local homophily, giving a persuasive answer how the navigation appears in real-life networks.
Edit intent: fluency
Original:  Many features of the model are observed in real-life networks, in particular in the brain neural networks, supporting  earlier suggestions that they are navigable .
Revised:  Many features of the model are observed in real-life networks, in particular in the brain neural networks, supporting the earlier suggestions that they are navigable .
Edit intent: fluency
Original: Hierarchical feature extractors such as Convolutional Networks (ConvNets) have achieved strong performance on a variety of classification tasks using purely feedforward processing.
Revised: Hierarchical feature extractors such as Convolutional Networks (ConvNets) have achieved impressive performance on a variety of classification tasks using purely feedforward processing.
Edit intent: clarity
Original:  Instead of directly predicting the target outputs in one go, we use a self-correcting model that progressively changes an initial solution by feeding back error predictions, in a process we call Iterative Error Feedback (IEF).
Revised:  Instead of directly predicting the outputs in one go, we use a self-correcting model that progressively changes an initial solution by feeding back error predictions, in a process we call Iterative Error Feedback (IEF).
Edit intent: clarity
Original:  We show that IEF improves over the state-of-the-art on the task of articulated human pose estimation on the challenging MPII dataset .
Revised:  IEF shows excellent performance on the task of articulated human pose estimation on the challenging MPII dataset .
Edit intent: clarity
Original:  We show that IEF improves over the state-of-the-art on the task of articulated human pose estimation on the challenging MPII dataset .
Revised:  We show that IEF improves over the state-of-the-art on the task of articulated pose estimation in the challenging MPII dataset .
Edit intent: clarity
Original:  We  test the performance of these algorithms on real aggregate power data from five appliances against seven metrics .
Revised:  We use seven metrics to test the performance of these algorithms on real aggregate power data from five appliances against seven metrics .
Edit intent: clarity
Original:  We  test the performance of these algorithms on real aggregate power data from five appliances against seven metrics .
Revised:  We test the performance of these algorithms on real aggregate power data from five appliances .
Edit intent: clarity
Original:  Tests are performed against houses seen during training and houses not seen during training.
Revised:  Tests are performed against a house not seen during training and houses not seen during training.
Edit intent: fluency
Original:  Tests are performed against houses seen during training and houses not seen during training.
Revised:  Tests are performed against houses seen during training and against houses seen during training.
Edit intent: clarity
Original:  \ (08), Globerson \& Roweis (06)].
Revised:  (08), Globerson \& Roweis (06)].
Edit intent: fluency
Original:  \ (08), Globerson \& Roweis (06)].
Revised:  \ (08), Globerson Roweis (06)].
Edit intent: fluency
Original:  \ (08). It is not difficult to show that even if we look at robustness to removing a single element, the problem is at least as hard as the ordinary maximization problem, which is approximable upto a factor of 1-1/e.
Revised:  (08). It is not difficult to show that even if we look at robustness to removing a single element, the problem is at least as hard as the ordinary maximization problem, which is approximable upto a factor of 1-1/e.
Edit intent: fluency
Original:  \ (08). It is not difficult to show that even if we look at robustness to removing a single element, the problem is at least as hard as the ordinary maximization problem, which is approximable upto a factor of 1-1/e.
Revised:  \ (08). It is not difficult to show that even if we look at robustness to removing a single element, the problem is at least as hard as the ordinary maximization problem, which is approximable up to a factor of 1-1/e.
Edit intent: fluency
Original:  However, we would like to choose a robust set of features such that, there is not too much dependence on a small subset of chosen features Krause et al. (08), Globerson%DIFDELCMD < & %%% Roweis (06) .
Revised:  However, we would like to choose a robust set of features such that, there is not too much dependence on a small subset of chosen features %DIFDELCMD < & %%% Roweis (06) .
Edit intent: coherence
Original:  However, we would like to choose a robust set of features such that, there is not too much dependence on a small subset of chosen features Krause et al. (08), Globerson%DIFDELCMD < & %%% Roweis (06) .
Revised:  However, we would like to choose a robust set of features such that, there is not too much dependence on a small subset of chosen features Krause et al. (08), Globerson%DIFDELCMD < & %%% .
Edit intent: coherence
Original:  However, we would like to choose a robust set of features such that, there is not too much dependence on a small subset of chosen features Krause et al. (08), Globerson%DIFDELCMD < & %%% Roweis (06) .
Revised:  However, we would like to choose a robust set of features such that, there is not too much dependence on a small subset of chosen features Krause et al. (08), Globerson%DIFDELCMD < & %%% Roweis (06) 
Edit intent: fluency
Original:  We consider a formulation of this problem that was formally introduced by Krause et al. ( 08).
Revised:  We consider a robust formulation, introduced by Krause et al. ( 08).
Edit intent: clarity
Original:  For this case of single element removal , we give : (i)an algorithm with parameter m, that has asymptotic guarantee ( 1-1/  e)-\Omega(1/m) using O(n^{ m+ 1  }) queries and (ii)a fast asymptotically 0.5547 approximate algorithm.
Revised:  For this case of single element removal , we give a deterministic ( 1-1/ e)-\Omega(1/m) using O(n^{ m+ 1 }) queries and (ii)a fast asymptotically 0.5547 approximate algorithm.
Edit intent: clarity
Original:  For this case of single element removal , we give : (i)an algorithm with parameter m, that has asymptotic guarantee ( 1-1/  e)-\Omega(1/m) using O(n^{ m+ 1  }) queries and (ii)a fast asymptotically 0.5547 approximate algorithm.
Revised:  For this case of single element removal , we give : (i)an algorithm with parameter m, that has asymptotic guarantee ( 1-1/ e)-\Omega(1/m) using O(n^{ 1 }) queries and (ii)a fast asymptotically 0.5547 approximate algorithm.
Edit intent: clarity
Original: We consider a robust formulation, introduced by Krause et al. (2008), of the classic cardinality constrained monotone submodular function maximization problem, and give the first constant factor approximation results.
Revised: We consider a robust formulation, introduced by Krause et al. (2008), of the classical cardinality constrained monotone submodular function maximization problem, and give the first constant factor approximation results.
Edit intent: fluency
Original:  The robustness considered is w.r.t. \ adversarial removal of up to \tau elements from the chosen set.
Revised:  The robustness considered is w.r.t. adversarial removal of up to \tau elements from the chosen set.
Edit intent: fluency
Original:  For the fundamental case of \tau=1, we give a deterministic (1-1/e) -\Omega(1 /  m) approximation , which makes O(n^{m+1}) queries .
Revised:  For the fundamental case of \tau=1, we give a deterministic (1-1/e) -1 / m) approximation , which makes O(n^{m+1}) queries .
Edit intent: clarity
Original:  For the fundamental case of \tau=1, we give a deterministic (1-1/e) -\Omega(1 /  m) approximation , which makes O(n^{m+1}) queries .
Revised:  For the fundamental case of \tau=1, we give a deterministic (1-1/e) -\Omega(1 / m) approximation algorithm, where m is an input parameter and number of queries scale as O(n^{m+1}) queries .
Edit intent: clarity
Original:  For the fundamental case of \tau=1, we give a deterministic (1-1/e) -\Omega(1 /  m) approximation , which makes O(n^{m+1}) queries .
Revised:  For the fundamental case of \tau=1, we give a deterministic (1-1/e) -\Omega(1 / m) approximation , which makes O(n^{m+1}) .
Edit intent: clarity
Original:  Finally, to facilitate usage of our method "in the wild", we present a novel synthetic data augmentation approach for training with depth images that improves recognition accuracy in real-world environments .
Revised:  Finally, to facilitate usage of our method "in the wild", we present a novel synthetic data augmentation approach for training with depth images that improves recognition accuracy in real-world noisy settings .
Edit intent: clarity
Original:  One of the ingredients in the proof is a tight uppper bound on the geometric dilation of a convex cycle that is contained in an annulus.
Revised:  One of the ingredients in the proof is a tight upper bound on the geometric dilation of a convex cycle that is contained in an annulus.
Edit intent: fluency
Original: We analyze the dynamics of spreading processes taking place over time-varying networks.
Revised: In this paper, we analyze the dynamics of spreading processes taking place over time-varying networks.
Edit intent: clarity
Original:  We  study the stability  spreading processes in this extended family.
Revised:  We then study the stability spreading processes in this extended family.
Edit intent: coherence
Original:  We  study the stability  spreading processes in this extended family.
Revised:  We study the stability of spreading processes in this extended family.
Edit intent: fluency
Original:  We first show that a direct analysis based on the It\^o formula provide conditions in terms of the eigenvalues of a matrix whose size grows exponentially with the number of edges.
Revised:  We first show that a direct analysis based on It\^o formula provide conditions in terms of the eigenvalues of a matrix whose size grows exponentially with the number of edges.
Edit intent: fluency
Original:  We first show that a direct analysis based on the It\^o formula provide conditions in terms of the eigenvalues of a matrix whose size grows exponentially with the number of edges.
Revised:  We first show that a direct analysis based on the It\^o 's formula provides stability conditions in terms of the eigenvalues of a matrix whose size grows exponentially with the number of edges.
Edit intent: clarity
Original:  Using alternative tools , we derive  stability conditions involving the eigenvalues of a matrix whose size grows linearly with the number of nodes.
Revised:  To overcome this limitation , we derive stability conditions involving the eigenvalues of a matrix whose size grows linearly with the number of nodes.
Edit intent: coherence
Original:  Using alternative tools , we derive  stability conditions involving the eigenvalues of a matrix whose size grows linearly with the number of nodes.
Revised:  Using alternative tools , we derive alternative stability conditions involving the eigenvalues of a matrix whose size grows linearly with the number of nodes.
Edit intent: fluency
Original:  Apart from these theoretical results , we illustrate our findings via numerical simulations.
Revised:  Finally , we illustrate our findings via numerical simulations.
Edit intent: coherence
Original:  Event-triggered updates are critical to get right to avoid issues such as dropped packets, degraded performance, or violations of security policies, but they are also challenging to implement due to the high degree of concurrency and distributed nature of networks.
Revised:  Event-triggered updates are critical to get right , but difficult to implement correctly due to the high degree of concurrency and distributed nature of networks.
Edit intent: clarity
Original:  This paper introduces event-triggered consistent updates , which are guaranteed to preserve well-defined behaviors when transitioning between static configurations in response to events.
Revised:  This paper introduces event-driven consistent updates that are guaranteed to preserve well-defined behaviors when transitioning between static configurations in response to events.
Edit intent: clarity
Original:  This paper introduces event-triggered consistent updates , which are guaranteed to preserve well-defined behaviors when transitioning between static configurations in response to events.
Revised:  This paper introduces event-triggered consistent updates , which are guaranteed to preserve well-defined behaviors when transitioning between configurations in response to events.
Edit intent: clarity
Original:  We propose network event structures (NESs) as a way to specify which events can be simultaneously enabled and causal dependencies between events.
Revised:  We propose network event structures (NESs) as a way to specify which events can be enabled simultaneously and causal dependencies between events.
Edit intent: fluency
Original:  We give semantics to these Stateful NetKAT programs in terms of NESs, develop general mechanisms for implementing NESs using next-generation switches, and prove our implementation strategies correct.
Revised:  We give semantics to stateful programs using NESs. We discuss strategies for implementing NESs using next-generation switches, and prove our implementation strategies correct.
Edit intent: clarity