wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Finally, we note that unlike the original sketching approach of Ahn, Guha and McGregor'12, none of the existing spanner constructions yield%DIFDELCMD < {\em %%% simultaneous communication protocols with low per player information .
Revised:  Finally, we note that unlike the original sketching approach of Ahn, Guha and McGregor'12, none of the existing spanner constructions yield%DIFDELCMD < {\em %%% study the simultaneous communication model and propose the first protocols with low per player information .
Edit intent: meaning-changed
Original:  Finally, we note that unlike the original sketching approach of Ahn, Guha and McGregor'12, none of the existing spanner constructions yield%DIFDELCMD < {\em %%% simultaneous communication protocols with low per player information . We give the first such protocols for the spanner problem that use a small number of rounds .
Revised:  Finally, we note that unlike the original sketching approach of Ahn, Guha and McGregor'12, none of the existing spanner constructions yield%DIFDELCMD < {\em %%% simultaneous communication protocols with low per player information .
Edit intent: coherence
Original:  The method is quite general and flexible, since it dos not rely on any specific property of the dynamical system, and represents a mathematical formalisation of the procedure consisting of sampling and testing parameters, in which evolutions generated by candidate parameters are tested against observed data to assess goodness-of-fit.
Revised:  The method is quite general and flexible, since it does not rely on any specific property of the dynamical system, and represents a mathematical formalisation of the procedure consisting of sampling and testing parameters, in which evolutions generated by candidate parameters are tested against observed data to assess goodness-of-fit.
Edit intent: fluency
Original:  The method is quite general and flexible, since it dos not rely on any specific property of the dynamical system, and represents a mathematical formalisation of the procedure consisting of sampling and testing parameters, in which evolutions generated by candidate parameters are tested against observed data to assess goodness-of-fit. The Statistical Learningframework introduces a mathematically rigorous scheme to this general approach for parameter estimation, adding to the great field of parameter estimation in dynamical systems .
Revised:  The method is quite general and flexible, since it dos not rely on any specific property of the dynamical system, and represents a reinterpretation of Approximate Bayesian Computation methods through the lens of Statistical Learning .
Edit intent: clarity
Original:  The method is specially useful for estimating parameters in epidemiological compartmental models . We illustrate it in simulated and real data about COVID-19 spread in the US in order to assess qualitatively the peak of deaths by the disease .
Revised:  The method is specially useful for estimating parameters in epidemiological compartmental models in order to obtain qualitative properties of a disease evolution. We apply it to simulated and real data about COVID-19 spread in the US in order to assess qualitatively the peak of deaths by the disease .
Edit intent: meaning-changed
Original:  We illustrate it in simulated and real data about COVID-19 spread in the US in order to assess qualitatively the peak of deaths by the disease .
Revised:  We illustrate it in simulated and real data about COVID-19 spread in the US in order to evaluate qualitatively its evolution over time, showing how one may assess the effectiveness of measures implemented to slow the spread and some qualitative features of the disease current and future evolution .
Edit intent: meaning-changed
Original:  In this work we evaluate the performance of this library on the simulation of a well-known cortical microcircuit model, based on LIF neurons and current-based synapses, and on a balanced networks of excitatory and inhibitory neurons, using AdEx neurons and conductance-based synapses.
Revised:  In this work we evaluate the performance of this library on the simulation of a cortical microcircuit model, based on LIF neurons and current-based synapses, and on a balanced networks of excitatory and inhibitory neurons, using AdEx neurons and conductance-based synapses.
Edit intent: clarity
Original:  In this work we evaluate the performance of this library on the simulation of a well-known cortical microcircuit model, based on LIF neurons and current-based synapses, and on a balanced networks of excitatory and inhibitory neurons, using AdEx neurons and conductance-based synapses.
Revised:  In this work we evaluate the performance of this library on the simulation of a well-known cortical microcircuit model, based on LIF neurons and current-based synapses, and on a balanced network of excitatory and inhibitory neurons, using AdEx neurons and conductance-based synapses.
Edit intent: fluency
Original:  School closures in Lombardy lowered it to 1.3. Soft lockdown measueres lowered Rto 0.7 and no further reductions were observed when a hard lockdown was introduced (e.g. Emilia-Romagna soft lockdown 0.67 +/-0.07, hard lockdown 0.69+/-0.071).
Revised:  School closures in Lombardy lowered it to 1.3. Soft lockdown measures resulted in R<0.8 and no further reductions were observed when a hard lockdown was introduced (e.g. Emilia-Romagna soft lockdown 0.67 +/-0.07, hard lockdown 0.69+/-0.071).
Edit intent: meaning-changed
Original: In this work we develop a new hierarchical multilevel approach to generate Gaussian random field realizations in a scalable manner that is well-suited to incorporate into multilevel Markov chain Monte Carlo (MCMC) algorithms.
Revised: In this work we develop a new hierarchical multilevel approach to generate Gaussian random field realizations in an algorithmically scalable manner that is well-suited to incorporate into multilevel Markov chain Monte Carlo (MCMC) algorithms.
Edit intent: clarity
Original:  After presenting our main theoretical results and numerical scaling results to showcase the utility of this new hierarchical PDE method for generating Gaussian random field realizations, this method is tested on a three-level MCMC algorithm to explore its feasibility.
Revised:  After presenting our main theoretical results and numerical scaling results to showcase the utility of this new hierarchical PDE method for generating Gaussian random field realizations, this method is tested on a four-level MCMC algorithm to explore its feasibility.
Edit intent: meaning-changed
Original:  In particular, we show that for (3P_1+P_2)-free graphs (where P_r is the path on r vertices) there is a polynomial-time algorithm, but the problem is NP-complete for 5P_1-free graphs, that is, graphs of independence number~4. Thus we obtain a dichotomy with respect to the independence number; this is an analogue of the dichotomy for Weighted Subset Feedback Vertex Set recently obtained by Papadopoulos and Tzimas.
Revised:  Our general approach can also be used for Weighted Subset Feedback Vertex Set recently obtained by Papadopoulos and Tzimas.
Edit intent: coherence
Original:  this is an analogue of the dichotomy for Weighted Subset Feedback Vertex Set recently obtained by Papadopoulos and Tzimas. In contrast, Subset Feedback Vertex Set and Subset Odd Cycle Transversal have a polynomial-time algorithm for any graph class with bounded independence number. We also generalize the polynomial-time result of Papadopoulos and Tzimas for Weighted Subset Feedback Vertex Set on 4P_1-free graphs to (3P_1+P_2)-free graphs.
Revised:  this is an analogue of the dichotomy for Weighted Subset Feedback Vertex Set , which enables us to generalize a recent result of Papadopoulos and Tzimas for Weighted Subset Feedback Vertex Set on 4P_1-free graphs to (3P_1+P_2)-free graphs.
Edit intent: coherence
Original:  We also generalize the polynomial-time result of Papadopoulos and Tzimas for Weighted Subset Feedback Vertex Set on 4P_1-free graphs to (3P_1+P_2)-free graphs. As a consequence, we show that the complexity for both of the weighted subset transversal problems restricted to H-free graphs remains open for just three particular graphs~H .
Revised:  We also generalize the polynomial-time result of Papadopoulos and Tzimas .
Edit intent: coherence
Original: The aim of the work is to stabilize the unstable index-1 descriptor systems by Riccati-based feedback stabilization via a modified form interpolatory projection-based technique Iterative Rational Krylov Algorithm (IRKA) .
Revised: The work aims to stabilize the unstable index-1 descriptor systems by Riccati-based feedback stabilization via a modified form interpolatory projection-based technique Iterative Rational Krylov Algorithm (IRKA) .
Edit intent: clarity
Original: The aim of the work is to stabilize the unstable index-1 descriptor systems by Riccati-based feedback stabilization via a modified form interpolatory projection-based technique Iterative Rational Krylov Algorithm (IRKA) .
Revised: The aim of the work is to stabilize the unstable index-1 descriptor systems by Riccati-based feedback stabilization via a modified form of Iterative Rational Krylov Algorithm (IRKA) .
Edit intent: clarity
Original: The aim of the work is to stabilize the unstable index-1 descriptor systems by Riccati-based feedback stabilization via a modified form interpolatory projection-based technique Iterative Rational Krylov Algorithm (IRKA) . The basic IRKAis used to find Reduced Order Models (ROMs) for the stable systems conveniently but it is unsuitable for the unstable systems .
Revised: The aim of the work is to stabilize the unstable index-1 descriptor systems by Riccati-based feedback stabilization via a modified form interpolatory projection-based technique Iterative Rational Krylov Algorithm (IRKA) , which is a bi-tangential interpolation-based technique. In the basic IRKA, for the stable systems the Reduced Order Models (ROMs) for the stable systems conveniently but it is unsuitable for the unstable systems .
Edit intent: meaning-changed
Original:  Our approach is based on a hierarchical representation of the input data and the fast identification of topologically invariant vertices,  for which we show that no computation is required as they are introduced in the hierarchy.
Revised:  Our approach is based on a hierarchical representation of the input data and the fast identification of topologically invariant vertices, which are vertices that have no impact on the topological description of the data and for which we show that no computation is required as they are introduced in the hierarchy.
Edit intent: meaning-changed
Original:  Experiments on real-life datasets illustrate that our progressive strategy, in addition to the continuous visual feedback it provides, even improves run time performances with regard to non-progressive algorithms and we describe further accelerations with shared-memory parallelism.
Revised:  Experiments on real-life datasets illustrate that our progressive strategy, in addition to the continuous visual feedback it provides, even improves run time performance with regard to non-progressive algorithms and we describe further accelerations with shared-memory parallelism.
Edit intent: fluency
Original:  We illustrate the utility of our approach in (i) batch-mode and (ii) interactive setups, where it respectively enables (i) the control of the execution time of complete topological pipelines as well as (ii) previews of the topological features found in a dataset, with progressive updates delivered within interactive times.
Revised:  We illustrate the utility of our approach in batch-mode and (ii) interactive setups, where it respectively enables (i) the control of the execution time of complete topological pipelines as well as (ii) previews of the topological features found in a dataset, with progressive updates delivered within interactive times.
Edit intent: fluency
Original:  We illustrate the utility of our approach in (i) batch-mode and (ii) interactive setups, where it respectively enables (i) the control of the execution time of complete topological pipelines as well as (ii) previews of the topological features found in a dataset, with progressive updates delivered within interactive times.
Revised:  We illustrate the utility of our approach in (i) batch-mode and interactive setups, where it respectively enables (i) the control of the execution time of complete topological pipelines as well as (ii) previews of the topological features found in a dataset, with progressive updates delivered within interactive times.
Edit intent: fluency
Original:  We illustrate the utility of our approach in (i) batch-mode and (ii) interactive setups, where it respectively enables (i) the control of the execution time of complete topological pipelines as well as (ii) previews of the topological features found in a dataset, with progressive updates delivered within interactive times.
Revised:  We illustrate the utility of our approach in (i) batch-mode and (ii) interactive setups, where it respectively enables the control of the execution time of complete topological pipelines as well as (ii) previews of the topological features found in a dataset, with progressive updates delivered within interactive times.
Edit intent: fluency
Original:  We illustrate the utility of our approach in (i) batch-mode and (ii) interactive setups, where it respectively enables (i) the control of the execution time of complete topological pipelines as well as (ii) previews of the topological features found in a dataset, with progressive updates delivered within interactive times.
Revised:  We illustrate the utility of our approach in (i) batch-mode and (ii) interactive setups, where it respectively enables (i) the control of the execution time of complete topological pipelines as well as previews of the topological features found in a dataset, with progressive updates delivered within interactive times.
Edit intent: fluency
Original:  Here we show that the quantitative analysis of several reported superspreading events points towards aerosol mediated transmission of SARS-CoV-2.
Revised:  Here we quantitatively analyze virion accumulation by accounting for aerosolized virion emission and destabilization. Reported superspreading events analyzed within this framework point towards aerosol mediated transmission of SARS-CoV-2.
Edit intent: meaning-changed
Original:  Aerosolized virus emitted by an infected person in an enclosed space will accumulate until virion emission and virion destabilization are balanced, resulting in a steady-state concentration C_{\infty found to trace out a single value of the calculated virion exposure , suggesting a universal minimum infective dose (MID) via aerosol .
Revised:  Virion exposure calculated for these events is found to trace out a single value of the calculated virion exposure , suggesting a universal minimum infective dose (MID) via aerosol .
Edit intent: clarity
Original:  Aerosolized virus emitted by an infected person in an enclosed space will accumulate until virion emission and virion destabilization are balanced, resulting in a steady-state concentration C_{\infty found to trace out a single value of the calculated virion exposure , suggesting a universal minimum infective dose (MID) via aerosol .
Revised:  Aerosolized virus emitted by an infected person in an enclosed space will accumulate until virion emission and virion destabilization are balanced, resulting in a steady-state concentration C_{\infty found to trace out a single value , suggesting a universal minimum infective dose (MID) via aerosol .
Edit intent: clarity
Original:  Aerosolized virus emitted by an infected person in an enclosed space will accumulate until virion emission and virion destabilization are balanced, resulting in a steady-state concentration C_{\infty found to trace out a single value of the calculated virion exposure , suggesting a universal minimum infective dose (MID) via aerosol . The MID implied by our analysis is comparable to the measured MIDs for influenza A (H2N2), the virus responsible for the 1957-1958 asian flu pandemic.
Revised:  Aerosolized virus emitted by an infected person in an enclosed space will accumulate until virion emission and virion destabilization are balanced, resulting in a steady-state concentration C_{\infty found to trace out a single value of the calculated virion exposure , suggesting a universal minimum infective dose (MID) via aerosol that is comparable to the measured MIDs for influenza A (H2N2), the virus responsible for the 1957-1958 asian flu pandemic.
Edit intent: clarity
Original:  The MID implied by our analysis is comparable to the measured MIDs for influenza A (H2N2), the virus responsible for the 1957-1958 asian flu pandemic. Our model suggests that the likelihood for aerosol-mediated transmission reduces significantly when there is filtration at a rate exceeding the destabilization rate of aerosolized SARS-CoV-2  .
Revised:  The MID implied by our analysis is comparable to the MIDs measured for other respiratory viruses; thus, the consistent infectious exposure levels and their commensurability to known aerosol-MIDs establishes the plausibility of aerosol transmission of SARS-CoV-2. Using filtration at a rate exceeding the destabilization rate of aerosolized SARS-CoV-2 .
Edit intent: meaning-changed
Original:  Our model suggests that the likelihood for aerosol-mediated transmission reduces significantly when there is filtration at a rate exceeding the destabilization rate of aerosolized SARS-CoV-2  .
Revised:  Our model suggests that the likelihood for aerosol-mediated transmission reduces significantly when there is filtration at a rate exceeding the destabilization rate of aerosolized SARS-CoV-2 can reduce exposure below this infective dose .
Edit intent: meaning-changed
Original:  We find that democratic countries, countries with the higher Gross Domestic Product (GDP) per capita, higher healthcare expenditures, and better universal healthcare coverage are less likely to deviate from the Newcomb-Benford law.
Revised:  We find that democratic countries, countries with the higher gross domestic product (GDP) per capita, higher healthcare expenditures, and better universal healthcare coverage are less likely to deviate from the Newcomb-Benford law.
Edit intent: fluency
Original:  The findings are robust for the second digit tests, for a sub-sample of countries with regional data, and during the previous swine flu (H1N1) 2009-2010 pandemic  .
Revised:  The findings are robust for second-digit tests, for a sub-sample of countries with regional data, and during the previous swine flu (H1N1) 2009-2010 pandemic .
Edit intent: fluency
Original:  The findings are robust for the second digit tests, for a sub-sample of countries with regional data, and during the previous swine flu (H1N1) 2009-2010 pandemic  .
Revised:  The findings are robust for the second digit tests, for a sub-sample of countries with regional data, and in relation to the previous swine flu (H1N1) 2009-2010 pandemic .
Edit intent: clarity
Original:  The findings are robust for the second digit tests, for a sub-sample of countries with regional data, and during the previous swine flu (H1N1) 2009-2010 pandemic  .
Revised:  The findings are robust for the second digit tests, for a sub-sample of countries with regional data, and during the previous swine flu (H1N1) 2009-2010 pandemic . The paper further highlights the importance of independent surveillance data verification projects .
Edit intent: meaning-changed
Original:  In this paper, we study three specific COVID-19 epidemic control models: the susceptible, exposed, infectious, recovered (SEIR) model with vaccination control , the SEIR model with shield immunity control , and the susceptible, un-quarantined infected, quarantined infected, confirmed infected (SUQC) model with quarantine control.
Revised:  We study three specific COVID-19 epidemic control models: the susceptible, exposed, infectious, recovered (SEIR) model with vaccination control , the SEIR model with shield immunity control , and the susceptible, un-quarantined infected, quarantined infected, confirmed infected (SUQC) model with quarantine control.
Edit intent: clarity
Original:  In this paper, we study three specific COVID-19 epidemic control models: the susceptible, exposed, infectious, recovered (SEIR) model with vaccination control , the SEIR model with shield immunity control , and the susceptible, un-quarantined infected, quarantined infected, confirmed infected (SUQC) model with quarantine control.
Revised:  In this paper, we study three specific COVID-19 epidemic control models: the susceptible, exposed, infectious, recovered (SEIR) model with vaccination control ; the SEIR model with shield immunity control , and the susceptible, un-quarantined infected, quarantined infected, confirmed infected (SUQC) model with quarantine control.
Edit intent: fluency
Original:  In this paper, we study three specific COVID-19 epidemic control models: the susceptible, exposed, infectious, recovered (SEIR) model with vaccination control , the SEIR model with shield immunity control , and the susceptible, un-quarantined infected, quarantined infected, confirmed infected (SUQC) model with quarantine control.
Revised:  In this paper, we study three specific COVID-19 epidemic control models: the susceptible, exposed, infectious, recovered (SEIR) model with vaccination control , the SEIR model with shield immunity control ; and the susceptible, un-quarantined infected, quarantined infected, confirmed infected (SUQC) model with quarantine control.
Edit intent: fluency
Original:  We express the control requirement in metric temporal logic (MTL) formulas and develop methods for synthesizing control inputs based on three specific COVID-19 epidemic models with MTL specifications.
Revised:  We express the control requirement in metric temporal logic (MTL) formulas (a type of formal specification languages) which can specify the expected control outcomes such as "the deaths from the infection should never exceed one thousand per day within the next three months" or "the population immune from the disease should eventually exceed 200 thousand within the next 100 to 120 days". We then develop methods for synthesizing control inputs based on three specific COVID-19 epidemic models with MTL specifications.
Edit intent: meaning-changed
Original:  The results show that the proposed synthesis approach can generate control inputs within a relatively short time (within 5 seconds) such that the time-varying numbers of individuals in each category (e.g., infectious, immune) satisfy the MTL specifications.
Revised:  The results show that the proposed synthesis approach can generate control inputs such that the time-varying numbers of individuals in each category (e.g., infectious, immune) satisfy the MTL specifications.
Edit intent: clarity
Original: We propose a notion of algorithmic stability for scenarios where cardinal preferencesare elicited. Informally, our definition captures the idea that an agent should not experience a large change in their utility as long as they make " small" or " innocuous" mistakes while reporting their preferences .
Revised: Many allocation problems in multiagent systems rely on agents specifying cardinal preferences. However, allocation mechanisms can be sensitive to small perturbations in cardinal preferences, thus causing agents who make `` small" or " innocuous" mistakes while reporting their preferences .
Edit intent: clarity