wanyu/IteraTeR_v2 huggingface dataset:
Original:  The employment of the Multiple-Input and Multiple-Output ( MIMO) technique, especially the multi-user mode ( MU-MIMO), has huge potentials to substantially increase the throughput, as well as to mitigate high collision rates in dense WLANs.
Revised:  The employment of the Multiple-Input and Multiple-Output ( MU-MIMO), has huge potentials to substantially increase the throughput, as well as to mitigate high collision rates in dense WLANs.
Edit intent: clarity
Original:  This paper first reviews the evolution and the fundamental medium access scheme of IEEE 802.
Revised:  This paper first reviews the evolution and the fundamental MAC schemes of IEEE 802.
Edit intent: clarity
Original: 11 standards and amendments , and then identifies the key requirements for designing MU-MIMO MAC protocols in WLANs. After that, the most representative MU-MIMO MAC proposals in the literature are surveyed by benchmarking their MAC procedures , channel state information (CSI)
Revised: 11 Standards and Amendments , and then identifies the key requirements for designing MU-MIMO MAC protocols in WLANs. After that, the most representative MU-MIMO MAC proposals in the literature are surveyed by benchmarking their MAC procedures , channel state information (CSI)
Edit intent: fluency
Original: 11 standards and amendments , and then identifies the key requirements for designing MU-MIMO MAC protocols in WLANs. After that, the most representative MU-MIMO MAC proposals in the literature are surveyed by benchmarking their MAC procedures , channel state information (CSI)
Revised: 11 standards and amendments , and then identifies the key requirements of designing MU-MIMO MAC protocols in WLANs. After that, the most representative MU-MIMO MAC proposals in the literature are surveyed by benchmarking their MAC procedures , channel state information (CSI)
Edit intent: fluency
Original: 11 standards and amendments , and then identifies the key requirements for designing MU-MIMO MAC protocols in WLANs. After that, the most representative MU-MIMO MAC proposals in the literature are surveyed by benchmarking their MAC procedures , channel state information (CSI)
Revised: 11 standards and amendments , and then identifies the key requirements for designing MU-MIMO MAC protocols for WLANs. After that, the most representative MU-MIMO MAC proposals in the literature are surveyed by benchmarking their MAC procedures , channel state information (CSI)
Edit intent: fluency
Original: 11 standards and amendments , and then identifies the key requirements for designing MU-MIMO MAC protocols in WLANs. After that, the most representative MU-MIMO MAC proposals in the literature are surveyed by benchmarking their MAC procedures , channel state information (CSI)
Revised: 11 standards and amendments , and then identifies the key requirements for designing MU-MIMO MAC protocols in WLANs. After that, the most representative MU-MIMO MAC proposals in the literature are overviewed by benchmarking their MAC procedures , channel state information (CSI)
Edit intent: clarity
Original: 11 standards and amendments , and then identifies the key requirements for designing MU-MIMO MAC protocols in WLANs. After that, the most representative MU-MIMO MAC proposals in the literature are surveyed by benchmarking their MAC procedures , channel state information (CSI)
Revised: 11 standards and amendments , and then identifies the key requirements for designing MU-MIMO MAC protocols in WLANs. After that, the most representative MU-MIMO MAC proposals in the literature are surveyed by benchmarking their MAC procedures , channel state information 
Edit intent: clarity
Original:  acquisition, de/ precoding schemes, scheduling schemes, key assumptions, evaluation methods and achieved performance gains . Classifications and underlying features of the surveyed MAC protocols are presented , based on which, the future research challenges for designing effective MU-MIMO MAC protocols are discussed and highlighted.
Revised:  acquisition, de/ pre-coding and scheduling schemes . Classifications and underlying features of the surveyed MAC protocols are presented , based on which, the future research challenges for designing effective MU-MIMO MAC protocols are discussed and highlighted.
Edit intent: coherence
Original:  acquisition, de/ precoding schemes, scheduling schemes, key assumptions, evaluation methods and achieved performance gains . Classifications and underlying features of the surveyed MAC protocols are presented , based on which, the future research challenges for designing effective MU-MIMO MAC protocols are discussed and highlighted.
Revised:  acquisition, de/ precoding schemes, scheduling schemes, key assumptions, evaluation methods and achieved performance gains . Classifications and discussions on important findings of the surveyed MAC protocols are presented , based on which, the future research challenges for designing effective MU-MIMO MAC protocols are discussed and highlighted.
Edit intent: clarity
Original:  acquisition, de/ precoding schemes, scheduling schemes, key assumptions, evaluation methods and achieved performance gains . Classifications and underlying features of the surveyed MAC protocols are presented , based on which, the future research challenges for designing effective MU-MIMO MAC protocols are discussed and highlighted.
Revised:  acquisition, de/ precoding schemes, scheduling schemes, key assumptions, evaluation methods and achieved performance gains . Classifications and underlying features of the surveyed MAC protocols are provided , based on which, the future research challenges for designing effective MU-MIMO MAC protocols are discussed and highlighted.
Edit intent: clarity
Original:  acquisition, de/ precoding schemes, scheduling schemes, key assumptions, evaluation methods and achieved performance gains . Classifications and underlying features of the surveyed MAC protocols are presented , based on which, the future research challenges for designing effective MU-MIMO MAC protocols are discussed and highlighted.
Revised:  acquisition, de/ precoding schemes, scheduling schemes, key assumptions, evaluation methods and achieved performance gains . Classifications and underlying features of the surveyed MAC protocols are presented , based on which, the research challenges for designing effective MU-MIMO MAC protocols are discussed and highlighted.
Edit intent: clarity
Original:  In this paper, we focus our attention to develop the CSCS-based methods for solving the absolute value equation (AVE) involving the Toeplitz structure, and propose the Picard-CSCS method and the nonlinear CSCS-like iterative method.
Revised:  In present paper, we focus our attention to develop the CSCS-based methods for solving the absolute value equation (AVE) involving the Toeplitz structure, and propose the Picard-CSCS method and the nonlinear CSCS-like iterative method.
Edit intent: clarity
Original:  In this paper, we focus our attention to develop the CSCS-based methods for solving the absolute value equation (AVE) involving the Toeplitz structure, and propose the Picard-CSCS method and the nonlinear CSCS-like iterative method.
Revised:  In this paper, we focus on developing the CSCS-based methods for solving the absolute value equation (AVE) involving the Toeplitz structure, and propose the Picard-CSCS method and the nonlinear CSCS-like iterative method.
Edit intent: clarity
Original:  By introducing a smoothing approximate function, we give a theoretical proof for the convergence of the CSCS-based iteration methods for AVE.
Revised:  With the help of introducing a smoothing approximate function, we give a theoretical proof for the convergence of the CSCS-based iteration methods for AVE.
Edit intent: clarity
Original:  By introducing a smoothing approximate function, we give a theoretical proof for the convergence of the CSCS-based iteration methods for AVE.
Revised:  By introducing a smoothing approximate function, we give some theoretical analyses for the convergence of the CSCS-based iteration methods for AVE.
Edit intent: clarity
Original:  The advantage of these methods is that they do not require storage of coefficient matrix, and only need to solve linear sub-systems of constant coefficient matrices .
Revised:  The advantage of these methods is that they do not require storage of coefficient matrix, and the linear sub-systems of constant coefficient matrices .
Edit intent: coherence
Original:  Extensive numerical experiments are employed to demonstrate the feasibility, robustness and effectiveness of the CSCS-based methods and to compare with the existed methods.
Revised:  Extensive numerical experiments are employed to demonstrate the feasibility, robustness and effectiveness of the CSCS-based methods and to compare with the recent methods.
Edit intent: clarity
Original: Recently  two kinds of HSS-based iteration methods to solve the absolute value equation (AVE) are proposed .
Revised: Recently , two kinds of HSS-based iteration methods to solve the absolute value equation (AVE) are proposed .
Edit intent: fluency
Original:  In present paper, we focus on developing the CSCS-based methods for solving the absolute value equation (AVE) involving the Toeplitz structure , and propose the Picard-CSCS method and the nonlinear CSCS-like iterative method.
Revised:  In present paper, we focus on developing the CSCS-based methods for solving the absolute value equation (AVE) involving the Toeplitz matrix , and propose the Picard-CSCS method and the nonlinear CSCS-like iterative method.
Edit intent: clarity
Original:  With the help of introducing a smoothing approximate function, we give some theoretical analyses for the convergence of the CSCS-based iteration methods for  AVE.
Revised:  With the help of introducing a smoothing approximate function, we give some theoretical analyses for the convergence of the CSCS-based iteration methods for the AVE.
Edit intent: fluency
Original:  The advantage of these methods is that they do not require storage of coefficient matrix, and the linear sub-systems can be solved efficiently via fast Fouriertransform (FFT).
Revised:  The advantage of these methods is that they do not require storage of coefficient matrix, and the linear sub-systems can be solved efficiently via the fast Fourier transform (FFT).
Edit intent: clarity
Original:  Therefore, computational workloads and computer storage may be saved in actual implementations.
Revised:  Therefore, computational cost and computer storage may be saved in actual implementations.
Edit intent: clarity
Original:  Extensive numerical experiments  are employed to demonstrate the feasibility, robustness and effectiveness of the CSCS-based methods and to compare with the recent methods.
Revised:  Extensive numerical experiments are employed to demonstrate the robustness and effectiveness of the CSCS-based methods and to compare with the recent methods.
Edit intent: clarity
Original:  Extensive numerical experiments  are employed to demonstrate the feasibility, robustness and effectiveness of the CSCS-based methods and to compare with the recent methods.
Revised:  Extensive numerical experiments are employed to demonstrate the feasibility, robustness and effectiveness of the proposed methods and to compare with the recent methods.
Edit intent: clarity
Original: Recently, two kinds of HSS-based iteration methods are constructed for coping with the absolute value equation (AVE), which is a family of non-differentiable NP-hard problem .
Revised: Recently, two families of HSS-based iteration methods are constructed for coping with the absolute value equation (AVE), which is a family of non-differentiable NP-hard problem .
Edit intent: clarity
Original: Recently, two kinds of HSS-based iteration methods are constructed for coping with the absolute value equation (AVE), which is a family of non-differentiable NP-hard problem .
Revised: Recently, two kinds of HSS-based iteration methods are constructed for handling the absolute value equation (AVE), which is a family of non-differentiable NP-hard problem .
Edit intent: clarity
Original: Recently, two kinds of HSS-based iteration methods are constructed for coping with the absolute value equation (AVE), which is a family of non-differentiable NP-hard problem .
Revised: Recently, two kinds of HSS-based iteration methods are constructed for coping with the absolute value equation (AVE), which is a class of non-differentiable NP-hard problem .
Edit intent: clarity
Original: Recently, two kinds of HSS-based iteration methods are constructed for coping with the absolute value equation (AVE), which is a family of non-differentiable NP-hard problem .
Revised: Recently, two kinds of HSS-based iteration methods are constructed for coping with the absolute value equation (AVE), which is a family of non-differentiable NP-hard problems .
Edit intent: fluency
Original:  In present paper, we focus on developing the CSCS-based methods for solving the absolute value equation (AVE ) involving the Toeplitz matrix , and propose the Picard-CSCS method and the nonlinear CSCS-like iterative method.
Revised:  In present paper, we establish the Picard-CSCS iteration method and the nonlinear CSCS-like iteration method for the AVE involving the Toeplitz matrix , and propose the Picard-CSCS method and the nonlinear CSCS-like iterative method.
Edit intent: clarity
Original:  With the help of introducing a smoothing approximate function, we give some theoretical analyses for the convergence of the CSCS-based iteration methods for the AVE.
Revised:  With the help of introducing a smoothing approximate function, we give some theoretical analyses for the convergence of the nonlinear CSCS-like iteration method for the AVE.
Edit intent: clarity
Original:  The advantage of these methods is that they do not require  storage of coefficient matrix , and the linear sub-systems can be solved efficiently via the fast Fourier transform (FFT).
Revised:  The advantage of these methods is that they do not require the storage of coefficient matrix , and the linear sub-systems can be solved efficiently via the fast Fourier transform (FFT).
Edit intent: fluency
Original:  The advantage of these methods is that they do not require  storage of coefficient matrix , and the linear sub-systems can be solved efficiently via the fast Fourier transform (FFT).
Revised:  The advantage of these methods is that they do not require storage of coefficient matrices , and the linear sub-systems can be solved efficiently via the fast Fourier transform (FFT).
Edit intent: fluency
Original:  The advantage of these methods is that they do not require  storage of coefficient matrix , and the linear sub-systems can be solved efficiently via the fast Fourier transform (FFT).
Revised:  The advantage of these methods is that they do not require storage of coefficient matrix , and the sub-system of linear equations can be solved efficiently via the fast Fourier transform (FFT).
Edit intent: clarity
Original:  Therefore, computational cost and computer storage may be saved in actual implementations.
Revised:  Therefore, computational cost and storage may be saved in actual implementations.
Edit intent: clarity
Original: Recently, two families of HSS-based iteration methods are constructed for handling the absolute value equation (AVE ), which is a class of non-differentiable NP-hard problems.
Revised: Recently, two families of HSS-based iteration methods are constructed for solving the system of absolute value equations (AVEs ), which is a class of non-differentiable NP-hard problems.
Edit intent: clarity
Original:  In present paper , we establish the Picard-CSCS iteration method and the nonlinear CSCS-like iteration method for the AVE involving the Toeplitz matrix.
Revised:  In this study , we establish the Picard-CSCS iteration method and the nonlinear CSCS-like iteration method for the AVE involving the Toeplitz matrix.
Edit intent: clarity
Original:  In present paper , we establish the Picard-CSCS iteration method and the nonlinear CSCS-like iteration method for the AVE involving the Toeplitz matrix.
Revised:  In present paper , we establish the Picard-CSCS iteration method and the nonlinear CSCS-like iteration method for AVEs involving the Toeplitz matrix.
Edit intent: fluency
Original:  Then  we analyze the convergence of the Picard-CSCS iteration method for solving the AVE .
Revised:  Then , we analyze the convergence of the Picard-CSCS iteration method for solving the AVE .
Edit intent: fluency
Original:  Then  we analyze the convergence of the Picard-CSCS iteration method for solving the AVE .
Revised:  Then we analyze the convergence of the Picard-CSCS iteration method for solving AVEs .
Edit intent: clarity
Original:  The advantage of these methods is that they do not require the storage of coefficient matrices  , and the sub-system of linear equations can be solved efficiently via the fast Fourier transform (FFT).
Revised:  The advantage of these methods is that they do not require the storage of coefficient matrices at all , and the sub-system of linear equations can be solved efficiently via the fast Fourier transform (FFT).
Edit intent: clarity
Original:  Therefore, computational cost and storage may be saved in practical implementations.
Revised:  Therefore, computational cost and storage can be saved in practical implementations.
Edit intent: clarity
Original:  Numerical experiments including the solution of the fractional diffusion equation with a nonlinear term are presented to show the effectiveness of the proposed methods in comparison with the HSS-based methods.
Revised:  Numerical experiments including the solution of nonlinear fractional diffusion equations are presented to show the effectiveness of the proposed methods in comparison with the HSS-based methods.
Edit intent: clarity
Original:  Numerical experiments including the solution of the fractional diffusion equation with a nonlinear term are presented to show the effectiveness of the proposed methods in comparison with the HSS-based methods.
Revised:  Numerical experiments including the solution of the fractional diffusion equation with a nonlinear term are presented to illustrate the effectiveness of the proposed methods in comparison with the HSS-based methods.
Edit intent: fluency
Original:  Numerical experiments including the solution of the fractional diffusion equation with a nonlinear term are presented to show the effectiveness of the proposed methods in comparison with the HSS-based methods.
Revised:  Numerical experiments including the solution of the fractional diffusion equation with a nonlinear term are presented to show the effectiveness of the proposed methods in comparison with some existing methods.
Edit intent: clarity
Original:  The superiority of these methods is that they do not require the storage of coefficient matrices at all, and the sub-system of linear equations can be solved efficiently via the fast Fourier transform (FFT ).
Revised:  The advantage of these methods is that they do not require the storage of coefficient matrices at all, and the sub-system of linear equations can be solved efficiently via the fast Fourier transform (FFT ).
Edit intent: clarity
Original:  The superiority of these methods is that they do not require the storage of coefficient matrices at all, and the sub-system of linear equations can be solved efficiently via the fast Fourier transform (FFT ).
Revised:  The superiority of these methods is that they do not require the storage of coefficient matrices at all, and the sub-system of linear equations can be solved efficiently via the fast Fourier transforms (FFTs ).
Edit intent: fluency
Original:  By using the theory about nonsmooth analysis, we particularly prove the convergence of the nonlinear CSCS-like iteration solver for AVEs.
Revised:  By using the theory about nonsmooth analysis, we particularly prove the convergence of the nonlinear CSCS-like iterationsolver for AVEs.
Edit intent: fluency
Original:  Numerical experiments including the solution of nonlinear fractional diffusion equations are presented to illustrate the effectiveness of the proposed methods in comparison with some existing methods.
Revised:  Numerical examples including numerical solutions of nonlinear fractional diffusion equations are presented to illustrate the effectiveness of the proposed methods in comparison with some existing methods.
Edit intent: clarity
Original:  Numerical experiments including the solution of nonlinear fractional diffusion equations are presented to illustrate the effectiveness of the proposed methods in comparison with some existing methods.
Revised:  Numerical experiments including the solution of nonlinear fractional diffusion equations are reported to show the effectiveness of the proposed methods in comparison with some existing methods.
Edit intent: clarity
Original: It has been proved that almost all n-bit Boolean functions have {\em exact classical query complexity n.
Revised: It has been proved that almost all n-bit Boolean functions have the{\em exact classical query complexity n.
Edit intent: clarity
Original:  However, the situation seems very different when we deal with {\em exact quantum query complexity .
Revised:  However, the situation seems very different when we deal with the{\em exact quantum query complexity .
Edit intent: coherence
Original:  In this paper, we prove that almost all n-bit symmetric, monotone Boolean functions and Boolean functions with formula size n can be computed by an exact quantum algorithm with less than n queries.
Revised:  In this paper, we prove that almost all n-bit Boolean functions can be computed by an exact quantum algorithm with less than n queries.
Edit intent: clarity
Original: It has been proved that almost all n-bit Boolean functions have the%DIFDELCMD < {\em %DIFDELCMD < %%% exact classical query complexity n.
Revised: It has been proved that almost all n-bit Boolean functions have %DIFDELCMD < {\em %DIFDELCMD < %%% exact classical query complexity n.
Edit intent: fluency
Original:  However, the situation seems very different when we deal with the%DIFDELCMD < {\em %%% exact quantum query complexity .
Revised:  However, the situation seemed to be very different when we deal with the%DIFDELCMD < {\em %%% exact quantum query complexity .
Edit intent: coherence
Original:  However, the situation seems very different when we deal with the%DIFDELCMD < {\em %%% exact quantum query complexity .
Revised:  However, the situation seems very different when we deal with %DIFDELCMD < {\em %%% exact quantum query complexity .
Edit intent: coherence
Original:  Moreover , we prove that \mbox{AND _n is the only  Boolean function, up to isomorphism, that requires n queries in all n-bit Boolean functions .
Revised:  More exactly , we prove that \mbox{AND _n is the only Boolean function, up to isomorphism, that requires n queries in all n-bit Boolean functions .
Edit intent: coherence
Original:  Moreover , we prove that \mbox{AND _n is the only  Boolean function, up to isomorphism, that requires n queries in all n-bit Boolean functions .
Revised:  Moreover , we prove that AND _n is the only Boolean function, up to isomorphism, that requires n queries in all n-bit Boolean functions .
Edit intent: fluency
Original:  Moreover , we prove that \mbox{AND _n is the only  Boolean function, up to isomorphism, that requires n queries in all n-bit Boolean functions .
Revised:  Moreover , we prove that \mbox{AND _n is the only n-bit Boolean function, up to isomorphism, that requires n queries in all n-bit Boolean functions .
Edit intent: fluency
Original:  Moreover , we prove that \mbox{AND _n is the only  Boolean function, up to isomorphism, that requires n queries in all n-bit Boolean functions .
Revised:  Moreover , we prove that \mbox{AND _n is the only Boolean function, up to isomorphism, that requires n queries .
Edit intent: clarity