wanyu/IteraTeR_v2 huggingface dataset:
Original:  As a result, a combination of these two stages leads to a positivity-preserving and energy stable numerical scheme for the original reaction-diffusion system.
Revised:  As a result, a combination of these two stages leads to a positivity-preserving and energy-stable numerical scheme for the original reaction-diffusion system.
Edit intent: fluency
Original: Counts of attribute value combinations are central to the profiling of a data set , particularly in determining fitness for use and in eliminating bias and unfairness.
Revised: Counts of attribute-value combinations are central to the profiling of a data set , particularly in determining fitness for use and in eliminating bias and unfairness.
Edit intent: fluency
Original: Counts of attribute value combinations are central to the profiling of a data set , particularly in determining fitness for use and in eliminating bias and unfairness.
Revised: Counts of attribute value combinations are central to the profiling of a dataset , particularly in determining fitness for use and in eliminating bias and unfairness.
Edit intent: clarity
Original:  While counts of individual attribute values may be stored in some data set profiles, there are too many combinations of attributes for it to be practical to store counts for each combination.
Revised:  While counts of individual attribute values may be stored in some dataset profiles, there are too many combinations of attributes for it to be practical to store counts for each combination.
Edit intent: clarity
Original:  As side results, we derive lower and upper bounds on the size of list-decodable codes for the Z-channel and prove that for a fraction 1/4+\epsilon of asymmetric errors,  error-correcting codes must have size at most O(\epsilon^{ -2 })  .
Revised:  As side results, we derive lower and upper bounds on the size of list-decodable codes for the Z-channel and prove that for a fraction 1/4+\epsilon of asymmetric errors, an error-correcting codes must have size at most O(\epsilon^{ -2 }) .
Edit intent: clarity
Original:  As side results, we derive lower and upper bounds on the size of list-decodable codes for the Z-channel and prove that for a fraction 1/4+\epsilon of asymmetric errors,  error-correcting codes must have size at most O(\epsilon^{ -2 })  .
Revised:  As side results, we derive lower and upper bounds on the size of list-decodable codes for the Z-channel and prove that for a fraction 1/4+\epsilon of asymmetric errors, error-correcting code contains at most O(\epsilon^{ -2 }) .
Edit intent: clarity
Original:  As side results, we derive lower and upper bounds on the size of list-decodable codes for the Z-channel and prove that for a fraction 1/4+\epsilon of asymmetric errors,  error-correcting codes must have size at most O(\epsilon^{ -2 })  .
Revised:  As side results, we derive lower and upper bounds on the size of list-decodable codes for the Z-channel and prove that for a fraction 1/4+\epsilon of asymmetric errors, error-correcting codes must have size at most O(\epsilon^{ -2 }) codewords .
Edit intent: clarity
Original:  The experiments evaluate the methods using the signal-to-distortion ratio (SDR) and PEMO-Q, a perceptually motivated metric .
Revised:  In the experiments the methods are evaluated using the signal-to-distortion ratio (SDR) and PEMO-Q, a perceptually motivated metric .
Edit intent: clarity
Original:  Natural language processing (NLP) - the branch of artificial intelligence that interprets human language - can be applied to address many of the information needs made urgent by the COVID-19 pandemic.
Revised:  Natural language processing (NLP) , the branch of artificial intelligence that interprets human language - can be applied to address many of the information needs made urgent by the COVID-19 pandemic.
Edit intent: fluency
Original:  Natural language processing (NLP) - the branch of artificial intelligence that interprets human language - can be applied to address many of the information needs made urgent by the COVID-19 pandemic.
Revised:  Natural language processing (NLP) - the branch of artificial intelligence that interprets human language , can be applied to address many of the information needs made urgent by the COVID-19 pandemic.
Edit intent: fluency
Original:  We also describe work that directly addresses aspects of the pandemic through four additional tasks: topic modeling, sentiment and emotion analysis, case load forecasting and misinformation detection.
Revised:  We also describe work that directly addresses aspects of the pandemic through four additional tasks: topic modeling, sentiment and emotion analysis, caseload forecasting, and misinformation detection.
Edit intent: fluency
Original:  We conclude  discussing observable trends and remaining challenges.
Revised:  We conclude by discussing observable trends and remaining challenges.
Edit intent: fluency
Original:  Compared with the initial work, the requirements on the step-size is  significantly released.
Revised:  Compared with the initial work, the requirements on the step-size is also significantly released.
Edit intent: clarity
Original:  We have previously introduced an intuitive, user-driven, EMG based orthotic control , but the process of training a control which is robust to concept drift (changes in the input signal) places a substantial burden on the user.
Revised:  We have previously introduced an intuitive, user-driven, EMG-based method to operate a robotic hand orthosis , but the process of training a control which is robust to concept drift (changes in the input signal) places a substantial burden on the user.
Edit intent: clarity
Original:  We have previously introduced an intuitive, user-driven, EMG based orthotic control , but the process of training a control which is robust to concept drift (changes in the input signal) places a substantial burden on the user.
Revised:  We have previously introduced an intuitive, user-driven, EMG based orthotic control , but the process of training a control that is robust to concept drift (changes in the input signal) places a substantial burden on the user.
Edit intent: fluency
Original:  We propose a K-means semi-supervision and a disagreement-based semi-supervision algorithm .
Revised:  Specifically, we propose a disagreement-based semi-supervision algorithm .
Edit intent: coherence
Original: We present a novel continuation method to compute all zeros of a harmonic mapping f in the complex plane.
Revised: We present a continuation method to compute all zeros of a harmonic mapping f in the complex plane.
Edit intent: clarity
Original:  Our method works without any prior knowledge about the number of zeros , or their approximate location , as long as the number of zeros is finite.
Revised:  Our method works without any prior knowledge of the number of zeros , or their approximate location , as long as the number of zeros is finite.
Edit intent: fluency
Original:  Our method works without any prior knowledge about the number of zeros , or their approximate location , as long as the number of zeros is finite.
Revised:  Our method works without any prior knowledge about the number of zeros or their approximate location , as long as the number of zeros is finite.
Edit intent: fluency
Original:  In our numerical examples, the method terminates with the correct number of zeros, is very fast compared to general purpose root finders , and is highly accurate in terms of the residual.
Revised:  In our numerical example the method always terminates with the correct number of zeros, is very fast compared to general purpose root finders , and is highly accurate in terms of the residual.
Edit intent: clarity
Original:  In our numerical examples, the method terminates with the correct number of zeros, is very fast compared to general purpose root finders , and is highly accurate in terms of the residual.
Revised:  In our numerical examples, the method terminates with the correct number of zeros, is very fast compared to general purpose root finders and is highly accurate in terms of the residual.
Edit intent: fluency
Original:  An easy-to-use Matlab implementation of our method is freely available online.
Revised:  An easy-to-use MATLAB implementation is freely available online.
Edit intent: clarity
Original:  This article proposes to use narrow period pulse for poisoning attack of EEG-based BCIs, which is more feasible in practice and has never been considered before.
Revised:  This article proposes to use narrow period pulse for poisoning attack of EEG-based BCIs, which is implementable in practice and has never been considered before.
Edit intent: clarity
Original:  The effectiveness and robustness of the backdoor attack approach is demonstrated, highlighting a critical security concern for EEG-based BCIs  .
Revised:  The effectiveness and robustness of the backdoor attack approach is demonstrated, highlighting a critical security concern for EEG-based BCIs and calling for urgent attention to address it .
Edit intent: coherence
Original:  Mass conservation, balance of stress, and the Beavers-Joseph-Saffman condition are imposed on the interface.
Revised:  Mass conservation, balance of stress, and the Beavers--Joseph--Saffman condition are imposed on the interface.
Edit intent: fluency
Original:  The interface conditions are incorporated through the introduction of the traces of  structure velocity and  Darcy pressure as Lagrange multipliers.
Revised:  The interface conditions are incorporated through the introduction of the traces of the structure velocity and Darcy pressure as Lagrange multipliers.
Edit intent: fluency
Original:  The interface conditions are incorporated through the introduction of the traces of  structure velocity and  Darcy pressure as Lagrange multipliers.
Revised:  The interface conditions are incorporated through the introduction of the traces of structure velocity and the Darcy pressure as Lagrange multipliers.
Edit intent: fluency
Original:  Stability and error analysis is performed for the semi-discrete continuous-in-time mixed finite element scheme . Numerical experiments are presented in confirmation of the theoretical results  .
Revised:  Stability and error estimates are derived for the semi-discrete continuous-in-time mixed finite element scheme . Numerical experiments are presented in confirmation of the theoretical results .
Edit intent: clarity
Original:  Stability and error analysis is performed for the semi-discrete continuous-in-time mixed finite element scheme . Numerical experiments are presented in confirmation of the theoretical results  .
Revised:  Stability and error analysis is performed for the semi-discrete continuous-in-time mixed finite element approximation . Numerical experiments are presented in confirmation of the theoretical results .
Edit intent: clarity
Original:  Stability and error analysis is performed for the semi-discrete continuous-in-time mixed finite element scheme . Numerical experiments are presented in confirmation of the theoretical results  .
Revised:  Stability and error analysis is performed for the semi-discrete continuous-in-time mixed finite element scheme . Numerical experiments are presented to verify the theoretical results .
Edit intent: clarity
Original:  We derive an optimal strategy that maximizes the agent' s expected payoff and calibrate the uncertain state by taking the opportunity costs into account.
Revised:  We derive an optimal strategy that maximizes the agent' s expected payoff and calibrate the uncertain state by taking opportunity costs into account.
Edit intent: fluency
Original:  We discuss the sense in which the matching derived from the proposed strategy has a stability property.
Revised:  We also derive an incentive-compatibility property and show that the outcome from the learned strategies has a stability property.
Edit intent: clarity
Original:  We also prove a fairness property that asserts that there exists no justified envy according to the proposed strategy.
Revised:  Finally, we prove a fairness property that asserts that there exists no justified envy according to the proposed strategy.
Edit intent: coherence
Original:  Numerical experiments are further conducted to show the performance of proposed algorithms, demonstrating good convergence speed and robustness to the noise . Especially, we report the virtual wall-clock time of proposed algorithm, which shows great potential for parallel computing in massively parallel processing computers .
Revised:  Numerical experiments are further conducted to show the performance of proposed algorithms, demonstrating good convergence speed and robustness to the noise .
Edit intent: coherence
Original: As an emerging business phenomenon especially in China, instant messaging (IM) based social commerce is growing increasingly popular, attracting hundreds of millions of users and is becoming one primary way where people make everyday purchases.
Revised: As an emerging business phenomenon especially in China, instant messaging (IM) based social commerce is growing increasingly popular, attracting hundreds of millions of users and is becoming one important way where people make everyday purchases.
Edit intent: clarity
Original:  We demonstrate that all these unique aspects link closely to the characteristics of IM platform , as well as the coupling of user social and economic lives under such business model.
Revised:  We demonstrate that all these unique aspects link closely to the characteristics of IM platforms , as well as the coupling of user social and economic lives under such business model.
Edit intent: fluency
Original:  In this work, RespireNet, we propose a simple CNN-based model, along with a suite of novel techniques---device specific fine-tuning, concatenation-based augmentation, blank region clipping, and smart padding---enabling us to efficiently use the small-sized dataset.
Revised:  In this work, RespireNet, we propose a simple CNN-based model, along with a suite of novel techniques -- device specific fine-tuning, concatenation-based augmentation, blank region clipping, and smart padding---enabling us to efficiently use the small-sized dataset.
Edit intent: fluency
Original:  In this work, RespireNet, we propose a simple CNN-based model, along with a suite of novel techniques---device specific fine-tuning, concatenation-based augmentation, blank region clipping, and smart padding---enabling us to efficiently use the small-sized dataset.
Revised:  In this work, RespireNet, we propose a simple CNN-based model, along with a suite of novel techniques---device specific fine-tuning, concatenation-based augmentation, blank region clipping, and smart padding -- enabling us to efficiently use the small-sized dataset.
Edit intent: fluency
Original:  It then focuses on three categories: methods that use magnitude-based pruning, methods that utilise clustering to identify redundancy, and methods that utilise sensitivity analysis . Some of the key influencing studies within these categories are presented to illuminate the underlying approaches and results achieved.
Revised:  It then focuses on three categories: methods that use magnitude based pruning, methods that utilise clustering to identify redundancy, and methods that utilise sensitivity analysis . Some of the key influencing studies within these categories are presented to illuminate the underlying approaches and results achieved.
Edit intent: fluency
Original:  It then focuses on three categories: methods that use magnitude-based pruning, methods that utilise clustering to identify redundancy, and methods that utilise sensitivity analysis . Some of the key influencing studies within these categories are presented to illuminate the underlying approaches and results achieved.
Revised:  It then focuses on three categories: methods that use magnitude-based pruning, methods that utilise clustering to identify redundancy, and methods that use sensitivity analysis to assess the effect of pruning . Some of the key influencing studies within these categories are presented to illuminate the underlying approaches and results achieved.
Edit intent: clarity
Original:  It then focuses on three categories: methods that use magnitude-based pruning, methods that utilise clustering to identify redundancy, and methods that utilise sensitivity analysis . Some of the key influencing studies within these categories are presented to illuminate the underlying approaches and results achieved.
Revised:  It then focuses on three categories: methods that use magnitude-based pruning, methods that utilise clustering to identify redundancy, and methods that utilise sensitivity analysis . Some of the key influencing studies within these categories are presented to highlight the underlying approaches and results achieved.
Edit intent: fluency
Original:  Most studies on pruning present results from empirical evaluations, which are distributed in the literature as new architectures, algorithms and data sets have evolved with time.
Revised:  Most studies present results which are distributed in the literature as new architectures, algorithms and data sets have evolved with time.
Edit intent: clarity
Original: Molecular communication is not just able to mimic biological and chemical communication mechanisms, but also provides a theoretical framework regarding viral infection processes.
Revised: Molecular communication is not only able to mimic biological and chemical communication mechanisms, but also provides a theoretical framework regarding viral infection processes.
Edit intent: fluency
Original: Molecular communication is not just able to mimic biological and chemical communication mechanisms, but also provides a theoretical framework regarding viral infection processes.
Revised: Molecular communication is not just able to mimic biological and chemical communication mechanisms, but also provides a theoretical framework for viral infection processes.
Edit intent: clarity
Original:  This work is inspired by the recent outbreak of the coronavirus (COVID-19) pandemic, but also applicable to other air-borne infectious diseases like influenza.
Revised:  This work is inspired by the recent outbreak of the coronavirus (COVID-19) pandemic, but also applicable to other airborne infectious diseases like influenza.
Edit intent: fluency
Original: Free boundary problems deal with systems of partial differential equations, where the domain boundary is apriori unknown.
Revised: Free boundary problems deal with systems of partial differential equations, where the domain boundaries are apriori unknown.
Edit intent: fluency
Original:  We also numerically verify this approach by computing the symmetry-breaking solutions that are guided by the bifurcation analysis near the radially-symmetric branch.
Revised:  We also numerically verify this approach by computing the symmetry-breaking solutions which are guided by the bifurcation analysis near the radially-symmetric branch.
Edit intent: fluency
Original:  In this study, we constructed a system to identify the relevant tweets related to the COVID-19 pandemic throughout January 1\textsuperscript{st , 2020 to April 30\textsuperscript{th , 2020  and explored topic modeling to identify the most discussed topics and themes during this period in our data set.
Revised:  In this study, we constructed a system to identify the relevant tweets related to the COVID-19 pandemic throughout January 1st , 2020 to April 30\textsuperscript{th , 2020 and explored topic modeling to identify the most discussed topics and themes during this period in our data set.
Edit intent: fluency
Original:  In this study, we constructed a system to identify the relevant tweets related to the COVID-19 pandemic throughout January 1\textsuperscript{st , 2020 to April 30\textsuperscript{th , 2020  and explored topic modeling to identify the most discussed topics and themes during this period in our data set.
Revised:  In this study, we constructed a system to identify the relevant tweets related to the COVID-19 pandemic throughout January 1\textsuperscript{st , 2020 to April 30th , 2020 and explored topic modeling to identify the most discussed topics and themes during this period in our data set.
Edit intent: fluency
Original:  In this study, we constructed a system to identify the relevant tweets related to the COVID-19 pandemic throughout January 1\textsuperscript{st , 2020 to April 30\textsuperscript{th , 2020  and explored topic modeling to identify the most discussed topics and themes during this period in our data set.
Revised:  In this study, we constructed a system to identify the relevant tweets related to the COVID-19 pandemic throughout January 1\textsuperscript{st , 2020 to April 30\textsuperscript{th , 2020 , and explored topic modeling to identify the most discussed topics and themes during this period in our data set.
Edit intent: fluency
Original:   The principal results of this paper are twofold: the norm of the Lasso hyperinterpolation operator is bounded independently of the polynomial degree, which is inherited from hyperinterpolation;
Revised:  The principal results are twofold: the norm of the Lasso hyperinterpolation operator is bounded independently of the polynomial degree, which is inherited from hyperinterpolation;
Edit intent: clarity
Original: We present a general method for computing the abelian complexity \rho^{\rm ab}_{\bf s} (n) of an automatic sequence \bf s in the case where (a) \rho^{\rm ab}_{\bf s} (n) is bounded by a constant and (b) the  length-n prefixes of s have synchronized Parikh vectors \bf  .
Revised: We present a general method for computing the abelian complexity \rho^{\rm ab}_{\bf s} (n) of an automatic sequence \bf s in the case where (a) \rho^{\rm ab}_{\bf s} (n) is bounded by a constant and (b) the Parikh vectors of the length-n prefixes of s have synchronized Parikh vectors \bf .
Edit intent: clarity
Original: Distributed optimization is widely used to solve large-scale problems effectively in a localized and coordinated manner.
Revised: Distributed optimization is often widely attempted and innovated as an attractive and preferred methodology to solve large-scale problems effectively in a localized and coordinated manner.
Edit intent: clarity
Original:  Thus  , it is noteworthy that the methodology of distributed model predictive control (DMPC) has become a promising approach to achieve effective outcomes ;
Revised:  Thus along this line , it is noteworthy that the methodology of distributed model predictive control (DMPC) has become a promising approach to achieve effective outcomes ;
Edit intent: coherence
Original:  However, the typical deployment of such DMPC frameworks would lead to  involvement of nonlinear processes with a large number of nonconvex constraints.
Revised:  However, the typical deployment of such distributed MPC frameworks would lead to involvement of nonlinear processes with a large number of nonconvex constraints.
Edit intent: clarity
Original:  However, the typical deployment of such DMPC frameworks would lead to  involvement of nonlinear processes with a large number of nonconvex constraints.
Revised:  However, the typical deployment of such DMPC frameworks would lead to the involvement of nonlinear processes with a large number of nonconvex constraints.
Edit intent: fluency
Original:  Firstly thus , an additional slack variable is introduced to relax the original large-scale nonconvex optimization problem ;
Revised:  Here firstly , an additional slack variable is introduced to relax the original large-scale nonconvex optimization problem ;
Edit intent: coherence
Original:  Next, the approximate optimization with a barrier method is then applied to accelerate the computational efficiency .
Revised:  Finally, an approximate optimization stage with a barrier method is then applied to accelerate the computational efficiency .
Edit intent: clarity
Original:  Thus along this line , it is noteworthy that the methodology of distributed model predictive control (DMPC) has become a promising approach to achieve effective outcomes, e.g., in decision-making tasks for multi-agent systems.
Revised:  Thus , it is noteworthy that the methodology of distributed model predictive control (DMPC) has become a promising approach to achieve effective outcomes, e.g., in decision-making tasks for multi-agent systems.
Edit intent: coherence