wanyu/IteraTeR_v2 huggingface dataset:
Original:  Furthermore, we have also identified novel compensatory pathways from the predicted synthetic lethal genetic interactions.
Revised:  Furthermore, we had also identified novel compensatory pathways from the predicted synthetic lethal genetic interactions.
Edit intent: fluency
Original:  Our study significantly improves the understanding of yeast mulitdomain proteins, the synthetic lethal genetic interactions and the global functional relationships between proteins and pathways.
Revised:  Our study significantly improved the understanding of yeast mulitdomain proteins, the synthetic lethal genetic interactions and the global functional relationships between proteins and pathways.
Edit intent: fluency
Original:  Our study significantly improves the understanding of yeast mulitdomain proteins, the synthetic lethal genetic interactions and the global functional relationships between proteins and pathways.
Revised:  Our study significantly improves the understanding of yeast mulitdomain proteins, the synthetic lethal genetic interactions and the functional relationships between proteins and pathways.
Edit intent: clarity
Original:  Our focus is on applications where the number of changepoints will increase as we collect more data: for example in genetics as we sequence larger regions of the genome, or in finance as we observe time-series over longer periods.
Revised:  Our focus is on applications where the number of changepoints will increase as we collect more data: for example in genetics as we analyse larger regions of the genome, or in finance as we observe time-series over longer periods.
Edit intent: clarity
Original:  This includes most common procedures for detecting changing points, such as penalised likelihood and minimum description length.
Revised:  This includes several established procedures for detecting changing points, such as penalised likelihood and minimum description length.
Edit intent: clarity
Original:  We introduce a new method for finding the minimum of such cost functions and hence the optimal number and location of changepoints , that has a computational cost which, under mild conditions, is linear in the number of observations.
Revised:  We introduce a new method for finding the minimum of such cost functions and hence the optimal number and location of changepoints that has a computational cost which, under mild conditions, is linear in the number of observations.
Edit intent: fluency
Original:  This compares favourably with existing methods for the same problem whose computational cost can be quadratic , or even cubic.
Revised:  This compares favourably with existing methods for the same problem whose computational cost can be quadratic or even cubic.
Edit intent: fluency
Original:  We also compare with Binary Segmentation and a genetic algorithm for finding changepoints, and show that the exactness of our approach can lead to substantial improvements in the accuracy of the inferred segmentation of the data.
Revised:  We also compare with the Binary Segmentation algorithm for identifying changepoints, showing that the exactness of our approach can lead to substantial improvements in the accuracy of the inferred segmentation of the data.
Edit intent: clarity
Original: In recent experiments ( Richardson et al. (  2010), PLoS ONE 5(3): e9621. doi:10.1371/ journal.pone.0009621) ant motion out of the nest is shown to be a non-stationary process intriguingly similar to the so calledaging dynamics , of physical  glassy systems.
Revised: In recent experiments by Richardson et al. ( 2010), PLoS ONE 5(3): e9621. doi:10.1371/ journal.pone.0009621) ant motion out of the nest is shown to be a non-stationary process intriguingly similar to the so calledaging dynamics , of physical glassy systems.
Edit intent: clarity
Original: In recent experiments ( Richardson et al. (  2010), PLoS ONE 5(3): e9621. doi:10.1371/ journal.pone.0009621) ant motion out of the nest is shown to be a non-stationary process intriguingly similar to the so calledaging dynamics , of physical  glassy systems.
Revised: In recent experiments ( Richardson et al. ( ( 2010), PLoS ONE 5(3): e9621. doi:10.1371/ journal.pone.0009621) ant motion out of the nest is shown to be a non-stationary process intriguingly similar to the so calledaging dynamics , of physical glassy systems.
Edit intent: fluency
Original: In recent experiments ( Richardson et al. (  2010), PLoS ONE 5(3): e9621. doi:10.1371/ journal.pone.0009621) ant motion out of the nest is shown to be a non-stationary process intriguingly similar to the so calledaging dynamics , of physical  glassy systems.
Revised: In recent experiments ( Richardson et al. ( 2010), PLoS ONE 5(3): e9621. doi:10.1371/ journal.pone.0009621) ant motion out of the nest is shown to be a non-stationary process intriguingly similar to the aging dynamics , of physical glassy systems.
Edit intent: clarity
Original: In recent experiments ( Richardson et al. (  2010), PLoS ONE 5(3): e9621. doi:10.1371/ journal.pone.0009621) ant motion out of the nest is shown to be a non-stationary process intriguingly similar to the so calledaging dynamics , of physical  glassy systems.
Revised: In recent experiments ( Richardson et al. ( 2010), PLoS ONE 5(3): e9621. doi:10.1371/ journal.pone.0009621) ant motion out of the nest is shown to be a non-stationary process intriguingly similar to the so called dynamics , of physical glassy systems.
Edit intent: fluency
Original: In recent experiments ( Richardson et al. (  2010), PLoS ONE 5(3): e9621. doi:10.1371/ journal.pone.0009621) ant motion out of the nest is shown to be a non-stationary process intriguingly similar to the so calledaging dynamics , of physical  glassy systems.
Revised: In recent experiments ( Richardson et al. ( 2010), PLoS ONE 5(3): e9621. doi:10.1371/ journal.pone.0009621) ant motion out of the nest is shown to be a non-stationary process intriguingly similar to the so calledaging dynamics encountered in glassy systems.
Edit intent: clarity
Original: In recent experiments ( Richardson et al. (  2010), PLoS ONE 5(3): e9621. doi:10.1371/ journal.pone.0009621) ant motion out of the nest is shown to be a non-stationary process intriguingly similar to the so calledaging dynamics , of physical  glassy systems.
Revised: In recent experiments ( Richardson et al. ( 2010), PLoS ONE 5(3): e9621. doi:10.1371/ journal.pone.0009621) ant motion out of the nest is shown to be a non-stationary process intriguingly similar to the so calledaging dynamics , of physicalphysical aging glassy systems.
Edit intent: fluency
Original: In recent experiments ( Richardson et al. (  2010), PLoS ONE 5(3): e9621. doi:10.1371/ journal.pone.0009621) ant motion out of the nest is shown to be a non-stationary process intriguingly similar to the so calledaging dynamics , of physical  glassy systems.
Revised: In recent experiments ( Richardson et al. ( 2010), PLoS ONE 5(3): e9621. doi:10.1371/ journal.pone.0009621) ant motion out of the nest is shown to be a non-stationary process intriguingly similar to the so calledaging dynamics , of physical of glassy systems.
Edit intent: fluency
Original:  Under different conditions, ( Nouvellet et al.( 2010), Journal of Theoretical Biology 266, 573)the same exit process is well described by a Poisson process.
Revised:  Under different conditions, ( Nouvellet et al.( J. Theor. Biol. 266, 573)the same exit process is well described by a Poisson process.
Edit intent: coherence
Original:  To investigate possible mechanisms producing both types of behavior ,  a model is introduced where interacting agents, e.g. anrs, move from one site to a neighbor site on a finite 2D lattice.
Revised:  To investigate possible mechanisms producing both types of behavior , a model is introduced where interacting agents, e.g. anrs, move from one site to a neighboring site on a finite 2D lattice.
Edit intent: fluency
Original:  The latter is a sum of pairwise interactions between agents , weighted by distance.
Revised:  The latter is a sum of pairwise interactions between ants , weighted by distance.
Edit intent: clarity
Original:  Depending on how the interactions are defined and on a control parameter dubbed `temperature' , the dynamics either quickly converges to a stationary state, where movements are a standard Poisson process, or may enter a non-stationary aging regime, where exits can be described in the way suggested by Richardson et al ., i.e. as a Poisson process in logarithmic time, for short a log-Poisson process .
Revised:  Depending on how the interactions are defined and on a control parameter dubbed `temperature' , the dynamics either quickly converges to a stationary state, where movements are a standard Poisson process, or may enter a non-stationary regime, where exits can be described in the way suggested by Richardson et al ., i.e. as a Poisson process in logarithmic time, for short a log-Poisson process .
Edit intent: clarity
Original:  Depending on how the interactions are defined and on a control parameter dubbed `temperature' , the dynamics either quickly converges to a stationary state, where movements are a standard Poisson process, or may enter a non-stationary aging regime, where exits can be described in the way suggested by Richardson et al ., i.e. as a Poisson process in logarithmic time, for short a log-Poisson process .
Revised:  Depending on how the interactions are defined and on a control parameter dubbed `temperature' , the dynamics either quickly converges to a stationary state, where movements are a standard Poisson process, or may enter a non-stationary aging regime, where exits can be described as suggested by Richardson et al ., i.e. as a Poisson process in logarithmic time, for short a log-Poisson process .
Edit intent: clarity
Original:  Depending on how the interactions are defined and on a control parameter dubbed `temperature' , the dynamics either quickly converges to a stationary state, where movements are a standard Poisson process, or may enter a non-stationary aging regime, where exits can be described in the way suggested by Richardson et al ., i.e. as a Poisson process in logarithmic time, for short a log-Poisson process .
Revised:  Depending on how the interactions are defined and on a control parameter dubbed `temperature' , the dynamics either quickly converges to a stationary state, where movements are a standard Poisson process, or may enter a non-stationary aging regime, where exits can be described in the way suggested by Richardson et al .
Edit intent: coherence
Original:  Compared to peer sanctioning, institutional sanctioning is sensitive to players' attitude toward players who do not commit punishment.
Revised:  Compared to peer sanctioning, institutional sanctioning may be sensitive to players' attitude toward players who do not commit punishment.
Edit intent: clarity
Original:  Relying on stochastic adaptive dynamics, we show that skeptical punisher matched with sanctioning by institution can make cooperation evolve for the case that sanctioning by peer cannot .
Revised:  Relying on stochastic adaptive dynamics, we show that skeptical punisher matched with sanctioning by institution can make cooperation evolve for the case that sanctioning by peer may not .
Edit intent: clarity
Original:  Relying on stochastic adaptive dynamics, we show that skeptical punisher matched with sanctioning by institution can make cooperation evolve for the case that sanctioning by peer may not.
Revised:  Relying on stochastic adaptive dynamics, we show that institutional sanctioning coupled with skeptical punisher can make cooperation evolve for the case that sanctioning by peer may not.
Edit intent: clarity
Original:  Relying on stochastic adaptive dynamics, we show that skeptical punisher matched with sanctioning by institution can make cooperation evolve for the case that sanctioning by peer may not.
Revised:  Relying on stochastic adaptive dynamics, we show that skeptical punisher matched with sanctioning by institution can make cooperation evolve for the case where sanctioning by peer may not.
Edit intent: fluency
Original:  Compared to peer sanctioning, institutional sanctioning may be sensitive to players' attitude toward players who do not commit punishment.
Revised:  Compared to peer sanctioning, institutional sanctioning may be sensitive to players' attitude toward players who do not pre-commit punishment.
Edit intent: clarity
Original:  Departed from former studies based on the punisher who always acts cooperatively, we assume that punisher is skeptical in that she cooperates in proportion to how many punishers join in her team.
Revised:  Departed from former studies based on the punisher who always acts cooperatively, we assume that the punishing player is skeptical in that she cooperates in proportion to how many punishers join in her team.
Edit intent: clarity
Original:  Departed from former studies based on the punisher who always acts cooperatively, we assume that punisher is skeptical in that she cooperates in proportion to how many punishers join in her team.
Revised:  Departed from former studies based on the punisher who always acts cooperatively, we assume that punisher is skeptical in that she cooperates in proportion to how many same types join in her team.
Edit intent: clarity
Original:  Relying on stochastic adaptive dynamics, we show that institutional sanctioning coupled with skeptical punisher can make cooperation evolve for the case where sanctioning by peer may not.
Revised:  Relying on stochastic adaptive dynamics, we show that institutional sanctioning coupled with skeptical punisher can make cooperation evolve for the case where peer sanctioning may not.
Edit intent: clarity
Original: We document a new stylized fact in the global pattern of exports: a relationship between the diversification of a country 's exports and the ubiquity of its products.
Revised: We document a new stylized fact in the global pattern of exports: a relationship between the diversification of a country and the average ubiquity of its products.
Edit intent: clarity
Original:  QP captures many known combinatorial optimization problems and SDP techniques have given optimal approximation algorithms for many of these problems .
Revised:  QP captures many known combinatorial optimization problems and SDP techniques have given optimal approximation algorithms .
Edit intent: clarity
Original:  The specific problem we study is: QP-Ratio : max _{  -1,0,1  ^n (x^T A x) / (x^T x).
Revised:  The specific problems we study are QP-Ratio : max _{ -1,0,1 ^n (x^T A x) / (x^T x).
Edit intent: fluency
Original:  Yet, it is a good testbed for both algorithms and complexity because the techniques used for quadratic problems for the -1, 1 a_{ij} x_i x_j}{\sum x_i^2}, } and 0,1 domains do not seem to carry over to the%DIFDELCMD < {%%% -1,0,1 domain.
Revised:  Yet, it is a good testbed for both algorithms and complexity because the techniques used for quadratic problems for the -1, 1 a_{ij} x_i x_j}{\sum x_i^2}, } and domains do not seem to carry over to the%DIFDELCMD < {%%% -1,0,1 domain.
Edit intent: coherence
Original:  Yet, it is a good testbed for both algorithms and complexity because the techniques used for quadratic problems for the -1, 1 a_{ij} x_i x_j}{\sum x_i^2}, } and 0,1 domains do not seem to carry over to the%DIFDELCMD < {%%% -1,0,1 domain.
Revised:  Yet, it is a good testbed for both algorithms and complexity because the techniques used for quadratic problems for the -1, 1 a_{ij} x_i x_j}{\sum x_i^2}, } and 0,1 %DIFDELCMD < {%%% -1,0,1 domain.
Edit intent: coherence
Original:  We \sum_{i \not = j a_{ij} x_i x_j}{\sum d_i x_i^2}, where d_i = \sum_j |a_{ij}| We } consider an SDP relaxation obtained by adding constraints to the natural SDP relaxation for this problem and obtain an O(n\tilde{O} ^{ 2 / 7 }) algorithm for QP-ratio.
Revised:  We \sum_{i \not = j a_{ij} x_i x_j}{\sum d_i x_i^2}, where d_i = \sum_j |a_{ij}| We } consider an SDP relaxation obtained by adding constraints to the natural SDP relaxation for this problem . Using this, we obtain an\tilde{O} ^{ 2 / 7 }) algorithm for QP-ratio.
Edit intent: coherence
Original:  \tilde{O} As with other problems with ratio objectives like uniform sparsest cut  , it seems difficult to obtain good inapproximability results assuming P!=NP.
Revised:  \tilde{O} As with other problems with ratio objectives (e.g. uniform sparsest cut , it seems difficult to obtain good inapproximability results assuming P!=NP.
Edit intent: clarity
Original:  \tilde{O} As with other problems with ratio objectives like uniform sparsest cut  , it seems difficult to obtain good inapproximability results assuming P!=NP.
Revised:  \tilde{O} As with other problems with ratio objectives like uniform sparsest cut ) , it seems difficult to obtain good inapproximability results assuming P!=NP.
Edit intent: fluency
Original:  \tilde{O} As with other problems with ratio objectives like uniform sparsest cut  , it seems difficult to obtain good inapproximability results assuming P!=NP.
Revised:  \tilde{O} As with other problems with ratio objectives like uniform sparsest cut , it seems difficult to obtain inapproximability results based on P!=NP.
Edit intent: clarity
Original:  In fact, we give a natural distribution on instances of QP-Ratio that we believe are hard to approximate to factors of n^{\epsilon.
Revised:  In fact, we give a natural distribution on instances of QP-Ratio .
Edit intent: clarity
Original:  These fractals can be defined as the Hausdorff limit of a sequence of compact planar sets, where each set is the projection of a finite union of faces of unit cubes.
Revised:  These fractals can be defined as the Hausdorff limit of a sequence of compact sets, where each set is the projection of a finite union of faces of unit cubes.
Edit intent: clarity
Original:  The proofs rely in part on the recent analysis of the speed of coming down from infinity for Lambda-coalescents, done by the authors in a previous work. state branching processes, and The second goal of this paper is to investigate a remarkable connection between Lambda-coalescents and genealogies of continuous-state branching processes.
Revised:  The proofs rely in part on the recent analysis of the speed of coming down from infinity for Lambda-coalescents, done by the authors in a previous work. The second goal of this paper is to investigate a remarkable connection between Lambda-coalescents and genealogies of continuous-state branching processes.
Edit intent: fluency
Original:  The coupling also offers new perspective on the speed of coming down from infinity , and allows us to relate power-law behavior for N ^\La (t) to the classical upper and lower indices arising in the study of pathwise properties of L\'evy processes.
Revised:  The coupling also offers new perspective on the speed of coming down from infinity and allows us to relate power-law behavior for N ^\La (t) to the classical upper and lower indices arising in the study of pathwise properties of L\'evy processes.
Edit intent: fluency
Original:  The coupling also offers new perspective on the speed of coming down from infinity , and allows us to relate power-law behavior for N ^\La (t) to the classical upper and lower indices arising in the study of pathwise properties of L\'evy processes.
Revised:  The coupling also offers new perspective on the speed of coming down from infinity , and allows us to relate power-law behavior for N ^\La (t) to the classical upper and lower indices arising in the study of pathwise properties of L\'{e processes.
Edit intent: fluency
Original:  However, most RBN studies have been made with regular topologies, while real regulatory networks have been found to be modular.
Revised:  However, most RBN studies have been made with random topologies, while real regulatory networks have been found to be modular.
Edit intent: clarity
Original: A natural way for cooperative tasking in multi-agent systems is through a top-down design by decomposing a global task into subtasks such that the accomplishments of these subtasks will guarantee the achievement of the global task.
Revised: A natural way for cooperative tasking in multi-agent systems is through a top-down design by decomposing a global task into subtasks such that the accomplishments of these sub-tasks will guarantee the achievement of the global task.
Edit intent: clarity
Original:  In our previous work [1], we proposed  necessary and sufficient conditions on the decomposability of a  task automaton between two cooperative agents, and showed that given a concurrent systems and a decomposable task automaton, the global specification is satisfied by design, if local supervisors exist to satisfy local specifications.
Revised:  In our previous works [1], we proposed necessary and sufficient conditions on the decomposability of a task automaton between two cooperative agents, and showed that given a concurrent systems and a decomposable task automaton, the global specification is satisfied by design, if local supervisors exist to satisfy local specifications.
Edit intent: fluency
Original:  In our previous work [1], we proposed  necessary and sufficient conditions on the decomposability of a  task automaton between two cooperative agents, and showed that given a concurrent systems and a decomposable task automaton, the global specification is satisfied by design, if local supervisors exist to satisfy local specifications.
Revised:  In our previous work [1], 2 necessary and sufficient conditions on the decomposability of a task automaton between two cooperative agents, and showed that given a concurrent systems and a decomposable task automaton, the global specification is satisfied by design, if local supervisors exist to satisfy local specifications.
Edit intent: coherence
Original:  In our previous work [1], we proposed  necessary and sufficient conditions on the decomposability of a  task automaton between two cooperative agents, and showed that given a concurrent systems and a decomposable task automaton, the global specification is satisfied by design, if local supervisors exist to satisfy local specifications.
Revised:  In our previous work [1], we proposed necessary and sufficient conditions on the decomposability of a global task automaton between two cooperative agents, and showed that given a concurrent systems and a decomposable task automaton, the global specification is satisfied by design, if local supervisors exist to satisfy local specifications.
Edit intent: fluency
Original:  This paper represents a continuation of the workin 1%DIFDELCMD < ]%%% , and deals with the issue when failures occur in sensors, actuators and possibly communication links .
Revised:  This paper represents a continuation of the workin %DIFDELCMD < ]%%% , and deals with the issue when failures occur in sensors, actuators and possibly communication links .
Edit intent: fluency
Original:  The main concern under  failure is whether a previously decomposable task can still be achieved collectively by the agents .
Revised:  The main concern under event failure is whether a previously decomposable task can still be achieved collectively by the agents .
Edit intent: clarity
Original:  This is actually the fault-tolerance issue of the top-down design, and the results provide designers  hints on which operations (sensing, actuation or communication) is fragile with respect to failures, and whether redundancies are needed.
Revised:  This is actually the fault-tolerance issue of the top-down design, and the results provide designers with hints on which operations (sensing, actuation or communication) is fragile with respect to failures, and whether redundancies are needed.
Edit intent: fluency
Original:  This is actually the fault-tolerance issue of the top-down design, and the results provide designers  hints on which operations (sensing, actuation or communication) is fragile with respect to failures, and whether redundancies are needed.
Revised:  This is actually the fault-tolerance issue of the top-down design, and the results provide designers hints on which events are fragile with respect to failures, and whether redundancies are needed.
Edit intent: clarity