wanyu/IteraTeR_v2 huggingface dataset:
Original:  We demonstrate a reduction from RNA folding problem to Dyck edit distance problem of alphabet size 10, establishing a connection between the two fundamental string problems.
Revised:  We demonstrate a reduction from RNA folding to Dyck edit distance problem of alphabet size 10, establishing a connection between the two fundamental string problems.
Edit intent: fluency
Original:  We demonstrate a reduction from RNA folding problem to Dyck edit distance problem of alphabet size 10, establishing a connection between the two fundamental string problems.
Revised:  We demonstrate a reduction from RNA folding problem to Dyck edit distance with alphabet size 10.
Edit intent: coherence
Original: Emotional content is a key element in user-generated videos.
Revised: Emotion is a key element in user-generated videos.
Edit intent: clarity
Original:  However, it is difficult to understand emotions conveyed in such videos due to the complex and unstructured nature of user-generated content and the sparsity of video frames that express emotion.
Revised:  However, it is difficult to understand emotions conveyed in such videos due to the complex and unstructured nature of user-generated content and the sparsity of video frames expressing emotion.
Edit intent: clarity
Original:  In this paper, for the first time, we study the problem of transferring knowledge from heterogeneous external sources, including image and textual data, to facilitate three related tasks in video emotion understanding : emotion recognition, emotion attribution and emotion-oriented summarization.
Revised:  In this paper, for the first time, we study the problem of transferring knowledge from heterogeneous external sources, including image and textual data, to facilitate three related tasks in understanding video emotion : emotion recognition, emotion attribution and emotion-oriented summarization.
Edit intent: clarity
Original:  Specifically, our framework (1) learns a video encoding from an auxiliary emotional image dataset in order to improve supervised video emotion recognition, and (2) transfers knowledge from an auxiliary textual corpus for zero-shot  of emotion classes unseen during training.
Revised:  Specifically, our framework (1) learns a video encoding from an auxiliary emotional image dataset in order to improve supervised video emotion recognition, and (2) transfers knowledge from an auxiliary textual corpora for zero-shot of emotion classes unseen during training.
Edit intent: clarity
Original:  Specifically, our framework (1) learns a video encoding from an auxiliary emotional image dataset in order to improve supervised video emotion recognition, and (2) transfers knowledge from an auxiliary textual corpus for zero-shot  of emotion classes unseen during training.
Revised:  Specifically, our framework (1) learns a video encoding from an auxiliary emotional image dataset in order to improve supervised video emotion recognition, and (2) transfers knowledge from an auxiliary textual corpus for zero-shot recognition of emotion classes unseen during training.
Edit intent: clarity
Original:  Our experimental studies with real and simulated data sets suggest that the proposed DUDE-Seq  outperforms existing alternatives in terms of error-correction capabilities,  time efficiency, as boosting the reliability of downstream analyses.
Revised:  Our experimental studies with real and simulated data sets suggest that the proposed DUDE-Seq not only outperforms existing alternatives in terms of error-correction capabilities, time efficiency, as boosting the reliability of downstream analyses.
Edit intent: clarity
Original:  Our experimental studies with real and simulated data sets suggest that the proposed DUDE-Seq  outperforms existing alternatives in terms of error-correction capabilities,  time efficiency, as boosting the reliability of downstream analyses.
Revised:  Our experimental studies with real and simulated data sets suggest that the proposed DUDE-Seq outperforms existing alternatives in terms of error-correction capabilities, and time efficiency, as boosting the reliability of downstream analyses.
Edit intent: coherence
Original:  Our experimental studies with real and simulated data sets suggest that the proposed DUDE-Seq  outperforms existing alternatives in terms of error-correction capabilities,  time efficiency, as boosting the reliability of downstream analyses.
Revised:  Our experimental studies with real and simulated data sets suggest that the proposed DUDE-Seq outperforms existing alternatives in terms of error-correction capabilities, time efficiency, but also boosts the reliability of downstream analyses.
Edit intent: coherence
Original:  Further,  DUDE-Seq is universally applicable across different sequencing platforms and analysis pipelines by a simple update of the noise model.
Revised:  Further, DUDE-Seq enables us to robustly apply it to different sequencing platforms and analysis pipelines by a simple update of the noise model.
Edit intent: clarity
Original:  The error rate in reads has been increasing with the shift of focus of mainstream sequencers from accuracy to throughput .
Revised:  The next-generation sequencing (NGS) platforms can provide a great deal of sequencing data thanks to their high throughput, but the associated error rates often tend to be high .
Edit intent: clarity
Original:  Denoising in high-throughput sequencing is thus becoming a crucial component for boosting the reliability of downstream analyses.
Revised:  Denoising in high-throughput sequencing has thus become a crucial process for boosting the reliability of downstream analyses.
Edit intent: clarity
Original:  Our methodology, named DUDE-Seq, is derived from a general setting of reconstructing finite-valued source data corrupted by a discrete memoryless channel and provides an effective means for correcting substitution and homopolymer indel errors, the two major types of sequencing errors in most high-throughput  sequencing platforms.
Revised:  Our methodology, named DUDE-Seq, is derived from a general setting of reconstructing finite-valued source data corrupted by a discrete memoryless channel and effectively corrects substitution and homopolymer indel errors, the two major types of sequencing errors in most high-throughput sequencing platforms.
Edit intent: clarity
Original:  Our experimental studies with real and simulated data sets suggest that the proposed DUDE-Seq not only outperforms existing alternatives in terms of error-correction capabilities, and time efficiency, but also boosts the reliability of downstream analyses.
Revised:  Our experimental studies with real and simulated datasets suggest that the proposed DUDE-Seq not only outperforms existing alternatives in terms of error-correction capabilities, and time efficiency, but also boosts the reliability of downstream analyses.
Edit intent: clarity
Original:  Our experimental studies with real and simulated data sets suggest that the proposed DUDE-Seq not only outperforms existing alternatives in terms of error-correction capabilities, and time efficiency, but also boosts the reliability of downstream analyses.
Revised:  Our experimental studies with real and simulated data sets suggest that the proposed DUDE-Seq not only outperforms existing alternatives in terms of error-correction capability and time efficiency, but also boosts the reliability of downstream analyses.
Edit intent: fluency
Original:  Further, the flexibility of DUDE-Seq enables us to robustly apply it to different sequencing platforms and analysis pipelines by a simple update of the noise model. availability: URL
Revised:  Further, the flexibility of DUDE-Seq enables its robust application to different sequencing platforms and analysis pipelines by a simple update of the noise model. availability: URL
Edit intent: clarity
Original:  Further, the flexibility of DUDE-Seq enables us to robustly apply it to different sequencing platforms and analysis pipelines by a simple update of the noise model. availability: URL
Revised:  Further, the flexibility of DUDE-Seq enables us to robustly apply it to different sequencing platforms and analysis pipelines by simple updates of the noise model. availability: URL
Edit intent: fluency
Original:  Further, the flexibility of DUDE-Seq enables us to robustly apply it to different sequencing platforms and analysis pipelines by a simple update of the noise model. availability: URL
Revised:  Further, the flexibility of DUDE-Seq enables us to robustly apply it to different sequencing platforms and analysis pipelines by a simple update of the noise model. DUDE-Seq is available at URL
Edit intent: coherence
Original:  We develop a connection with ergodic and infinite horizon quadratic BSDE, and with a risk-sensitive control problem.
Revised:  We develop a connection with ergodic and infinite horizon quadratic BSDE, and , moreover, with risk-sensitive control problem.
Edit intent: coherence
Original:  We also develop a connection, for large trading horizons, with a family of traditional homothetic value function processes  .
Revised:  We also develop a connection, for large time horizons, with a family of traditional homothetic value function processes .
Edit intent: clarity
Original:  We also develop a connection, for large trading horizons, with a family of traditional homothetic value function processes  .
Revised:  We also develop a connection, for large trading horizons, with a family of classical homothetic value function processes .
Edit intent: clarity
Original: In order to perform accurate electroencephalography (EEG) source reconstruction, i.e., to localize the sources underlying a measured EEG, the electric potential distribution at the electrodes generated by a dipolar current source in the brain has to be simulated,  the so-called EEG forward problem.
Revised: In order to perform electroencephalography (EEG) source reconstruction, i.e., to localize the sources underlying a measured EEG, the electric potential distribution at the electrodes generated by a dipolar current source in the brain has to be simulated, the so-called EEG forward problem.
Edit intent: clarity
Original: In order to perform accurate electroencephalography (EEG) source reconstruction, i.e., to localize the sources underlying a measured EEG, the electric potential distribution at the electrodes generated by a dipolar current source in the brain has to be simulated,  the so-called EEG forward problem.
Revised: In order to perform accurate electroencephalography (EEG) source reconstruction, i.e., to localize the sources underlying a measured EEG, the electric potential distribution at the electrodes generated by a dipolar current source in the brain has to be simulated, which is the so-called EEG forward problem.
Edit intent: coherence
Original:  The finite element method (FEM) has shown high numerical accuracy with the possibility to model complex geometries and conductive features, e.g., white matter conductivity anisotropy.
Revised:  In this context, the finite element method (FEM) has shown high numerical accuracy with the possibility to model complex geometries and conductive features, e.g., white matter conductivity anisotropy.
Edit intent: coherence
Original:  In this article  we introduce and analyze the application of a Discontinuous Galerkin (DG) method, a finite element method that includes features of the finite volume framework, to the EEG forward problem.
Revised:  In this article , we introduce and analyze the application of a Discontinuous Galerkin (DG) method, a finite element method that includes features of the finite volume framework, to the EEG forward problem.
Edit intent: fluency
Original:  In this article  we introduce and analyze the application of a Discontinuous Galerkin (DG) method, a finite element method that includes features of the finite volume framework, to the EEG forward problem.
Revised:  In this article we introduce and analyze the application of a discontinuous Galerkin (DG) method, a finite element method that includes features of the finite volume framework, to the EEG forward problem.
Edit intent: fluency
Original:  The DG-FEM approach allows to fulfill the conservation property of electric charge also in the discrete case, making it attractive for a variety of applications.
Revised:  The DG-FEM approach fulfills the conservation property of electric charge also in the discrete case, making it attractive for a variety of applications.
Edit intent: clarity
Original:  Furthermore, as we show, it can alleviate modeling inaccuracies that might occur in head geometries when using classical FE methods, e.g., so-called "skull leakage effects" for skull compartments with a thickness in the range of the mesh resolution.
Revised:  Furthermore, as we show, this approach can alleviate modeling inaccuracies that might occur in head geometries when using classical FE methods, e.g., so-called "skull leakage effects" for skull compartments with a thickness in the range of the mesh resolution.
Edit intent: clarity
Original:  Furthermore, as we show, it can alleviate modeling inaccuracies that might occur in head geometries when using classical FE methods, e.g., so-called "skull leakage effects" for skull compartments with a thickness in the range of the mesh resolution.
Revised:  Furthermore, as we show, it can alleviate modeling inaccuracies that might occur in head geometries when using classical FE methods, e.g., so-called "skull leakage effects" , which may occur in areas where the thickness of the skull is in the range of the mesh resolution.
Edit intent: clarity
Original:  Therefore, we derive a DG formulation of the FEM subtraction approach for the EEG forward problem and present first numerical results which highlight the advantageous features and the potential  of the proposed approach.
Revised:  Therefore, we derive a DG formulation of the FEM subtraction approach for the EEG forward problem and present numerical results that highlight the advantageous features and the potential of the proposed approach.
Edit intent: coherence
Original:  Therefore, we derive a DG formulation of the FEM subtraction approach for the EEG forward problem and present first numerical results which highlight the advantageous features and the potential  of the proposed approach.
Revised:  Therefore, we derive a DG formulation of the FEM subtraction approach for the EEG forward problem and present first numerical results which highlight the advantageous features and the potential benefits of the proposed approach.
Edit intent: clarity
Original:  The Chung-Lu random graph represents an example of such graphs.
Revised:  The Chung-Lu random graph representsan example of such graphs.
Edit intent: fluency
Original: We present an approach for random access suited for Machine-Type Communication (MTC) that is inspired by the Bloom filter technique .
Revised: We present a random access method inspired on Bloom filters that is suited for Machine-Type Communication (MTC) that is inspired by the Bloom filter technique .
Edit intent: clarity
Original: We present an approach for random access suited for Machine-Type Communication (MTC) that is inspired by the Bloom filter technique .
Revised: We present an approach for random access suited for Machine-Type Communications (MTC) that is inspired by the Bloom filter technique .
Edit intent: fluency
Original: We present an approach for random access suited for Machine-Type Communication (MTC) that is inspired by the Bloom filter technique .
Revised: We present an approach for random access suited for Machine-Type Communication (MTC) .
Edit intent: clarity
Original:  Each accessing device sends a signature during the contention process.
Revised:  Each accessing device sends a signature during the contention process.
Edit intent: fluency
Original:  A signature is constructed using  Bloom filtering method and contains information on the device identity , as well as the connection establishment cause.
Revised:  A signature is constructed using the Bloom filtering method and contains information on the device identity , as well as the connection establishment cause.
Edit intent: fluency
Original:  A signature is constructed using  Bloom filtering method and contains information on the device identity , as well as the connection establishment cause.
Revised:  A signature is constructed using Bloom filtering method and contains information on the device identity and the connection establishment cause.
Edit intent: coherence
Original:  The system model used to instantiate our approach is based on LTE-A access protocol.
Revised:  We instantiate the proposed method over the current LTE-A access protocol.
Edit intent: clarity
Original:   We show that the proposed access method uses the resources, i.e., link time, significantly more efficiently and achieves comparable or lower latency of connection establishment in case of synchronous arrivals, compared to the  LTE-A access protocol  optimized for MTC traffic according to 3GPP . A dividend of the proposed method is that  allows the base station (BS)
Revised:  We show that our method utilizes the system resources more efficiently and achieves comparable or lower latency of connection establishment in case of synchronous arrivals, compared to the LTE-A access protocol optimized for MTC traffic according to 3GPP . A dividend of the proposed method is that allows the base station (BS)
Edit intent: clarity
Original:   We show that the proposed access method uses the resources, i.e., link time, significantly more efficiently and achieves comparable or lower latency of connection establishment in case of synchronous arrivals, compared to the  LTE-A access protocol  optimized for MTC traffic according to 3GPP . A dividend of the proposed method is that  allows the base station (BS)
Revised:  We show that the proposed access method uses the resources, i.e., link time, significantly more efficiently and achieves significantly lower connection establishment latency in case of synchronous arrivals, compared to the LTE-A access protocol optimized for MTC traffic according to 3GPP . A dividend of the proposed method is that allows the base station (BS)
Edit intent: clarity
Original:   We show that the proposed access method uses the resources, i.e., link time, significantly more efficiently and achieves comparable or lower latency of connection establishment in case of synchronous arrivals, compared to the  LTE-A access protocol  optimized for MTC traffic according to 3GPP . A dividend of the proposed method is that  allows the base station (BS)
Revised:  We show that the proposed access method uses the resources, i.e., link time, significantly more efficiently and achieves comparable or lower latency of connection establishment in case of synchronous arrivals, compared to the LTE-A access protocol that is optimized for MTC traffic according to 3GPP . A dividend of the proposed method is that allows the base station (BS)
Edit intent: clarity
Original:   We show that the proposed access method uses the resources, i.e., link time, significantly more efficiently and achieves comparable or lower latency of connection establishment in case of synchronous arrivals, compared to the  LTE-A access protocol  optimized for MTC traffic according to 3GPP . A dividend of the proposed method is that  allows the base station (BS)
Revised:  We show that the proposed access method uses the resources, i.e., link time, significantly more efficiently and achieves comparable or lower latency of connection establishment in case of synchronous arrivals, compared to the LTE-A access protocol optimized for MTC traffic . A dividend of the proposed method is that allows the base station (BS)
Edit intent: clarity
Original:   We show that the proposed access method uses the resources, i.e., link time, significantly more efficiently and achieves comparable or lower latency of connection establishment in case of synchronous arrivals, compared to the  LTE-A access protocol  optimized for MTC traffic according to 3GPP . A dividend of the proposed method is that  allows the base station (BS)
Revised:  We show that the proposed access method uses the resources, i.e., link time, significantly more efficiently and achieves comparable or lower latency of connection establishment in case of synchronous arrivals, compared to the LTE-A access protocol optimized for MTC traffic according to 3GPP . A dividend of the proposed method is that it allows the base station (BS)
Edit intent: fluency
Original: Motivated by the need for fast and accurate classification of unlabeled nucleotide sequences on a large scale, we propose a new classification method that captures the probabilistic structure of a sequence family as a compact context-tree model and uses it efficiently to test proximity and membership of a query sequence.
Revised: Motivated by the need for fast and accurate classification of unlabeled nucleotide sequences on a large scale, we propose a new classification method that captures statistical structures of nucleotide sequences by compact context-tree model and uses it efficiently to test proximity and membership of a query sequence.
Edit intent: clarity
Original:  The proposed nucleic acid sequence classification by universal probability (NASCUP) method crucially utilizes the notion of universal probability from information theory in model-building and classification processes, delivering BLAST-like accuracy in orders-of-magnitude reduced runtime for large-scale databases .
Revised:  The proposed nucleic acid sequence classification by universal probability (NASCUP) method crucially utilizes the notion of universal probability from information theory . NASCUP achieved BLAST-like accuracy in orders-of-magnitude reduced runtime for large-scale databases .
Edit intent: clarity
Original:  The proposed nucleic acid sequence classification by universal probability (NASCUP) method crucially utilizes the notion of universal probability from information theory in model-building and classification processes, delivering BLAST-like accuracy in orders-of-magnitude reduced runtime for large-scale databases .
Revised:  The proposed nucleic acid sequence classification by universal probability (NASCUP) method crucially utilizes the notion of universal probability from information theory in model-building and classification processes, delivering BLAST-like classification accuracy consistently for several large-scale databases .
Edit intent: clarity
Original:  We demonstrate the value of our approach in a number of synthetic and real-world settings, including traffic volume measurements and accelerometer signals .
Revised:  We demonstrate the value of our approach in a number of synthetic and real-world settings, considering traffic volume measurements and accelerometer signals .
Edit intent: clarity
Original:  From a set of d-dimensional vectors, we obtain a d-dot product graph\dpg by letting each vector %DIFDELCMD < {\bf %%% a \va ^u correspond to a vertex u and by adding an edge between two vertices u and v if and only if their dot product %DIFDELCMD < {\bf %%% a ^{u \cdot }%DIFDELCMD < {\bf %%% a \va \cdot }\va ^{v} \geq t, for some fixed, positive threshold~t.
Revised:  From a set of d-dimensional vectors, we obtain a d-\dpg by letting each vector %DIFDELCMD < {\bf %%% a \va ^u correspond to a vertex u and by adding an edge between two vertices u and v if and only if their dot product %DIFDELCMD < {\bf %%% a ^{u \cdot }%DIFDELCMD < {\bf %%% a \va \cdot }\va ^{v} \geq t, for some fixed, positive threshold~t.
Edit intent: clarity
Original:  From a set of d-dimensional vectors, we obtain a d-dot product graph\dpg by letting each vector %DIFDELCMD < {\bf %%% a \va ^u correspond to a vertex u and by adding an edge between two vertices u and v if and only if their dot product %DIFDELCMD < {\bf %%% a ^{u \cdot }%DIFDELCMD < {\bf %%% a \va \cdot }\va ^{v} \geq t, for some fixed, positive threshold~t.
Revised:  From a set of d-dimensional vectors, we obtain a d-dot product graph\dpg\ by letting each vector %DIFDELCMD < {\bf %%% a \va ^u correspond to a vertex u and by adding an edge between two vertices u and v if and only if their dot product %DIFDELCMD < {\bf %%% a ^{u \cdot }%DIFDELCMD < {\bf %%% a \va \cdot }\va ^{v} \geq t, for some fixed, positive threshold~t.
Edit intent: fluency