wanyu/IteraTeR_full_sent huggingface dataset:
Original:  However, this queue-length-based approach could potentially suffer from large (even infinite) packet delays due to the well-known last packet problem, whereby packets may get excessively delayed due to lack of subsequent packet arrivals.
Revised:  However, this queue-length-based approach could potentially suffer from large (even infinite) packet delays due to the well-known last packet problem, whereby packets belonging to some flows may be excessively delayed due to lack of subsequent packet arrivals.
Edit intent: meaning-changed
Original:  Finally , we conduct extensive simulations to support our analytical results, and show that the delay-based scheduler successfully removes excessive packet delays, while it achieves the same throughput region as the queuelength-based scheme.
Revised:  Further , we conduct extensive simulations to support our analytical results, and show that the delay-based scheduler successfully removes excessive packet delays, while it achieves the same throughput region as the queuelength-based scheme.
Edit intent: fluency
Original:  Finally , we conduct extensive simulations to support our analytical results, and show that the delay-based scheduler successfully removes excessive packet delays, while it achieves the same throughput region as the queuelength-based scheme.
Revised:  Finally , we conduct simulations to support our analytical results, and show that the delay-based scheduler successfully removes excessive packet delays, while it achieves the same throughput region as the queuelength-based scheme.
Edit intent: clarity
Original:  Finally , we conduct extensive simulations to support our analytical results, and show that the delay-based scheduler successfully removes excessive packet delays, while it achieves the same throughput region as the queuelength-based scheme.
Revised:  Finally , we conduct extensive simulations to support our analytical results, and show that the delay-based scheduler successfully removes excessive packet delays, while it achieves the same throughput region as the queue-length-based scheme.
Edit intent: fluency
Original:  Although many protein comparison methods are available online on numerous web servers, their ability to handle a large scale model comparison is often very limited. Most of the servers offer only a single pairwise structural comparison , and they usually do not provide a model-specific comparison with a fixed alignment between the models .
Revised:  Although many protein comparison methods are available online on numerous web servers, their ability to handle a large scale model comparison : (1) they operate with methods designed to compare actual proteins, not the models of the same protein, (2) majority of them offer only a single pairwise structural comparison , and they usually do not provide a model-specific comparison with a fixed alignment between the models .
Edit intent: meaning-changed
Original:  It runs on the Google App Engine (GAE) cloud platform and is a showcase of how the emerging PaaS (Platform as a Service) technology could be used to simplify the development of scalable bioinformatics services through outsourcing of the setup and maintenance of the hardware infrastructure .
Revised:  It runs on the Google App Engine (GAE) cloud platform and is a showcase of how the emerging PaaS (Platform as a Service) technology could be used to simplify the development of scalable bioinformatics services .
Edit intent: clarity
Original:  The functionality of the web application has been made available over a programmable API , so that the experiment submission and results retrieval could be automated . Protein Models Comparator is free software released on the Affero GNU Public Licence and is available  at: URL This article presents a large scale model-specific protein comparison web application and provides an insight into the GAE  platform and its potential value for scientific computations .
Revised:  The functionality of pm-cmp is accessible through API which allows a full automation of the experiment submission and results retrieval could be automated . Protein Models Comparator is free software released on the Affero GNU Public Licence and is available at: URL This article presents a large scale model-specific protein comparison web application and provides an insight into the GAE platform and its potential value for scientific computations .
Edit intent: meaning-changed
Original:  The functionality of the web application has been made available over a programmable API , so that the experiment submission and results retrieval could be automated . Protein Models Comparator is free software released on the Affero GNU Public Licence and is available  at: URL This article presents a large scale model-specific protein comparison web application and provides an insight into the GAE  platform and its potential value for scientific computations .
Revised:  The functionality of the web application has been made available over a programmable API , so that the experiment submission and results retrieval . Protein Models Comparator is free software released on the Affero GNU Public Licence and is available at: URL This article presents a large scale model-specific protein comparison web application and provides an insight into the GAE platform and its potential value for scientific computations .
Edit intent: clarity
Original:  The functionality of the web application has been made available over a programmable API , so that the experiment submission and results retrieval could be automated . Protein Models Comparator is free software released on the Affero GNU Public Licence and is available  at: URL This article presents a large scale model-specific protein comparison web application and provides an insight into the GAE  platform and its potential value for scientific computations .
Revised:  The functionality of the web application has been made available over a programmable API , so that the experiment submission and results retrieval could be automated . Protein Models Comparator is free software released on the Affero GNU Public Licence and is available with its source code at: URL This article presents a large scale model-specific protein comparison web application and provides an insight into the GAE platform and its potential value for scientific computations .
Edit intent: meaning-changed
Original:  The functionality of the web application has been made available over a programmable API , so that the experiment submission and results retrieval could be automated . Protein Models Comparator is free software released on the Affero GNU Public Licence and is available  at: URL This article presents a large scale model-specific protein comparison web application and provides an insight into the GAE  platform and its potential value for scientific computations .
Revised:  The functionality of the web application has been made available over a programmable API , so that the experiment submission and results retrieval could be automated . Protein Models Comparator is free software released on the Affero GNU Public Licence and is available at: URL This article presents a new web application addressing the need for a large-scale model-specific protein comparison web application and provides an insight into the GAE platform and its potential value for scientific computations .
Edit intent: meaning-changed
Original:  The functionality of the web application has been made available over a programmable API , so that the experiment submission and results retrieval could be automated . Protein Models Comparator is free software released on the Affero GNU Public Licence and is available  at: URL This article presents a large scale model-specific protein comparison web application and provides an insight into the GAE  platform and its potential value for scientific computations .
Revised:  The functionality of the web application has been made available over a programmable API , so that the experiment submission and results retrieval could be automated . Protein Models Comparator is free software released on the Affero GNU Public Licence and is available at: URL This article presents a large scale model-specific protein structure comparison and provides an insight into the GAE platform and its potential value for scientific computations .
Edit intent: meaning-changed
Original:  The functionality of the web application has been made available over a programmable API , so that the experiment submission and results retrieval could be automated . Protein Models Comparator is free software released on the Affero GNU Public Licence and is available  at: URL This article presents a large scale model-specific protein comparison web application and provides an insight into the GAE  platform and its potential value for scientific computations .
Revised:  The functionality of the web application has been made available over a programmable API , so that the experiment submission and results retrieval could be automated . Protein Models Comparator is free software released on the Affero GNU Public Licence and is available at: URL This article presents a large scale model-specific protein comparison web application and provides an insight into the GAE (Google App Engine) platform and its potential value for scientific computations .
Edit intent: meaning-changed
Original:  The functionality of the web application has been made available over a programmable API , so that the experiment submission and results retrieval could be automated . Protein Models Comparator is free software released on the Affero GNU Public Licence and is available  at: URL This article presents a large scale model-specific protein comparison web application and provides an insight into the GAE  platform and its potential value for scientific computations .
Revised:  The functionality of the web application has been made available over a programmable API , so that the experiment submission and results retrieval could be automated . Protein Models Comparator is free software released on the Affero GNU Public Licence and is available at: URL This article presents a large scale model-specific protein comparison web application and provides an insight into the GAE platform and its usefulness in scientific computing .
Edit intent: clarity
Original: The drawdown process Y= - X {\em   of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X   . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Revised: The drawdown process Y= {\em of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Edit intent: fluency
Original:  X {\em   of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X   . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Revised:  X {\em drawdown of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Edit intent: clarity
Original:  X {\em   of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X   . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Revised:  X {\em process Y of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Edit intent: meaning-changed
Original:  X {\em   of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X   . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Revised:  X {\em of a completely asymmetric L\'{e}vy process X is equal to X reflected at its running supremum X . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Edit intent: clarity
Original:  X {\em   of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X   . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Revised:  X {\em of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X : Y = . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Edit intent: meaning-changed
Original:  X {\em   of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X   . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Revised:  X {\em of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X - X . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Edit intent: meaning-changed
Original:  X {\em   of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X   . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Revised:  X {\em of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X . In this paper we explicitly express _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Edit intent: meaning-changed
Original:  X {\em   of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X   . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Revised:  X {\em of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X . In this paper we explicitly express the law of the sextuple (\tau_a, ,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Edit intent: fluency
Original:  X {\em   of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X   . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Revised:  X {\em of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,} _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Edit intent: fluency
Original:  X {\em   of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X   . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Revised:  X {\em of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X ,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Edit intent: fluency
Original:  X {\em   of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X   . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% _{\tau_a,Y_{\tau_a-},Y_{\tau_a}-a)
Revised:  X {\em of a completely asymmetric L\'{e}vy process X is given by X reflected at its running supremum X . In this paper we explicitly express the law of the sextuple (\tau_a, _{\tau_a,}X _{\tau_a,}%DIFDELCMD < \bar{X}%%% ,Y_{\tau_a-},Y_{\tau_a}-a)
Edit intent: fluency
Original:  } in terms of the scale function and the L\'evy measure of X , where \tau_a denotes the first-passage time of Y over the level a>0,  \bar{G}_{\tau_a} is the time of the last supremum of X prior to \tau_a and\underline{X is the running infimum of\unl X . We also explicitly identify the distribution of the drawup%DIFDELCMD < \hat{Y}%%% _{\tau_aat the moment \tau_a, where }%DIFDELCMD < \hat{Y} %%% = X-\underline{X , and derive the probability of a large drawdown preceding a small rally.
Revised:  } in terms of the scale function and the L\'{e measure of X , where \tau_a denotes the first-passage time of Y over the level a>0, \bar{G}_{\tau_a} is the time of the last supremum of X prior to \tau_a and\underline{X is the running infimum of\unl X . We also explicitly identify the distribution of the drawup%DIFDELCMD < \hat{Y}%%% _{\tau_aat the moment \tau_a, where }%DIFDELCMD < \hat{Y} %%% = X-\underline{X , and derive the probability of a large drawdown preceding a small rally.
Edit intent: fluency
Original:  } in terms of the scale function and the L\'evy measure of X , where \tau_a denotes the first-passage time of Y over the level a>0,  \bar{G}_{\tau_a} is the time of the last supremum of X prior to \tau_a and\underline{X is the running infimum of\unl X . We also explicitly identify the distribution of the drawup%DIFDELCMD < \hat{Y}%%% _{\tau_aat the moment \tau_a, where }%DIFDELCMD < \hat{Y} %%% = X-\underline{X , and derive the probability of a large drawdown preceding a small rally.
Revised:  } in terms of the scale function and the L\'evy measure of X the law of the sextuple of the first-passage time of Y over the level a>0, \bar{G}_{\tau_a} is the time of the last supremum of X prior to \tau_a and\underline{X is the running infimum of\unl X . We also explicitly identify the distribution of the drawup%DIFDELCMD < \hat{Y}%%% _{\tau_aat the moment \tau_a, where }%DIFDELCMD < \hat{Y} %%% = X-\underline{X , and derive the probability of a large drawdown preceding a small rally.
Edit intent: meaning-changed
Original:  } in terms of the scale function and the L\'evy measure of X , where \tau_a denotes the first-passage time of Y over the level a>0,  \bar{G}_{\tau_a} is the time of the last supremum of X prior to \tau_a and\underline{X is the running infimum of\unl X . We also explicitly identify the distribution of the drawup%DIFDELCMD < \hat{Y}%%% _{\tau_aat the moment \tau_a, where }%DIFDELCMD < \hat{Y} %%% = X-\underline{X , and derive the probability of a large drawdown preceding a small rally.
Revised:  } in terms of the scale function and the L\'evy measure of X , where \tau_a denotes the first-passage time of Y over the level a>0, the time \bar{G}_{\tau_a} is the time of the last supremum of X prior to \tau_a and\underline{X is the running infimum of\unl X . We also explicitly identify the distribution of the drawup%DIFDELCMD < \hat{Y}%%% _{\tau_aat the moment \tau_a, where }%DIFDELCMD < \hat{Y} %%% = X-\underline{X , and derive the probability of a large drawdown preceding a small rally.
Edit intent: fluency
Original:  } in terms of the scale function and the L\'evy measure of X , where \tau_a denotes the first-passage time of Y over the level a>0,  \bar{G}_{\tau_a} is the time of the last supremum of X prior to \tau_a and\underline{X is the running infimum of\unl X . We also explicitly identify the distribution of the drawup%DIFDELCMD < \hat{Y}%%% _{\tau_aat the moment \tau_a, where }%DIFDELCMD < \hat{Y} %%% = X-\underline{X , and derive the probability of a large drawdown preceding a small rally.
Revised:  } in terms of the scale function and the L\'evy measure of X , where \tau_a denotes the first-passage time of Y over the level a>0, \bar{G}_{\tau_a} of the last supremum of X prior to \tau_a and\underline{X is the running infimum of\unl X . We also explicitly identify the distribution of the drawup%DIFDELCMD < \hat{Y}%%% _{\tau_aat the moment \tau_a, where }%DIFDELCMD < \hat{Y} %%% = X-\underline{X , and derive the probability of a large drawdown preceding a small rally.
Edit intent: clarity
Original:  } in terms of the scale function and the L\'evy measure of X , where \tau_a denotes the first-passage time of Y over the level a>0,  \bar{G}_{\tau_a} is the time of the last supremum of X prior to \tau_a and\underline{X is the running infimum of\unl X . We also explicitly identify the distribution of the drawup%DIFDELCMD < \hat{Y}%%% _{\tau_aat the moment \tau_a, where }%DIFDELCMD < \hat{Y} %%% = X-\underline{X , and derive the probability of a large drawdown preceding a small rally.
Revised:  } in terms of the scale function and the L\'evy measure of X , where \tau_a denotes the first-passage time of Y over the level a>0, \bar{G}_{\tau_a} is the time of the last supremum of X prior to \tau_a \underline{X is the running infimum of\unl X . We also explicitly identify the distribution of the drawup%DIFDELCMD < \hat{Y}%%% _{\tau_aat the moment \tau_a, where }%DIFDELCMD < \hat{Y} %%% = X-\underline{X , and derive the probability of a large drawdown preceding a small rally.
Edit intent: coherence
Original:  } in terms of the scale function and the L\'evy measure of X , where \tau_a denotes the first-passage time of Y over the level a>0,  \bar{G}_{\tau_a} is the time of the last supremum of X prior to \tau_a and\underline{X is the running infimum of\unl X . We also explicitly identify the distribution of the drawup%DIFDELCMD < \hat{Y}%%% _{\tau_aat the moment \tau_a, where }%DIFDELCMD < \hat{Y} %%% = X-\underline{X , and derive the probability of a large drawdown preceding a small rally.
Revised:  } in terms of the scale function and the L\'evy measure of X , where \tau_a denotes the first-passage time of Y over the level a>0, \bar{G}_{\tau_a} is the time of the last supremum of X prior to \tau_a and\underline{ is the running infimum of\unl X . We also explicitly identify the distribution of the drawup%DIFDELCMD < \hat{Y}%%% _{\tau_aat the moment \tau_a, where }%DIFDELCMD < \hat{Y} %%% = X-\underline{X , and derive the probability of a large drawdown preceding a small rally.
Edit intent: fluency
Original:  } in terms of the scale function and the L\'evy measure of X , where \tau_a denotes the first-passage time of Y over the level a>0,  \bar{G}_{\tau_a} is the time of the last supremum of X prior to \tau_a and\underline{X is the running infimum of\unl X . We also explicitly identify the distribution of the drawup%DIFDELCMD < \hat{Y}%%% _{\tau_aat the moment \tau_a, where }%DIFDELCMD < \hat{Y} %%% = X-\underline{X , and derive the probability of a large drawdown preceding a small rally.
Revised:  } in terms of the scale function and the L\'evy measure of X , where \tau_a denotes the first-passage time of Y over the level a>0, \bar{G}_{\tau_a} is the time of the last supremum of X prior to \tau_a and\underline{X , the infimum\unl X . We also explicitly identify the distribution of the drawup%DIFDELCMD < \hat{Y}%%% _{\tau_aat the moment \tau_a, where }%DIFDELCMD < \hat{Y} %%% = X-\underline{X , and derive the probability of a large drawdown preceding a small rally.
Edit intent: clarity