wanyu/IteraTeR_v2 huggingface dataset:
Original:  The rays are curves determined by the variable speed of sound and initial conditions and we develop ultrasonic ray models based on a system of differential equations.
Revised:  The speed of sound and initial conditions and we develop ultrasonic ray models based on a system of differential equations.
Edit intent: clarity
Original: Mass vaccination campaigns are an important strategy in the global fight against polio and measles.
Revised: Mass-vaccination campaigns are an important strategy in the global fight against polio and measles.
Edit intent: fluency
Original: Mass vaccination campaigns are an important strategy in the global fight against polio and measles.
Revised: Mass vaccination campaigns are an important strategy in the global fight against poliomyelitis and measles.
Edit intent: clarity
Original:  The large-scale logistics required for these mass immunization campaigns magnifies the need for research into the effectiveness and optimal deployment of pulse vaccination.
Revised:  The large-scale logistics required for these mass immunisation campaigns magnifies the need for research into the effectiveness and optimal deployment of pulse vaccination.
Edit intent: fluency
Original:  In order to better understand this control strategy, we consider an impulsive SIR-type metapopulation model with seasonality, an environmental reservoir and independent periodic pulse vaccination schedules in each patch .
Revised:  In order to better understand this control strategy, we consider an impulsive SIR-type metapopulation model with seasonality, an environmental reservoir and independent periodic pulse vaccination schedules in each region .
Edit intent: clarity
Original:  Numerical calculations show the importance of synchronizing the pulse vaccinations between the patches and the timing of the pulses with respect to the seasonality.
Revised:  Numerical calculations show the importance of synchronising the pulse vaccinations between the patches and the timing of the pulses with respect to the seasonality.
Edit intent: fluency
Original:  Numerical calculations show the importance of synchronizing the pulse vaccinations between the patches and the timing of the pulses with respect to the seasonality.
Revised:  Numerical calculations show the importance of synchronizing the pulse vaccinations in connected regions and the timing of the pulses with respect to the seasonality.
Edit intent: clarity
Original:  In the final push for disease eradication, it is crucial that mass vaccination programs, such as national immunization days, be synchronized across different countries .
Revised:  In the final push for disease eradication, it is crucial that mass vaccination programs, such as national immunisation days, to be synchronised across different regions .
Edit intent: clarity
Original:  Numerical calculations show the importance of synchronising the pulse vaccinations in connected regions and the timing of the pulses with respect to the pathogen circulation seasonality.
Revised:  Analytical and numerical calculations show the importance of synchronising the pulse vaccinations in connected regions and the timing of the pulses with respect to the pathogen circulation seasonality.
Edit intent: clarity
Original:  Taking into account both the asymmetry and the interaction strength, we explore the much weaker demixing in three dimensions and show how the symmetric directed percolation transition to a mutualistic phase becomes pinned to an exactly soluble voter model point .
Revised:  By taking into account both the asymmetry and the interaction strength, we explore the much weaker demixing in three dimensions and show how the symmetric directed percolation transition to a mutualistic phase becomes pinned to an exactly soluble voter model point .
Edit intent: coherence
Original:  Taking into account both the asymmetry and the interaction strength, we explore the much weaker demixing in three dimensions and show how the symmetric directed percolation transition to a mutualistic phase becomes pinned to an exactly soluble voter model point .
Revised:  Taking into account both the asymmetry and the interaction strength, we show that the much weaker demixing in three dimensions and show how the symmetric directed percolation transition to a mutualistic phase becomes pinned to an exactly soluble voter model point .
Edit intent: clarity
Original:  Taking into account both the asymmetry and the interaction strength, we explore the much weaker demixing in three dimensions and show how the symmetric directed percolation transition to a mutualistic phase becomes pinned to an exactly soluble voter model point .
Revised:  Taking into account both the asymmetry and the interaction strength, we explore the much weaker demixing in three dimensions allows for a mutualistic phase becomes pinned to an exactly soluble voter model point .
Edit intent: clarity
Original:  It allows the assumption that  some alternatives (herein referred to as concepts) are known and fixed, hence the weight vector needs to be estimated only for the other unknown values.
Revised:  It allows the assumption that the weights of some alternatives (herein referred to as concepts) are known and fixed, hence the weight vector needs to be estimated only for the other unknown values.
Edit intent: clarity
Original:  The simplest versions of these algorithms correspond to distributed on-line protocols of interest for neuromorphic devices and, hopefully, for the understanding  some aspects of synaptic plasticity.
Revised:  The simplest versions of these algorithms correspond to distributed on-line protocols of interest for neuromorphic devices and, hopefully, for the understanding of some aspects of synaptic plasticity.
Edit intent: fluency
Original:  An old conjecture states that for every fixed k, the maximum number of edges in a k-quasi-planar graph on n vertices is O(n).
Revised:  A 20-year-old conjecture asserts that for every fixed k, the maximum number of edges in a k-quasi-planar graph on n vertices is O(n).
Edit intent: clarity
Original:  Fox and Pach showed that every k-quasi-planar graph with n vertices and no pair of edges intersecting in more than O(1) points has at most n( \frac{\log n{\log k}}  )^{O(\log k)} edges.
Revised:  Fox and Pach showed that every k-quasi-planar graph with n vertices has at most n( \frac{\log n{\log k}} )^{O(\log k)} edges.
Edit intent: clarity
Original:  We improve this upper bound to 2^{\alpha(n)^c}n\log n, where \alpha(n) denotes the inverse Ackermann function , and c depends only on k  . We also show that every k-quasi-planar graph with n vertices and every two edges have at most one point in common has at most O(n\log n) edges.
Revised:  We improve this upper bound to 2^{\alpha(n)^c}n\log n, where \alpha(n) denotes the inverse Ackermann function and c depends only on k . We also show that every k-quasi-planar graph with n vertices and every two edges have at most one point in common has at most O(n\log n) edges.
Edit intent: fluency
Original:  We improve this upper bound to 2^{\alpha(n)^c}n\log n, where \alpha(n) denotes the inverse Ackermann function , and c depends only on k  . We also show that every k-quasi-planar graph with n vertices and every two edges have at most one point in common has at most O(n\log n) edges.
Revised:  We improve this upper bound to 2^{\alpha(n)^c}n\log n, where \alpha(n) denotes the inverse Ackermann function , and c depends only on k . We also show that every k-quasi-planar graph with n vertices in which any two edges have at most one point in common has at most O(n\log n) edges.
Edit intent: clarity
Original:  We present a new family of alignment-free vectorizations of the genome, the generalized vector (GV) , that maintains the speed of existing alignment-free methods and incorporates some of the interpretability of sequence alignment .
Revised:  We present a new family of alignment-free vectorizations of the genome, the generalized vector , that maintains the speed of existing alignment-free methods and incorporates some of the interpretability of sequence alignment .
Edit intent: clarity
Original:  We analyze 5 different characterizations of genome similarity using k-nearest neighbor classification, and evaluate these on two collections of viruses totalling over 10,000 viruses.
Revised:  We analyze 5 different characterizations of genome similarity using k-nearest neighbor classification, and evaluate these on two collections of viruses totaling over 10,000 viruses.
Edit intent: fluency
Original:  We show that our proposed method performs better than, or at least as well as, other methods at every level of the phylogenetic hierarchy.
Revised:  We show that our proposed method performs better than, or as well as, other methods at every level of the phylogenetic hierarchy.
Edit intent: clarity
Original:  This answers an open question raised by Nishimura and Yamakami [J. Comput.
Revised:  This answers an open question , posed by Nishimura and Yamakami [J. Comput.
Edit intent: clarity
Original:  The equation describes the value function of a non-Markovian stochastic control optimal problem in which the terminal state of the controlled process is prespecified .
Revised:  The equation describes the value function of non-Markovian stochastic control optimal problem in which the terminal state of the controlled process is prespecified .
Edit intent: fluency
Original:  The equation describes the value function of a non-Markovian stochastic control optimal problem in which the terminal state of the controlled process is prespecified .
Revised:  The equation describes the value function of a non-Markovian stochastic optimal control problem in which the terminal state of the controlled process is prespecified .
Edit intent: fluency
Original:  The equation describes the value function of a non-Markovian stochastic control optimal problem in which the terminal state of the controlled process is prespecified .
Revised:  The equation describes the value function of a non-Markovian stochastic control optimal problem in which the terminal state of the controlled process is pre-specified .
Edit intent: fluency
Original:  The analysis of such control problems is motivated by models of optimal portfolio liquidation .
Revised:  The analysis of such control problems is motivated by models of optimal portfolio liquidation 
Edit intent: fluency
Original:  The analysis of such control problems is motivated by models of optimal portfolio liquidation 
Revised:  The analysis of such control problems is motivated by models of optimal portfolio liquidation .
Edit intent: fluency
Original:  In this direction, a first contribution of this work is the new concept of weighted frameworks and rigidity, and of the rigidity eigenvalue, which when positive ensures the infinitesimal rigidity of a weighted framework.
Revised:  In this direction, a first contribution of this work is an extension of rigidity theory to weighted frameworks and rigidity, and of the rigidity eigenvalue, which when positive ensures the infinitesimal rigidity of a weighted framework.
Edit intent: clarity
Original:  In this direction, a first contribution of this work is the new concept of weighted frameworks and rigidity, and of the rigidity eigenvalue, which when positive ensures the infinitesimal rigidity of a weighted framework.
Revised:  In this direction, a first contribution of this work is the new concept of weighted frameworks and the rigidity eigenvalue, which when positive ensures the infinitesimal rigidity of a weighted framework.
Edit intent: coherence
Original:  In this direction, a first contribution of this work is the new concept of weighted frameworks and rigidity, and of the rigidity eigenvalue, which when positive ensures the infinitesimal rigidity of a weighted framework.
Revised:  In this direction, a first contribution of this work is the new concept of weighted frameworks and rigidity, and of the rigidity eigenvalue, which when positive ensures the infinitesimal rigidity of the framework.
Edit intent: fluency
Original:  The estimate of the rigidity eigenvalue is finally used to generate a local control action for each agent that both maintains the rigidity property and enforces additional constraints such as collision avoidance and sensing/communication range limits and occlusions.
Revised:  The estimate of the rigidity eigenvalue is finally used to generate a local control action for each agent that both maintains the rigidity property and enforces additional con- straints such as collision avoidance and sensing/communication range limits and occlusions.
Edit intent: fluency
Original: The widespread deployment of various networking technologies, coupled with the exponential increase in end-user data demand, have led to the proliferation of multi-homed  or multi-interface enabled  devices.
Revised: The widespread deployment of various networking technologies, coupled with the exponential increase in end- user data demand, have led to the proliferation of multi-homed or multi-interface enabled devices.
Edit intent: fluency
Original: The widespread deployment of various networking technologies, coupled with the exponential increase in end-user data demand, have led to the proliferation of multi-homed  or multi-interface enabled  devices.
Revised: The widespread deployment of various networking technologies, coupled with the exponential increase in end-user data demand, have led to the proliferation of multi-homed , or multi-interface enabled devices.
Edit intent: fluency
Original: The widespread deployment of various networking technologies, coupled with the exponential increase in end-user data demand, have led to the proliferation of multi-homed  or multi-interface enabled  devices.
Revised: The widespread deployment of various networking technologies, coupled with the exponential increase in end-user data demand, have led to the proliferation of multi-homed or multi-interface enabled , devices.
Edit intent: fluency
Original:  We investigate the common features of proposed bandwidth aggregation systems and break them down into two major categories: layer-dependent and layer- independent features.
Revised:  We investigate the common features of proposed bandwidth aggregation systems and break them down into two major categories: layer-dependent and layer-independent features.
Edit intent: fluency
Original: The DevR-DevS two component system of Mycobacterium tuberculosis is responsible for its dormancy in host and becomes operative under hypoxic condition.
Revised: The DevRS two component system of Mycobacterium tuberculosis is responsible for its dormancy in host and becomes operative under hypoxic condition.
Edit intent: clarity
Original:  In the present work we have developed a mathematical model to show the role of binding sites in the DevR mediated gene expression.
Revised:  In the present work we propose a theoretical model to show the role of binding sites in the DevR mediated gene expression.
Edit intent: clarity
Original:  In the present work we have developed a mathematical model to show the role of binding sites in the DevR mediated gene expression.
Revised:  In the present work we have developed a mathematical model to show role of binding sites in the DevR mediated gene expression.
Edit intent: fluency
Original:  In the present work we have developed a mathematical model to show the role of binding sites in the DevR mediated gene expression.
Revised:  In the present work we have developed a mathematical model to show the role of binding sites in DevR mediated gene expression.
Edit intent: fluency
Original:  Through modeling it has been shown the individual and collective role of the binding sites in regulating the DevR mediated gene expression .
Revised:  Individual and collective role of the binding sites in regulating the DevR mediated gene expression .
Edit intent: coherence
Original:  Through modeling it has been shown the individual and collective role of the binding sites in regulating the DevR mediated gene expression .
Revised:  Through modeling it has been shown the individual and collective role of binding sites in regulating the DevR mediated gene expression .
Edit intent: fluency
Original:  Through modeling it has been shown the individual and collective role of the binding sites in regulating the DevR mediated gene expression .
Revised:  Through modeling it has been shown the individual and collective role of the binding sites in regulating DevR mediated gene expression .
Edit intent: fluency
Original:  Second, to analyze the behavior of the system from the information theoretical point of view.
Revised:  Second, to analyze behavior of the system from the information theoretical point of view.
Edit intent: fluency
Original:  Second, to analyze the behavior of the system from the information theoretical point of view.
Revised:  Second, to analyze the behavior of the system from information theoretical point of view.
Edit intent: fluency
Original:  Using the tools of information theory we have calculated the molecular efficiency of the system and have shown that it is close to the maximum limit of isothermal efficiency.
Revised:  Using the tools of information theory we have calculated molecular efficiency of the system and have shown that it is close to the maximum limit of isothermal efficiency.
Edit intent: fluency
Original:  With this motivation, we developed a differential expression classifier, ICRBC, to can detect alternatively expressed genes between biologically averaged samples.
Revised:  With this motivation, we developed a differential expression classifier, ICRBC, that can detect alternatively expressed genes between biologically averaged samples.
Edit intent: fluency
Original:  Using the Avida digital evolution research platform, we subjected populations of organisms implemented with each test architecture to seven different computational environments designed to present a range of evolutionary challenges.
Revised:  We subjected digital organisms with each tested architecture to seven different computational environments designed to present a range of evolutionary challenges.
Edit intent: clarity
Original:   We evaluated six different types of architectural features for the virtual CPUs: (1) genetic flexibility: we enhanced the ability of digital organisms to specify how a genetic instruction should function using modifier instructions, (2) memory: we provided an increased number of registers in the virtual CPUs, (3) decoupled sensors and actuators:  separated input and output operations that enable greater flexibility in the control of data flow.
Revised:  We evaluated six different types of architectural features for the virtual CPUs: (1) genetic flexibility: we allowed digital organisms to specify how a genetic instruction should function using modifier instructions, (2) memory: we provided an increased number of registers in the virtual CPUs, (3) decoupled sensors and actuators: separated input and output operations that enable greater flexibility in the control of data flow.
Edit intent: clarity
Original:   We evaluated six different types of architectural features for the virtual CPUs: (1) genetic flexibility: we enhanced the ability of digital organisms to specify how a genetic instruction should function using modifier instructions, (2) memory: we provided an increased number of registers in the virtual CPUs, (3) decoupled sensors and actuators:  separated input and output operations that enable greater flexibility in the control of data flow.
Revised:  We evaluated six different types of architectural features for the virtual CPUs: (1) genetic flexibility: we enhanced the ability of digital organisms to more precisely modify the function of genetic instructions, (2) memory: we provided an increased number of registers in the virtual CPUs, (3) decoupled sensors and actuators: separated input and output operations that enable greater flexibility in the control of data flow.
Edit intent: clarity
Original:   We evaluated six different types of architectural features for the virtual CPUs: (1) genetic flexibility: we enhanced the ability of digital organisms to specify how a genetic instruction should function using modifier instructions, (2) memory: we provided an increased number of registers in the virtual CPUs, (3) decoupled sensors and actuators:  separated input and output operations that enable greater flexibility in the control of data flow.
Revised:  We evaluated six different types of architectural features for the virtual CPUs: (1) genetic flexibility: we enhanced the ability of digital organisms to specify how a genetic instruction should function using modifier instructions, (2) memory: we provided an increased number of registers in the virtual CPUs, (3) decoupled sensors and actuators: we separated input and output operations that enable greater flexibility in the control of data flow.
Edit intent: fluency
Original:   We evaluated six different types of architectural features for the virtual CPUs: (1) genetic flexibility: we enhanced the ability of digital organisms to specify how a genetic instruction should function using modifier instructions, (2) memory: we provided an increased number of registers in the virtual CPUs, (3) decoupled sensors and actuators:  separated input and output operations that enable greater flexibility in the control of data flow.
Revised:  We evaluated six different types of architectural features for the virtual CPUs: (1) genetic flexibility: we enhanced the ability of digital organisms to specify how a genetic instruction should function using modifier instructions, (2) memory: we provided an increased number of registers in the virtual CPUs, (3) decoupled sensors and actuators: separated input and output operations to enable greater control over data flow.
Edit intent: clarity
Original:  We also tested a variety of methods to regulate expression: (4) explicit genome labels that allow programs to dynamically refer to specific positions in the genome , (5) position relative search instructions, and (6) multiple new flow control instructions, including conditionals and jump instructions . Each of these features also adds additional complication to the instruction set and runs the risk of slowing down evolution due to epistatic interactions.
Revised:  We also tested a variety of methods to regulate expression: (4) explicit labels that allow programs to dynamically refer to specific positions in the genome , (5) position relative search instructions, and (6) multiple new flow control instructions, including conditionals and jump instructions . Each of these features also adds additional complication to the instruction set and runs the risk of slowing down evolution due to epistatic interactions.
Edit intent: clarity
Original:  We also tested a variety of methods to regulate expression: (4) explicit genome labels that allow programs to dynamically refer to specific positions in the genome , (5) position relative search instructions, and (6) multiple new flow control instructions, including conditionals and jump instructions . Each of these features also adds additional complication to the instruction set and runs the risk of slowing down evolution due to epistatic interactions.
Revised:  We also tested a variety of methods to regulate expression: (4) explicit genome labels that allow programs to dynamically refer to specific genome positions , (5) position relative search instructions, and (6) multiple new flow control instructions, including conditionals and jump instructions . Each of these features also adds additional complication to the instruction set and runs the risk of slowing down evolution due to epistatic interactions.
Edit intent: clarity