wanyu/IteraTeR_v2 huggingface dataset:
Original:  We begin by observing that, due to the strong spatial dependency of the underwater acoustic channel, an attacker can  mimic the channel associated with the legitimate transmitter only for a single or a small set of receivers  .
Revised:  We begin by observing that, due to the strong spatial dependency of the underwater acoustic channel, an attacker can attempt to mimic the channel associated with the legitimate transmitter only for a single or a small set of receivers .
Edit intent: clarity
Original:  We begin by observing that, due to the strong spatial dependency of the underwater acoustic channel, an attacker can  mimic the channel associated with the legitimate transmitter only for a single or a small set of receivers  .
Revised:  We begin by observing that, due to the strong spatial dependency of the underwater acoustic channel, an attacker can mimic the channel associated with the legitimate transmitter only for a small set of receivers .
Edit intent: clarity
Original:  Taking this into account, our scheme is based on the cooperative operation of a set of trusted nodes reporting to a sink node  .
Revised:  Taking this into account, our scheme is based on the cooperative operation of a set of trusted nodes reporting to a sink node in the authentication process .
Edit intent: clarity
Original:  In this talk, we will describe our ongoing work on designing a formal semantics for Rust that captures how programmers can understand ownership and borrowing without trying to grasp the details of lifetime analysis.
Revised:  In this talk, we will describe our ongoing work on designing a formal semantics for Rust that captures ownership and borrowing without trying to grasp the details of lifetime analysis.
Edit intent: clarity
Original:  In this talk, we will describe our ongoing work on designing a formal semantics for Rust that captures how programmers can understand ownership and borrowing without trying to grasp the details of lifetime analysis.
Revised:  In this talk, we will describe our ongoing work on designing a formal semantics for Rust that captures how programmers can understand ownership and borrowing without the details of lifetime analysis.
Edit intent: clarity
Original:  Further, while RustBelt aims to verify the safety of unsafe code in Rust's standard library, we model standard library APIs as primitives, which is sufficient to capture their expressive power .
Revised:  Further, while RustBelt aims to verify the safety of unsafe code in Rust's standard library, we model standard library APIs as primitives, which is sufficient to reason about their behavior .
Edit intent: clarity
Original:  Unlike RustBelt, we  prove type soundness using progress and preservation instead of a Kripke logical relation.
Revised:  Unlike RustBelt, we aim to prove type soundness using progress and preservation instead of a Kripke logical relation.
Edit intent: clarity
Original:  Separating the language into different levels of expressive power provides a framework for future work on Rust verification and compiler optimization.
Revised:  Separating the language into different levels of expressive power should provide a framework for future work on Rust verification and compiler optimization.
Edit intent: clarity
Original:  For treedepth ~ 2 (also related to bounded expansion), we obtain a 4-approximation.
Revised:  For treedepth 2 (also related to bounded expansion), we obtain a 4-approximation.
Edit intent: clarity
Original:  and show that it includes many well-studied graph problems, such as Independent Set, Vertex Cover, Feedback Vertex Set, Minimum Maximal Matching, Chromatic Number, (\ell-)Dominating Set, and Edge (\ell-)Dominating Set  . To enable this framework, we develop new editing algorithms that find the approximately fewest edits required to bring a given graph into one of several important graph classes (in some cases, also approximating the target parameter of the family).
Revised:  and show that it includes many well-studied graph problems, such as Independent Set, Vertex Cover, Feedback Vertex Set, Minimum Maximal Matching, Chromatic Number, (\ell-)Dominating Set, Edge (\ell-)Dominating Set . To enable this framework, we develop new editing algorithms that find the approximately fewest edits required to bring a given graph into one of several important graph classes (in some cases, also approximating the target parameter of the family).
Edit intent: fluency
Original:  and show that it includes many well-studied graph problems, such as Independent Set, Vertex Cover, Feedback Vertex Set, Minimum Maximal Matching, Chromatic Number, (\ell-)Dominating Set, and Edge (\ell-)Dominating Set  . To enable this framework, we develop new editing algorithms that find the approximately fewest edits required to bring a given graph into one of several important graph classes (in some cases, also approximating the target parameter of the family).
Revised:  and show that it includes many well-studied graph problems, such as Independent Set, Vertex Cover, Feedback Vertex Set, Minimum Maximal Matching, Chromatic Number, (\ell-)Dominating Set, and Edge (\ell-)Dominating Set . To enable this framework, we develop new editing algorithms that find the approximately-fewest edits required to bring a given graph into one of several important graph classes (in some cases, also approximating the target parameter of the family).
Edit intent: fluency
Original:  We also prove complementary hardness-of-approximation results assuming P \neq NP: in particular, all of the problems just stated have a log-factor inapproximability , except the last which is not approximable below some constant factor (2 assuming UGC).
Revised:  We also prove complementary hardness-of-approximation results assuming P \neq NP: in particular, these problems are all log-factor inapproximability , except the last which is not approximable below some constant factor (2 assuming UGC).
Edit intent: clarity
Original:  We also prove complementary hardness-of-approximation results assuming P \neq NP: in particular, all of the problems just stated have a log-factor inapproximability , except the last which is not approximable below some constant factor (2 assuming UGC).
Revised:  We also prove complementary hardness-of-approximation results assuming P \neq NP: in particular, all of the problems just stated have a log-factor inapproximable , except the last which is not approximable below some constant factor (2 assuming UGC).
Edit intent: fluency
Original: In this paper , we explore streaming video over HTTP.
Revised: This paper proposes and evaluates a novel algorithm for streaming video over HTTP.
Edit intent: clarity
Original:  The problem is formulated as a non-convex optimization problem which is constrained by the predicted  bandwidth, chunk deadlines, available video rates, and buffer occupancy.
Revised:  The problem is formulated as a non-convex optimization problem which is constrained by the predicted available bandwidth, chunk deadlines, available video rates, and buffer occupancy.
Edit intent: clarity
Original:  We propose FastScan, a low complexity algorithm that solves the problem , and show that the solution is optimal when every quality level is encoded in Constant Bit Rate (CBR) . Online adaptations for dynamic bandwidth environments are proposed with imperfect  bandwidth prediction.
Revised:  We propose FastScan, a low complexity algorithm that solves the problem . Online adaptations for dynamic bandwidth environments are proposed with imperfect bandwidth prediction.
Edit intent: coherence
Original:  Results of real experiments driven by real Variable Bit Rate (VBR) encoded video, video platform system (dash.js), and cellular bandwidth traces of a public dataset reveal the robustness of the online version of FastScan algorithm and demonstrate its significant performance improvement as compared to the  state-of-the-art video streaming algorithms.
Revised:  Results of experiments driven by real Variable Bit Rate (VBR) encoded video, video platform system (dash.js), and cellular bandwidth traces of a public dataset reveal the robustness of the online version of FastScan algorithm and demonstrate its significant performance improvement as compared to the state-of-the-art video streaming algorithms.
Edit intent: clarity
Original:  Results of real experiments driven by real Variable Bit Rate (VBR) encoded video, video platform system (dash.js), and cellular bandwidth traces of a public dataset reveal the robustness of the online version of FastScan algorithm and demonstrate its significant performance improvement as compared to the  state-of-the-art video streaming algorithms.
Revised:  Results of real experiments driven by Variable Bit Rate (VBR) encoded video, video platform system (dash.js), and cellular bandwidth traces of a public dataset reveal the robustness of the online version of FastScan algorithm and demonstrate its significant performance improvement as compared to the state-of-the-art video streaming algorithms.
Edit intent: clarity
Original:  Results of real experiments driven by real Variable Bit Rate (VBR) encoded video, video platform system (dash.js), and cellular bandwidth traces of a public dataset reveal the robustness of the online version of FastScan algorithm and demonstrate its significant performance improvement as compared to the  state-of-the-art video streaming algorithms.
Revised:  Results of real experiments driven by real Variable Bit Rate (VBR) encoded video, video platform system (dash.js), and cellular bandwidth traces of a public dataset reveal the robustness of the online version of FastScan algorithm and demonstrate its significant performance improvement as compared to the considered state-of-the-art video streaming algorithms.
Edit intent: clarity
Original:  For example, on an experiment conducted over 100 real cellular  bandwidth traces of a public dataset that spans different  bandwidth regimes, our proposed algorithm (FastScan) achieves the minimum re-buffering (stall) time and the maximum average playback rate in every single trace as compared to the original dash.js rate adaptation scheme , Festive, BBA, RB, and FastMPC  algorithms.
Revised:  For example, on an experiment conducted over 100 real cellular bandwidth traces of a public dataset that spans different available bandwidth regimes, our proposed algorithm (FastScan) achieves the minimum re-buffering (stall) time and the maximum average playback rate in every single trace as compared to the original dash.js rate adaptation scheme , Festive, BBA, RB, and FastMPC algorithms.
Edit intent: clarity
Original: Single-cell experiments have revealed significant cell-to-cell variability in generation times  for genetically identical cells.
Revised: Single-cell experiments have revealed cell-to-cell variability in generation times for genetically identical cells.
Edit intent: clarity
Original:  Theoretical models relating the fluctuating generation times of single cells to the growth rate of the entire population are usually based on the assumption that the generation times of mother and daughter cells are uncorrelated.
Revised:  Theoretical models relating the fluctuating generation times of single cells to the population growth rate are usually based on the assumption that the generation times of mother and daughter cells are uncorrelated.
Edit intent: clarity
Original:  However, it was recently realized that this assumption is inconsistent with exponentially growing cell volume at the single-cell level .
Revised:  This assumption, however, is inconsistent with exponentially growing cell volume at the single-cell level .
Edit intent: coherence
Original:  An agent can belong to different communities for different events, and these communities are unknown a priori .
Revised:  An agent can belong to different communities for different events, and these communities are unknown a priori .
Edit intent: fluency
Original: Developing efficient numerical algorithms for  high dimensional random Partial Differential Equations (PDEs) has been a challenging task due to the well-known curse of dimensionality problem .
Revised: Developing efficient numerical algorithms for the solution of high dimensional random Partial Differential Equations (PDEs) has been a challenging task due to the well-known curse of dimensionality problem .
Edit intent: clarity
Original: Developing efficient numerical algorithms for  high dimensional random Partial Differential Equations (PDEs) has been a challenging task due to the well-known curse of dimensionality problem .
Revised: Developing efficient numerical algorithms for high dimensional random Partial Differential Equations (PDEs) has been a challenging task due to the well-known curse of dimensionality .
Edit intent: clarity
Original:  We present a new framework for solving high-dimensional PDEs characterized by random parameters based on a deep learning approach.
Revised:  We present a new solution framework for these problems based on a deep learning approach.
Edit intent: clarity
Original:  The random PDE is approximated by a feed-forward fully-connected deep neural network, with either strong or weak enforcement of initial and boundary constraints.
Revised:  Specifically, the random PDE is approximated by a feed-forward fully-connected deep neural network, with either strong or weak enforcement of initial and boundary constraints.
Edit intent: coherence
Original:  The random PDE is approximated by a feed-forward fully-connected deep neural network, with either strong or weak enforcement of initial and boundary constraints.
Revised:  The random PDE is approximated by a feed-forward fully-connected deep residual network, with either strong or weak enforcement of initial and boundary constraints.
Edit intent: clarity
Original:  The performance of the proposed framework in accurate estimation of solution to random PDEs is examined by implementing it for diffusion and heat conduction problems . Results are compared with the sampling-based finite element results , and suggest that the proposed framework achieves satisfactory accuracy and can handle high-dimensional random PDEs.
Revised:  The performance of the proposed frameworks is numerically demonstrated on diffusion and heat conduction problems . Results are compared with the sampling-based finite element results , and suggest that the proposed framework achieves satisfactory accuracy and can handle high-dimensional random PDEs.
Edit intent: clarity
Original:  These approaches, combined with various possibilities of using (e.g. ~ sampling) the probabilistic VAE to obtain scalar novelty scores, yield a large family of methods.
Revised:  These approaches, combined with various possibilities of using (e.g. sampling) the probabilistic VAE to obtain scalar novelty scores, yield a large family of methods.
Edit intent: fluency
Original:  We apply these methods to magnetic resonance imaging, namely to the detection of diffusion-space ( \mbox{q-space ) abnormalities in diffusion MRI scans of multiple sclerosis patients, i.e. ~ to detect multiple sclerosis lesions without using any lesion labels for training.
Revised:  We apply these methods to magnetic resonance imaging, namely to the detection of diffusion-space ( q-space ) abnormalities in diffusion MRI scans of multiple sclerosis patients, i.e. ~ to detect multiple sclerosis lesions without using any lesion labels for training.
Edit intent: coherence
Original:  We apply these methods to magnetic resonance imaging, namely to the detection of diffusion-space ( \mbox{q-space ) abnormalities in diffusion MRI scans of multiple sclerosis patients, i.e. ~ to detect multiple sclerosis lesions without using any lesion labels for training.
Revised:  We apply these methods to magnetic resonance imaging, namely to the detection of diffusion-space ( \mbox{q-space ) abnormalities in diffusion MRI scans of multiple sclerosis patients, i.e. to detect multiple sclerosis lesions without using any lesion labels for training.
Edit intent: coherence
Original:  The feature of this network architecture is a single oscillator (neuron) at the output with multilevel variation of its synchronization value with the main oscillatorthus allowing classifications of an input pattern into a set of classes.
Revised:  The feature of this network architecture is a single oscillator (neuron) of the network has multilevel variations in its synchronization value with the main oscillatorthus allowing classifications of an input pattern into a set of classes.
Edit intent: clarity
Original:  The feature of this network architecture is a single oscillator (neuron) at the output with multilevel variation of its synchronization value with the main oscillatorthus allowing classifications of an input pattern into a set of classes.
Revised:  The feature of this network architecture is a single oscillator (neuron) at the output with multilevel variation of its synchronization value with the reference oscillator, and allows classification of an input pattern into a set of classes.
Edit intent: coherence
Original:   ONN model is realized on thermally-coupled VO2-oscillators.
Revised:  The ONN model is realized on thermally-coupled VO2-oscillators.
Edit intent: fluency
Original:   ONN model is realized on thermally-coupled VO2-oscillators.
Revised:  ONN model is implemented on thermally-coupled VO2-oscillators.
Edit intent: clarity
Original:  It is shown that ONN is capable to classify 512 visual patterns (as a cell array 3x3 , distributed by symmetry into 102 classes) into a set of classes with the maximum number of elements up to P=11.
Revised:  It is shown that ONN is capable of classifying 512 visual patterns (as a cell array 3x3 , distributed by symmetry into 102 classes) into a set of classes with the maximum number of elements up to P=11.
Edit intent: fluency
Original:  It is shown that ONN is capable to classify 512 visual patterns (as a cell array 3x3 , distributed by symmetry into 102 classes) into a set of classes with the maximum number of elements up to P=11.
Revised:  It is shown that ONN is capable to classify 512 visual patterns (as a cell array 3x3 , distributed by symmetry into 102 classes) into a set of classes with a maximum number of elements up to P=11.
Edit intent: fluency
Original:  The obtained results allow designing multilevel output cascades of neural networks with high net data throughput and it may be applied in ONNs with various coupling mechanisms and oscillators topology.
Revised:  The model allows for designing multilevel output cascades of neural networks with high net data throughput and it may be applied in ONNs with various coupling mechanisms and oscillators topology.
Edit intent: clarity
Original:  The obtained results allow designing multilevel output cascades of neural networks with high net data throughput and it may be applied in ONNs with various coupling mechanisms and oscillators topology.
Revised:  The obtained results allow designing multilevel output cascades of neural networks with high net data throughput . The presented method can be applied in ONNs with various coupling mechanisms and oscillators topology.
Edit intent: coherence
Original:  The obtained results allow designing multilevel output cascades of neural networks with high net data throughput and it may be applied in ONNs with various coupling mechanisms and oscillators topology.
Revised:  The obtained results allow designing multilevel output cascades of neural networks with high net data throughput and it may be applied in ONNs with various coupling mechanisms and oscillator topology.
Edit intent: fluency
Original: Direct cDNA preamplification protocols developed for single-cell RNA-seq (scRNA-seq) have enabled transcriptome profiling of  rare cells without having to pool multiple samples or to perform RNA extraction.
Revised: Direct cDNA preamplification protocols developed for single-cell RNA-seq have enabled transcriptome profiling of rare cells without having to pool multiple samples or to perform RNA extraction.
Edit intent: clarity
Original: Direct cDNA preamplification protocols developed for single-cell RNA-seq (scRNA-seq) have enabled transcriptome profiling of  rare cells without having to pool multiple samples or to perform RNA extraction.
Revised: Direct cDNA preamplification protocols developed for single-cell RNA-seq (scRNA-seq) have enabled transcriptome profiling of rare cells without sample pooling or RNA extraction.
Edit intent: clarity
Original:  We present CLEAR, a workflow that identifies robust transcripts in lcRNA-seq data for between-group comparisons.
Revised:  We present CLEAR, a workflow that identifies reliably quantifiable transcripts in lcRNA-seq data for between-group comparisons.
Edit intent: clarity
Original:  When using CLEAR transcripts vs. using all available transcripts, downstream analyses reveal more shared DEGs , improved Principal Component Analysis separation of cell type, and increased similarity between results across different input RNA amounts.
Revised:  When using CLEAR transcripts vs. using all transcripts, downstream analyses reveal more shared DEGs , improved Principal Component Analysis separation of cell type, and increased similarity between results across different input RNA amounts.
Edit intent: clarity
Original:  Another advantage is the ability to use the Nystr\"{o}m extension for computationally efficient interpolation of signals over a graph.
Revised:  Another advantage is the ability to use the Nystr\"{o}m extension , for interpolation of signals over a graph.
Edit intent: clarity
Original:  We show that our method outperforms state of the art graph signal interpolation methods on both datasets, and that our computationally efficient reconstruction achieves slightly reduced accuracy with a large  speedup.
Revised:  We show that our method outperforms state of the art graph signal interpolation techniques on both datasets, and that our computationally efficient reconstruction achieves slightly reduced accuracy with a large speedup.
Edit intent: clarity
Original:  We show that our method outperforms state of the art graph signal interpolation methods on both datasets, and that our computationally efficient reconstruction achieves slightly reduced accuracy with a large  speedup.
Revised:  We show that our method outperforms state of the art graph signal interpolation methods on both datasets, and that our computationally efficient reconstruction achieves slightly reduced accuracy with a large computational speedup.
Edit intent: clarity
Original:  Numerical optimization and statistics are two fields of application in which the algorithm can be a great improvement .
Revised:  Numerical optimization and statistics are two fields of application in which the algorithm can be of particular interest .
Edit intent: clarity
Original:  Algorithms computing the optimal free energy solution are developed for two types of paths: hitting (or absorbing) paths and non-hitting, regular  paths, and require the inversion of an n \times n matrix with n being the number of nodes.
Revised:  Algorithms computing the optimal free energy solution are developed for two types of paths: hitting (or absorbing) paths and non-hitting, regular , paths, and require the inversion of an n \times n matrix with n being the number of nodes.
Edit intent: fluency
Original:  To increase and diversify the set of sites on existing block lists, we develop CensorSeeker, which uses search engines and natural language techniques to discover a much wider range of websites that are censored in China.
Revised:  To increase and diversify the set of sites on existing block lists, we use natural language processing and search engines to automatically discover a much wider range of websites that are censored in China.
Edit intent: clarity
Original:  Using this tool , we create a list of 821 websites outside the Alexa Top 1000 that cover Chinese politics, minority human rights organizations, and oppressed religions .
Revised:  Using these techniques , we create a list of 821 websites outside the Alexa Top 1000 that cover Chinese politics, minority human rights organizations, and oppressed religions .
Edit intent: clarity