wanyu/IteraTeR_v2 huggingface dataset:
Original: We study the adhesion of a droplet  with insoluble surfactant laid on its capillary surface to a textured substrate.
Revised: We study the adhesion of a droplet with insoluble surfactant laid on its capillary surface , on a textured substrate.
Edit intent: clarity
Original:  This allows us to derive the full dynamics of the droplets laid by the insoluble surfactant: (i) the moving contact lines, (ii) the evolution of the capillary surface, and (iii) the surfactant dynamics on this moving surface with a boundary condition at the contact lines  .
Revised:  This allows us to derive the full dynamics of the droplets laid by the insoluble surfactant: (i) the moving contact lines, (ii) the evolution of the capillary surface, (iii) the surfactant dynamics on this moving surface with a boundary condition at the contact lines .
Edit intent: fluency
Original:  We also prove the Rayleigh dissipation functional for the viscous flow case is stronger than the one for the motion by mean curvature.
Revised:  We also prove the Rayleigh dissipation functional for viscous flow case is stronger than the one for the motion by mean curvature.
Edit intent: fluency
Original:  After incorporating the textured substrate profile, we design numerical schemes based on unconditionally stable explicit boundary updates and moving grids, which enable efficient computations for many challenging examples showing the significant contributions of the surfactant  .
Revised:  After incorporating the textured substrate profile, we design a numerical scheme based on unconditionally stable explicit boundary updates and moving grids, which enable efficient computations for many challenging examples showing the significant contributions of the surfactant .
Edit intent: fluency
Original:  After incorporating the textured substrate profile, we design numerical schemes based on unconditionally stable explicit boundary updates and moving grids, which enable efficient computations for many challenging examples showing the significant contributions of the surfactant  .
Revised:  After incorporating the textured substrate profile, we design numerical schemes based on unconditionally stable explicit boundary updates and moving grids, which enable efficient computations for many challenging examples showing significant impacts of the surfactant .
Edit intent: clarity
Original:  In this paper, we are concerned with the computation of the minimal-norm solution to an underdetermined nonlinear least-squares problem.
Revised:  In this paper, we are concerned with the computation of the minimal-norm solution of an underdetermined nonlinear least-squares problem.
Edit intent: fluency
Original:  In this paper, we proposed a novel approach, named PEP (short for Plug-in Embedding Pruning), to reduce the size of the embedding table while obviating a drop in accuracyand computational optimization .
Revised:  In this paper, we proposed a novel approach, named PEP (short for Plug-in Embedding Pruning), to reduce the size of the embedding table while avoiding the drop of recommendation accuracy .
Edit intent: clarity
Original:  This is formulated as a tunnel passing problem, which includes passing a tunnel , inter-agent collision avoidance and keeping within the tunnel . Lyapunov-like functions are designed elaborately, and formal analysis based on invariant set theorem is made to show that all UAVs can pass the tunnel without getting trapped, avoid collision and keep within the tunnel .
Revised:  This is formulated as a virtual tube passing problem, which includes passing a tunnel , inter-agent collision avoidance and keeping within the tunnel . Lyapunov-like functions are designed elaborately, and formal analysis based on invariant set theorem is made to show that all UAVs can pass the tunnel without getting trapped, avoid collision and keep within the tunnel .
Edit intent: clarity
Original:  This is formulated as a tunnel passing problem, which includes passing a tunnel , inter-agent collision avoidance and keeping within the tunnel . Lyapunov-like functions are designed elaborately, and formal analysis based on invariant set theorem is made to show that all UAVs can pass the tunnel without getting trapped, avoid collision and keep within the tunnel .
Revised:  This is formulated as a tunnel passing problem, which includes passing a virtual tube , inter-agent collision avoidance and keeping within the tunnel . Lyapunov-like functions are designed elaborately, and formal analysis based on invariant set theorem is made to show that all UAVs can pass the tunnel without getting trapped, avoid collision and keep within the tunnel .
Edit intent: clarity
Original:  This is formulated as a tunnel passing problem, which includes passing a tunnel , inter-agent collision avoidance and keeping within the tunnel . Lyapunov-like functions are designed elaborately, and formal analysis based on invariant set theorem is made to show that all UAVs can pass the tunnel without getting trapped, avoid collision and keep within the tunnel .
Revised:  This is formulated as a tunnel passing problem, which includes passing a tunnel , inter-agent collision avoidance and keeping within the virtual tube . Lyapunov-like functions are designed elaborately, and formal analysis based on invariant set theorem is made to show that all UAVs can pass the tunnel without getting trapped, avoid collision and keep within the tunnel .
Edit intent: clarity
Original:  This is formulated as a tunnel passing problem, which includes passing a tunnel , inter-agent collision avoidance and keeping within the tunnel . Lyapunov-like functions are designed elaborately, and formal analysis based on invariant set theorem is made to show that all UAVs can pass the tunnel without getting trapped, avoid collision and keep within the tunnel .
Revised:  This is formulated as a tunnel passing problem, which includes passing a tunnel , inter-agent collision avoidance and keeping within the tunnel . Lyapunov-like functions are designed elaborately, and formal analysis based on invariant set theorem is made to show that all UAVs can pass the virtual tube without getting trapped, avoid collision and keep within the tunnel .
Edit intent: clarity
Original:  This is formulated as a tunnel passing problem, which includes passing a tunnel , inter-agent collision avoidance and keeping within the tunnel . Lyapunov-like functions are designed elaborately, and formal analysis based on invariant set theorem is made to show that all UAVs can pass the tunnel without getting trapped, avoid collision and keep within the tunnel .
Revised:  This is formulated as a tunnel passing problem, which includes passing a tunnel , inter-agent collision avoidance and keeping within the tunnel . Lyapunov-like functions are designed elaborately, and formal analysis based on invariant set theorem is made to show that all UAVs can pass the tunnel without getting trapped, avoid collision and keep within the virtual tube .
Edit intent: clarity
Original:  What is more, by the proposed distributed control, a VTOL UAV can keep away from another VTOL UAV or return back to the tunnel as soon as possible, once it enters into the safety area of another or has a collision with the tunnel during it is passing the tunnel . Simulations and experiments are carried out to show the effectiveness of the proposed method and the comparison with other methods.
Revised:  What is more, by the proposed distributed control, a VTOL UAV can keep away from another VTOL UAV or return back to the virtual tube as soon as possible, once it enters into the safety area of another or has a collision with the tunnel during it is passing the tunnel . Simulations and experiments are carried out to show the effectiveness of the proposed method and the comparison with other methods.
Edit intent: clarity
Original:  What is more, by the proposed distributed control, a VTOL UAV can keep away from another VTOL UAV or return back to the tunnel as soon as possible, once it enters into the safety area of another or has a collision with the tunnel during it is passing the tunnel . Simulations and experiments are carried out to show the effectiveness of the proposed method and the comparison with other methods.
Revised:  What is more, by the proposed distributed control, a VTOL UAV can keep away from another VTOL UAV or return back to the tunnel as soon as possible, once it enters into the safety area of another or has a collision with the virtual tube during it is passing the tunnel . Simulations and experiments are carried out to show the effectiveness of the proposed method and the comparison with other methods.
Edit intent: clarity
Original:  What is more, by the proposed distributed control, a VTOL UAV can keep away from another VTOL UAV or return back to the tunnel as soon as possible, once it enters into the safety area of another or has a collision with the tunnel during it is passing the tunnel . Simulations and experiments are carried out to show the effectiveness of the proposed method and the comparison with other methods.
Revised:  What is more, by the proposed distributed control, a VTOL UAV can keep away from another VTOL UAV or return back to the tunnel as soon as possible, once it enters into the safety area of another or has a collision with the tunnel during it is passing the virtual tube . Simulations and experiments are carried out to show the effectiveness of the proposed method and the comparison with other methods.
Edit intent: clarity
Original:  We study a variety of 2-player heap games induced by standard arithmetic functions, such as divisors, relatively prime numbers, and their negations .
Revised:  We study a variety of 2-player games induced by standard arithmetic functions, such as divisors, relatively prime numbers, and their negations .
Edit intent: clarity
Original: This paper is concerned with simple games.
Revised: This study investigates simple games.
Edit intent: clarity
Original:  One of the fundamental questions regarding simple games is that of what makes a simple game  a weighted majority game.
Revised:  A fundamental research question in this field is to determine necessary and sufficient conditions for a simple game a weighted majority game.
Edit intent: clarity
Original:  One of the fundamental questions regarding simple games is that of what makes a simple game  a weighted majority game.
Revised:  One of the fundamental questions regarding simple games is that of what makes a simple game to be a weighted majority game.
Edit intent: clarity
Original:  We provide a new proof of the existence of a trading transform when a given simple game is non-weighted.
Revised:  In this study, we provide a new proof of the existence of a trading transform when a given simple game is non-weighted.
Edit intent: clarity
Original:  We also discuss an integer weights representation of a weighted simple game, and improve on the bounds obtained by Muroga (1971).
Revised:  We also discuss an integer-weight representation of a weighted simple game, and improve on the bounds obtained by Muroga (1971).
Edit intent: fluency
Original:  We also discuss an integer weights representation of a weighted simple game, and improve on the bounds obtained by Muroga (1971).
Revised:  We also discuss an integer weights representation of a weighted simple game, improving the bounds obtained by Muroga (1971).
Edit intent: coherence
Original:  We show that our bounds are tight when the number of players is less than or equal to five, based on the computational results obtained by Kurz (2012).
Revised:  We show that our bound on the quota is tight when the number of players is less than or equal to five, based on the computational results obtained by Kurz (2012).
Edit intent: clarity
Original:  Lastly, we deal with the problem of finding an integer weights representation under the assumption that we have minimal winning coalitions and maximal losing coalitions.
Revised:  Furthermore, we discuss the problem of finding an integer weights representation under the assumption that we have minimal winning coalitions and maximal losing coalitions.
Edit intent: clarity
Original:  Lastly, we deal with the problem of finding an integer weights representation under the assumption that we have minimal winning coalitions and maximal losing coalitions.
Revised:  Lastly, we deal with the problem of finding an integer-weight representation under the assumption that we have minimal winning coalitions and maximal losing coalitions.
Edit intent: fluency
Original:  We discuss a performance of a rounding method  .
Revised:  In particular, we show a performance of a rounding method .
Edit intent: clarity
Original:  Specifically, well-performing event-level localization work requires fully labeled development subsets to obtain event duration estimates, which significantly benefits localization performance.
Revised:  Specifically, well-performing event-level localization requires fully labeled development subsets to obtain event duration estimates, which significantly benefits localization performance.
Edit intent: clarity
Original:  In the meantime, this paper proposes a new post-processing strategy named Triple Threshold and investigates two data augmentation methods along with a label smoothing method within the scope of WSSED. Evaluation of our model is done on three publicly available datasets: Task 4 of the DCASE2017 and 2018 datasets, as well as URBAN-SED.
Revised:  This paper proposes a new post-processing strategy named Triple Threshold and investigates two data augmentation methods along with a label smoothing method within the scope of WSSED. Evaluation of our model is done on three publicly available datasets: Task 4 of the DCASE2017 and 2018 datasets, as well as URBAN-SED.
Edit intent: coherence
Original:  In the meantime, this paper proposes a new post-processing strategy named Triple Threshold and investigates two data augmentation methods along with a label smoothing method within the scope of WSSED. Evaluation of our model is done on three publicly available datasets: Task 4 of the DCASE2017 and 2018 datasets, as well as URBAN-SED.
Revised:  In the meantime, this paper proposes a new post-processing strategy named "Triple Threshold" and investigates two data augmentation methods along with a label smoothing method within the scope of WSSED. Evaluation of our model is done on three publicly available datasets: Task 4 of the DCASE2017 and 2018 datasets, as well as URBAN-SED.
Edit intent: fluency
Original:  In the meantime, this paper proposes a new post-processing strategy named Triple Threshold and investigates two data augmentation methods along with a label smoothing method within the scope of WSSED. Evaluation of our model is done on three publicly available datasets: Task 4 of the DCASE2017 and 2018 datasets, as well as URBAN-SED.
Revised:  In the meantime, this paper proposes a new post-processing strategy named Triple Threshold and investigates two data augmentation methods along with a label smoothing method within the scope of WSSED. Evaluation of our model is done on the DCASE2017 and 2018 datasets, as well as URBAN-SED.
Edit intent: coherence
Original:  Lastly, we run a series of ablation experiments to reveal that without post-processing, our model's localization performance drop is significantly lower compared with other approaches.
Revised:  Lastly, ablation experiments to reveal that without post-processing, our model's localization performance drop is significantly lower compared with other approaches.
Edit intent: clarity
Original:  The experimental results show that Angelica achieves significant speedups against the state-of-the-art graph pattern mining systems and supports large pattern mining that none of the existing systems can handle.
Revised:  The experimental results show that our system achieves significant speedups against the state-of-the-art graph pattern mining systems and supports large pattern mining that none of the existing systems can handle.
Edit intent: clarity
Original:  The experimental results show that Angelica achieves significant speedups against the state-of-the-art graph pattern mining systems and supports large pattern mining that none of the existing systems can handle.
Revised:  The experimental results show that Angelica achieves significant speedups against the state-of-the-art graph pattern mining systems and supports larger pattern mining tasks that none of the existing systems can handle.
Edit intent: clarity
Original: Computing the similarity of two point sets is an ubiquitous task in medical imaging, geometric shape comparison, trajectory analysis, and many more settings.
Revised: Computing the similarity of two point sets is a ubiquitous task in medical imaging, geometric shape comparison, trajectory analysis, and many more settings.
Edit intent: fluency
Original:  We show that for any n^{-2}\le\epsilon\le 1, if %DIFDELCMD < \[\#\{\xi \in \{0,1\}^{n}: \langle %DIFDELCMD < \xi, w \rangle = r\} \ge 2^{-\epsilon n}\cdot 2^{n}\]%%% \[\#\{\xi \in \{0,1\}^{n}: \langle \xi, w \rangle = \tau\} \ge 2^{-\epsilon n}\cdot 2^{n}\] for some r \in R, then \[\#\{\langle \xi, w \rangle : \xi \in \{0,1\}^{n}\} \le 2^{O(\epsilonn)}.
Revised:  We show that for any n^{-2}\le\epsilon\le 1, if %DIFDELCMD < \[\#\{\xi \in \{0,1\}^{n}: \langle %DIFDELCMD < \xi, w \rangle = r\} \ge 2^{-\epsilon n}\cdot 2^{n}\]%%% \[\#\{\xi \in \{0,1\}^{n}: \langle \xi, w \rangle = \tau\} \ge 2^{-\epsilon n}\cdot 2^{n}\] for some \tau \in R, then \[\#\{\langle \xi, w \rangle : \xi \in \{0,1\}^{n}\} \le 2^{O(\epsilonn)}.
Edit intent: clarity
Original:  It explains how DCTCP introduces unnecessary lag equivalent to 1.5--2 RTTs , due to the way it processes congestion feedback.
Revised:  It explains how DCTCP introduces 1--2 rounds of unnecessary lag , due to the way it processes congestion feedback.
Edit intent: clarity
Original:  A per-ACK moving average is proposed that cuts out 1 RTT of this lag . Paradoxically, the rest of the lag is reduced by spreading the congestion response over a round.
Revised:  A per-ACK moving average is proposed . It always cuts out 1 RTT of this lag . Paradoxically, the rest of the lag is reduced by spreading the congestion response over a round.
Edit intent: coherence
Original:  A per-ACK moving average is proposed that cuts out 1 RTT of this lag . Paradoxically, the rest of the lag is reduced by spreading the congestion response over a round.
Revised:  A per-ACK moving average is proposed that cuts out 1 RTT of this lag . Paradoxically, the rest of the lag by spreading the congestion response over a round.
Edit intent: clarity
Original:  The EWMA is designed to still smooth over the same set number of round trips, even though it is clocked per-ACK.
Revised:  The EWMA still averages out variations in the feedback signal over the same set number of round trips, even though it is clocked per-ACK.
Edit intent: clarity
Original:  This version  is released prior to full evaluation  in order to elicit early feedback on the design.
Revised:  This version of the report is released prior to full evaluation in order to elicit early feedback on the design.
Edit intent: clarity
Original:  This version  is released prior to full evaluation  in order to elicit early feedback on the design.
Revised:  This version is released prior to full evaluation , in order to elicit early feedback on the design.
Edit intent: fluency
Original:  Hence, we: ( i ) show how to insert permutation constraints into a QUBO problem and (ii) solve the constrained QUBO problem on the current generation of the adiabatic quantum computers D-Wave.
Revised:  Hence, we: ( I ) show how to insert permutation constraints into a QUBO problem and (ii) solve the constrained QUBO problem on the current generation of the adiabatic quantum computers D-Wave.
Edit intent: fluency
Original:  To remain aware of the fast-evolving  threat landscape, open-source Cyber Threat Intelligence (OSCTI) has received growing attention from the community.
Revised:  To remain aware of the fast-evolving cyber threat landscape, open-source Cyber Threat Intelligence (OSCTI) has received growing attention from the community.
Edit intent: fluency
Original: In recognition of the transformative opportunities that broadband connectivity presents, the United Nations Broadband Commission has committed the international community to accelerate universal access across the developing world .
Revised: The United Nations Broadband Commission has committed the international community to accelerate universal access across the developing world .
Edit intent: clarity
Original: In recognition of the transformative opportunities that broadband connectivity presents, the United Nations Broadband Commission has committed the international community to accelerate universal access across the developing world .
Revised: In recognition of the transformative opportunities that broadband connectivity presents, the United Nations Broadband Commission has committed the international community to accelerate universal broadband .
Edit intent: clarity
Original:  To provide at least 2 Mbps per user, 4G is often the cheapest option to reach universal coverage.
Edit intent: coherence
Original:  Providing governments make judicious choices, adopting fiscal and regulatory regimes conducive to lowering costs, broadband universal service may be within reach of most developing countries over the next decade.
Revised:  Providing governments make judicious choices, adopting fiscal and regulatory regimes conducive to lowering costs, universal broadband may be within reach of most developing countries over the next decade.
Edit intent: clarity
Original:  Specifically, we work at a networked epidemic spreading under a vaccination campaign with agents in favor and against the vaccine.
Revised:  Specifically, we work on a networked epidemic spreading under a vaccination campaign with agents in favor and against the vaccine.
Edit intent: fluency
Original:  Our results show that such coupled dynamics exhibit a myriad of phenomena such as nonequilibrium transitions accompanied by bistability.
Revised:  Our results show that such coupled dynamics exhibits a myriad of phenomena such as nonequilibrium transitions accompanied by bistability.
Edit intent: fluency
Original:  Besides we observe the emergence of an intermediate optimal segregation level where the community structure can favor the negative opinions about vaccination but counterintuitively hinders - rather than enhance - the global disease spreading.
Revised:  Besides we observe the emergence of an intermediate optimal segregation level where the community structure enhances negative opinions over vaccination but counterintuitively hinders - rather than enhance - the global disease spreading.
Edit intent: clarity
Original:  Besides we observe the emergence of an intermediate optimal segregation level where the community structure can favor the negative opinions about vaccination but counterintuitively hinders - rather than enhance - the global disease spreading.
Revised:  Besides we observe the emergence of an intermediate optimal segregation level where the community structure can favor the negative opinions about vaccination but counterintuitively hinders - rather than favoring - the global disease spreading.
Edit intent: clarity
Original:  Thus, our results point out that vaccination campaigns should avoid policies that end up segregating excessively anti-vaccine groups  .
Revised:  Thus, our results hint vaccination campaigns should avoid policies that end up segregating excessively anti-vaccine groups .
Edit intent: clarity
Original: Interfaces for creating visualizations typically embrace one of several common forms  Textual specification enables fine-grained control, shelf building facilitates rapid exploration, while chart choosing promotes immediacy and simplicity.
Revised: Interfaces for creating visualizations typically embrace one of several common forms . Textual specification enables fine-grained control, shelf building facilitates rapid exploration, while chart choosing promotes immediacy and simplicity.
Edit intent: fluency