wanyu/IteraTeR_v2 huggingface dataset:
Original:  Significant gains in CPU time are achieved by using large time steps without sacrificing accuracy.
Revised:  Significant gains in Central Processing Unit (CPU) time are achieved by using large time steps without sacrificing accuracy.
Edit intent: clarity
Original: The Second DiCOVA Challenge aims at accelerating the research in diagnosing COVID-19 using acoustics (DiCOVA) , a topic at the intersection of acoustics  signal processing, machine learning, and healthcare.
Revised: The Second Diagnosis of COVID-19 using Acoustics (DiCOVA) Challenge aimed at accelerating the research in diagnosing COVID-19 using acoustics (DiCOVA) , a topic at the intersection of acoustics signal processing, machine learning, and healthcare.
Edit intent: clarity
Original: The Second DiCOVA Challenge aims at accelerating the research in diagnosing COVID-19 using acoustics (DiCOVA) , a topic at the intersection of acoustics  signal processing, machine learning, and healthcare.
Revised: The Second DiCOVA Challenge aims at accelerating the research in acoustics based detection of COVID-19 using acoustics (DiCOVA) , a topic at the intersection of acoustics signal processing, machine learning, and healthcare.
Edit intent: clarity
Original: The Second DiCOVA Challenge aims at accelerating the research in diagnosing COVID-19 using acoustics (DiCOVA) , a topic at the intersection of acoustics  signal processing, machine learning, and healthcare.
Revised: The Second DiCOVA Challenge aims at accelerating the research in diagnosing COVID-19 , a topic at the intersection of acoustics signal processing, machine learning, and healthcare.
Edit intent: clarity
Original: The Second DiCOVA Challenge aims at accelerating the research in diagnosing COVID-19 using acoustics (DiCOVA) , a topic at the intersection of acoustics  signal processing, machine learning, and healthcare.
Revised: The Second DiCOVA Challenge aims at accelerating the research in diagnosing COVID-19 using acoustics (DiCOVA) , a topic at the intersection of acoustics , signal processing, machine learning, and healthcare.
Edit intent: fluency
Original:  This challenge is an open call to researchers to analyze a dataset of audio recordings , collected from individuals with and without COVID-19 , for a two-class classification.
Revised:  This challenge is an open call for researchers to analyze a dataset of audio recordings , collected from individuals with and without COVID-19 , for a two-class classification.
Edit intent: fluency
Original:  The development set audio recordings correspond to breathing, cough, and speech sound samples collected from 965 (172 COVID) individuals .
Revised:  The development set audio recordings were collected from 965 (172 COVID) individuals .
Edit intent: clarity
Original:  The challenge features four tracks, one associated with each sound category and a fourth fusion track allowing experimentation with combination of the individual sound categories .
Revised:  The challenge featured four tracks, one associated with each sound category and a fourth fusion track allowing experimentation with combination of the individual sound categories .
Edit intent: fluency
Original:  In this paper, we introduce the challengeand provide a detailed description of the task and a baseline system .
Revised:  In this paper, we present an overview of the challenge, the rationale for the data collection and the baseline system. Further, a performance analysis for the systems submitted by the 16 participating teams in the leaderboard is also presented .
Edit intent: coherence
Original: To induce a desired equilibrium in a social system comprised of self-interested agents, economic incentives (e.g., taxes, tolls, and subsidies) are often required to correct an inefficient outcome.
Revised: To regulate a social system comprised of self-interested agents, economic incentives (e.g., taxes, tolls, and subsidies) are often required to correct an inefficient outcome.
Edit intent: clarity
Original:  Such an incentive design problem naturally possesses a bi-level structure, in which an upper-level "designer" revises the payoffs of the agents with incentives while anticipating the response of the agents  , who play a non-cooperative game at the lower level .
Revised:  Such an incentive design problem naturally possesses a bi-level structure, in which an upper-level "designer" modifies the payoffs of the agents with incentives while anticipating the response of the agents , who play a non-cooperative game at the lower level .
Edit intent: clarity
Original:  Such an incentive design problem naturally possesses a bi-level structure, in which an upper-level "designer" revises the payoffs of the agents with incentives while anticipating the response of the agents  , who play a non-cooperative game at the lower level .
Revised:  Such an incentive design problem naturally possesses a bi-level structure, in which an upper-level "designer" revises the payoffs of the agents with incentives while anticipating the response of the agents at the lower level , who play a non-cooperative game at the lower level .
Edit intent: fluency
Original:  bypassing the time-consuming step of equilibrium-finding can reduce the computational cost, but may lead  to a sub-optimal solution.
Revised:  bypassing the time-consuming step of equilibrium-finding can reduce the computational cost, but may lead the designer to a sub-optimal solution.
Edit intent: clarity
Original:  Therefore , we propose an efficient method that tackles the designer's and agents' problems simultaneously in a single loop.
Revised:  Therefore , we propose a method that tackles the designer's and agents' problems simultaneously in a single loop.
Edit intent: clarity
Original:  At each iteration, both the designer and the agents only move one step based on the first-order information.
Revised:  In particular, at each iteration, both the designer and the agents only move one step based on the first-order information.
Edit intent: coherence
Original:  The Selective Attention Collection Module (SACM) in our approach leverages attention weights in ViT and filters them adaptively to corre-spond with the relative importance of input patches.
Revised:  The Selective Attention Collection Module (SACM) in our approach leverages attention weights in ViT and filters them adaptively to correspond with the relative importance of input patches.
Edit intent: fluency
Original:  The technology is intended as backbone network at factory scale and line rates of 10 - 100Gbit/s that carries massive amounts of IT traffic together with  sub-microsecond precision machine control type traffic .
Revised:  The technology is intended as backbone network at factory scale and line rates of 10 - 100Gbit/s . The backbone is intended to carry massive amounts of IT traffic together with sub-microsecond precision machine control type traffic .
Edit intent: clarity
Original:  We prove our claims by prototype measurements, interoperability tests , and field trials.
Revised:  We prove our claims by prototype measurements, interoperability tests and field trials.
Edit intent: fluency
Original:  Applications of neural networks have been extended to include similarity and metric learning.
Revised:  Applications of neural networks have been extended to include similarity learning.
Edit intent: clarity
Original:  The generated representations can help preserve regions of the embedding space used by prior knowledge so that new knowledge will not "overwrite" prior knowledge.
Revised:  The generated representations can help preserve regions of the embedding space used by prior knowledge so that new knowledge will not ``overwrite'' prior knowledge.
Edit intent: fluency
Original: We propose a conservative energy method based on a neural network with subdomains (CENN), where the admissible function satisfying the essential boundary condition without boundary penalty is constructed by the radial basis function  , particular solution neural network, and general neural network.
Revised: We propose a conservative energy method based on neural networks with subdomains (CENN), where the admissible function satisfying the essential boundary condition without boundary penalty is constructed by the radial basis function , particular solution neural network, and general neural network.
Edit intent: fluency
Original:  We apply the proposed method to some representative examples to demonstrate the ability of the proposed method to model strong discontinuity, singularity, complex boundary, non-linear, and heterogeneous PDE problems.
Revised:  The advantage of the proposed method to some representative examples to demonstrate the ability of the proposed method to model strong discontinuity, singularity, complex boundary, non-linear, and heterogeneous PDE problems.
Edit intent: clarity
Original:  The purpose of this paper is to amend this commonly reported issue .
Revised:  The purpose of this paper is to overcome this drawback .
Edit intent: clarity
Original:  Then, by using a new proposed posteriori adaptive technique, we apply this LOP property to obtain the new mappings from those of the WENO-X schemes where "X" stands for the version of the existing mapped WENO scheme .
Revised:  Then, by using a new proposed posteriori adaptive technique, we apply this LOP property to obtain the new mappings from those of the WENO-X schemes .
Edit intent: clarity
Original:  Additionally, a consistency constraint by minimizing difference between current and ensemble predictions is designed to improve the robustness of predictions.
Revised:  Additionally, a consistency constraint by minimizing the discrepancy distance between instant and ensemble predictions is designed to improve the robustness of predictions.
Edit intent: clarity
Original:  Based on this observation, we propose an ensemble-diversified actor-critic algorithm that reduces the number of required ensemble networks down to a tenth compared to the naive ensemble while achieving state-of-the-art performance on most of the D4RL benchmarks considered 
Revised:  Based on this observation, we propose an ensemble-diversified actor-critic algorithm that reduces the number of required ensemble networks down to a tenth compared to the naive ensemble while achieving state-of-the-art performance on most of the D4RL benchmarks considered .
Edit intent: fluency
Original: As summer in the northern hemisphere comes to an end, changes in daylight, temperature, and weather -- and people's reaction to them -- will be the drivers of a disadvantageous seasonality of SARS-CoV-2 . With the seasonal odds against us, stabilization of new COVID-19 cases and hospitalizations requires high immunity levels in the population or sufficient non-pharmaceutical interventions (NPIs) .
Revised: With winter coming in the northern hemisphere comes to an end, changes in daylight, temperature, and weather -- and people's reaction to them -- will be the drivers of a disadvantageous seasonality of SARS-CoV-2 . With the seasonal odds against us, stabilization of new COVID-19 cases and hospitalizations requires high immunity levels in the population or sufficient non-pharmaceutical interventions (NPIs) .
Edit intent: clarity
Original: As summer in the northern hemisphere comes to an end, changes in daylight, temperature, and weather -- and people's reaction to them -- will be the drivers of a disadvantageous seasonality of SARS-CoV-2 . With the seasonal odds against us, stabilization of new COVID-19 cases and hospitalizations requires high immunity levels in the population or sufficient non-pharmaceutical interventions (NPIs) .
Revised: As summer in the northern hemisphere , disadvantageous seasonality of SARS-CoV-2 . With the seasonal odds against us, stabilization of new COVID-19 cases and hospitalizations requires high immunity levels in the population or sufficient non-pharmaceutical interventions (NPIs) .
Edit intent: clarity
Original: As summer in the northern hemisphere comes to an end, changes in daylight, temperature, and weather -- and people's reaction to them -- will be the drivers of a disadvantageous seasonality of SARS-CoV-2 . With the seasonal odds against us, stabilization of new COVID-19 cases and hospitalizations requires high immunity levels in the population or sufficient non-pharmaceutical interventions (NPIs) .
Revised: As summer in the northern hemisphere comes to an end, changes in daylight, temperature, and weather -- and people's reaction to them -- will be the drivers of a disadvantageous seasonality of SARS-CoV-2 . With the seasonal odds against us, stabilization of new COVID-19 cases and hospitalizations requires high immunity levels in the population or increasing non-pharmaceutical interventions (NPIs) .
Edit intent: clarity
Original:  Therefore, understanding how individual protection-seeking behavior affects disease spread is crucial to prepare for the upcoming winter and future challenges .
Revised:  Therefore, understanding how individual protection-seeking behaviors is crucial for better preparedness this winter and for future crises .
Edit intent: clarity
Original:  This approach contrasts current approaches for `` neural PDE solvers '' that employ collocation-based methods to make point-wise predictions of solutions to PDEs.
Revised:  This approach contrasts current approaches for " neural PDE solvers '' that employ collocation-based methods to make point-wise predictions of solutions to PDEs.
Edit intent: fluency
Original:  This approach contrasts current approaches for `` neural PDE solvers '' that employ collocation-based methods to make point-wise predictions of solutions to PDEs.
Revised:  This approach contrasts current approaches for `` neural PDE solvers " that employ collocation-based methods to make point-wise predictions of solutions to PDEs.
Edit intent: fluency
Original:  The weighted Galerkin loss (FEM loss) is similar to an energy functional that produces improved solutions, satisfies a priori mesh convergence, and can model Dirichlet and Neumann boundary conditions.
Revised:  The weighted Galerkin loss (FEM loss) is similar to an energy functional that produces improved solutions, satisfies a priori mesh convergence, and can model Dirichlet and Neumann boundary conditions.
Edit intent: fluency
Original:  Our final submission achieved a mean Dice score of 0.8299 (0.0465) in the validation phase  .
Revised:  Our final submission achieved mean Dice scores of 0.8299 (0.0465) in the validation phase .
Edit intent: fluency
Original:  Our final submission achieved a mean Dice score of 0.8299 (0.0465) in the validation phase  .
Revised:  Our final submission achieved a mean Dice score of 0.8299 in the validation phase .
Edit intent: clarity
Original:  To accommodate the change in topology, we define the Stokes and Darcy domains implicitly via a phase-field indicator function.
Revised:  To accommodate possible changes in topology, we define the Stokes and Darcy domains implicitly via a phase-field indicator function.
Edit intent: clarity
Original:  In addition, we introduce a modification of DEIM that leads to positivity-preserving approximations, thus guaranteeing positive-definiteness of the system matrix.
Revised:  In addition, we introduce a modification of DEIM that leads to positivity-preserving approximations, thus guaranteeing positive-semidefiniteness of the system matrix.
Edit intent: fluency
Original:  We show that |P \cap Z^n| can be computed with an algorithm, having the arithmetic complexity bound O\bigl( d^{m + 4 \cdot }  \Delta^4 \cdot \log(\Delta) \bigr), where d = \dim(P) , which outperforms the previous best known complexity bound O( d^{m + O(1) \cdot d^{\log_2(\Delta)}) . We do not directly compute the short rational generating function for P \cap \mathbb{Z}^n, but compute its particular representation in the form of exponential series that depends on only one variable.
Revised:  We show that |P \cap Z^n| can be computed with an algorithm, having the arithmetic complexity bound O\bigl( \cdot } \Delta^4 \cdot \log(\Delta) \bigr), where d = \dim(P) , which outperforms the previous best known complexity bound O( d^{m + O(1) \cdot d^{\log_2(\Delta)}) . We do not directly compute the short rational generating function for P \cap \mathbb{Z}^n, but compute its particular representation in the form of exponential series that depends on only one variable.
Edit intent: coherence
Original:  Combining the simple-partial and complex-partial seizures provides the highest accuracy of all the models tested.
Revised:  Combining the simple partial and complex partial seizures provides the highest accuracy of all the models tested.
Edit intent: fluency
Original:  The information schism between the real-world and that which can be gathered and considered by any individual information processing agent is characterized and discussed, which is followed by the presentation of a series of the adopted requisites while developing the modeling approach.
Revised:  The information schism between the real-world and that which can be gathered and considered by any individual information processing agent is characterized and discussed, followed by the presentation of a series of the adopted requisites while developing the modeling approach.
Edit intent: coherence
Original:  First, the reference M^* meta model framework is presented, which relies critically in associating whole datasets and respective models in terms of a strict equivalence relation.
Revised:  First, the reference M* meta model framework is presented, which relies critically in associating whole datasets and respective models in terms of a strict equivalence relation.
Edit intent: clarity
Original:  This not only offers a better understanding of language models , but uses human capabilities to incorporate knowledge outside of the rigid range of purely data-driven approaches.
Revised:  This not only offers a better understanding of language models but uses human capabilities to incorporate knowledge outside of the rigid range of purely data-driven approaches.
Edit intent: fluency
Original: We present FacialFilmroll , a solution for spatially and temporally consistent editing of faces in one or multiple shots.
Revised: We present FacialFilmroll , a solution for spatially and temporally consistent editing of faces in one or multiple shots.
Edit intent: fluency
Original:  We explain how FacialFilmroll is integrated in post-production facility.
Revised:  We explain how FacialFilmroll is integrated in post-production facility.
Edit intent: fluency
Original:  Finally, we present video editing results using FacialFilmroll on high resolution videos.
Revised:  Finally, we present video editing results using FacialFilmroll on high resolution videos.
Edit intent: fluency
Original: In this short paper, we revisit the open DNS (ODNS) infrastructure and, for the first time, systematically measure and analyze transparent forwarders, DNS components that transparently relay between stub resolvers and recursive resolvers.
Revised: In this paper, we revisit the open DNS (ODNS) infrastructure and, for the first time, systematically measure and analyze transparent forwarders, DNS components that transparently relay between stub resolvers and recursive resolvers.
Edit intent: coherence
Original:  This effect is decreased for masking noise having an interaural time difference (ITD).
Revised:  This effect is decreased for masking noises with an interaural time difference (ITD).
Edit intent: fluency
Original:  Thus far, simulation of the detection threshold required both a mechanism for internal ITD compensation and an increased binaural processing bandwidth.
Revised:  Thus far, modeling of these detection thresholds required both a mechanism for internal ITD compensation and an increased binaural processing bandwidth.
Edit intent: clarity
Original:  Thus far, simulation of the detection threshold required both a mechanism for internal ITD compensation and an increased binaural processing bandwidth.
Revised:  Thus far, simulation of the detection threshold required both a mechanism for internal ITD compensation and an increased binaural bandwidth.
Edit intent: clarity
Original:  An alternative explanation for the reduction is that unmasking is impaired by the lower interaural coherence in off-frequency regions caused by the second masker (Marquardt and McAlpine  2009, JASA pp. EL177 - EL182).
Revised:  An alternative explanation for the reduction is that unmasking is impaired by the lower interaural coherence in off-frequency regions caused by the second masker (Marquardt and McAlpine , 2009, JASA pp. EL177 - EL182).
Edit intent: fluency
Original:  Based on this hypothesis  the current work proposes a quantitative multi-channel model using monaurally derived peripheral filter bandwidths and an across-channel incoherence interference mechanism.
Revised:  Based on this hypothesis , the current work proposes a quantitative multi-channel model using monaurally derived peripheral filter bandwidths and an across-channel incoherence interference mechanism.
Edit intent: fluency
Original:  This mechanism differs from wider filters since it is moot when the masker coherence is constant across frequency bands.
Revised:  This mechanism differs from wider filters since it has no effect when the masker coherence is constant across frequency bands.
Edit intent: clarity
Original:  It can help resolving the inconsistency that simulation of some data sets requires wide filters while others require narrow filters.
Revised:  It helps resolving the inconsistency that simulation of some data sets requires wide filters while others require narrow filters.
Edit intent: clarity
Original:  However, the existing strategies are aimed at invisible adversarial perturbation, and do not consider the case of locally visible adversarial perturbation .
Revised:  However, the existing reversible adversarial examples generation strategies are all designed for the traditional imperceptible adversarial perturbation. How to get reversibility for locally visible adversarial perturbation .
Edit intent: clarity
Original:  In this article, we generate reversible adversarial examples for local visual adversarial perturbation , and use reversible data embedding technology to embed the information needed to restore the original image into the adversarial examples to generate examples that are both adversarial and reversible . Experiments on ImageNet dataset show that our method can restore the original image losslessly while ensuring the attack capability .
Revised:  In this article, we generate reversible adversarial examples based on local visual adversarial perturbation , and use reversible data embedding technology to embed the information needed to restore the original image into the adversarial examples to generate examples that are both adversarial and reversible . Experiments on ImageNet dataset show that our method can restore the original image losslessly while ensuring the attack capability .
Edit intent: clarity
Original:  In this article, we generate reversible adversarial examples for local visual adversarial perturbation , and use reversible data embedding technology to embed the information needed to restore the original image into the adversarial examples to generate examples that are both adversarial and reversible . Experiments on ImageNet dataset show that our method can restore the original image losslessly while ensuring the attack capability .
Revised:  In this article, we generate reversible adversarial examples for local visual adversarial perturbation , and use reversible data embedding technology to embed the information needed to restore the original image into the adversarial examples to generate examples that are both adversarial and reversible . Experiments on ImageNet dataset show that our method can restore the original images error-free while ensuring the attack capability .
Edit intent: clarity