wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our simulation experiments show that the transmission of the first ten IP datagrams of each TCP flow can be 500 ms faster with random access than with dedicated access making the former of interest to carry Internet traffic.
Revised:  Our simulation experiments show that the transmission of the first ten IP datagrams of each TCP flow can be 500 ms faster with ran- dom access than with dedicated access making the former of interest to carry Internet traffic.
Edit intent: fluency
Original:  Although DVB-RCS2 has not been designed for random access methods, the results presented in this study open interesting deployment perspectives in terms of mobile, fixed or aeronautical satellite return link protocol .
Revised:  Although DVB-RCS2 to browse the web by introducing different services, which choice is based on the channel access method .
Edit intent: coherence
Original: Application of genomic-based risk stratification to clinical diagnosis is appealing yet performance varies widely depending on the disease and genomic risk score (GRS) method.
Revised: Practical application of genomic-based risk stratification to clinical diagnosis is appealing yet performance varies widely depending on the disease and genomic risk score (GRS) method.
Edit intent: clarity
Original:  Comparable to HLA typing, the GRS can  identify individuals without CD with >99.6\% negative predictive value and , unlike HLA typing, patients can be stratified for further more invasive and costly testing .
Revised:  Comparable to HLA typing, the GRS can be used to identify individuals without CD with >99.6\% negative predictive value and , unlike HLA typing, patients can be stratified for further more invasive and costly testing .
Edit intent: fluency
Original:  Comparable to HLA typing, the GRS can  identify individuals without CD with >99.6\% negative predictive value and , unlike HLA typing, patients can be stratified for further more invasive and costly testing .
Revised:  Comparable to HLA typing, the GRS can identify individuals without CD with >99.6\% negative predictive value however , unlike HLA typing, patients can be stratified for further more invasive and costly testing .
Edit intent: coherence
Original:  Comparable to HLA typing, the GRS can be used to identify individuals without CD with >99.6\% negative predictive value however, unlike HLA typing, \geq99\\%DIF > negative predictive value however, unlike HLA typing, patients can also be stratified into categories of higher-risk for CD who would benefit from more invasive and costly definitive testing.
Revised:  Comparable to HLA typing, the GRS can be used to identify individuals without CD with \geq99\\%DIF > negative predictive value however, unlike HLA typing, patients can also be stratified into categories of higher-risk for CD who would benefit from more invasive and costly definitive testing.
Edit intent: coherence
Original:  Comparable to HLA typing, the GRS can be used to identify individuals without CD with >99.6\% negative predictive value however, unlike HLA typing, \geq99\\%DIF > negative predictive value however, unlike HLA typing, patients can also be stratified into categories of higher-risk for CD who would benefit from more invasive and costly definitive testing.
Revised:  Comparable to HLA typing, the GRS can be used to identify individuals without CD with >99.6\% negative predictive value however, unlike HLA typing, \geq99.6\\%DIF > negative predictive value however, unlike HLA typing, patients can also be stratified into categories of higher-risk for CD who would benefit from more invasive and costly definitive testing.
Edit intent: fluency
Original:  We show that, for both weighted and unweighted voting, every possible answer can be made to hold, even for election systems with simple winner problems : The complexity of manipulation, manipulation with runoffs, and manipulation with revoting runoffs are completely independent, in the abstract.
Revised:  For both weighted and unweighted voting, every possible answer can be made to hold, even for election systems with simple winner problems : The complexity of manipulation, manipulation with runoffs, and manipulation with revoting runoffs are completely independent, in the abstract.
Edit intent: coherence
Original:  We show that, for both weighted and unweighted voting, every possible answer can be made to hold, even for election systems with simple winner problems : The complexity of manipulation, manipulation with runoffs, and manipulation with revoting runoffs are completely independent, in the abstract.
Revised:  We show that, for both weighted and unweighted voting, we show that even for election systems with simple winner problems : The complexity of manipulation, manipulation with runoffs, and manipulation with revoting runoffs are completely independent, in the abstract.
Edit intent: clarity
Original:  We show that, for both weighted and unweighted voting, every possible answer can be made to hold, even for election systems with simple winner problems : The complexity of manipulation, manipulation with runoffs, and manipulation with revoting runoffs are completely independent, in the abstract.
Revised:  We show that, for both weighted and unweighted voting, every possible answer can be made to hold, even for election systems with simple winner problems the complexity of manipulation, manipulation with runoffs, and manipulation with revoting runoffs are completely independent, in the abstract.
Edit intent: clarity
Original:  We show that, for both weighted and unweighted voting, every possible answer can be made to hold, even for election systems with simple winner problems : The complexity of manipulation, manipulation with runoffs, and manipulation with revoting runoffs are completely independent, in the abstract.
Revised:  We show that, for both weighted and unweighted voting, every possible answer can be made to hold, even for election systems with simple winner problems : The complexity of manipulation, manipulation with runoffs, and manipulation with revoting runoffs are independent, in the abstract.
Edit intent: clarity
Original:  Our main motivation comes from the analysis of the Lotka-Volterra's competition system with mutation which simulates the demo-genetic dynamics of diverse virus in their host : dv_{i(t)}{dt}=v _i[r_i-\frac{1{K}\Psi_i(v)]} \[r_i-1{K}\Psi_i(v)\] +j=1^{N} ij(v_j-v_i).
Revised:  Our main motivation comes from the analysis of the Lotka-Volterra's competition system with mutation which simulates the demo-genetic dynamics of diverse virus in their host : dv_{i(t)}{dt}=v {K}\Psi_i(v)]} \[r_i-1{K}\Psi_i(v)\] +j=1^{N} ij(v_j-v_i).
Edit intent: clarity
Original:  Our main motivation comes from the analysis of the Lotka-Volterra's competition system with mutation which simulates the demo-genetic dynamics of diverse virus in their host : dv_{i(t)}{dt}=v _i[r_i-\frac{1{K}\Psi_i(v)]} \[r_i-1{K}\Psi_i(v)\] +j=1^{N} ij(v_j-v_i).
Revised:  Our main motivation comes from the analysis of the Lotka-Volterra's competition system with mutation which simulates the demo-genetic dynamics of diverse virus in their host : dv_{i(t)}{dt}=v _i[r_i-\frac{1{K}\Psi_i(v)]} _i\[r_i-1{K}\Psi_i(v)\] +j=1^{N} ij(v_j-v_i).
Edit intent: clarity
Original:  We show that the sharpness of both error estimates estimate can be seamlessly controlled by adapting the parameters of the corresponding reduced order model.
Revised:  We show that the sharpness of both error estimates can be seamlessly controlled by adapting the parameters of the corresponding reduced order model.
Edit intent: clarity
Original:  Six head positions are used to evoke combined somatosensory and auditory (via bone-conduction effect) brain responses, in order to define a multimodal tactile and auditory brain computer interface (taBCI).
Revised:  Six head positions are used to evoke combined somatosensory and auditory (via the bone conduction effect) brain responses, in order to define a multimodal tactile and auditory brain computer interface (taBCI).
Edit intent: fluency
Original:  Experimental results on subjects performing online taBCI, using stimuli with a moderately fast inter-stimulus-interval (ISI), validate the taBCI paradigm, while the feasibility of the concept is illuminated through information-transfer rate case studies.
Revised:  Experimental results of subjects performing online taBCI, using stimuli with a moderately fast inter-stimulus-interval (ISI), validate the taBCI paradigm, while the feasibility of the concept is illuminated through information-transfer rate case studies.
Edit intent: clarity
Original:  Experimental results on subjects performing online taBCI, using stimuli with a moderately fast inter-stimulus-interval (ISI), validate the taBCI paradigm, while the feasibility of the concept is illuminated through information-transfer rate case studies.
Revised:  Experimental results on subjects performing online taBCI, using stimuli with a moderately fast inter-stimulus interval (ISI), validate the taBCI paradigm, while the feasibility of the concept is illuminated through information-transfer rate case studies.
Edit intent: fluency
Original:  Experimental results on subjects performing online taBCI, using stimuli with a moderately fast inter-stimulus-interval (ISI), validate the taBCI paradigm, while the feasibility of the concept is illuminated through information-transfer rate case studies.
Revised:  Experimental results on subjects performing online taBCI, using stimuli with a moderately fast inter-stimulus-interval (ISI), validate the taBCI paradigm, while the feasibility of the concept is illuminated through information transfer rate case studies.
Edit intent: fluency
Original:  Auditory P300 responses gave encouragingly longer target vs. non-target latencies during the training phase, however, real-world online BCI experiments in the multimodal setting did not validate this potential advantage.
Revised:  Auditory P300 responses give encouragingly longer target vs. non-target latencies during the training phase, however, real-world online BCI experiments in the multimodal setting did not validate this potential advantage.
Edit intent: fluency
Original:  Auditory P300 responses gave encouragingly longer target vs. non-target latencies during the training phase, however, real-world online BCI experiments in the multimodal setting did not validate this potential advantage.
Revised:  Auditory P300 responses gave encouragingly longer target vs. non-target latencies during the training phase, however, real-world online BCI experiments in the multimodal setting do not validate this potential advantage.
Edit intent: fluency
Original:  Here we use a Moran process framework to explore how the kind of evolutionary process (drift, and selection of various kinds) at work in a lineage affects the amount of information that the present state of the lineage provides about its evolutionary past.
Revised:  Here we use a Moran process framework and consider how the kind of evolutionary process (drift, and selection of various kinds) at work in a lineage affects the amount of information that the present state of the lineage provides about its evolutionary past.
Edit intent: clarity
Original:  Here we use a Moran process framework to explore how the kind of evolutionary process (drift, and selection of various kinds) at work in a lineage affects the amount of information that the present state of the lineage provides about its evolutionary past.
Revised:  Here we use a Moran process framework to explore how the kind of evolutionary process (drift, and selection of various kinds) at work in a lineage affects the epistemological relation of present to past.
Edit intent: clarity
Original: Fungicide mixtures produced by the agrochemical industry often contain low risk fungicides, to which fungal pathogens are fully sensitive together with high risk fungicides known to be prone to fungicide resistance.
Revised: Fungicide mixtures produced by the agrochemical industry often contain low-risk fungicides, to which fungal pathogens are fully sensitive together with high risk fungicides known to be prone to fungicide resistance.
Edit intent: fluency
Original: Fungicide mixtures produced by the agrochemical industry often contain low risk fungicides, to which fungal pathogens are fully sensitive together with high risk fungicides known to be prone to fungicide resistance.
Revised: Fungicide mixtures produced by the agrochemical industry often contain low risk fungicides, to which fungal pathogens are fully sensitive , together with high-risk fungicides known to be prone to fungicide resistance.
Edit intent: fluency
Original:  If fitness costs are absent, then the use of the high risk fungicide in a mixture selects for resistance and the fungicide eventually becomes nonfunctional.
Revised:  If fitness costs are absent, then the use of the high-risk fungicide in a mixture selects for resistance and the fungicide eventually becomes nonfunctional.
Edit intent: fluency
Original:  If there is a cost of resistance, then an optimal ratio of fungicides in the mixture can be found, at which selection for resistance is expected to vanish and the level of disease control  optimized.
Revised:  If there is a cost of resistance, then an optimal ratio of fungicides in the mixture can be found, at which selection for resistance is expected to vanish and the level of disease control can be optimized.
Edit intent: fluency
Original: We present a stochastic geometry based model , in which we investigate the fundamental limitations of wireless networks.
Revised: This paper presents a stochastic geometry based model , in which we investigate the fundamental limitations of wireless networks.
Edit intent: style
Original: We present a stochastic geometry based model , in which we investigate the fundamental limitations of wireless networks.
Revised: We present a stochastic geometry model for the investigation of fundamental information theoretic limitations in wireless networks.
Edit intent: clarity
Original:  We derive  cut-set bounds on the information theoretic capacity of networks of arbitrary Poisson node density, size, power , bandwidth, and fading characteristics .
Revised:  We derive cut-set bound on the capacity of networks of arbitrary Poisson node density, size, power , bandwidth, and fading characteristics .
Edit intent: clarity
Original:  In other words, we upper-bound the optimal performance in terms of capacity , under any communication scheme, that can be achieved between a subset of network nodes ( contained in the cut) with all the remaining nodes.
Revised:  In other words, we upper-bound the optimal performance in terms of capacity , under any scheme, that can be achieved between a subset of network nodes ( contained in the cut) with all the remaining nodes.
Edit intent: clarity
Original:  In other words, we upper-bound the optimal performance in terms of capacity , under any communication scheme, that can be achieved between a subset of network nodes ( contained in the cut) with all the remaining nodes.
Revised:  In other words, we upper-bound the optimal performance in terms of capacity , under any communication scheme, that can be achieved between a subset of network nodes ( defined by the cut) with all the remaining nodes.
Edit intent: clarity
Original:  Additionally, we identify four different operating regimes, thus confirming previously known scaling laws (e.g., in bandwidth and/or power limited wireless networks), and extending them with specific bounds.
Revised:  Additionally, we identify four different operating regimes, thus confirming previously known scaling laws (e.g., in bandwidth and/or power limited wireless networks), and we extend them with specific bounds.
Edit intent: fluency
Original: We consider the short-time energy relaxation of the dilute SK model.
Revised: We consider energy relaxation of the dilute SK model.
Edit intent: clarity
Original:  Conversely , a more modular system reaches a less favorable energy at long timesin a static environment.
Revised:  Conversely , a more modular system also has a less favorable energy at long timesin a static environment.
Edit intent: clarity
Original:  In this paper we propose a unifying logic-based, framework for Computing, inspired by artificial intelligence, but scaled down for practical database and programming applications.
Revised:  In this paper we propose a logic-based, framework for Computing, inspired by artificial intelligence, but scaled down for practical database and programming applications.
Edit intent: clarity
Original:  In this paper we propose a unifying logic-based, framework for Computing, inspired by artificial intelligence, but scaled down for practical database and programming applications.
Revised:  In this paper we propose a unifying logic-based, framework inspired by artificial intelligence, but scaled down for practical database and programming applications.
Edit intent: coherence
Original:  In the model-theoretic semantics, the entire sequence of states and events are combined into a single model-theoretic structure, by associating time stamps with facts .
Revised:  In the model-theoretic semantics, the entire sequence of states and events are combined into a single model-theoretic structure, by associating timestamps with facts and events .
Edit intent: fluency
Original:  But in the operational semantics, facts are updated destructively, without time stamps .
Revised:  But in the operational semantics, facts are updated destructively, without timestamps .
Edit intent: fluency
Original:  We show that the model generated by destructive updates is identical to the model generated by reasoning with facts containing time stamps .
Revised:  We show that the model generated by destructive updates is identical to the model generated by reasoning with facts containing timestamps .
Edit intent: fluency
Original: We present an O(nlogn) time algorithm for the (weighted) k-center problem of n points on a real line.
Revised: We consider the problem of finding k centers for n weighted points on a real line.
Edit intent: clarity
Original:  Our techniques involve developing efficient data structures for processing queries that find a lowest point in the common intersection of a certain subset of half-planes.
Revised:  Our techniques involve developing interesting data structures for processing queries that find a lowest point in the common intersection of a certain subset of half-planes.
Edit intent: clarity
Original:  This subproblem is interesting in its own right and our solution for it may find other applications  .
Revised:  This subproblem is interesting in its own right and our solution for it may find other applications as well .
Edit intent: clarity
Original:  In this paper, we gave a new proof with our preceding works , which revealed the canonical structure of general graph with perfect matchings.
Revised:  In this paper, we give a new proof with our preceding works , which revealed the canonical structure of general graph with perfect matchings.
Edit intent: fluency
Original:  In this paper, we gave a new proof with our preceding works , which revealed the canonical structure of general graph with perfect matchings.
Revised:  In this paper, we gave a new proof with our preceding works which revealed canonical structures of general graphs with perfect matchings.
Edit intent: fluency
Original:  Here, the cathedral theorem is derived in quite a naturalway and shows that it holds independently from the Gallai-Edmonds structure theorem.
Revised:  Here, the cathedral theorem is derived in quite a naturalway and shows that it can be proved without using the Gallai-Edmonds structure theorem.
Edit intent: clarity
Original:  In this paper, we propose  Blocked Compact Symmetric Storage  wherein we consider the tensor by blocks and store only the unique blocks of a symmetric tensor.
Revised:  In this paper, we propose a blocked data structure ( Blocked Compact Symmetric Storage wherein we consider the tensor by blocks and store only the unique blocks of a symmetric tensor.
Edit intent: clarity
Original:  In this paper, we propose  Blocked Compact Symmetric Storage  wherein we consider the tensor by blocks and store only the unique blocks of a symmetric tensor.
Revised:  In this paper, we propose Blocked Compact Symmetric Storage ) wherein we consider the tensor by blocks and store only the unique blocks of a symmetric tensor.
Edit intent: fluency
Original:  An implementation demonstrates that the complexity introduced by storing and computing with tensors by blocks is manageable and preliminary results demonstrate that computational time is indeed reduced.
Revised:  An implementation demonstrates that the complexity introduced by storing and computing with tensors by blocks is manageable and preliminary results demonstrate that computational time is also reduced.
Edit intent: clarity
Original:  A detailed analysis shows that, relative to storing and computing with tensors without taking advantage of symmetry and partial symmetry, storage requirements are reduced by a factor O(m! )\left( \right) and computational requirements by a factor O((\left(  m+1)!
Revised:  A detailed analysis shows that, relative to storing and computing with tensors without taking advantage of symmetry and partial symmetry, storage requirements are reduced by a factor of O\left( \right) and computational requirements by a factor O((\left( m+1)!
Edit intent: clarity
Original:  A detailed analysis shows that, relative to storing and computing with tensors without taking advantage of symmetry and partial symmetry, storage requirements are reduced by a factor O(m! )\left( \right) and computational requirements by a factor O((\left(  m+1)!
Revised:  A detailed analysis shows that, relative to storing and computing with tensors without taking advantage of symmetry and partial symmetry, storage requirements are reduced by a factor O(m! )\left( m!\right) and computational requirements by a factor O((\left( m+1)!
Edit intent: fluency
Original:  A detailed analysis shows that, relative to storing and computing with tensors without taking advantage of symmetry and partial symmetry, storage requirements are reduced by a factor O(m! )\left( \right) and computational requirements by a factor O((\left(  m+1)!
Revised:  A detailed analysis shows that, relative to storing and computing with tensors without taking advantage of symmetry and partial symmetry, storage requirements are reduced by a factor O(m! )\left( \right) and computational requirements by a factor of O\left( m+1)!
Edit intent: clarity
Original:  A detailed analysis shows that, relative to storing and computing with tensors without taking advantage of symmetry and partial symmetry, storage requirements are reduced by a factor O(m! )\left( \right) and computational requirements by a factor O((\left(  m+1)!
Revised:  A detailed analysis shows that, relative to storing and computing with tensors without taking advantage of symmetry and partial symmetry, storage requirements are reduced by a factor O(m! )\left( \right) and computational requirements by a factor O((\left( ( m+1)!
Edit intent: fluency
Original: /2^m ) \right) , where m is the order of the tensor.
Revised: /2^m \right) , where m is the order of the tensor.
Edit intent: fluency
Original:   An implementation demonstrates that  the complexity introduced by storing and computing with tensors by blocks is manageable and preliminary results demonstrate that computational time is also reduced.
Revised:  An implementation demonstrates that the complexity introduced by storing and computing with tensors by blocks is manageable . Preliminary results demonstrate that computational time is also reduced.
Edit intent: coherence
Original:  The paper concludes with a discussion of how the insights point to opportunities for generalizing recent advances for the domain of linear algebra libraries to the field of multi-linear computation.
Revised:  The paper concludes with a discussion of how insights in this paper point to opportunities for generalizing recent advances for the domain of linear algebra libraries to the field of multi-linear computation.
Edit intent: clarity