wanyu/IteraTeR_v2 huggingface dataset:
Original:  Moreover, we use reinforcement learning techniques  to train server policies which effectively probe the client's decisions to achieve more sample-efficient authentication , while making modelling attacks as difficult as possible via entropy-maximization principles.
Revised:  Moreover, we use reinforcement learning techniques to train server policies which effectively probe a client's decisions to achieve more sample-efficient authentication , while making modelling attacks as difficult as possible via entropy-maximization principles.
Edit intent: fluency
Original:  Likewise, it has been hypothesized that the presence of certain infections can be identified from cells' equilibrium behavior.
Edit intent: coherence
Original: This paper presents PaSh, a shell aimed at {\scshape   parallelizing POSIX shell scripts through a combination of program transformations and runtime primitives . Given a script, PaSh {\scshape  converts it to a data-flow graph, performs a series of analyses that aim at exposing parallelismwhile preserving its sequential semantics , and then converts  dataflow graph back into a script that uses POSIX constructs to explicitly guide parallelism .
Revised: This paper presents {\scshape parallelizing POSIX shell scripts through a combination of program transformations and runtime primitives . Given a script, PaSh {\scshape converts it to a data-flow graph, performs a series of analyses that aim at exposing parallelismwhile preserving its sequential semantics , and then converts dataflow graph back into a script that uses POSIX constructs to explicitly guide parallelism .
Edit intent: clarity
Original: This paper presents PaSh, a shell aimed at {\scshape   parallelizing POSIX shell scripts through a combination of program transformations and runtime primitives . Given a script, PaSh {\scshape  converts it to a data-flow graph, performs a series of analyses that aim at exposing parallelismwhile preserving its sequential semantics , and then converts  dataflow graph back into a script that uses POSIX constructs to explicitly guide parallelism .
Revised: This paper presents PaSh, a shell aimed at {\scshape , a system for parallelizing POSIX shell scripts through a combination of program transformations and runtime primitives . Given a script, PaSh {\scshape converts it to a data-flow graph, performs a series of analyses that aim at exposing parallelismwhile preserving its sequential semantics , and then converts dataflow graph back into a script that uses POSIX constructs to explicitly guide parallelism .
Edit intent: clarity
Original: This paper presents PaSh, a shell aimed at {\scshape   parallelizing POSIX shell scripts through a combination of program transformations and runtime primitives . Given a script, PaSh {\scshape  converts it to a data-flow graph, performs a series of analyses that aim at exposing parallelismwhile preserving its sequential semantics , and then converts  dataflow graph back into a script that uses POSIX constructs to explicitly guide parallelism .
Revised: This paper presents PaSh, a shell aimed at {\scshape parallelizing POSIX shell scripts . Given a script, PaSh {\scshape converts it to a data-flow graph, performs a series of analyses that aim at exposing parallelismwhile preserving its sequential semantics , and then converts dataflow graph back into a script that uses POSIX constructs to explicitly guide parallelism .
Edit intent: clarity
Original: This paper presents PaSh, a shell aimed at {\scshape   parallelizing POSIX shell scripts through a combination of program transformations and runtime primitives . Given a script, PaSh {\scshape  converts it to a data-flow graph, performs a series of analyses that aim at exposing parallelismwhile preserving its sequential semantics , and then converts  dataflow graph back into a script that uses POSIX constructs to explicitly guide parallelism .
Revised: This paper presents PaSh, a shell aimed at {\scshape parallelizing POSIX shell scripts through a combination of program transformations and runtime primitives . Given a script, {\scshape converts it to a data-flow graph, performs a series of analyses that aim at exposing parallelismwhile preserving its sequential semantics , and then converts dataflow graph back into a script that uses POSIX constructs to explicitly guide parallelism .
Edit intent: fluency
Original: This paper presents PaSh, a shell aimed at {\scshape   parallelizing POSIX shell scripts through a combination of program transformations and runtime primitives . Given a script, PaSh {\scshape  converts it to a data-flow graph, performs a series of analyses that aim at exposing parallelismwhile preserving its sequential semantics , and then converts  dataflow graph back into a script that uses POSIX constructs to explicitly guide parallelism .
Revised: This paper presents PaSh, a shell aimed at {\scshape parallelizing POSIX shell scripts through a combination of program transformations and runtime primitives . Given a script, PaSh {\scshape converts it to a dataflow graph, performs a series of analyses that aim at exposing parallelismwhile preserving its sequential semantics , and then converts dataflow graph back into a script that uses POSIX constructs to explicitly guide parallelism .
Edit intent: fluency
Original: This paper presents PaSh, a shell aimed at {\scshape   parallelizing POSIX shell scripts through a combination of program transformations and runtime primitives . Given a script, PaSh {\scshape  converts it to a data-flow graph, performs a series of analyses that aim at exposing parallelismwhile preserving its sequential semantics , and then converts  dataflow graph back into a script that uses POSIX constructs to explicitly guide parallelism .
Revised: This paper presents PaSh, a shell aimed at {\scshape parallelizing POSIX shell scripts through a combination of program transformations and runtime primitives . Given a script, PaSh {\scshape converts it to a data-flow graph, performs a series of semantics-preserving program transformations that expose parallelism , and then converts dataflow graph back into a script that uses POSIX constructs to explicitly guide parallelism .
Edit intent: clarity
Original: This paper presents PaSh, a shell aimed at {\scshape   parallelizing POSIX shell scripts through a combination of program transformations and runtime primitives . Given a script, PaSh {\scshape  converts it to a data-flow graph, performs a series of analyses that aim at exposing parallelismwhile preserving its sequential semantics , and then converts  dataflow graph back into a script that uses POSIX constructs to explicitly guide parallelism .
Revised: This paper presents PaSh, a shell aimed at {\scshape parallelizing POSIX shell scripts through a combination of program transformations and runtime primitives . Given a script, PaSh {\scshape converts it to a data-flow graph, performs a series of analyses that aim at exposing parallelismwhile preserving its sequential semantics , and then converts the dataflow graph back into a script that uses POSIX constructs to explicitly guide parallelism .
Edit intent: clarity
Original: This paper presents PaSh, a shell aimed at {\scshape   parallelizing POSIX shell scripts through a combination of program transformations and runtime primitives . Given a script, PaSh {\scshape  converts it to a data-flow graph, performs a series of analyses that aim at exposing parallelismwhile preserving its sequential semantics , and then converts  dataflow graph back into a script that uses POSIX constructs to explicitly guide parallelism .
Revised: This paper presents PaSh, a shell aimed at {\scshape parallelizing POSIX shell scripts through a combination of program transformations and runtime primitives . Given a script, PaSh {\scshape converts it to a data-flow graph, performs a series of analyses that aim at exposing parallelismwhile preserving its sequential semantics , and then converts dataflow graph back into a script -- one that adds POSIX constructs to explicitly guide parallelism .
Edit intent: clarity
Original:  An accompanying parallelizability study of POSIX and GNU commands , two large and commonly used groups , informs PaSh's annotation language and results in its equivalent of a data-parallel standard library{\scshape   .
Revised:  An accompanying parallelizability study of POSIX and GNU commands -- two large and commonly used groups , informs PaSh's annotation language and results in its equivalent of a data-parallel standard library{\scshape .
Edit intent: fluency
Original:  An accompanying parallelizability study of POSIX and GNU commands , two large and commonly used groups , informs PaSh's annotation language and results in its equivalent of a data-parallel standard library{\scshape   .
Revised:  An accompanying parallelizability study of POSIX and GNU commands , two large and commonly used groups -- guides the annotation language and results in its equivalent of a data-parallel standard library{\scshape .
Edit intent: clarity
Original:  An accompanying parallelizability study of POSIX and GNU commands , two large and commonly used groups , informs PaSh's annotation language and results in its equivalent of a data-parallel standard library{\scshape   .
Revised:  An accompanying parallelizability study of POSIX and GNU commands , two large and commonly used groups , informs PaSh's annotation language and optimized aggregator library that{\scshape .
Edit intent: clarity
Original:  Finally, PaSh {\scshape  {\scshape  's Unix-aware runtime primitives address several practical issues related to performance and correctness.
Revised:  Finally, {\scshape {\scshape 's Unix-aware runtime primitives address several practical issues related to performance and correctness.
Edit intent: fluency
Original:  Finally, PaSh {\scshape  {\scshape  's Unix-aware runtime primitives address several practical issues related to performance and correctness.
Revised:  Finally, PaSh {\scshape 's{\scshape 's Unix-aware runtime primitives address several practical issues related to performance and correctness.
Edit intent: fluency
Original:  PaSh's extensive evaluation , combining several classic and modern Unixscripts, shows significant benefits across several axes---with order-of-magnitude performance improvements{\scshape   stemming from the combination of its program transformations and runtime primitives.
Revised:  PaSh's extensive evaluation , combining several classic and modern Unixscripts, shows significant benefits across several axes---with order-of-magnitude performance improvements{\scshape Unix stemming from the combination of its program transformations and runtime primitives.
Edit intent: fluency
Original:  Here we make an original analyses with this time dependent data adopting a more informative regression analysis.
Revised:  Here we make the analyses with this time dependent data adopting a more informative regression analysis.
Edit intent: clarity
Original: Understanding of the evolved biological function of NREM and slow wave sleep has advanced considerably in the past decade.
Revised: Understanding of the evolved biological function of sleep has advanced considerably in the past decade.
Edit intent: clarity
Original:  However, no equivalent understanding of REM sleep and dreams has emerged.
Revised:  However, no equivalent understanding of dreams has emerged.
Edit intent: clarity
Original:  This ubiquitous problem in DNNs is often solved by experimenters via "noise injections" in the form of noisy or corrupted inputs.
Revised:  This ubiquitous problem in DNNs is often solved by modelers via "noise injections" in the form of noisy or corrupted inputs.
Edit intent: clarity
Original:  This is the first \varepsilon-BIC to BIC transformation that preserves welfare and provides bounded revenue loss.
Revised:  This is the first \varepsilon-BIC to BIC transformation that preserves welfare and provides negligible revenue loss.
Edit intent: clarity
Original: In this paper, we investigate the problem of transforming an \varepsilon-BIC mechanism into an exactly BIC mechanism without loss of social welfare, working in a general mechanism design setting.
Revised: In this paper, we provide a transform from an \varepsilon-BIC mechanism into an exactly BIC mechanism without loss of social welfare, working in a general mechanism design setting.
Edit intent: clarity
Original:  We show that the revenue loss bound is tight given the requirement to maintain social welfare.
Edit intent: coherence
Original:  The revenue loss achieved by our transformation is incomparable to these earlier approaches and can sometimes be significantly less.
Revised:  The revenue loss achieved by our transformation is incomparable to these earlier approaches and can be significantly less.
Edit intent: clarity
Original: } We also analyze \varepsilon-expected ex-post IC (\varepsilon-EEIC) mechanisms~DuettingFJLLP12 , and provide a welfare-preserving transformation  with the same revenue loss guarantee for the special case of uniform type distributions .
Revised: } We also analyze \varepsilon-expected ex-post IC (\varepsilon-EEIC) mechanisms~DuettingFJLLP12 . We provide a welfare-preserving transformation with the same revenue loss guarantee for the special case of uniform type distributions .
Edit intent: coherence
Original: } We also analyze \varepsilon-expected ex-post IC (\varepsilon-EEIC) mechanisms~DuettingFJLLP12 , and provide a welfare-preserving transformation  with the same revenue loss guarantee for the special case of uniform type distributions .
Revised: } We also analyze \varepsilon-expected ex-post IC (\varepsilon-EEIC) mechanisms~DuettingFJLLP12 , and provide a welfare-preserving transformation with the same revenue loss guarantee for uniform type distributions .
Edit intent: clarity
Original:  In particular, we can obtain the global convergence to global optimum of  alternating direction method of multipliers (ADMM) for this problem.
Revised:  In particular, we can obtain the global convergence to global optimum of the alternating direction method of multipliers (ADMM) for this problem.
Edit intent: fluency
Original:  Numerical experiments for applications in  BEC validate our theories and demonstrate the effectiveness of ADMM for solving this problem .
Revised:  Numerical experiments for applications in BEC validate our theories .
Edit intent: coherence
Original: We study a special nonconvex optimization problem with a single spherical constraint to find a global minimizer of it.
Revised: We consider a special nonconvex optimization problem with a single spherical constraint to find a global minimizer of it.
Edit intent: fluency
Original:  We show that with the property of NEPv , any algorithm finding the positive stationary point of this optimization problem actually finds its global minimum, such as the regularized Newton (RN) method.
Revised:  We show that with the property of NEPv , any algorithm finding the positive stationary point of this optimization problem finds its global minimum, such as the regularized Newton (RN) method.
Edit intent: clarity
Original:  In particular, we can obtain the global convergence to global optimum of the  alternating direction method of multipliers (ADMM) for this problem.
Revised:  In particular, we obtain the global convergence to global optimum of the alternating direction method of multipliers (ADMM) for this problem.
Edit intent: clarity
Original:  Here, we compare the credibility of tweets about COVID-19  to datasets pertaining to other health issues.
Revised:  Here, we compare the credibility of tweets about COVID-19 to other health issues.
Edit intent: clarity
Original: Several high-profile sources have focused worldwide attention on the dangers of misinformation about COVID, with the World Health Organization declaring a COVID-19 social media ``infodemic''.
Revised: Several high-profile sources have focused worldwide attention on the dangers of misinformation about COVID, with the World Health Organization declared a COVID-19 social media ``infodemic''.
Edit intent: fluency
Original: 5, 6 Here, we report the results of an analysis of over 500 million social media posts from Twitter and Facebook  between March 8 and May 1, 2020.
Revised: 5, 6 Here, we report the results of an analysis of over 500 million posts from Twitter and Facebook between March 8 and May 1, 2020.
Edit intent: clarity
Original:  We find that messages about COVID-19 are more likely to come from high quality sources , with clearer provenance, when compared to other health topics.
Revised:  We find that messages about COVID-19 were more likely to come from high quality sources , with clearer provenance, when compared to other health topics.
Edit intent: fluency
Original:  Although the behaviors were correlated, the sociality measures derived from observed data fell outside the distribution of those derived from the reference model .
Revised:  Although the behaviors were correlated, the first reference model suggests that the two behaviors convey different information about some social properties and should therefore not be pooled .
Edit intent: clarity
Original:  This framework can be used for any type of behavior and question, however, caution should be used when interpreting the results as some measures are sensitive to data properties , such as unequal rates of observed behavior .
Revised:  Awareness of how selected measurements can be affected by data properties is warranted, but nonetheless our framework disentangles these efforts and as a result can be used for myriad types of behaviors and questions .
Edit intent: clarity
Original:  }{\bf   the resulting growth process has remained controversial .
Revised:  }{\bf 102 the resulting growth process has remained controversial .
Edit intent: fluency
Original:  Moreover, the interface width exhibits logarithmic growth with the time, instead of saturation , in the long-time limit.
Revised:  Moreover, in the long-time limit the interface width exhibits logarithmic growth with the time, instead of saturation , in the long-time limit.
Edit intent: fluency
Original:  We conclude with numerical simulations demonstrating their predicted convergence rates on two multirate test problems, and compare their efficiency against  legacy IMEX multirate  methods.
Revised:  We conclude with numerical simulations on two multirate test problems, and compare their efficiency against legacy IMEX multirate methods.
Edit intent: clarity
Original:  We conclude with numerical simulations demonstrating their predicted convergence rates on two multirate test problems, and compare their efficiency against  legacy IMEX multirate  methods.
Revised:  We conclude with numerical simulations demonstrating their predicted convergence rates on two multirate test problems, demonstrating the methods' predicted convergence rates and comparing their efficiency against legacy IMEX multirate methods.
Edit intent: clarity
Original:  In addition to defining these methods, we prove that they may be viewed as specific instances of generalized-structure additive Runge--Kutta (GARK ) methods, and derive a set of order conditions on the IMEX-MRI-GARK coefficients to guarantee both third and fourth order accuracy for the overall multirate method.
Revised:  In addition to defining these methods, we prove that they may be viewed as specific instances of GARK methods, and derive a set of order conditions on the IMEX-MRI-GARK coefficients to guarantee both third and fourth order accuracy for the overall multirate method.
Edit intent: clarity
Original: The recent introduction of Unified Virtual Memory (UVM) in GPUs offers a new programming model that allows GPUs and CPUs to share the same virtual memory space,  shifts the complex memory management from programmers to GPU driver/ hardware , and enables kernel execution even when memory is oversubscribed.
Revised: The recent introduction of Unified Virtual Memory (UVM) in GPUs offers a new programming model that allows GPUs and CPUs to share the same virtual memory space, which shifts the complex memory management from programmers to GPU driver/ hardware , and enables kernel execution even when memory is oversubscribed.
Edit intent: coherence
Original: The recent introduction of Unified Virtual Memory (UVM) in GPUs offers a new programming model that allows GPUs and CPUs to share the same virtual memory space,  shifts the complex memory management from programmers to GPU driver/ hardware , and enables kernel execution even when memory is oversubscribed.
Revised: The recent introduction of Unified Virtual Memory (UVM) in GPUs offers a new programming model that allows GPUs and CPUs to share the same virtual memory space, shifts the complex memory management from programmers to GPU driver/ hardware and enables kernel execution even when memory is oversubscribed.
Edit intent: fluency
Original:  Meanwhile, UVM may also incur considerable performance overhead due to the tracking and data migration along with the special handling of page faults and page table walk.
Revised:  Meanwhile, UVM may also incur considerable performance overhead due to tracking and data migration along with the special handling of page faults and page table walk.
Edit intent: fluency
Original:  Meanwhile, UVM may also incur considerable performance overhead due to the tracking and data migration along with the special handling of page faults and page table walk.
Revised:  Meanwhile, UVM may also incur considerable performance overhead due to the tracking and data migration along with special handling of page faults and page table walk.
Edit intent: fluency
Original: We consider the restricted case of the Santa Claus problem and improve the current best approximation ratio by presenting a polynomial time 12-approximation algorithm using linear programming and novel quadratic program that we consider .
Revised: We consider the restricted case of the problem and improve the current best approximation ratio by presenting a polynomial time 12-approximation algorithm using linear programming and novel quadratic program that we consider .
Edit intent: coherence
Original:  However, the natural physical mechanisms of our society promote cooperation.
Revised:  However, natural physical mechanisms of our society promote cooperation.
Edit intent: fluency
Original:  The loci of evolutionary paths of the cooperation and the defection are correlated, but not  full complement of each other.
Revised:  The loci of evolutionary paths of the cooperation and the defection are correlated, but not a full complement of each other.
Edit intent: fluency
Original:  Moreover, the execution of a particular evolutionary rule through algorithm method over the long time experiences highly sensitive influence of the model parameters.
Revised:  Moreover, the execution of a particular evolutionary rule through algorithm method over the long time encounters highly sensitive influence of the model parameters.
Edit intent: clarity
Original:  Given a sampling resolution parameter h , state-of-the-art discrete methods yield O(h ^2) approximations at most .
Revised:  Given a sampling resolution parameter h , state-of-the-art discrete methods yield O(h ) provable approximations .
Edit intent: clarity
Original:  We consider classical sketching algorithms which first  compress data by multiplication with a random "sketch matrix".
Revised:  We consider classical sketching algorithms which first quickly compress data by multiplication with a random "sketch matrix".
Edit intent: clarity
Original:  We prove the worst-case property for each of ] the problems and their modified algorithms .
Revised:  We prove the worst-case property for each of 2019] the problems and their modified algorithms .
Edit intent: fluency
Original:  In this model, a query involves specifying a subset S of the domain, and the output received is a sample drawn from the distribution conditioned on being in S.
Revised:  In this model, a query specifies a subset S of the domain, and the output received is a sample drawn from the distribution conditioned on being in S.
Edit intent: clarity