wanyu/IteraTeR_v2 huggingface dataset:
Original:  When both Willie and Alice jobs have general service times we establish an upper bound for the amount of service Alice can get  covertly.
Revised:  When both Willie and Alice jobs have general service times we establish an upper bound for the number of jobs Alice can get covertly.
Edit intent: clarity
Original:  When both Willie and Alice jobs have general service times we establish an upper bound for the amount of service Alice can get  covertly.
Revised:  When both Willie and Alice jobs have general service times we establish an upper bound for the amount of service Alice can get done covertly.
Edit intent: clarity
Original:  Additional upper bounds are obtained for more general insertion policies  .
Revised:  More general insertion policies .
Edit intent: clarity
Original:  When both Willie and Alice jobs have general service times we establish an upper bound for the number of jobs Alice can get done covertly.
Revised:  When both Willie and Alice jobs have general service times we establish an upper bound for the number of jobs Alice can execute covertly.
Edit intent: clarity
Original:  More general insertion policies are also investigated .
Revised:  More general insertion policies are also discussed .
Edit intent: clarity
Original:  Methods. We present a rigorous mathematical framework for the representation of phrase structure trees and parse-trees of context-free grammars (CFG) in Fock space, i.e. infinite-dimensional Hilbert space as being used in quantum field theory.
Revised:  Methods. We present a rigorous mathematical framework for the representation of phrase structure trees and parse trees of context-free grammars (CFG) in Fock space, i.e. infinite-dimensional Hilbert space as being used in quantum field theory.
Edit intent: fluency
Original: Probabilistic programming languages (PPLs) make it possible to reason under uncertainty , by encoding inference problems as programs.
Revised: Probabilistic programming is an approach to reasoning under uncertainty by encoding inference problems as programs.
Edit intent: clarity
Original:  In order to solve these inference problems, PPLs employ many different inference algorithms  . Existing research on such inference algorithms mainly concerns their implementation and efficiency, rather than the correctness of the algorithms themselves when applied in the context of expressive PPLs.
Revised:  In order to solve these inference problems, PPLs employ many different inference algorithms . Existing research on such algorithms mainly concerns their implementation and efficiency, rather than the correctness of the algorithms themselves when applied in the context of expressive PPLs.
Edit intent: fluency
Original:  To remedy this, we give a correctness proof for sequential Monte Carlo (SMC ) methods in the context of an expressive PPL calculus, representative of popular PPLs such as WebPPL, Anglican, and Birch.
Revised:  To remedy this, we give a correctness proof for SMC methods in the context of an expressive PPL calculus, representative of popular PPLs such as WebPPL, Anglican, and Birch.
Edit intent: clarity
Original:  Previous work have studied correctness of Markov chain Monte Carlo (MCMC ) using an operational semantics, and  in a denotational setting without term recursion.
Revised:  Previous work have studied correctness of MCMC using an operational semantics, and in a denotational setting without term recursion.
Edit intent: clarity
Original:  However, for SMC inference---one of the most commonly used algorithms in PPLs as of today---no formal correctness proof exists in an untyped operational setting.
Revised:  However, for SMC inference -- one of the most commonly used algorithms in PPLs as of today---no formal correctness proof exists in an untyped operational setting.
Edit intent: fluency
Original:  However, for SMC inference---one of the most commonly used algorithms in PPLs as of today---no formal correctness proof exists in an untyped operational setting.
Revised:  However, for SMC inference---one of the most commonly used algorithms in PPLs as of today -- no formal correctness proof exists in an untyped operational setting.
Edit intent: fluency
Original:  However, for SMC inference---one of the most commonly used algorithms in PPLs as of today---no formal correctness proof exists in an untyped operational setting.
Revised:  However, for SMC inference---one of the most commonly used algorithms in PPLs as of today---no formal correctness proof exists in an operational setting.
Edit intent: clarity
Original:  (i) we  prove, for the first time, that SMC inference is correct in an untyped operational context of an expressive PPL calculus, and we show that, under mild assumptions, the correctness is independent of the placement of explicit resampling points, (ii)  we formalize the bootstrap particle filter for the calculus , and (iii) we demonstrate a classical law of large numbers from the SMC literature that holds as a consequence of our proof .
Revised:  (i) we prove, for the first time, that subject to mild restrictions, any placement of the explicit resample terms is valid for a generic form of SMC inference; (iii) as a result of (ii) we formalize the bootstrap particle filter for the calculus , and (iii) we demonstrate a classical law of large numbers from the SMC literature that holds as a consequence of our proof .
Edit intent: clarity
Original:  The paper is a continuation of 13%DIFDELCMD < ]%%% , where the derivation of the governing fractional differential equation, similarly as the stability and convergence analysis can be found .
Revised:  The paper is a continuation of %DIFDELCMD < ]%%% , where the derivation of the governing fractional differential equation, similarly as the stability and convergence analysis can be found .
Edit intent: fluency
Original:  The paper is a continuation of 13%DIFDELCMD < ]%%% , where the derivation of the governing fractional differential equation, similarly as the stability and convergence analysis can be found .
Revised:  The paper is a continuation of 13%DIFDELCMD < ]%%% .
Edit intent: coherence
Original: This paper is focused on American option pricing in the subdiffusive Black Scholes model.
Revised: This paper is focused on American option pricing in the subdiffusive Black-Scholes model.
Edit intent: fluency
Original:  Two  methods for valuing American options in the considered model are proposed.
Revised:  Two computational methods for valuing American options in the considered model are proposed.
Edit intent: clarity
Original:  In the article it is also shown how to valuate  wide range of Barrier options using the FD approach.
Revised:  In the article it is also shown how to valuate wide range of barrier options using the FD approach.
Edit intent: fluency
Original:  American and barrier option pricing in the subdiffusive Black-Scholes  model.
Revised:  American and barrier option pricing in the subdiffusive Black-Scholes (B-S) model.
Edit intent: clarity
Original:  The Longstaff-Schwartz method is applied for the discussed model and is compared to the previous method .
Revised:  The Longstaff-Schwartz method .
Edit intent: clarity
Original:  Thus, an accurate way to compare functional connectomes is essential . Canonically, functional connectomes are compared using Pearson's correlation coefficient of the entire functional connectivity profiles.
Revised:  Thus, an accurate way to compare functional connectomes is essential . Canonically, FCs are compared using Pearson's correlation coefficient of the entire functional connectivity profiles.
Edit intent: clarity
Original:  Thus, an accurate way to compare functional connectomes is essential . Canonically, functional connectomes are compared using Pearson's correlation coefficient of the entire functional connectivity profiles.
Revised:  Thus, an accurate way to compare functional connectomes is essential . Canonically, functional connectomes are compared using Pearson\'s correlation coefficient of the entire functional connectivity profiles.
Edit intent: fluency
Original:  Recently, Venkatesh and colleagues proposed the use of geodesic distance as a more accurate way of comparing functional connectomes, one which reflects the underlying non-Euclidean geometry of the data.
Revised:  Recently, it has been proposed that the use of geodesic distance as a more accurate way of comparing functional connectomes, one which reflects the underlying non-Euclidean geometry of the data.
Edit intent: clarity
Original:  Recently, Venkatesh and colleagues proposed the use of geodesic distance as a more accurate way of comparing functional connectomes, one which reflects the underlying non-Euclidean geometry of the data.
Revised:  Recently, Venkatesh and colleagues proposed the use of geodesic distance is a more accurate way of comparing functional connectomes, one which reflects the underlying non-Euclidean geometry of the data.
Edit intent: fluency
Original:  They evaluated their approach in the context of participant identification (or fingerprinting) and showed that it leads to higher identification rates for all functional MRI conditions assessed.
Edit intent: coherence
Original:  In the present technical note , we show that regularization is not only crucial for making the functional connectomes invertible, but also that an optimal magnitude of regularization can lead to systematically higher identification rates .
Revised:  In the present work , we show that regularization is not only crucial for making the functional connectomes invertible, but also that an optimal magnitude of regularization can lead to systematically higher identification rates .
Edit intent: clarity
Original:  In the present technical note , we show that regularization is not only crucial for making the functional connectomes invertible, but also that an optimal magnitude of regularization can lead to systematically higher identification rates .
Revised:  In the present technical note , we show that regularization is not only crucial for making the functional connectomes invertible, but also that an optimal magnitude of regularization leads to systematically higher identification rates .
Edit intent: clarity
Original:  In the present technical note , we show that regularization is not only crucial for making the functional connectomes invertible, but also that an optimal magnitude of regularization can lead to systematically higher identification rates .
Revised:  In the present technical note , we show that regularization is not only crucial for making the functional connectomes invertible, but also that an optimal magnitude of regularization can lead to systematically higher fingerprints .
Edit intent: clarity
Original:  We also show that this optimal value of regularization is highly dataset-dependent, and varies as a function of condition, parcellation,  and the number of frames used to compute the functional connectomes .
Revised:  We also show evidence that optimal regularization is dataset-dependent, and varies as a function of condition, parcellation, and the number of frames used to compute the functional connectomes .
Edit intent: clarity
Original:  Functional connectomes (FCs), have been shown to provide a reproducible individual fingerprint, which has opened the possibility of personalized medicine for neuro/psychiatric disorders.
Revised: Background: Functional connectomes (FCs), have been shown to provide a reproducible individual fingerprint, which has opened the possibility of personalized medicine for neuro/psychiatric disorders.
Edit intent: coherence
Original:   Canonically, FCs are compared using Pearson\'s correlation coefficient of the entire functional connectivity profiles.
Revised:  Methods: Canonically, FCs are compared using Pearson\'s correlation coefficient of the entire functional connectivity profiles.
Edit intent: fluency
Original:   Canonically, FCs are compared using Pearson\'s correlation coefficient of the entire functional connectivity profiles.
Revised:  Canonically, FCs are compared using Pearson's correlation coefficient of the entire functional connectivity profiles.
Edit intent: fluency
Original:   In the present work, we show that regularization is not only an algebraic operation for making FCs invertible, but also that an optimal magnitude of regularization leads to systematically higher fingerprints.
Revised:  Results: In the present work, we show that regularization is not only an algebraic operation for making FCs invertible, but also that an optimal magnitude of regularization leads to systematically higher fingerprints.
Edit intent: fluency
Original:   We demonstrate that a universally fixed regularization does not fully uncover the potential of geodesic distance on individual fingerprinting, and indeed could severely diminish it.
Revised:  Discussion: We demonstrate that a universally fixed regularization does not fully uncover the potential of geodesic distance on individual fingerprinting, and indeed could severely diminish it.
Edit intent: fluency
Original:  The possibility of a global pandemic is growing .
Revised:  World Health Organization (WHO) has already declared a global pandemic is growing .
Edit intent: clarity
Original:  The possibility of a global pandemic is growing .
Revised:  The possibility of a global pandemic warning .
Edit intent: clarity
Original:  It appears most of the infection resulted deaths are mainly due to dysfunctions or failures of the lung or multiple organs that could be attributed to host immune system s hyperinflammatory disorders.
Revised:  It appears most of the infection resulted deaths are mainly due to dysfunctions or failures of the lung or multiple organs that could be attributed to host s immunodysfunction or related disorders.
Edit intent: clarity
Original:  Based on this model, rational or effective therapeutic strategies at right stages or timing, with right type of agents ( immunostimulators or immunosuppressors) and right dosages, can be designed and implemented that are expected to effectively achieve maximum PIRP or reduce the mortality.
Revised:  Based on this model, rational or effective therapeutic strategies at right stages or timing, with right type of agents ( immuno-stimulators or immuno-suppressors), and right dosages, can be designed and implemented that are expected to effectively achieve maximum PIRP or reduce the mortality.
Edit intent: fluency
Original:  Based on this model, rational or effective therapeutic strategies at right stages or timing, with right type of agents ( immunostimulators or immunosuppressors) and right dosages, can be designed and implemented that are expected to effectively achieve maximum PIRP or reduce the mortality.
Revised:  Based on this model, rational or effective therapeutic strategies at right stages or timing, with right type of agents ( immunostimulators or immunosuppressors) and right dosages, may be designed and implemented that are expected to effectively achieve maximum PIRP or reduce the mortality.
Edit intent: clarity
Original:  This is analogous to the Cheeger-type inequality relating the spectral gap  , \lambda_2 (G), of the graph to its {\em edge expansion}.
Revised:  This is analogous to the Cheeger-type inequality relating the spectral gap , \lambda_2 , to its {\em edge expansion}.
Edit intent: clarity
Original:  We settle this question by proving that computing \lambda_\infty is indeed NP-hard .
Revised:  We confirm this conjecture by proving that computing \lambda_\infty is indeed NP-hard .
Edit intent: clarity
Original:  Finally{\em   , we provide improved approximation results for the maximum variance embedding problem for general graphs, by replacing the optimal orthogonal projection (PCA) with a randomized projection approach .
Revised:  Finally{\em maximum variance embedding , we provide improved approximation results for the maximum variance embedding problem for general graphs, by replacing the optimal orthogonal projection (PCA) with a randomized projection approach .
Edit intent: clarity
Original:  There are similarities with the incremental variant of CAD, the NLSAT method of Jovanovi\'{c Moura, and the NuCAD algorithm of Brown;
Revised:  There are similarities with the incremental variant of CAD, the NLSAT method of Jovanovic and de Moura, and the NuCAD algorithm of Brown;
Edit intent: fluency
Original:  We further notice the Logistic function steadily underestimate the final epidemic size, while the Gomertz 's function makes an overestimation in all cases.
Revised:  We further notice the Logistic function steadily underestimate the final epidemic size, while the Gompertz 's function makes an overestimation in all cases.
Edit intent: fluency
Original:  Since the methods of sequential Bayesian and time dependent reproduction number take the non-constant nature of the effective reproduction number into consideration, we suggest to employ them especially in the late stage of an epidemic.
Revised:  Since the methods of sequential Bayesian and time-dependent reproduction number are more accurate at the late stage of an epidemic.
Edit intent: clarity
Original:  The transition-like behavior of exponential growth method from underestimation to overestimation with respect to the inflection point might be useful for constructing a more reliable forecast.
Revised:  And the transition-like behavior of exponential growth method from underestimation to overestimation with respect to the inflection point might be useful for constructing a more reliable forecast.
Edit intent: coherence
Original:  Towards the ODE models, the SEIR-QD and SEIR-PO models are shown to be suitable for modeling the COVID-19 epidemics, whose success  could be attributed to the inclusion of self-protection and quarantine .
Revised:  Towards the ODE models, the SEIR-QD and SEIR-PO models generally show a better performance on studying the COVID-19 epidemics, whose success could be attributed to the inclusion of self-protection and quarantine .
Edit intent: clarity
Original:  Towards the ODE models, the SEIR-QD and SEIR-PO models are shown to be suitable for modeling the COVID-19 epidemics, whose success  could be attributed to the inclusion of self-protection and quarantine .
Revised:  Towards the ODE models, the SEIR-QD and SEIR-PO models are shown to be suitable for modeling the COVID-19 epidemics, whose success we believe could be attributed to the inclusion of self-protection and quarantine .
Edit intent: clarity
Original:  However for other countries, it is almost inevitable to see the continuation of the outbreak in the coming months.
Revised:  Borrowing from the experience of China, we made scenario projections on the development of the outbreak in the coming months.
Edit intent: clarity
Original: The COVID-19 has been successfully contained in China but is spreading all over the world.
Revised: The COVID-19 has been spreading all over the world.
Edit intent: coherence
Original:  Ensuring that the matched records in the combined file actually correspond to the same individual or entity is crucial for the validity of any analyses and inferences based on the combined data.
Revised:  Ensuring that the matched records in the combined file correspond to the same individual or entity is crucial for the validity of any analyses and inferences based on the combined data.
Edit intent: clarity
Original:  Haque et al. (submitted for publication ) proposed a Markov Chain based Monte Carlo simulation approach (MaCSim) for assessing linkage accuracy and used ABS ( Australian Bureau of Statistics ) synthetic data to illustrate the utility of the approach . Different blocking strategies were considered to classify matches from non-matches with different levels of accuracy.
Revised:  Haque et al. (submitted ) proposed a Markov Chain based Monte Carlo simulation approach (MaCSim) for assessing linkage accuracy and used ABS ( Australian Bureau of Statistics ) synthetic data to illustrate the utility of the approach . Different blocking strategies were considered to classify matches from non-matches with different levels of accuracy.
Edit intent: clarity
Original:  Haque et al. (submitted for publication ) proposed a Markov Chain based Monte Carlo simulation approach (MaCSim) for assessing linkage accuracy and used ABS ( Australian Bureau of Statistics ) synthetic data to illustrate the utility of the approach . Different blocking strategies were considered to classify matches from non-matches with different levels of accuracy.
Revised:  Haque et al. (submitted for publication ) proposed a Markov Chain based Monte Carlo simulation approach (MaCSim) for assessing a linking method and applied synthetic data provided by the Australian Bureau of Statistics ) synthetic data to illustrate the utility of the approach . Different blocking strategies were considered to classify matches from non-matches with different levels of accuracy.
Edit intent: clarity
Original:  Haque et al. (submitted for publication ) proposed a Markov Chain based Monte Carlo simulation approach (MaCSim) for assessing linkage accuracy and used ABS ( Australian Bureau of Statistics ) synthetic data to illustrate the utility of the approach . Different blocking strategies were considered to classify matches from non-matches with different levels of accuracy.
Revised:  Haque et al. (submitted for publication ) proposed a Markov Chain based Monte Carlo simulation approach (MaCSim) for assessing linkage accuracy and used ABS ( Australian Bureau of Statistics (ABS) to illustrate the utility of the approach . Different blocking strategies were considered to classify matches from non-matches with different levels of accuracy.
Edit intent: clarity
Original:  Haque et al. (submitted for publication ) proposed a Markov Chain based Monte Carlo simulation approach (MaCSim) for assessing linkage accuracy and used ABS ( Australian Bureau of Statistics ) synthetic data to illustrate the utility of the approach . Different blocking strategies were considered to classify matches from non-matches with different levels of accuracy.
Revised:  Haque et al. (submitted for publication ) proposed a Markov Chain based Monte Carlo simulation approach (MaCSim) for assessing linkage accuracy and used ABS ( Australian Bureau of Statistics ) synthetic data to illustrate the utility of the approach . Different blocking strategies are considered to classify matches from non-matches with different levels of accuracy.
Edit intent: fluency
Original:  In this paper, this method is employed to evaluate the accuracy of linkages, using varying block sizes and different cut-off values while minimizing error.
Revised:  In this paper, this method is employed to evaluate the accuracy of individual link using varying block sizes and different cut-off values while minimizing error.
Edit intent: clarity
Original: Record linkage is the process of matching together the records from different data sources that belong to the same entity.
Revised: Record linkage is the process of matching together records from different data sources that belong to the same entity.
Edit intent: clarity
Original:  Record linkage is increasingly being used by  statistical, health, government and business organisations to link administrative, survey, population census and other files to create a robust file for more complete and comprehensive analysis.
Revised:  Record linkage is increasingly being used by many organizations including statistical, health, government and business organisations to link administrative, survey, population census and other files to create a robust file for more complete and comprehensive analysis.
Edit intent: clarity
Original:  Record linkage is increasingly being used by  statistical, health, government and business organisations to link administrative, survey, population census and other files to create a robust file for more complete and comprehensive analysis.
Revised:  Record linkage is increasingly being used by statistical, health, government etc. to link administrative, survey, population census and other files to create a robust file for more complete and comprehensive analysis.
Edit intent: clarity