wanyu/IteraTeR_v2 huggingface dataset:
Original:  This design obviates the need for prior unintuitive or error-prone data flow analysis or application re-architecting , while enforcing the developer's access policy at run time.
Revised:  This design obviates the need for prior unintuitive or error-prone data flow analysis , while enforcing the developer's access policy at run time.
Edit intent: clarity
Original:  Our Pyronia prototype implementation for Python runs on a custom Linux kernel, and incurs low performance overhead on completely unmodified Python applications.
Revised:  Our Pyronia prototype for Python runs on a custom Linux kernel, and incurs low performance overhead on completely unmodified Python applications.
Edit intent: clarity
Original:  Our Pyronia prototype implementation for Python runs on a custom Linux kernel, and incurs low performance overhead on completely unmodified Python applications.
Revised:  Our Pyronia prototype implementation for Python runs on a custom Linux kernel, and incurs low performance overhead on unmodified Python applications.
Edit intent: clarity
Original:  We found that the crowd was able to use a behavior-driven microtask workflow to successfully complete 350 microtasks and implement 13 functions , quickly onboard and submit their first microtask in less than 24 minutes, contribute new behaviors in less than 5 minutes, and together implement a functioning microservice with only four defects .
Revised:  We found that the crowd was able to use a behavior-driven microtask workflow to successfully complete 350 microtasks and implementing 13 functions , quickly onboard and submit their first microtask in less than 24 minutes, contribute new behaviors in less than 5 minutes, and together implement a functioning microservice with only four defects .
Edit intent: coherence
Original:  We found that the crowd was able to use a behavior-driven microtask workflow to successfully complete 350 microtasks and implement 13 functions , quickly onboard and submit their first microtask in less than 24 minutes, contribute new behaviors in less than 5 minutes, and together implement a functioning microservice with only four defects .
Revised:  We found that the crowd was able to use a behavior-driven microtask workflow to successfully complete 350 microtasks and implement 13 functions .
Edit intent: coherence
Original:  We discuss these findings and their implications for incorporating microtask work into open source projects.
Revised:  We discuss the implications of these findings for incorporating crowdsourced programming contributions into traditional software projects.
Edit intent: clarity
Original:  The plan space of our optimizer is richer than the plan spaces based on tree decompositions from prior work.
Revised:  The plan space of our optimizer contains plans that are not in the plan spaces based on tree decompositions from prior work.
Edit intent: clarity
Original:  satisfying the three factor rule . Using a sparse feedback matrix, we show that a neuron needs only a fraction of the information previously used by the feedback alignment algorithms to yield results which are competitive with backpropagation . Consequently, memory and compute can be partitioned and distributed whichever way produces the most efficient forward pass so long as a single error can be delivered to each neuron.
Revised:  satisfying the three factor rule . Using a sparse feedback matrix, we show that a neuron needs only a fraction of the information previously used by the feedback alignment algorithms . Consequently, memory and compute can be partitioned and distributed whichever way produces the most efficient forward pass so long as a single error can be delivered to each neuron.
Edit intent: clarity
Original:  We evaluate our algorithm using standard data sets, including ImageNet, to address the concern of scaling to challenging problems.
Edit intent: coherence
Original:  Our results show orders of magnitude improvement in data movement and 2x improvement in multiply-and-accumulate operations over backpropagation  .
Revised:  Our results show orders of magnitude improvement in data movement and 2\times improvement in multiply-and-accumulate operations over backpropagation .
Edit intent: clarity
Original: This paper presents a sequence of self-starting deferred correction (DC) schemes built recursively from a modified trapezoidal rule for the numerical solution of general first order ordinary differential equations  .
Revised: TThis paper presents a sequence of self-starting deferred correction (DC) schemes built recursively from a modified trapezoidal rule for the numerical solution of general first order ordinary differential equations .
Edit intent: fluency
Original: This paper presents a sequence of self-starting deferred correction (DC) schemes built recursively from a modified trapezoidal rule for the numerical solution of general first order ordinary differential equations  .
Revised: This paper presents a sequence of deferred correction (DC) schemes built recursively from a modified trapezoidal rule for the numerical solution of general first order ordinary differential equations .
Edit intent: clarity
Original: This paper presents a sequence of self-starting deferred correction (DC) schemes built recursively from a modified trapezoidal rule for the numerical solution of general first order ordinary differential equations  .
Revised: This paper presents a sequence of self-starting deferred correction (DC) schemes built recursively from a modified trapezoidal rule for the numerical solution of general first order ordinary differential equations (ODEs) .
Edit intent: clarity
Original:  It is proven that each scheme is A-stable and that the correction on a scheme DC2j ( of order 2j of accuracy) leads to a scheme DC(2j+2) (of order 2j+2).
Revised:  It is proven that each scheme is A-stable and that the correction on a scheme DC(2j) ( of order 2j of accuracy) leads to a scheme DC(2j+2) (of order 2j+2).
Edit intent: fluency
Original:  The proof is based on a deferred correction condition (DCC) which guarantees the order of accuracy.
Revised:  The order of accuracy is guaranteed by a deferred correction condition (DCC) which guarantees the order of accuracy.
Edit intent: clarity
Original: %DIFDELCMD < \keywords{%%% ordinary differential equations, high order time-stepping methods, deferred correction, A-stability .
Revised: %DIFDELCMD < \keywords{%%% a satisfactory stability .
Edit intent: clarity
Original: TThis paper presents a sequence of deferred correction (DC) schemes built recursively from the implicit midpoint scheme for the numerical solution of general first order ordinary differential equations (ODEs).
Revised: This paper presents a sequence of deferred correction (DC) schemes built recursively from the implicit midpoint scheme for the numerical solution of general first order ordinary differential equations (ODEs).
Edit intent: fluency
Original:  It is proven that each scheme is A-stable  and that the correction on a scheme DC(2j) ( of order 2j of accuracy ) leads to a scheme DC(2j+2) ( of order 2j+ 2).
Revised:  It is proven that each scheme is A-stable and that the correction on a scheme DC(2j) of order 2j of accuracy ) leads to a scheme DC(2j+2) ( of order 2j+ 2).
Edit intent: fluency
Original:  It is proven that each scheme is A-stable  and that the correction on a scheme DC(2j) ( of order 2j of accuracy ) leads to a scheme DC(2j+2) ( of order 2j+ 2).
Revised:  It is proven that each scheme is A-stable and that the correction on a scheme DC(2j) ( of order 2j of accuracy leads to a scheme DC(2j+2) ( of order 2j+ 2).
Edit intent: fluency
Original:  It is proven that each scheme is A-stable  and that the correction on a scheme DC(2j) ( of order 2j of accuracy ) leads to a scheme DC(2j+2) ( of order 2j+ 2).
Revised:  It is proven that each scheme is A-stable and that the correction on a scheme DC(2j) ( of order 2j of accuracy ) leads to a scheme DC(2j+2) of order 2j+ 2).
Edit intent: fluency
Original:  It is proven that each scheme is A-stable  and that the correction on a scheme DC(2j) ( of order 2j of accuracy ) leads to a scheme DC(2j+2) ( of order 2j+ 2).
Revised:  It is proven that each scheme is A-stable and that the correction on a scheme DC(2j) ( of order 2j of accuracy ) leads to a scheme DC(2j+2) ( of order 2j+ 2.
Edit intent: fluency
Original:  The order of accuracy is guaranteed by a deferred correction condition (DCC) . Numerical experiments with standard stiff and non-stiff ODEs are performed with the DC2, ..., DC10 schemes.
Revised:  The order of accuracy is guaranteed by a deferred correction condition . Numerical experiments with standard stiff and non-stiff ODEs are performed with the DC2, ..., DC10 schemes.
Edit intent: clarity
Original:  It is proven that each scheme is A-stable, satisfies a B-convergence property, and that the correction on a scheme DC(2j) of order 2j of accuracy leads to a scheme DC(2j +2 ) of order 2j+2.
Revised:  It is proven that each scheme is A-stable, satisfies a B-convergence property, and that the correction on a scheme DC(2j) of order 2j of accuracy leads to a scheme DC2j +2 ) of order 2j+2.
Edit intent: fluency
Original:  It is proven that each scheme is A-stable, satisfies a B-convergence property, and that the correction on a scheme DC(2j) of order 2j of accuracy leads to a scheme DC(2j +2 ) of order 2j+2.
Revised:  It is proven that each scheme is A-stable, satisfies a B-convergence property, and that the correction on a scheme DC(2j) of order 2j of accuracy leads to a scheme DC(2j +2 of order 2j+2.
Edit intent: fluency
Original:  We preset a new software framework called Evolutionary Cell Aided Design(ECAD) meant to aid in the exploration and design of Neural Network Architectures(NNAs) for reconfigurable hardware.
Revised:  We present a new software framework called Evolutionary Cell Aided Design(ECAD) meant to aid in the exploration and design of Neural Network Architectures(NNAs) for reconfigurable hardware.
Edit intent: fluency
Original:  We present a new software framework called Evolutionary Cell Aided Design(ECAD) meant to aid in the exploration and design of  Neural Network Architectures(NNAs) for reconfigurable hardware.
Revised:  We present a novel software framework called Evolutionary Cell Aided Design(ECAD) meant to aid in the exploration and design of Neural Network Architectures(NNAs) for reconfigurable hardware.
Edit intent: clarity
Original:  The framework uses evolutionary algorithms to search for efficient hardware architectures.
Edit intent: coherence
Original: This paper presents PBBFMM3D: a parallel black-box fast multipole method that accelerates kernel matrix-vector multiplications where the kernel is a non-oscillatory function in three dimensions.
Revised: We introduce a parallel black-box fast multipole method that accelerates kernel matrix-vector multiplications where the kernel is a non-oscillatory function in three dimensions.
Edit intent: clarity
Original: This paper presents PBBFMM3D: a parallel black-box fast multipole method that accelerates kernel matrix-vector multiplications where the kernel is a non-oscillatory function in three dimensions.
Revised: This paper presents PBBFMM3D:, a parallel black-box fast multipole method that accelerates kernel matrix-vector multiplications where the kernel is a non-oscillatory function in three dimensions.
Edit intent: fluency
Original: This paper presents PBBFMM3D: a parallel black-box fast multipole method that accelerates kernel matrix-vector multiplications where the kernel is a non-oscillatory function in three dimensions.
Revised: This paper presents PBBFMM3D: a parallel black-box method for computing kernel matrix-vector multiplications where the kernel is a non-oscillatory function in three dimensions.
Edit intent: clarity
Original: This paper presents PBBFMM3D: a parallel black-box fast multipole method that accelerates kernel matrix-vector multiplications where the kernel is a non-oscillatory function in three dimensions.
Revised: This paper presents PBBFMM3D: a parallel black-box fast multipole method that accelerates kernel matrix-vector multiplication, where the underlying kernel is a non-oscillatory function in three dimensions.
Edit intent: clarity
Original:  Such problems arise from a wide range of fields,e.g., computational mechanics, geosciences and machine learning.
Revised:  e.g., computational mechanics, geosciences and machine learning.
Edit intent: clarity
Original:  Such problems arise from a wide range of fields,e.g., computational mechanics, geosciences and machine learning.
Revised:  Such problems arise from a wide range of fields, computational mechanics, geosciences and machine learning.
Edit intent: clarity
Original:  Such problems arise from a wide range of fields,e.g., computational mechanics, geosciences and machine learning.
Revised:  Such problems arise from a wide range of fields,e.g., 
Edit intent: clarity
Original:  While a naive direct evaluation has an O (N^2) complexity in time and storage, which is prohibitive for large-scale applications, PBBFMM3D reduces the costs to O  (N) . In contrast to other fast methods that require the knowledge of the explicit kernel formula, PBBFMM3D requires only the ability to evaluate the kernel  .
Revised:  While a naive method requires \O (N^2) complexity in time and storage, which is prohibitive for large-scale applications, PBBFMM3D reduces the costs to O (N) . In contrast to other fast methods that require the knowledge of the explicit kernel formula, PBBFMM3D requires only the ability to evaluate the kernel .
Edit intent: coherence
Original:  While a naive direct evaluation has an O (N^2) complexity in time and storage, which is prohibitive for large-scale applications, PBBFMM3D reduces the costs to O  (N) . In contrast to other fast methods that require the knowledge of the explicit kernel formula, PBBFMM3D requires only the ability to evaluate the kernel  .
Revised:  While a naive direct evaluation has an O (N^2) computation, (N) . In contrast to other fast methods that require the knowledge of the explicit kernel formula, PBBFMM3D requires only the ability to evaluate the kernel .
Edit intent: clarity
Original:  While a naive direct evaluation has an O (N^2) complexity in time and storage, which is prohibitive for large-scale applications, PBBFMM3D reduces the costs to O  (N) . In contrast to other fast methods that require the knowledge of the explicit kernel formula, PBBFMM3D requires only the ability to evaluate the kernel  .
Revised:  While a naive direct evaluation has an O (N^2) complexity in time and storage, which is prohibitive for large-scale applications, PBBFMM3D reduces the costs to OPBBFMM3D (N) . In contrast to other fast methods that require the knowledge of the explicit kernel formula, PBBFMM3D requires only the ability to evaluate the kernel .
Edit intent: clarity
Original:  While a naive direct evaluation has an O (N^2) complexity in time and storage, which is prohibitive for large-scale applications, PBBFMM3D reduces the costs to O  (N) . In contrast to other fast methods that require the knowledge of the explicit kernel formula, PBBFMM3D requires only the ability to evaluate the kernel  .
Revised:  While a naive direct evaluation has an O (N^2) complexity in time and storage, which is prohibitive for large-scale applications, PBBFMM3D reduces the costs to O (N) work. In particular, our algorithm requires only the ability to evaluate the kernel .
Edit intent: clarity
Original:  While a naive direct evaluation has an O (N^2) complexity in time and storage, which is prohibitive for large-scale applications, PBBFMM3D reduces the costs to O  (N) . In contrast to other fast methods that require the knowledge of the explicit kernel formula, PBBFMM3D requires only the ability to evaluate the kernel  .
Revised:  While a naive direct evaluation has an O (N^2) complexity in time and storage, which is prohibitive for large-scale applications, PBBFMM3D reduces the costs to O (N) . In contrast to other fast methods that require the knowledge of the explicit kernel formula, PBBFMM3D requires only the ability to evaluate the kernel function, and is thus a black-box method .
Edit intent: clarity
Original:  To further accelerate the computation on shared-memory machines, the parallelism in PBBFMM3D was analyzed and implemented using OpenMP.
Revised:  To further accelerate the computation on shared-memory machines, a parallel algorithm is presented and implemented using OpenMP.
Edit intent: clarity
Original: We introducePBBFMM3D , a parallel black-box method for computing kernel matrix-vector multiplication, where the underlying kernel is a non-oscillatory function in three dimensions.
Revised: PBBFMM3D , a parallel black-box method for computing kernel matrix-vector multiplication, where the underlying kernel is a non-oscillatory function in three dimensions.
Edit intent: coherence
Original: We introducePBBFMM3D , a parallel black-box method for computing kernel matrix-vector multiplication, where the underlying kernel is a non-oscillatory function in three dimensions.
Revised: We introduce , a parallel black-box method for computing kernel matrix-vector multiplication, where the underlying kernel is a non-oscillatory function in three dimensions.
Edit intent: coherence
Original: We introducePBBFMM3D , a parallel black-box method for computing kernel matrix-vector multiplication, where the underlying kernel is a non-oscillatory function in three dimensions.
Revised: We introducePBBFMM3D Kernel matrix-vector multiplication, where the underlying kernel is a non-oscillatory function in three dimensions.
Edit intent: clarity
Original:  While a naive method requires \O (N^2) computation,PBBFMM3D reduces the cost to \O (N) work.
Revised:  While a naive method requires O (N^2) computation,PBBFMM3D reduces the cost to \O (N) work.
Edit intent: fluency
Original:  While a naive method requires \O (N^2) computation,PBBFMM3D reduces the cost to \O (N) work.
Revised:  While a naive method requires \O (N^2) PBBFMM3D reduces the cost to \O (N) work.
Edit intent: clarity
Original:  While a naive method requires \O (N^2) computation,PBBFMM3D reduces the cost to \O (N) work.
Revised:  While a naive method requires \O (N^2) computation, reduces the cost to \O (N) work.
Edit intent: clarity
Original:  In particular, our algorithm requires only the ability to evaluate the kernel function, and is thus a black-box method.
Revised:  In particular, our algorithm requires only the ability to evaluate the kernel function, offering a black-box method.
Edit intent: clarity
Original:  To further accelerate the computation on shared-memory machines , a parallel algorithm is presented and implemented using% {red \verb|OpenMP| } %DIFDELCMD < \verb|OpenMP|%%% , which achieved at most 19\times speedup on 32 cores in our numerical experiments.
Revised:  To further accelerate the computation on shared-memory machines % {red \verb|OpenMP| } %DIFDELCMD < \verb|OpenMP|%%% , which achieved at most 19\times speedup on 32 cores in our numerical experiments.
Edit intent: coherence
Original:  A real-world application in geostatistics is also presented, wherePBBFMM3D is used in computing the truncated eigen-decomposition (a.k.a., principle component analysis ) of a covariance matrix (a.k.a., graph Laplacian) .
Revised:  A real-world application in geostatistics PBBFMM3D is used in computing the truncated eigen-decomposition (a.k.a., principle component analysis ) of a covariance matrix (a.k.a., graph Laplacian) .
Edit intent: clarity
Original:  A real-world application in geostatistics is also presented, wherePBBFMM3D is used in computing the truncated eigen-decomposition (a.k.a., principle component analysis ) of a covariance matrix (a.k.a., graph Laplacian) .
Revised:  A real-world application in geostatistics is also presented, where is used in computing the truncated eigen-decomposition (a.k.a., principle component analysis ) of a covariance matrix (a.k.a., graph Laplacian) .
Edit intent: coherence
Original:  A real-world application in geostatistics is also presented, wherePBBFMM3D is used in computing the truncated eigen-decomposition (a.k.a., principle component analysis ) of a covariance matrix (a.k.a., graph Laplacian) .
Revised:  A real-world application in geostatistics is also presented, wherePBBFMM3D is used in computing the truncated eigen-decomposition (a.k.a., principle component analysis of covariance matrices .
Edit intent: coherence
Original:  The estimates of trading strategy success, cost of trading and slippage are considered along with an offline benchmark portfolio algorithm for performance comparison.
Revised:  The estimates of trading strategy success, cost of trading and slippage are considered along with an online benchmark portfolio algorithm for performance comparison.
Edit intent: clarity
Original:  We focus on  the changes in microbial communities over time and the factors influencing them.
Revised:  We focus on microbial communities, the changes in microbial communities over time and the factors influencing them.
Edit intent: fluency
Original:  We focus on  the changes in microbial communities over time and the factors influencing them.
Revised:  We focus on the changes in these communities over time and the factors influencing them.
Edit intent: clarity
Original:  Finally, we discuss how these communities present on residues and their interactions with pathogens could be used: from the identification of beneficial groups of microorganisms naturally present to their preservation , rather than the introduction of exogenous biocontrol agents as a 'treatment  '.
Revised:  Finally, we discuss how these communities present on residues could be used: from the identification of beneficial groups of microorganisms naturally present to their preservation , rather than the introduction of exogenous biocontrol agents as a 'treatment '.
Edit intent: clarity
Original:  Finally, we discuss how these communities present on residues and their interactions with pathogens could be used: from the identification of beneficial groups of microorganisms naturally present to their preservation , rather than the introduction of exogenous biocontrol agents as a 'treatment  '.
Revised:  Finally, we discuss how these communities present on residues and their interactions with pathogens could be used: from the identification of beneficial groups of microorganisms naturally present to their preservation , rather than the introduction of a single exogenous biocontrol species designed as a 'treatment '.
Edit intent: clarity
Original:  Finally, we discuss how these communities present on residues and their interactions with pathogens could be used: from the identification of beneficial groups of microorganisms naturally present to their preservation , rather than the introduction of exogenous biocontrol agents as a 'treatment  '.
Revised:  Finally, we discuss how these communities present on residues and their interactions with pathogens could be used: from the identification of beneficial groups of microorganisms naturally present to their preservation , rather than the introduction of exogenous biocontrol agents as a 'treatment product '.
Edit intent: clarity
Original:  MFE takes advantage of averaging effects in models with a large number of agents .
Revised:  MFE takes advantage of averaging effects in models with a large number of players .
Edit intent: clarity
Original:  First, our main result in the paper provides conditions that ensure the uniqueness of an MFE.
Revised:  First, our main result provides conditions that ensure the uniqueness of an MFE.
Edit intent: clarity
Original:  However, in our setting the phase field is allowed to be a function of bounded variation, instead of an H1-function .
Revised:  However, in our setting the phase field is allowed to be a function of bounded variation, instead of an H^1-function .
Edit intent: clarity
Original:  A comparison to the classical Ambrosio-Tortorelli approximation, where the phase field is an H1-function , shows that the new model leads to sharper phase fields.
Revised:  A comparison to the classical Ambrosio-Tortorelli approximation, where the phase field is an H^1-function , shows that the new model leads to sharper phase fields.
Edit intent: clarity