wanyu/IteraTeR_v2 huggingface dataset:
Original: We employ a simple modification to the conventional time of flight mass spectrometry (TOFMS) where a variable and (pseudo) random pulsing rate is used which allows for traces from different pulses to overlap.
Revised: We employ a simple modification to the conventional time of flight mass spectrometry (TOFMS) where a variable and (pseudo) random pulsing rate is used which allows for traces from different pulses to overlap.
Edit intent: fluency
Original: We employ a simple modification to the conventional time of flight mass spectrometry (TOFMS) where a variable and (pseudo) random pulsing rate is used which allows for traces from different pulses to overlap.
Revised: We employ a simple modification to the conventional time of flight mass spectrometry (TOFMS) where a variable and (pseudo) - pulsing rate is used which allows for traces from different pulses to overlap.
Edit intent: fluency
Original: We employ a simple modification to the conventional time of flight mass spectrometry (TOFMS) where a variable and (pseudo) random pulsing rate is used which allows for traces from different pulses to overlap.
Revised: We employ a simple modification to the conventional time of flight mass spectrometry (TOFMS) where a variable and (pseudo) randomrandom pulsing rate is used which allows for traces from different pulses to overlap.
Edit intent: clarity
Original:  Our approach can be used to improve duty cycle, throughput , and mass resolution of TOFMS at the same time.
Revised:  This approach can be used to improve duty cycle, throughput , and mass resolution of TOFMS at the same time.
Edit intent: fluency
Original:  Our approach can be used to improve duty cycle, throughput , and mass resolution of TOFMS at the same time.
Revised:  Our approach can be used to improve duty cycle, speed , and mass resolution of TOFMS at the same time.
Edit intent: clarity
Original:  Our approach can be used to improve duty cycle, throughput , and mass resolution of TOFMS at the same time.
Revised:  Our approach can be used to improve duty cycle, throughput , and mass resolving power of TOFMS at the same time.
Edit intent: clarity
Original:  We used the such parametrized model for performing several numerical tests to check  the universality of the model .
Revised:  We use the such parameterized model for performing several numerical tests to check the universality of the model .
Edit intent: fluency
Original:  Characterizing the cases where the greedy choice fails, we prove that this maximal weight is, as a function of m, asymptotically independent of \max(p,q), and we show how to compute its value in logarithmic time .
Revised:  Characterizing the cases where the greedy choice fails, we prove that this maximal weight is, as a function of m, asymptotically independent of \max(p,q), and we provide an efficient algorithm to compute it .
Edit intent: clarity
Original:  Understanding its behavior is of considerable applied importance because of Congenital Rubella Syndrome, which results from infection with rubella during early pregnancy and may entail a variety of birth defects.
Revised:  Understanding its behavior is of considerable public health importance because of Congenital Rubella Syndrome, which results from infection with rubella during early pregnancy and may entail a variety of birth defects.
Edit intent: clarity
Original:  This approach allows us to quantify the effects of demographic stochasticity and to give a coherent picture of measles and rubella dynamics, explaining essential differences in the  patterns exhibited by these diseases.
Revised:  This approach allows us to quantify the effects of demographic stochasticity and to give a coherent picture of measles and rubella dynamics, explaining essential differences in the recurrent patterns exhibited by these diseases.
Edit intent: clarity
Original:  Sodium MRI is an increasing subject in translational research as it can give some direct and quantitative biochemical information on the tissue viability, cell integrity and function, and therefore not only help the diagnosis but also the prognosis of diseases and treatment outcomes.
Revised:  Sodium MRI is a subject of increasing interest in translational research as it can give some direct and quantitative biochemical information on the tissue viability, cell integrity and function, and therefore not only help the diagnosis but also the prognosis of diseases and treatment outcomes.
Edit intent: clarity
Original: In multiview applications, multiple cameras acquire the same scene from different viewpoints and  produce correlated video streams.
Revised: In multiview applications, multiple cameras acquire the same scene from different viewpoints and generally produce correlated video streams.
Edit intent: coherence
Original:  In this work, we propose a correlation-aware packet scheduling algorithm for multi-camera networks, where information from all cameras are transmitted over a bottleneck channel to clients that reconstruct  multiview images.
Revised:  In this work, we propose a correlation-aware packet scheduling algorithm for multi-camera networks, where information from all cameras are transmitted over a bottleneck channel to clients that reconstruct the multiview images.
Edit intent: coherence
Original:  We then propose a problem formulation for foresighted optimization of scheduling policies, which adapt to temporal variations in the scene content.
Revised:  We propose a problem formulation for foresighted optimization of scheduling policies, which adapt to temporal variations in the scene content.
Edit intent: coherence
Original:  We then propose a problem formulation for foresighted optimization of scheduling policies, which adapt to temporal variations in the scene content.
Revised:  We then propose a problem formulation for foresighted optimization of scheduling policies, which adapt to variations in the scene content.
Edit intent: clarity
Original:  Furthermore, we propose a low complexity scheduling algorithm based on a trellis search that selects the subset of candidate packets to be transmitted for optimized reconstruction quality.
Revised:  Then, we design a low complexity scheduling algorithm based on a trellis search that selects the subset of candidate packets to be transmitted for optimized reconstruction quality.
Edit intent: clarity
Original:  We finally show that increasing the optimization horizon in the packet scheduling algorithm improves the transmission performance, especially in dynamic scenarios where the level of correlation varies rapidly with time.
Revised:  We finally show that increasing the optimization horizon in the packet scheduling algorithm improves the transmission performance, especially in scenarios where the level of correlation varies rapidly with time.
Edit intent: clarity
Original:  We finally show that increasing the optimization horizon in the packet scheduling algorithm improves the transmission performance, especially in dynamic scenarios where the level of correlation varies rapidly with time.
Revised:  We finally show that increasing the optimization horizon in the packet scheduling algorithm improves the transmission performance, especially in dynamic scenarios where the level of correlation rapidly varies with time.
Edit intent: fluency
Original: We report the experimental verification of noise-enhanced logic behaviour in an electronic analog of a synthetic genetic network, composed of two repressors and two constructive promoters.
Revised: We report the experimental verification of noise-enhanced logic behaviour in an electronic analog of a synthetic genetic network, composed of two repressors and two constitutive promoters.
Edit intent: clarity
Original:  Interestingly, the two dynamical variables in the system yield complementary logic behaviour simultaneously , indicating strong potential for parallel processing .
Revised:  The two dynamical variables in the system yield complementary logic behaviour simultaneously , indicating strong potential for parallel processing .
Edit intent: coherence
Original: Modelling of ion transport via plasma membrane needs identification and quantitative understanding of the involved processes.
Revised: Modeling of ion transport via plasma membrane needs identification and quantitative understanding of the involved processes.
Edit intent: fluency
Original:  Comparison of ion transport in small yeast cell and several animal cell types is provided and importance of cell volume to surface ratio is stressed.
Revised:  In this review a comparison of ion transport in small yeast cell and several animal cell types is provided and importance of cell volume to surface ratio is stressed.
Edit intent: clarity
Original:  Comparison of ion transport in small yeast cell and several animal cell types is provided and importance of cell volume to surface ratio is stressed.
Revised:  Comparison of ion transport in small yeast cell and several animal cell types is provided . The importance of cell volume to surface ratio is stressed.
Edit intent: coherence
Original:  Role of cell wall and lipid rafts is discussed in aspect of required increase in spatial and temporary resolution of measurements.
Revised:  Role of cell wall and lipid rafts is discussed in respect to required increase in spatial and temporary resolution of measurements.
Edit intent: clarity
Original:  Role of cell wall and lipid rafts is discussed in aspect of required increase in spatial and temporary resolution of measurements.
Revised:  Role of cell wall and lipid rafts is discussed in aspect of required increase in spatial and temporal resolution of measurements.
Edit intent: fluency
Original: We give a nontrivial algorithm for the satisfiability problem for cn-wire threshold circuits of depth 2 which is better than exhaustive search by a factor 2^{sn} where s= 1/c^{O(c^2)}.
Revised: We give a nontrivial algorithm for the satisfiability problem for cn-wire threshold circuits of depth two which is better than exhaustive search by a factor 2^{sn} where s= 1/c^{O(c^2)}.
Edit intent: fluency
Original:  Our proof provides a characterization of the set of satisfying solutions of such a circuit as the union of the 0-1 solutions of at most 2^{(1-s)n of the feasibility of the 0-1 integer programming problem with linear size constraints.
Revised:  Our proof provides a characterization of the set of satisfying solutions of such a circuit as the union of the 0-1 solutions of at most 2^{(1-s)n of the feasibility of sparse 0-1 integer programming problem with linear size constraints.
Edit intent: fluency
Original:  109, 228101, 2012) the elastic properties of DNA were studied by molecular dynamics (MD) simulations .
Revised:  109, 228101, 2012) molecular dynamics (MD) simulations .
Edit intent: coherence
Original:  Earlier similar studies showed that (i) the current MD forcefields systematically overestimate the DNA rigidity, and (ii) MD trajectories of DNA involve only short-range correlations;
Revised:  Earlier similar studies showed that (i) MD systematically overestimate the DNA rigidity, and (ii) MD trajectories of DNA involve only short-range correlations;
Edit intent: clarity
Original:  Earlier similar studies showed that (i) the current MD forcefields systematically overestimate the DNA rigidity, and (ii) MD trajectories of DNA involve only short-range correlations;
Revised:  Earlier similar studies showed that (i) the current MD forcefields systematically overestimate the DNA rigidity, and (ii) 
Edit intent: clarity
Original:  no deviations from the WLR model are detectable if MD data are analyzed properly .
Revised:  no deviations from the WLR model are detectable .
Edit intent: clarity
Original:  Here it is argued that the data analysis in the above mentioned paper was not correct and that the earlier conclusions are valid.
Revised:  Here it is argued that the data analysis in the above mentioned paper was incorrect and that the earlier conclusions are valid.
Edit intent: clarity
Original:  Our results also show that the spatial organization of the signaling process and the fact that the distributed  events take place in nanoclusters with a finite lifetime regulated by local production is sufficient to obtain a robust and high-fidelity response.
Revised:  Our results show that the spatial organization of the signaling process and the fact that the distributed events take place in nanoclusters with a finite lifetime regulated by local production is sufficient to obtain a robust and high-fidelity response.
Edit intent: clarity
Original:  Our results also show that the spatial organization of the signaling process and the fact that the distributed  events take place in nanoclusters with a finite lifetime regulated by local production is sufficient to obtain a robust and high-fidelity response.
Revised:  Our results also show that the fact that the distributed events take place in nanoclusters with a finite lifetime regulated by local production is sufficient to obtain a robust and high-fidelity response.
Edit intent: clarity
Original:  Our results also show that the spatial organization of the signaling process and the fact that the distributed  events take place in nanoclusters with a finite lifetime regulated by local production is sufficient to obtain a robust and high-fidelity response.
Revised:  Our results also show that the spatial organization of the signaling process and the fact that the distributed signaling events take place in nanoclusters with a finite lifetime regulated by local production is sufficient to obtain a robust and high-fidelity response.
Edit intent: fluency
Original:  We assume that the Brownian motion and jump process are independent, and there exists a  probability density function for the jump times and marks .
Revised:  We assume that there exists a probability density function for the jump times and marks .
Edit intent: clarity
Original: In this paper , we propose a distributed rate allocation algorithm that minimizes the average decoding delay  in inter-session network coding systems.
Revised: In this work , we propose a distributed rate allocation algorithm that minimizes the average decoding delay in inter-session network coding systems.
Edit intent: clarity
Original:  We consider a scenario where network nodes, or peers, are organized in a mesh network , with every peer interested in the content of one of the several available sources.
Revised:  We consider a scenario where the users are organized in a mesh network , with every peer interested in the content of one of the several available sources.
Edit intent: clarity
Original:  We consider a scenario where network nodes, or peers, are organized in a mesh network , with every peer interested in the content of one of the several available sources.
Revised:  We consider a scenario where network nodes, or peers, are organized in a mesh network and each user requests the content of one of the several available sources.
Edit intent: clarity
Original:  We consider a scenario where network nodes, or peers, are organized in a mesh network , with every peer interested in the content of one of the several available sources.
Revised:  We consider a scenario where network nodes, or peers, are organized in a mesh network , with every peer interested in the content of one of the available sources.
Edit intent: clarity
Original:  Our novel algorithm allows peers to determine the coding operations and the packet rates to be requested from the parent peers . A rate allocation problem is solved by every peer , which seeks the rates that minimize the average decoding delay for its children and for itself.
Revised:  Our novel algorithm allows peers to determine the coding operations and the packet rates to be requested from the parent peers . A rate allocation problem is solved by every user , which seeks the rates that minimize the average decoding delay for its children and for itself.
Edit intent: clarity
Original:  To solve this non-convex optimization problem , we introduce the concept of equivalent packet flows, which permits to estimate the expected number of packets that every peer needs to collect for decoding.
Revised:  Since the optimization problem is a priori non-convex , we introduce the concept of equivalent packet flows, which permits to estimate the expected number of packets that every peer needs to collect for decoding.
Edit intent: clarity
Original:  The results demonstrate that the proposed scheme eliminates effectively the bottlenecks and reduces the decoding delay experienced by users with limited bandwidth resources  .
Revised:  The results demonstrate that the proposed scheme eliminates the bottlenecks and reduces the decoding delay experienced by users with limited bandwidth resources .
Edit intent: clarity
Original:  Furthermore, the expression vector thus created can readily be introduced into yeast cells to test the assembled gene's functionality.
Revised:  Furthermore, the plasmid thus created can readily be introduced into yeast cells to test the assembled gene's functionality.
Edit intent: clarity
Original:  Using our gene assembly approach, we made yeast expression vectors of these engineered transactivators, AIDtTA and AIDrtTA , and tested their functions in yeast.
Revised:  Using our gene assembly approach, we made yeast expression vectors of these engineered transactivators, AIDtTA and AIDrtTA and then tested their functions in yeast.
Edit intent: coherence
Original: This study introduces a bibliometric approach to study international scientific migration, based on an analysis of the affiliation countries of authors publishing in peer reviewed scientific-scholarly journals indexed in Scopus.
Revised: A bibliometric approach is explored to tracking international scientific migration, based on an analysis of the affiliation countries of authors publishing in peer reviewed scientific-scholarly journals indexed in Scopus.
Edit intent: clarity
Original: This study introduces a bibliometric approach to study international scientific migration, based on an analysis of the affiliation countries of authors publishing in peer reviewed scientific-scholarly journals indexed in Scopus.
Revised: This study introduces a bibliometric approach to study international scientific migration, based on an analysis of the affiliation countries of authors publishing in peer reviewed journals indexed in Scopus.
Edit intent: clarity
Original:  A model is presented relating base notions in migration and collaboration studies to bibliometric constructs, and its potentialities and limitations are discussed . Synchronous and asynchronous analyses are presented for 10 rapidly growing countries and 7 scientifically established countries , comparing international migration with co-authorship relationships . Rough error rates of the proposed indicators are estimated.
Revised:  The paper introduces a model that relates base concepts in the study of migration to bibliometric constructs, and its potentialities and limitations are discussed . Synchronous and asynchronous analyses are presented for 10 rapidly growing countries and 7 scientifically established countries , comparing international migration with co-authorship relationships . Rough error rates of the proposed indicators are estimated.
Edit intent: clarity
Original:  A model is presented relating base notions in migration and collaboration studies to bibliometric constructs, and its potentialities and limitations are discussed . Synchronous and asynchronous analyses are presented for 10 rapidly growing countries and 7 scientifically established countries , comparing international migration with co-authorship relationships . Rough error rates of the proposed indicators are estimated.
Revised:  A model is presented relating base notions in migration and collaboration studies to bibliometric constructs, and discusses the potentialities and limitations are discussed . Synchronous and asynchronous analyses are presented for 10 rapidly growing countries and 7 scientifically established countries , comparing international migration with co-authorship relationships . Rough error rates of the proposed indicators are estimated.
Edit intent: fluency
Original:  A model is presented relating base notions in migration and collaboration studies to bibliometric constructs, and its potentialities and limitations are discussed . Synchronous and asynchronous analyses are presented for 10 rapidly growing countries and 7 scientifically established countries , comparing international migration with co-authorship relationships . Rough error rates of the proposed indicators are estimated.
Revised:  A model is presented relating base notions in migration and collaboration studies to bibliometric constructs, and its potentialities and limitations of a bibliometric approach both with respect to data accuracy and interpretation . Synchronous and asynchronous analyses are presented for 10 rapidly growing countries and 7 scientifically established countries , comparing international migration with co-authorship relationships . Rough error rates of the proposed indicators are estimated.
Edit intent: clarity
Original:  A model is presented relating base notions in migration and collaboration studies to bibliometric constructs, and its potentialities and limitations are discussed . Synchronous and asynchronous analyses are presented for 10 rapidly growing countries and 7 scientifically established countries , comparing international migration with co-authorship relationships . Rough error rates of the proposed indicators are estimated.
Revised:  A model is presented relating base notions in migration and collaboration studies to bibliometric constructs, and its potentialities and limitations are discussed . Synchronous and asynchronous analyses are presented for 10 rapidly growing countries and 7 scientifically established countries . Rough error rates of the proposed indicators are estimated.
Edit intent: coherence
Original:  It is concluded that the bibliometric approach is useful provided that its outcomes are interpreted with care  . Error rates for units of assessment with large indicator values are estimated to be fairly below 10 per cent .
Revised:  It is concluded that the bibliometric approach is promising provided that its outcomes are interpreted with care . Error rates for units of assessment with large indicator values are estimated to be fairly below 10 per cent .
Edit intent: clarity
Original: A hybrid finite difference--finite volume(FD-FV) approach for discretization in space is proposed to solve first-order hyperbolic conservation laws . Unlike any conventional finite difference method (FDM) or finite volume method (FVM), this approach uses both cell-averaged values and nodal values as degrees of freedom (DOF) . Consequently it is inherently conservative like FVM and easy to extend to high-order accuracy in spacelike FDM.
Revised: We present a class of hybrid FD-FV (finite difference and finite volume) methods for solving general hyperbolic conservation laws . Unlike any conventional finite difference method (FDM) or finite volume method (FVM), this approach uses both cell-averaged values and nodal values as degrees of freedom (DOF) . Consequently it is inherently conservative like FVM and easy to extend to high-order accuracy in spacelike FDM.
Edit intent: clarity
Original:  Also in the case of real query traffic simulations, results show that the proposed policy achieves cost gains compared with the other heuristicsconsidered.
Revised:  Also in the case of real query traffic , where our proposed policy achieves cost gains compared with the other heuristicsconsidered.
Edit intent: clarity
Original:  In this letter , we propose a new quantitative measure, namely, the propensity transition point as an indicator of stochastic regime shifts.
Revised:  In this paper , we propose a new quantitative measure, namely, the propensity transition point as an indicator of stochastic regime shifts.
Edit intent: coherence