wanyu/IteraTeR_v2 huggingface dataset:
Original:  The classic ALOHA approach is developed under a collision model, where slots that contain collided packets are considered as waste.
Revised:  The legacy ALOHA approach is developed under a collision model, where slots that contain collided packets are considered as waste.
Edit intent: clarity
Original:  The classic ALOHA approach is developed under a collision model, where slots that contain collided packets are considered as waste.
Revised:  The classic ALOHA approach is developed under a collision model, where slots containing collided packets are considered as waste.
Edit intent: fluency
Original:  Several instances of coded random access protocols are described, as well as a case study on how to upgrade a legacy ALOHA wireless system using the ideas of coded random access.
Revised:  Several instances of coded random access protocols are described, as well as a case study on how to upgrade a legacy ALOHA system using the ideas of coded random access.
Edit intent: clarity
Original: Following a hedging based approach to model free financial mathematics, we prove that it is possible to make an arbitrarily large profit by investing in those one-dimensional paths which do not possess local times.
Revised: Following a hedging based approach to model free financial mathematics, we prove that it should be possible to make an arbitrarily large profit by investing in those one-dimensional paths which do not possess local times.
Edit intent: clarity
Original:  The  semantics of quantum recursion is defined by employing the second quantisation method  .
Revised:  The semantics of quantum recursions are defined by employing the second quantisation method .
Edit intent: fluency
Original:  For the information-theoretic part of the proof, we consider a natural generalization of the average noise sensitivity of a Boolean function, which is bounded for compressive maps.
Revised:  For the information-theoretic part of the average noise sensitivity of a Boolean function, which is bounded for compressive maps.
Edit intent: clarity
Original:  For the information-theoretic part of the proof, we consider a natural generalization of the average noise sensitivity of a Boolean function, which is bounded for compressive maps.
Revised:  For the information-theoretic part of the proof, we consider a natural generalization of the average noise sensitivity of compressive maps.
Edit intent: clarity
Original: We are concerned with stochastic modeling of financial risk based on a reference filtration \mathbb{F the progressive enlargement of F with t.
Revised: Let \mathbb{F the progressive enlargement of F with t.
Edit intent: clarity
Original:  We prove the fact that , if no-arbitrage of the first kind holds on S in F,  the process S ^{t-} also has the property of no-arbitrage of the first kind in \mathbb{G}.
Revised:  We prove the fact that , if no-arbitrage of the first kind holds on S in F, the processes S ^{t-} also has the property of no-arbitrage of the first kind in \mathbb{G}.
Edit intent: fluency
Original:  This result has a natural interpretation in application, when S denotes the gain process of a hedging strategy .
Revised:  We also discuss the relevance of the progressive enlargement of filtration technique used to obtain the results .
Edit intent: coherence
Original:  Using these techniques we can automatically infer an approximate upper bound of the energy consumed when running a function under different platforms, using different compilers - without the need of actually running it .
Revised:  Using these techniques we can automatically infer an estimate of the energy consumed when running a function under different platforms, using different compilers - without the need of actually running it .
Edit intent: clarity
Original:  Using these techniques we can automatically infer an approximate upper bound of the energy consumed when running a function under different platforms, using different compilers - without the need of actually running it .
Revised:  Using these techniques we can automatically infer an approximate upper bound of the energy consumed when running a function under different platforms, using different compilers .
Edit intent: clarity
Original: This paper introduces a new memoized derivative parsing algorithm for recognition of parsing expression grammars.
Revised: This paper introduces a new derivative parsing algorithm for recognition of parsing expression grammars.
Edit intent: clarity
Original:  We also pay special attention to non-Euclidean settings (relevant algorithms include Frank-Wolfe, Mirror Descent, and Dual Averaging ) and discuss their relevance in machine learning.
Revised:  We also pay special attention to non-Euclidean settings (relevant algorithms include Frank-Wolfe, mirror descent, and dual averaging ) and discuss their relevance in machine learning.
Edit intent: coherence
Original:  We provide a gentle introduction to structural optimization with FISTA (to optimize a sum of a smooth and a simple non-smooth term), Saddle-Point Mirror Prox (Nemirovski's alternative to Nesterov's smoothing), and a concise description of Interior Point Methods .
Revised:  We provide a gentle introduction to structural optimization with FISTA (to optimize a sum of a smooth and a simple non-smooth term), saddle-point mirror prox (Nemirovski's alternative to Nesterov's smoothing), and a concise description of Interior Point Methods .
Edit intent: fluency
Original:  We provide a gentle introduction to structural optimization with FISTA (to optimize a sum of a smooth and a simple non-smooth term), Saddle-Point Mirror Prox (Nemirovski's alternative to Nesterov's smoothing), and a concise description of Interior Point Methods .
Revised:  We provide a gentle introduction to structural optimization with FISTA (to optimize a sum of a smooth and a simple non-smooth term), Saddle-Point Mirror Prox (Nemirovski's alternative to Nesterov's smoothing), and a concise description of interior point methods .
Edit intent: fluency
Original:  In stochastic optimization we discuss Stochastic Gradient Descent , mini-batches, Random Coordinate Descent , and sublinear algorithms.
Revised:  In stochastic optimization we discuss stochastic gradient descent , mini-batches, Random Coordinate Descent , and sublinear algorithms.
Edit intent: fluency
Original:  In stochastic optimization we discuss Stochastic Gradient Descent , mini-batches, Random Coordinate Descent , and sublinear algorithms.
Revised:  In stochastic optimization we discuss Stochastic Gradient Descent , mini-batches, random coordinate descent , and sublinear algorithms.
Edit intent: fluency
Original:  Not only errors introduced during library construction and sequencing steps but also the quality of the reference genome and the algorithms used for the alignment of the reads play an influential role .
Revised:  For instance, errors may be introduced during library construction and sequencing steps but also the quality of the reference genome and the algorithms used for the alignment of the reads play an influential role .
Edit intent: coherence
Original:  Not only errors introduced during library construction and sequencing steps but also the quality of the reference genome and the algorithms used for the alignment of the reads play an influential role .
Revised:  Not only errors introduced during library construction and sequencing steps . In addition, the reference genome and the algorithms used for the alignment of the reads play an influential role .
Edit intent: coherence
Original:  It is not trivial to estimate the influence these factors for individual sequencing experiments.
Revised:  It is crucial to account for these factors in individual sequencing experiments.
Edit intent: clarity
Original:  Several characteristics are sampled from sites with low mismatch rates and uses to estimate empirical log-likelihoods.
Revised:  Several characteristics are sampled from sites with low mismatch rates , and these are used to estimate empirical log-likelihoods.
Edit intent: clarity
Original:  Conclusions: In simulations we show that the proposed model is at par with frequently used  SNV calling algorithms in terms of sensitivity and specificity  .
Revised:  Conclusions: In simulations we show that the proposed model is competitive with frequently used SNV calling algorithms in terms of sensitivity and specificity .
Edit intent: clarity
Original:  The presence of spam, advertisements, rumors and fake images reduces the value of information collected from Twitter, especially during sudden-onset crisis events where information from other sources is scarce.
Revised:  The presence of spam, rumors and fake images reduces the value of information collected from Twitter, especially during sudden-onset crisis events where information from other sources is scarce.
Edit intent: coherence
Original:  The presence of spam, advertisements, rumors and fake images reduces the value of information collected from Twitter, especially during sudden-onset crisis events where information from other sources is scarce.
Revised:  The presence of spam, advertisements, rumors and fake content on Twitter reduces the value of information collected from Twitter, especially during sudden-onset crisis events where information from other sources is scarce.
Edit intent: clarity
Original: Few studies that examine the neurogenesis-behaviour relationship formally establish covariation between neurogenesis and behaviour or rule out competing explanations.
Revised: Few studies that examine the neurogenesis--behaviour relationship formally establish covariation between neurogenesis and behaviour or rule out competing explanations.
Edit intent: fluency
Original:  All publicly available data was reanalysed using causal mediation analysis, which can estimate the unique contribution of new hippocampal neurons to behaviour separately from other mechanisms that might be operating.
Revised:  A systematic review of the literature was conducted and the data reanalysed using causal mediation analysis, which can estimate the unique contribution of new hippocampal neurons to behaviour separately from other mechanisms that might be operating.
Edit intent: clarity
Original:  All publicly available data was reanalysed using causal mediation analysis, which can estimate the unique contribution of new hippocampal neurons to behaviour separately from other mechanisms that might be operating.
Revised:  All publicly available data was reanalysed using causal mediation analysis, which can estimate the behavioural contribution of new hippocampal neurons to behaviour separately from other mechanisms that might be operating.
Edit intent: clarity
Original:  All publicly available data was reanalysed using causal mediation analysis, which can estimate the unique contribution of new hippocampal neurons to behaviour separately from other mechanisms that might be operating.
Revised:  All publicly available data was reanalysed using causal mediation analysis, which can estimate the unique contribution of new hippocampal neurons separately from other mechanisms that might be operating.
Edit intent: clarity
Original:  Here we provide a mathematical theory that offers a physico-chemical expression for a large chemical network that is almost arbitrarily both nonlinear and complex.
Revised:  Here we provide a theory that offers a physico-chemical expression for a large chemical network that is almost arbitrarily both nonlinear and complex.
Edit intent: clarity
Original:  Specifically, we introduce a one-to-many bargaining game among the MNO and the APOs, and analyze the bargaining solutions (game equilibria ) systematically under two different bargaining protocols: (i) sequential bargaining, where the MNO bargains with APOs sequentially, with one APO at a time,  and (ii) concurrent bargaining, where the MNO bargains with all APOs concurrently.
Revised:  Specifically, we introduce a one-to-many bargaining game among the MNO and APOs, and analyze the bargaining solutions (game equilibria ) systematically under two different bargaining protocols: (i) sequential bargaining, where the MNO bargains with APOs sequentially, with one APO at a time, and (ii) concurrent bargaining, where the MNO bargains with all APOs concurrently.
Edit intent: fluency
Original:  Specifically, we introduce a one-to-many bargaining game among the MNO and the APOs, and analyze the bargaining solutions (game equilibria ) systematically under two different bargaining protocols: (i) sequential bargaining, where the MNO bargains with APOs sequentially, with one APO at a time,  and (ii) concurrent bargaining, where the MNO bargains with all APOs concurrently.
Revised:  Specifically, we introduce a one-to-many bargaining game among the MNO and the APOs, and analyze the bargaining solution (game equilibrium ) systematically under two different bargaining protocols: (i) sequential bargaining, where the MNO bargains with APOs sequentially, with one APO at a time, and (ii) concurrent bargaining, where the MNO bargains with all APOs concurrently.
Edit intent: fluency
Original:  Specifically, we introduce a one-to-many bargaining game among the MNO and the APOs, and analyze the bargaining solutions (game equilibria ) systematically under two different bargaining protocols: (i) sequential bargaining, where the MNO bargains with APOs sequentially, with one APO at a time,  and (ii) concurrent bargaining, where the MNO bargains with all APOs concurrently.
Revised:  Specifically, we introduce a one-to-many bargaining game among the MNO and the APOs, and analyze the bargaining solutions (game equilibria ) systematically under two different bargaining protocols: (i) sequential bargaining, where the MNO bargains with APOs sequentially, with one APO at a time, in a given order, and (ii) concurrent bargaining, where the MNO bargains with all APOs concurrently.
Edit intent: clarity
Original:  We quantify the benefits for APOs when bargaining sequentially and earlier with the MNO, and the losses for APOs when bargaining concurrently with the MNO. Moreover, we quantify the benefits for APOs when bargaining with the MNO as a group, and further study whether and up to what extent the grouping of some APOs affects those APOs not in the group.
Revised:  We quantify the benefits for APOs when bargaining sequentially and earlier with the MNO, and the losses for APOs when bargaining concurrently with the MNO. Moreover, we quantify the benefits for APOs when forming such a group. Interesting, our analysis indicates that grouping of APOs not only benefits the APOs in the group, but may also benefit some APOs not in the group.
Edit intent: clarity
Original:  These results shed light on the economic aspects and the possible outcomes of the MNO/APOs interactions, and can be used as a roadmap for designing policies for this promising data offloading solution.
Revised:  Our results shed light on the economic aspects and the possible outcomes of the MNO/APOs interactions, and can be used as a roadmap for designing policies for this promising data offloading solution.
Edit intent: fluency
Original:  We show this universal behavioral pattern emerges robustly by considering weighted moving averages of the priority-conditioned response-time probabilities generated by a basic prioritization model.
Revised:  We furthermore show that this universal behavioral pattern emerges robustly by considering weighted moving averages of the priority-conditioned response-time probabilities generated by a basic prioritization model.
Edit intent: clarity
Original:  The state of the art of the energy efficient CR based wireless access network is discussed in various aspects such as relay and cooperation radio and small cells.
Revised:  The state of the art of the energy efficient CR based wireless access network is discussed in various aspects such as relay and cooperative radio and small cells.
Edit intent: fluency
Original:  Many generalizations have been proposed and studied since the problem was introduced.
Edit intent: coherence
Original:  In this work we mainly deal with one of those generalizations which is calledshared Q-queue J-choice K-best secretary problem . ] In this problem, n candidates are evenly distributed into Q queues, and instead of hiring the best one, the employer wants to hire J candidates among the best K persons from all candidates .
Revised:  In this work we shared Q-queue J-choice K-best secretary problem . ] In this problem, n candidates are evenly distributed into Q queues, and instead of hiring the best one, the employer wants to hire J candidates among the best K persons from all candidates .
Edit intent: coherence
Original:  In this work we mainly deal with one of those generalizations which is calledshared Q-queue J-choice K-best secretary problem . ] In this problem, n candidates are evenly distributed into Q queues, and instead of hiring the best one, the employer wants to hire J candidates among the best K persons from all candidates .
Revised:  In this work we mainly deal with one of those generalizations which is called . ] In this problem, n candidates are evenly distributed into Q queues, and instead of hiring the best one, the employer wants to hire J candidates among the best K persons from all candidates .
Edit intent: clarity
Original:  In this work we mainly deal with one of those generalizations which is calledshared Q-queue J-choice K-best secretary problem . ] In this problem, n candidates are evenly distributed into Q queues, and instead of hiring the best one, the employer wants to hire J candidates among the best K persons from all candidates .
Revised:  In this work we mainly deal with one of those generalizations which is calledshared Q-queue J-choice K-best secretary problem . ]. We call it shared Q-queue J-choice K-best secretary problem. In this problem, n candidates are evenly distributed into Q queues, and instead of hiring the best one, the employer wants to hire J candidates among the best K persons from all candidates .
Edit intent: coherence
Original:  In this work we mainly deal with one of those generalizations which is calledshared Q-queue J-choice K-best secretary problem . ] In this problem, n candidates are evenly distributed into Q queues, and instead of hiring the best one, the employer wants to hire J candidates among the best K persons from all candidates .
Revised:  In this work we mainly deal with one of those generalizations which is calledshared Q-queue J-choice K-best secretary problem . ] In this problem, n candidates are evenly distributed into Q queues, and instead of hiring the best one, the employer wants to hire J candidates among the best K persons .
Edit intent: clarity
Original:  This problem is a generalized version of J-choice K-best problem which has been extensively studied and it has more practice value due to the parallelism .
Revised:  This problem is a generalized version of J-choice K-best problem which has been extensively studied and it has more practical value as it characterizes the parallel situation .
Edit intent: clarity
Original:  In this paper, we provide an optimal deterministic protocol for this generalizations .
Revised:  In this paper, we provide an optimal deterministic protocol for this problem .
Edit intent: clarity
Original:  The protocol is simple and efficient, and we show that several generalizations, such as the \emph{fractional J-choice K-best secretary problem and\emph{exclusive Q-queue J-choice K-best secretary problem , can be solved optimally by this protocol with slight modification   .
Revised:  Our protocol is very simple and efficient, and we show that several generalizations, such as the \emph{fractional J-choice K-best secretary problem and\emph{exclusive Q-queue J-choice K-best secretary problem , can be solved optimally by this protocol with slight modification .
Edit intent: coherence
Original:  The protocol is simple and efficient, and we show that several generalizations, such as the \emph{fractional J-choice K-best secretary problem and\emph{exclusive Q-queue J-choice K-best secretary problem , can be solved optimally by this protocol with slight modification   .
Revised:  The protocol is simple and efficient, and we show that several generalizations, such as the \emph{ and\emph{exclusive Q-queue J-choice K-best secretary problem , can be solved optimally by this protocol with slight modification .
Edit intent: clarity
Original:  The protocol is simple and efficient, and we show that several generalizations, such as the \emph{fractional J-choice K-best secretary problem and\emph{exclusive Q-queue J-choice K-best secretary problem , can be solved optimally by this protocol with slight modification   .
Revised:  The protocol is simple and efficient, and we show that several generalizations, such as the \emph{fractional J-choice K-best secretary problem \emph{exclusive Q-queue J-choice K-best secretary problem , can be solved optimally by this protocol with slight modification .
Edit intent: coherence
Original:  The protocol is simple and efficient, and we show that several generalizations, such as the \emph{fractional J-choice K-best secretary problem and\emph{exclusive Q-queue J-choice K-best secretary problem , can be solved optimally by this protocol with slight modification   .
Revised:  The protocol is simple and efficient, and we show that several generalizations, such as the \emph{fractional J-choice K-best secretary problem and\emph{fractional J-choice K-best secretary problem and exclusive Q-queue J-choice K-best secretary problem , can be solved optimally by this protocol with slight modification .
Edit intent: coherence
Original:  In addition, we provide some theoretical analysis for two typical cases, including the 1-queue 1-choice K-best problem and the shared 2-queue 2-choice 2-best problem.
Revised:  In addition, we provide theoretical analysis for two typical cases, including the 1-queue 1-choice K-best problem and the shared 2-queue 2-choice 2-best problem.
Edit intent: coherence
Original:  For the latter  we show the  competitive ratio is \approx0.
Revised:  For the latter , we show the competitive ratio is \approx0.
Edit intent: fluency
Original: We consider transition rates between metastable states in bistable evolutionary games  , and examine how they are affected by spatial degrees of freedom.
Revised: We consider the lifetimes of metastable states in bistable evolutionary games , and examine how they are affected by spatial degrees of freedom.
Edit intent: clarity
Original:  Semiclassical approximation based on a path integral method is applied to stochastic evolutionary game dynamics with and without spatial degrees of freedom, and lifetimes of the metastable states are evaluated.
Revised:  Semiclassical approximation based on a path integral method is applied to stochastic evolutionary game dynamics with and without spatial structure, and the lifetimes of the metastable states are evaluated.
Edit intent: clarity
Original: The concepts of quantum correlation and communication complexity have been proposed to quantify the worst-case computational resources needed in generating bipartite classical distributions or bipartite quantum states in the single-shot setting  by Zhang ({\em Proc.
Revised: The concepts of quantum correlation complexity and quantum communication complexity were recently proposed to quantify the worst-case computational resources needed in generating bipartite classical distributions or bipartite quantum states in the single-shot setting by Zhang ({\em Proc.
Edit intent: clarity
Original: The concepts of quantum correlation and communication complexity have been proposed to quantify the worst-case computational resources needed in generating bipartite classical distributions or bipartite quantum states in the single-shot setting  by Zhang ({\em Proc.
Revised: The concepts of quantum correlation and communication complexity have been proposed to quantify the minimum amount of resources needed in generating bipartite classical distributions or bipartite quantum states in the single-shot setting by Zhang ({\em Proc.
Edit intent: clarity