wanyu/IteraTeR_v2 huggingface dataset:
Original:  We also  give an example of extending a compact scheme for non-uniform in space and time rectangular meshes.
Revised:  We also give an example of a compact scheme for non-uniform in space and time rectangular meshes.
Edit intent: clarity
Original:  We suggest simple effective iterative methods based on FFT to implement the schemes whose convergence rate, under the stability condition, is fast and independent on both the meshes and variable sound speed .
Revised:  We suggest simple fast iterative methods based on FFT to implement the schemes whose convergence rate, under the stability condition, is fast and independent on both the meshes and variable sound speed .
Edit intent: clarity
Original:  We suggest simple effective iterative methods based on FFT to implement the schemes whose convergence rate, under the stability condition, is fast and independent on both the meshes and variable sound speed .
Revised:  We suggest simple effective iterative methods based on FFT to implement the schemes .
Edit intent: coherence
Original:  Programmable data planes allow users to define their own data plane algorithms for network devices including appropriate data plane APIs which may be leveraged by user-defined SDN control.
Revised:  Programmable data planes allow users to define their own data plane algorithms for network devices including appropriate data plane application programming interfaces (APIs) which may be leveraged by user-defined SDN control.
Edit intent: clarity
Original:  It is developed and standardized by an open community  and it is supported by various software and hardware platforms.
Revised:  It is developed and standardized by an open community , and it is supported by various software and hardware platforms.
Edit intent: fluency
Original:  In the second part, we analyze a large body of literature considering P4-based applied research .
Revised:  In the second part, we categorize a large body of literature considering P4-based applied research .
Edit intent: clarity
Original:  In the second part, we analyze a large body of literature considering P4-based applied research .
Revised:  In the second part, we analyze a large body of literature of P4-based applied research .
Edit intent: clarity
Original:  We categorize 241 research papers into different application domains, summarize their contributions , and extract prototypes, target platforms, and source code availability  .
Revised:  We categorize 241 research papers into different application domains, summarize the contributions of these papers , and extract prototypes, target platforms, and source code availability .
Edit intent: clarity
Original: A semi-supervised approach to acoustic source localization in reverberant environments , based on deep generative modeling , is proposed . Localization in reverberant environments remains an open challenge.
Revised: We propose a semi-supervised approach to acoustic source localization in reverberant environments , based on deep generative modeling , is proposed . Localization in reverberant environments remains an open challenge.
Edit intent: coherence
Original: A semi-supervised approach to acoustic source localization in reverberant environments , based on deep generative modeling , is proposed . Localization in reverberant environments remains an open challenge.
Revised: A semi-supervised approach to acoustic source localization in reverberant environments based on deep generative modeling , is proposed . Localization in reverberant environments remains an open challenge.
Edit intent: fluency
Original: A semi-supervised approach to acoustic source localization in reverberant environments , based on deep generative modeling , is proposed . Localization in reverberant environments remains an open challenge.
Revised: A semi-supervised approach to acoustic source localization in reverberant environments , based on deep generative modeling . Localization in reverberant environments remains an open challenge.
Edit intent: coherence
Original:  We address this issue by performing semi-supervised learning (SSL) with convolutional variational autoencoders (VAEs) on speech signals in reverberant environments .
Revised:  We address this issue by performing semi-supervised learning (SSL) with convolutional variational autoencoders (VAEs) on reverberant speech signals recorded with microphone arrays .
Edit intent: clarity
Original:  The VAE is trained to generate the phase of relative transfer functions (RTFs) between microphones, in parallel with a direction of arrival (DOA) classifier based on RTF-phase , on both labeled and unlabeled RTF samples .
Revised:  The VAE is trained to generate the phase of relative transfer functions (RTFs) between microphones, in parallel with a direction of arrival (DOA) classifier based on RTF-phase . These models are trained using both labeled and unlabeled RTF samples .
Edit intent: clarity
Original:  The VAE is trained to generate the phase of relative transfer functions (RTFs) between microphones, in parallel with a direction of arrival (DOA) classifier based on RTF-phase , on both labeled and unlabeled RTF samples .
Revised:  The VAE is trained to generate the phase of relative transfer functions (RTFs) between microphones, in parallel with a direction of arrival (DOA) classifier based on RTF-phase , on both labeled and unlabeled RTF-phase sequences .
Edit intent: clarity
Original:  To this end, we introduce the notion of requirement  and the notion of negotiation function.
Revised:  To this end, we introduce the notion of requirement , and the notion of negotiation function.
Edit intent: fluency
Original:  We establish that the set of plays that are supported by SPEs are exactly those that are consistent with the least fixed point of the negotiation function.
Revised:  We establish that the plays that are supported by SPEs are exactly those that are consistent with the least fixed point of the negotiation function.
Edit intent: clarity
Original:  Finally, we show that the negotiation function is piecewise linear  and can be analyzed using the linear algebraic tool box  .
Revised:  Finally, we show that the negotiation function is piecewise linear , and can be analyzed using the linear algebraic tool box .
Edit intent: coherence
Original: We prove non-asymptotic polynomial bounds on the convergence of the Langevin Monte Carlo algorithmin the case where the potential is a convex function which is globally Lipschitz on its domain, typically the maximum of a finite number of affine functions onan arbitrary convex set.
Revised: We prove non asymptotic polynomial bounds on the convergence of the Langevin Monte Carlo algorithmin the case where the potential is a convex function which is globally Lipschitz on its domain, typically the maximum of a finite number of affine functions onan arbitrary convex set.
Edit intent: fluency
Original: We prove non-asymptotic polynomial bounds on the convergence of the Langevin Monte Carlo algorithmin the case where the potential is a convex function which is globally Lipschitz on its domain, typically the maximum of a finite number of affine functions onan arbitrary convex set.
Revised: We prove non-asymptotic polynomial bounds on the convergence of the Langevin Monte Carlo algorithm in the case where the potential is a convex function which is globally Lipschitz on its domain, typically the maximum of a finite number of affine functions onan arbitrary convex set.
Edit intent: fluency
Original: We prove non-asymptotic polynomial bounds on the convergence of the Langevin Monte Carlo algorithmin the case where the potential is a convex function which is globally Lipschitz on its domain, typically the maximum of a finite number of affine functions onan arbitrary convex set.
Revised: We prove non-asymptotic polynomial bounds on the convergence of the Langevin Monte Carlo algorithmin the case where the potential is a convex function which is globally Lipschitz on its domain, typically the maximum of a finite number of affine functions on an arbitrary convex set.
Edit intent: fluency
Original: Data-driven computational mechanics replaces phenomenological constitutive functions by performing numerical simulations based on data sets of representative samples in stress-strain space.
Revised: Data-driven computational mechanics replaces phenomenological constitutive functions by numerical simulations based on data sets of representative samples in stress-strain space.
Edit intent: clarity
Original:  The distance of modeling values, e.g. stresses and strains in integration points of a finite element calculation, from the data set is minimized with respect to an appropriate metric , subject to equilibrium and compatibility constraints , see Kirchdoerfer et al. 2016, Kirchdoerfer et al. 2017, Conti et al. 2018.
Revised:  The distance of strain and stress pairs from the data set is minimized with respect to an appropriate metric , subject to equilibrium and compatibility constraints , see Kirchdoerfer et al. 2016, Kirchdoerfer et al. 2017, Conti et al. 2018.
Edit intent: clarity
Original:  The distance of modeling values, e.g. stresses and strains in integration points of a finite element calculation, from the data set is minimized with respect to an appropriate metric , subject to equilibrium and compatibility constraints , see Kirchdoerfer et al. 2016, Kirchdoerfer et al. 2017, Conti et al. 2018.
Revised:  The distance of modeling values, e.g. stresses and strains in integration points of a finite element calculation, from the data set is minimized , subject to equilibrium and compatibility constraints , see Kirchdoerfer et al. 2016, Kirchdoerfer et al. 2017, Conti et al. 2018.
Edit intent: clarity
Original:  The distance of modeling values, e.g. stresses and strains in integration points of a finite element calculation, from the data set is minimized with respect to an appropriate metric , subject to equilibrium and compatibility constraints , see Kirchdoerfer et al. 2016, Kirchdoerfer et al. 2017, Conti et al. 2018.
Revised:  The distance of modeling values, e.g. stresses and strains in integration points of a finite element calculation, from the data set is minimized with respect to an appropriate metric , subject to equilibrium and compatibility constraints .
Edit intent: coherence
Original: In Eggersmann et al. 2019 , this issue is treated by including local histories into the data set.
Revised: In Eggersmann et al. 2019 , this issue has been treated by including local histories into the data set.
Edit intent: style
Original:  Thus, a mixed formulation is obtained consisting of a combination of classical and data-driven modeling  .
Revised:  Thus, a mixed formulation of classical and data-driven modeling .
Edit intent: clarity
Original:  Thus, a mixed formulation is obtained consisting of a combination of classical and data-driven modeling  .
Revised:  Thus, a mixed formulation is obtained consisting of a combination of classical and data-driven modeling is obtained .
Edit intent: clarity
Original:  The approach and its numerical performance will be demonstrated by applying it to models of non-linear elasticity and elasto-plasticity with isotropic hardening.
Revised:  The approach will be applied to non-linear elasticity and elasto-plasticity with isotropic hardening.
Edit intent: clarity
Original:  We compile a high-quality gold-standard text summarisation dataset, which consists of historical German and Chinese news from hundreds of year ago summarised in modern German or Chinese.
Revised:  We compile a high-quality gold-standard text summarisation dataset, which consists of historical German and Chinese news from hundreds of years ago summarised in modern German or Chinese.
Edit intent: fluency
Original:  This results in a strong separation between oblivious  and adversarially-robust streaming algorithms .
Revised:  This results in a strong separation between oblivious streaming and adversarially-robust streaming algorithms .
Edit intent: fluency
Original:  This results in a strong separation between oblivious  and adversarially-robust streaming algorithms .
Revised:  This results in a strong separation between oblivious and adversarially-robust streaming , and resolves one of the central open questions in adversarial robust streaming .
Edit intent: clarity
Original:  Blockchain-enabled Radio Access Network (BE-RAN) , which is proposed as a novel decentralized RAN architecture , facilitates enhanced security and privacy on identification and authentication.
Revised:  Blockchain-enabled Radio Access Networks (BE-RAN) , which is proposed as a novel decentralized RAN architecture , facilitates enhanced security and privacy on identification and authentication.
Edit intent: fluency
Original:  Blockchain-enabled Radio Access Network (BE-RAN) , which is proposed as a novel decentralized RAN architecture , facilitates enhanced security and privacy on identification and authentication.
Revised:  Blockchain-enabled Radio Access Network (BE-RAN) is proposed as a novel decentralized RAN architecture , facilitates enhanced security and privacy on identification and authentication.
Edit intent: coherence
Original:  Blockchain-enabled Radio Access Network (BE-RAN) , which is proposed as a novel decentralized RAN architecture , facilitates enhanced security and privacy on identification and authentication.
Revised:  Blockchain-enabled Radio Access Network (BE-RAN) , which is proposed as a novel decentralized RAN architecture to facilitate enhanced security and privacy on identification and authentication.
Edit intent: fluency
Original:  It aims to offer user-centric identity management for UE and RAN elements, as well as mutual authentication to all entities , while enabling on-demand point-to-point communication with accountable billing service add-on to the general public.
Revised:  It can offer user-centric identity management for UE and RAN elements, as well as mutual authentication to all entities , while enabling on-demand point-to-point communication with accountable billing service add-on to the general public.
Edit intent: clarity
Original:  It aims to offer user-centric identity management for UE and RAN elements, as well as mutual authentication to all entities , while enabling on-demand point-to-point communication with accountable billing service add-on to the general public.
Revised:  It aims to offer user-centric identity management for UE and mutual authentication to all entities , while enabling on-demand point-to-point communication with accountable billing service add-on to the general public.
Edit intent: clarity
Original:  It aims to offer user-centric identity management for UE and RAN elements, as well as mutual authentication to all entities , while enabling on-demand point-to-point communication with accountable billing service add-on to the general public.
Revised:  It aims to offer user-centric identity management for UE and RAN elements, as well as mutual authentication to all entities while enabling on-demand point-to-point communication with accountable billing service add-on to the general public.
Edit intent: fluency
Original:  In addition , a potential operating model with thorough decentralization of RAN is envisioned , and the distributed privacy-preserving P2P communication, as one of the core use case for future mobile network , is presented as an important complement to the existing core network based security and privacy management  .
Revised:  Also , a potential operating model with thorough decentralization of RAN is envisioned , and the distributed privacy-preserving P2P communication, as one of the core use case for future mobile network , is presented as an important complement to the existing core network based security and privacy management .
Edit intent: coherence
Original:  In addition , a potential operating model with thorough decentralization of RAN is envisioned , and the distributed privacy-preserving P2P communication, as one of the core use case for future mobile network , is presented as an important complement to the existing core network based security and privacy management  .
Revised:  In addition , a potential operating model with thorough decentralization of RAN is envisioned . The distributed privacy-preserving P2P communication, as one of the core use case for future mobile network , is presented as an important complement to the existing core network based security and privacy management .
Edit intent: coherence
Original:  In addition , a potential operating model with thorough decentralization of RAN is envisioned , and the distributed privacy-preserving P2P communication, as one of the core use case for future mobile network , is presented as an important complement to the existing core network based security and privacy management  .
Revised:  In addition , a potential operating model with thorough decentralization of RAN is envisioned , and the distributed privacy-preserving P2P communication, as one of the core use cases for future mobile network , is presented as an important complement to the existing core network based security and privacy management .
Edit intent: fluency
Original:  In addition , a potential operating model with thorough decentralization of RAN is envisioned , and the distributed privacy-preserving P2P communication, as one of the core use case for future mobile network , is presented as an important complement to the existing core network based security and privacy management  .
Revised:  In addition , a potential operating model with thorough decentralization of RAN is envisioned , and the distributed privacy-preserving P2P communication, as one of the core use case for future mobile networks , is presented as an important complement to the existing core network based security and privacy management .
Edit intent: fluency
Original:  In addition , a potential operating model with thorough decentralization of RAN is envisioned , and the distributed privacy-preserving P2P communication, as one of the core use case for future mobile network , is presented as an important complement to the existing core network based security and privacy management  .
Revised:  In addition , a potential operating model with thorough decentralization of RAN is envisioned , and the distributed privacy-preserving P2P communication, as one of the core use case for future mobile network , is presented as an essential complement to the existing core network based security and privacy management .
Edit intent: clarity
Original:  In addition , a potential operating model with thorough decentralization of RAN is envisioned , and the distributed privacy-preserving P2P communication, as one of the core use case for future mobile network , is presented as an important complement to the existing core network based security and privacy management  .
Revised:  In addition , a potential operating model with thorough decentralization of RAN is envisioned , and the distributed privacy-preserving P2P communication, as one of the core use case for future mobile network , is presented as an important complement to the existing core network-based security and privacy management .
Edit intent: fluency
Original:  It can offer user-centric identity management for User Equipment (UE) and Radio Access Networks (RAN ) elementsand mutual authentication to all entities while enabling on-demand point-to-point communication with accountable billing service add-on to the general public .
Revised:  It can offer user-centric identity management for User Equipment (UE) and RAN elements, and enable mutual authentication to all entities while enabling on-demand point-to-point communication with accountable billing service add-on to the general public .
Edit intent: clarity
Original:  It can offer user-centric identity management for User Equipment (UE) and Radio Access Networks (RAN ) elementsand mutual authentication to all entities while enabling on-demand point-to-point communication with accountable billing service add-on to the general public .
Revised:  It can offer user-centric identity management for User Equipment (UE) and Radio Access Networks (RAN ) elementsand mutual authentication to all entities while enabling on-demand point-to-point communication with accountable billing service add-on on public network .
Edit intent: clarity
Original:  The  distributed privacy-preserving P2P communication  , as one of the core use cases for future mobile networks, is presented as an essential complement to the existing core network-based security and privacy management.
Revised:  The distributed privacy-preserving P2P communication approach , as one of the core use cases for future mobile networks, is presented as an essential complement to the existing core network-based security and privacy management.
Edit intent: clarity
Original:  Inspired by this, we investigate the predictions made by the cavity method for the algorithmic problemsof detecting and recovering a planted signal in a general model of sparse random graphs.
Revised:  Inspired by ideas from statistical physics, the algorithmic problemsof detecting and recovering a planted signal in a general model of sparse random graphs.
Edit intent: clarity
Original:  (ii) a rigorous polynomial-time algorithm for the problem of detection: distinguishing a graph with a planted signal from one without;
Revised:  (ii) a rigorous polynomial-time algorithm for the problem of detection: distinguishing an input with a planted signal from one without;
Edit intent: clarity
Original:  ( iii) a rigorous polynomial-time algorithm for the problem of recovery: outputting a vector that correlates with the planted signal significantly better than a random guess would .
Revised:  ( iii) a rigorous polynomial-time algorithm for the problem of recovery: outputting a vector that correlates with the hidden assignment significantly better than a random guess would .
Edit intent: clarity
Original:  The goal is to select up to k overlays such that the sum of the weights of elements that are covered at least n times is maximized .
Revised:  The goal is to select up to k overlays such that the sum of the weights of elements that are covered at least n times .
Edit intent: clarity
Original:  We show that the n-times coverage objective is not submodular, and we present an efficient solution by sequential greedy optimization.
Revised:  Maximum n-times coverage objective is not submodular, and we present an efficient solution by sequential greedy optimization.
Edit intent: coherence
Original: Classification of EEG-based motor imagery (MI) is a crucial non-invasive application in the brain-computer interface (BCI) research.
Revised: Classification of EEG-based motor imagery (MI) is a crucial non-invasive application in brain-computer interface (BCI) research.
Edit intent: fluency
Original:  This paper proposes a  convolutional neural network (CNN) architecture for accurate and robust EEG-based MI classification that outperforms the state-of-the-art methods.
Revised:  This paper proposes a novel convolutional neural network (CNN) architecture for accurate and robust EEG-based MI classification that outperforms the state-of-the-art methods.
Edit intent: clarity
Original:  Also, the proposed network is an end-to-end classification, for it takes the raw EEG signals as the input and does not require complex EEG signal-preprocessing.
Revised:  Also, the proposed network is an end-to-end classification, as it takes the raw EEG signals as the input and does not require complex EEG signal-preprocessing.
Edit intent: coherence
Original:  Furthermore, it takes less than 0.025 seconds to test a sample , which is suitable for real-time processing.
Revised:  Furthermore, it takes less than 0.025 seconds to test a sample suitable for real-time processing.
Edit intent: coherence
Original: Blind or no-reference video quality assessment of user-generated content (UGC) has become a trending, challenging,  unsolved problem.
Revised: Blind or no-reference video quality assessment of user-generated content (UGC) has become a trending, challenging, heretofore unsolved problem.
Edit intent: clarity