wanyu/IteraTeR_v2 huggingface dataset:
Original: and Proximal Policy Optimization on a mobile selfbalancing Extendible Wheeled Inverted Pendulum EWIP system Such RL models make the task of finding  satisfactory control scheme easier and respond to the dynamics effectively while self-tuning the parameters to provide better control  In this article two RLbased controllers are pitted against an MPC controller to evaluate the performance on the basis of state variables of the EWIP system while following a specific desired trajectory 
Revised: and Proximal Policy Optimization on a mobile selfbalancing Extendible Wheeled Inverted Pendulum EWIP system Such RL models make the task of finding satisfactory control scheme easier and respond to the dynamics effectively while self-tuning the parameters to provide better control In this article , two RL-based controllers are pitted against an MPC controller to evaluate the performance on the basis of state variables of the EWIP system while following a specific desired trajectory 
Edit intent: fluency
Original: and Proximal Policy Optimization on a mobile selfbalancing Extendible Wheeled Inverted Pendulum EWIP system Such RL models make the task of finding  satisfactory control scheme easier and respond to the dynamics effectively while self-tuning the parameters to provide better control  In this article two RLbased controllers are pitted against an MPC controller to evaluate the performance on the basis of state variables of the EWIP system while following a specific desired trajectory 
Revised: and Proximal Policy Optimization on a mobile selfbalancing Extendible Wheeled Inverted Pendulum EWIP system Such RL models make the task of finding satisfactory control scheme easier and respond to the dynamics effectively while self-tuning the parameters to provide better control In this article two RLbased controllers are pitted against an MPC controller to evaluate the performance on the basis of state variables of the EWIP system while following a specific desired trajectory .
Edit intent: fluency
Original:  Our large model, KAPAO-L, achieves an AP of 70.6 on the Microsoft COCO Keypoints validation set without test-time augmentation , which is 2.5x faster and 4.0 AP more accurate than the next best single-stage model  .
Revised:  Our large model, KAPAO-L, achieves an AP of 70.6 on the Microsoft COCO Keypoints validation set without test-time augmentation while being 2.5x faster and 4.0 AP more accurate than the next best single-stage model .
Edit intent: clarity
Original:  Our large model, KAPAO-L, achieves an AP of 70.6 on the Microsoft COCO Keypoints validation set without test-time augmentation , which is 2.5x faster and 4.0 AP more accurate than the next best single-stage model  .
Revised:  Our large model, KAPAO-L, achieves an AP of 70.6 on the Microsoft COCO Keypoints validation set without test-time augmentation , which is 2.5x faster than the next best single-stage model .
Edit intent: clarity
Original:  All the resources related to DataCLUE, including dataset , toolkit, leaderboard, and baselines, is available online at URL
Revised:  All the resources related to DataCLUE, including datasets , toolkit, leaderboard, and baselines, is available online at URL
Edit intent: fluency
Original:  This disproves the long-standing conjecture is that there exists a randomized social choice function that has a worst-case distortion of at most 2.
Revised:  This disproves the long-standing conjecture that there exists a randomized social choice function that has a worst-case distortion of at most 2.
Edit intent: clarity
Original:  Furthermore, it allowsed them to set tangible goals to improve their participation, and be more aware of what, why and how they are learning.
Revised:  Furthermore, it allowed them to set tangible goals to improve their participation, and be more aware of what, why and how they are learning.
Edit intent: fluency
Original: e give two approximation algorithms solving the Stochastic Boolean Function Evaluation (SBFE) problem for symmetric Boolean functions.
Revised: We give two approximation algorithms solving the Stochastic Boolean Function Evaluation (SBFE) problem for symmetric Boolean functions.
Edit intent: fluency
Original: Learning from 3D point-cloud data has rapidly gainedmomentum , motivated by the success of deep learning onimages and the increased availability of 3D data.
Revised: Learning from 3D point-cloud data has rapidly gained momentum , motivated by the success of deep learning onimages and the increased availability of 3D data.
Edit intent: fluency
Original: Learning from 3D point-cloud data has rapidly gainedmomentum , motivated by the success of deep learning onimages and the increased availability of 3D data.
Revised: Learning from 3D point-cloud data has rapidly gainedmomentum , motivated by the success of deep learning on images and the increased availability of 3D data.
Edit intent: fluency
Original:  In thispaper , we aim to construct anisotropic convolutions thatwork directly on the surface derived from a point cloud.
Revised:  In this paper , we aim to construct anisotropic convolutions thatwork directly on the surface derived from a point cloud.
Edit intent: fluency
Original:  In thispaper , we aim to construct anisotropic convolutions thatwork directly on the surface derived from a point cloud.
Revised:  In thispaper , we aim to construct anisotropic convolutions that work directly on the surface derived from a point cloud.
Edit intent: fluency
Original:  This is challenging because of the lack of a global coordi-nate system for tangential directions on surfaces.
Revised:  This is challenging because of the lack of a global coordinate system for tangential directions on surfaces.
Edit intent: fluency
Original:  We intro-duce a new convolution operator called DeltaConv, whichcombines geometric operators from exterior calculus to en-able the construction of anisotropic filters on point clouds.
Revised:  We introduce a new convolution operator called DeltaConv, whichcombines geometric operators from exterior calculus to en-able the construction of anisotropic filters on point clouds.
Edit intent: fluency
Original:  We intro-duce a new convolution operator called DeltaConv, whichcombines geometric operators from exterior calculus to en-able the construction of anisotropic filters on point clouds.
Revised:  We intro-duce a new convolution operator called DeltaConv, which combines geometric operators from exterior calculus to en-able the construction of anisotropic filters on point clouds.
Edit intent: fluency
Original:  We intro-duce a new convolution operator called DeltaConv, whichcombines geometric operators from exterior calculus to en-able the construction of anisotropic filters on point clouds.
Revised:  We intro-duce a new convolution operator called DeltaConv, whichcombines geometric operators from exterior calculus to enable the construction of anisotropic filters on point clouds.
Edit intent: fluency
Original:  The vectorstream enables the network to explicitly represent, evalu-ate , and process directional information.
Revised:  The vector stream enables the network to explicitly represent, evalu-ate , and process directional information.
Edit intent: fluency
Original:  The vectorstream enables the network to explicitly represent, evalu-ate , and process directional information.
Revised:  The vectorstream enables the network to explicitly represent, evaluate , and process directional information.
Edit intent: fluency
Original:  Our convolutionsare robust and simple to implement and show improved ac-curacy compared to state-of-the-art approaches on severalbenchmarks , while also speeding up training and inference.
Revised:  Our convolutions are robust and simple to implement and show improved ac-curacy compared to state-of-the-art approaches on severalbenchmarks , while also speeding up training and inference.
Edit intent: fluency
Original:  Our convolutionsare robust and simple to implement and show improved ac-curacy compared to state-of-the-art approaches on severalbenchmarks , while also speeding up training and inference.
Revised:  Our convolutionsare robust and simple to implement and show improved accuracy compared to state-of-the-art approaches on severalbenchmarks , while also speeding up training and inference.
Edit intent: fluency
Original:  Our convolutionsare robust and simple to implement and show improved ac-curacy compared to state-of-the-art approaches on severalbenchmarks , while also speeding up training and inference.
Revised:  Our convolutionsare robust and simple to implement and show improved ac-curacy compared to state-of-the-art approaches on several benchmarks , while also speeding up training and inference.
Edit intent: fluency
Original:  secondly, an innovative query scheme dubbed bimodal query is used to query labels of samples from both classes with maximum posterior probabilities, and lastly, the classical Friedman-Rafsky (FR) two-sample test is performed on the queried samples.
Revised:  secondly, a novel query scheme dubbed bimodal query is used to query labels of samples from both classes with maximum posterior probabilities, and lastly, the classical Friedman-Rafsky (FR) two-sample test is performed on the queried samples.
Edit intent: clarity
Original:  Our theoretical analysis shows that bimodal query is optimal for the FR test under reasonable conditions and that the three-stage framework controls the Type I error.
Revised:  Our theoretical analysis shows that bimodal query is optimal for two-sample testing using the FR statistic under reasonable conditions and that the three-stage framework controls the Type I error.
Edit intent: clarity
Original:  nevertheless, the effectiveness of many surveillance systems still depend of finite human attention.
Revised:  nevertheless, the effectiveness of many surveillance systems still depends of finite human attention.
Edit intent: fluency
Original:  Using Temporal Yolov5, an architecture based in Quasi-Recurrent Neural Networks, temporal information is extracted from video to improve the results of the handgun detection.
Revised:  Using Temporal Yolov5, an architecture based on Quasi-Recurrent Neural Networks, temporal information is extracted from video to improve the results of the handgun detection.
Edit intent: fluency
Original:  Using Temporal Yolov5, an architecture based in Quasi-Recurrent Neural Networks, temporal information is extracted from video to improve the results of the handgun detection.
Revised:  Using Temporal Yolov5, an architecture based in Quasi-Recurrent Neural Networks, temporal information is extracted from video to improve the results of handgun detection.
Edit intent: fluency
Original:  Moreover, two publicity available datasets are proposed, labeled with hands, guns, and phones.
Revised:  Moreover, two publicly available datasets are proposed, labeled with hands, guns, and phones.
Edit intent: fluency
Original:  Additionally, we explore two temporal data augmentation techniques based in Mosaic and Mixup.
Revised:  Additionally, we explore two temporal data augmentation techniques based on Mosaic and Mixup.
Edit intent: fluency
Original:  The resulting systems are three temporal architectures: one focused in reducing inference with a mAP_{50:95} of 56.1 , another in having a good balance between inference and accuracy with a mAP_{50:95} of 59.4 , and a last one specialized in accuracy with a mAP_{50:95} of 60.2.
Revised:  The resulting systems are three temporal architectures: one focused in reducing inference with a mAP_{50:95} of 56.1 , another in having a good balance between inference and accuracy with a mAP_{50:95} of 59 , and a last one specialized in accuracy with a mAP_{50:95} of 60.2.
Edit intent: clarity
Original:  A vertex partition \Psi=\{V_1,\ldots, V_k\} of V is called a coalition partition of G if every set ~ V_i\in \Psi is either a dominating set of G with the cardinality |V_i|=1, or is not a dominating set but for some V_j\in \Psi, V_i and V_j form a coalition.
Revised:  A vertex partition \Psi=\{V_1,\ldots, V_k\} of V is called a coalition partition of G if every set V_i\in \Psi is either a dominating set of G with the cardinality |V_i|=1, or is not a dominating set but for some V_j\in \Psi, V_i and V_j form a coalition.
Edit intent: clarity
Original:  Given a coalition partition \Psi=\{V_1, V_2,\ldots, V_r\} of ~ G, a coalition graph CG(G, \Psi) is associated on \Psi such that there is a one-to-one correspondence between its vertices and the members of \Psi.
Revised:  Given a coalition partition \Psi=\{V_1, V_2,\ldots, V_r\} of G, a coalition graph CG(G, \Psi) is associated on \Psi such that there is a one-to-one correspondence between its vertices and the members of \Psi.
Edit intent: clarity
Original:  Moreover, we characterize all graphs ~ G with \delta(G)\leq 1 and C(G)=n, where n is the number of vertices of G. Furthermore, we characterize all trees T with C(T)=n and all trees T with C(T)=n-1.
Revised:  Moreover, we characterize all graphs G with \delta(G)\leq 1 and C(G)=n, where n is the number of vertices of G. Furthermore, we characterize all trees T with C(T)=n and all trees T with C(T)=n-1.
Edit intent: coherence
Original:  This solves partially one of the open problem posed in ~ coal0.
Revised:  This solves partially one of the open problem posed in coal0.
Edit intent: fluency
Original:  These solve two open problems posed by Haynes et al. ~ coal1.
Revised:  These solve two open problems posed by Haynes et al. coal1.
Edit intent: fluency
Original:  This ``effort'' and `` cost per unit-of-effort '' perspective naturally leads to a principal-agent problem with hidden action and single-dimensional private type, which generalizes both the classic principal-agent hidden action model of contract theory \`a la Grossmann and Hart [ 1986 ] and the (procurement version) of single-dimensional mechanism design \`a la Myerson [ 1983 ].
Revised:  This "effort" and " cost per unit-of-effort '' perspective naturally leads to a principal-agent problem with hidden action and single-dimensional private type, which generalizes both the classic principal-agent hidden action model of contract theory \`a la Grossmann and Hart [ 1986 ] and the (procurement version) of single-dimensional mechanism design \`a la Myerson [ 1983 ].
Edit intent: fluency
Original:  This ``effort'' and `` cost per unit-of-effort '' perspective naturally leads to a principal-agent problem with hidden action and single-dimensional private type, which generalizes both the classic principal-agent hidden action model of contract theory \`a la Grossmann and Hart [ 1986 ] and the (procurement version) of single-dimensional mechanism design \`a la Myerson [ 1983 ].
Revised:  This ``effort'' and `` cost per unit-of-effort " perspective naturally leads to a principal-agent problem with hidden action and single-dimensional private type, which generalizes both the classic principal-agent hidden action model of contract theory \`a la Grossmann and Hart [ 1986 ] and the (procurement version) of single-dimensional mechanism design \`a la Myerson [ 1983 ].
Edit intent: fluency
Original:  This ``effort'' and `` cost per unit-of-effort '' perspective naturally leads to a principal-agent problem with hidden action and single-dimensional private type, which generalizes both the classic principal-agent hidden action model of contract theory \`a la Grossmann and Hart [ 1986 ] and the (procurement version) of single-dimensional mechanism design \`a la Myerson [ 1983 ].
Revised:  This ``effort'' and `` cost per unit-of-effort '' perspective naturally leads to a principal-agent problem with hidden action and single-dimensional private type, which generalizes both the classic principal-agent hidden action model of contract theory \`a la Grossman and Hart [ 1986 ] and the (procurement version) of single-dimensional mechanism design \`a la Myerson [ 1983 ].
Edit intent: fluency
Original:  This ``effort'' and `` cost per unit-of-effort '' perspective naturally leads to a principal-agent problem with hidden action and single-dimensional private type, which generalizes both the classic principal-agent hidden action model of contract theory \`a la Grossmann and Hart [ 1986 ] and the (procurement version) of single-dimensional mechanism design \`a la Myerson [ 1983 ].
Revised:  This ``effort'' and `` cost per unit-of-effort '' perspective naturally leads to a principal-agent problem with hidden action and single-dimensional private type, which generalizes both the classic principal-agent hidden action model of contract theory \`a la Grossmann and Hart [ 1983 ] and the (procurement version) of single-dimensional mechanism design \`a la Myerson [ 1983 ].
Edit intent: clarity
Original: What is being learned by superhuman neural network agents such as AlphaZero?
Revised: What is learned by sophisticated neural network agents such as AlphaZero?
Edit intent: clarity
Original:  The proposed hybrid controller generates continuous velocity input trajectories when the robot is initialized away from the boundaries of the obstacles .
Revised:  The proposed hybrid controller generates continuous velocity input trajectories when the robot is initialized away from the boundaries of the unsafe regions .
Edit intent: clarity
Original:  Generally, teleworking arrangements have direct effect on worker's efficiency and motivation.
Revised:  Generally, teleworking arrangements impacts directly worker's efficiency and motivation.
Edit intent: clarity
Original:  This tool becomes even more important today as it could support the adequate gender mainstreaming in the ` Next Generation EU ' recovery plan and help to manage related social impacts of COVID-19 through policymaking.
Revised:  This tool becomes even more important today as it could support the adequate gender mainstreaming in the `` Next Generation EU ' recovery plan and help to manage related social impacts of COVID-19 through policymaking.
Edit intent: fluency
Original:  This tool becomes even more important today as it could support the adequate gender mainstreaming in the ` Next Generation EU ' recovery plan and help to manage related social impacts of COVID-19 through policymaking.
Revised:  This tool becomes even more important today as it could support the adequate gender mainstreaming in the ` Next Generation EU '' recovery plan and help to manage related social impacts of COVID-19 through policymaking.
Edit intent: fluency
Original: The influential work of Bravo et al. ( 2018 ) shows that derivative free play in strongly monotone games converges at the rate O%DIFDELCMD < \left(%%% \frac{d^2{T^{1/3}}}%DIFDELCMD < \right)%%% , where T is the time horizon and d is the ambient dimension .
Revised: The influential work of Bravo et al. 2018 ) shows that derivative free play in strongly monotone games converges at the rate O%DIFDELCMD < \left(%%% \frac{d^2{T^{1/3}}}%DIFDELCMD < \right)%%% , where T is the time horizon and d is the ambient dimension .
Edit intent: clarity
Original: The influential work of Bravo et al. ( 2018 ) shows that derivative free play in strongly monotone games converges at the rate O%DIFDELCMD < \left(%%% \frac{d^2{T^{1/3}}}%DIFDELCMD < \right)%%% , where T is the time horizon and d is the ambient dimension .
Revised: The influential work of Bravo et al. ( 2018 shows that derivative free play in strongly monotone games converges at the rate O%DIFDELCMD < \left(%%% \frac{d^2{T^{1/3}}}%DIFDELCMD < \right)%%% , where T is the time horizon and d is the ambient dimension .
Edit intent: fluency
Original: The influential work of Bravo et al. ( 2018 ) shows that derivative free play in strongly monotone games converges at the rate O%DIFDELCMD < \left(%%% \frac{d^2{T^{1/3}}}%DIFDELCMD < \right)%%% , where T is the time horizon and d is the ambient dimension .
Revised: The influential work of Bravo et al. ( 2018 ) shows that derivative free play in strongly monotone games %DIFDELCMD < \left(%%% \frac{d^2{T^{1/3}}}%DIFDELCMD < \right)%%% , where T is the time horizon and d is the ambient dimension .
Edit intent: clarity
Original: This paper presents a novel  voltage control strategy for grid-forming using a three-phase inverter connected to a battery energy storage system . Stationary reference frame (\alpha \beta) based control is used to regulate voltage distortions caused by negative-sequence currents for maintaining balanced three-phase output voltages.
Revised: This paper presents a novel voltage control strategy for a battery energy storage system . Stationary reference frame (\alpha \beta) based control is used to regulate voltage distortions caused by negative-sequence currents for maintaining balanced three-phase output voltages.
Edit intent: clarity
Original: This paper presents a novel  voltage control strategy for grid-forming using a three-phase inverter connected to a battery energy storage system . Stationary reference frame (\alpha \beta) based control is used to regulate voltage distortions caused by negative-sequence currents for maintaining balanced three-phase output voltages.
Revised: This paper presents a novel voltage control strategy for grid-forming using a three-phase inverter connected to a battery energy storage system . Stationary reference frame (\alpha \beta) based control scheme is proposed to regulate positive-sequence and negative-sequence currents for maintaining balanced three-phase output voltages.
Edit intent: clarity
Original:  A grounding transformer is used to reduce the zero-sequence voltage caused by serving 1-phase loads to further improve the performance under severely unbalanced loads .
Revised:  A grounding transformer is used to reduce the zero-sequence current for further reducing the voltage unbalance .
Edit intent: clarity
Original:  Simulation results demonstrate the efficacy of the proposed control strategy for regulating system voltage using inverter-based resources .
Revised:  Simulation results demonstrate the effective performance of the proposed control strategy for regulating system voltage using inverter-based resources .
Edit intent: clarity
Original:  Simulation results demonstrate the efficacy of the proposed control strategy for regulating system voltage using inverter-based resources .
Revised:  Simulation results demonstrate the efficacy of the proposed voltage control scheme .
Edit intent: clarity
Original: This paper presents a novel grid-forming voltage control strategy for a battery energy storage system to maintain balanced three-phase output voltages under power unbalanced loads.
Revised: This paper presents a novel grid-forming voltage control strategy for a battery energy storage system to maintain balanced three-phase output voltages when serving unbalanced loads.
Edit intent: clarity
Original:  A stationary reference frame (\alpha \beta) based control scheme is proposed to regulate positive-sequence and negative-sequence voltages , whose control mechanism and better performance are compared with the conventional rotating reference frame (dq) based control scheme . Based on the analysis of the system zero-sequence equivalent circuit, we propose to add a grounding transformer to filter the zero-sequence current for further reducing the  voltage unbalance .
Revised:  A stationary reference frame (\alpha \beta) based control scheme is proposed to regulate positive-sequence and negative-sequence voltages . Compared with the conventional rotating reference frame (dq) based control scheme . Based on the analysis of the system zero-sequence equivalent circuit, we propose to add a grounding transformer to filter the zero-sequence current for further reducing the voltage unbalance .
Edit intent: coherence