wanyu/IteraTeR_v2 huggingface dataset:
Original:  But, on contrary to the binary problems, the computational power of Las-Vegas QFAs and bounded-error PFAs are equivalent to DFAs . Lastly, we present a new family of unary promise problems with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentially more succinct than DFAs.
Revised:  But, on contrary to the binary problems, the computational powers of Las-Vegas QFAs and bounded-error PFAs are equivalent to DFAs . Lastly, we present a new family of unary promise problems with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentially more succinct than DFAs.
Edit intent: fluency
Original:  But, on contrary to the binary problems, the computational power of Las-Vegas QFAs and bounded-error PFAs are equivalent to DFAs . Lastly, we present a new family of unary promise problems with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentially more succinct than DFAs.
Revised:  But, on contrary to the binary problems, the computational power of Las-Vegas QFAs and bounded-error PFAs are equivalent to deterministic finite automata (DFAs) . Lastly, we present a new family of unary promise problems with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentially more succinct than DFAs.
Edit intent: clarity
Original: With smartphones becoming our everyday companions,  high-quality mobile applications have become an important integral of people 's lives.
Revised: With smart devices, particular smartphones, becoming our everyday companions, high-quality mobile applications have become an important integral of people 's lives.
Edit intent: clarity
Original:  This motivates the emergence of Fog computing as a promising , practical and efficient solution tailored to serving mobile traffics .
Revised:  The Fog computing is a promising solution towards this goal .
Edit intent: clarity
Original:  Lastly, we discuss on the potential research issues from the networking 's perspective.
Revised:  Lastly, we discuss some of the future research issues from the networking 's perspective.
Edit intent: clarity
Original:  Lastly, we discuss on the potential research issues from the networking 's perspective.
Revised:  Lastly, we discuss on the potential research issues from the networking perspective.
Edit intent: fluency
Original: Discrete transforms such as the Discrete Fourier Transform (DFT) or the Discrete Hartley Transform (DHT) furnish an indispensable tool in Signal Processing .
Revised: Discrete transforms such as the discrete Fourier transform (DFT) or the Discrete Hartley Transform (DHT) furnish an indispensable tool in Signal Processing .
Edit intent: fluency
Original: Discrete transforms such as the Discrete Fourier Transform (DFT) or the Discrete Hartley Transform (DHT) furnish an indispensable tool in Signal Processing .
Revised: Discrete transforms such as the Discrete Fourier Transform (DFT) or the discrete Hartley transform (DHT) furnish an indispensable tool in Signal Processing .
Edit intent: fluency
Original: Discrete transforms such as the Discrete Fourier Transform (DFT) or the Discrete Hartley Transform (DHT) furnish an indispensable tool in Signal Processing .
Revised: Discrete transforms such as the Discrete Fourier Transform (DFT) or the Discrete Hartley Transform (DHT) furnish an indispensable tool in signal processing .
Edit intent: fluency
Original:  In this paper some fast algorithms are derived which meet the lower bound on the multiplicative complexity of a DFT/DHT.
Revised:  In this paper some fast algorithms are derived which meet the lower bound on the multiplicative complexity of the DFT/DHT.
Edit intent: fluency
Original:  The approach is based on a decomposition of the DHT into layers of Hadamard-Walsh transforms.
Revised:  The approach is based on a decomposition of the DHT into layers of Walsh-Hadamard transforms.
Edit intent: fluency
Original:  In particular, schemes named Turbo Fourier Transforms for short block lengths such as N = 4, 8, 12 and 24  are presented.
Revised:  In particular, fast algorithms for short block lengths such as N = 4, 8, 12 and 24 are presented.
Edit intent: clarity
Original:  In particular, schemes named Turbo Fourier Transforms for short block lengths such as N = 4, 8, 12 and 24  are presented.
Revised:  In particular, schemes named Turbo Fourier Transforms for short block lengths such as N = 4, 8, 12 , 24 are presented.
Edit intent: fluency
Original: Motivation: A wide variety of large-scale data have been produced in bioinformatics.
Revised:  A wide variety of large-scale data have been produced in bioinformatics.
Edit intent: coherence
Original: Motivation: A wide variety of large-scale data have been produced in bioinformatics.
Revised: Motivation: A wide variety of large-scale data has been produced in bioinformatics.
Edit intent: fluency
Original:  Nevertheless , the time demand of many bioinformatics programs still remains high for large-scale practical uses , due to factors that hinder acceleration by parallelization.
Revised:  However , the time demand of many bioinformatics programs still remains high for large-scale practical uses , due to factors that hinder acceleration by parallelization.
Edit intent: coherence
Original:  Nevertheless , the time demand of many bioinformatics programs still remains high for large-scale practical uses , due to factors that hinder acceleration by parallelization.
Revised:  Nevertheless , the time demand of many bioinformatics programs still remains high for large-scale practical uses due to factors that hinder acceleration by parallelization.
Edit intent: fluency
Original:  Recently, new generations of storage devices are emerging , such as NAND flash solid-state drives (SSDs), and with the renewed interest in near-data processing, they are increasingly becoming acceleration methods that can accompany parallel processing.
Revised:  Recently, new generations of storage devices have emerged , such as NAND flash solid-state drives (SSDs), and with the renewed interest in near-data processing, they are increasingly becoming acceleration methods that can accompany parallel processing.
Edit intent: clarity
Original:  Recently, new generations of storage devices are emerging , such as NAND flash solid-state drives (SSDs), and with the renewed interest in near-data processing, they are increasingly becoming acceleration methods that can accompany parallel processing.
Revised:  Recently, new generations of storage devices are emerging , such as NAND flash-based solid-state drives (SSDs), and with the renewed interest in near-data processing, they are increasingly becoming acceleration methods that can accompany parallel processing.
Edit intent: clarity
Original:  In certain cases, a simple drop-in replacement of HDDs by SSDs results in dramatic speedup.
Revised:  In certain cases, a simple drop-in replacement of hard disk drives (HDDs) by SSDs results in dramatic speedup.
Edit intent: clarity
Original:  Despite the various advantages and continuous cost reduction of SSDs, there has been little research on SSD-based profiling and performance exploration of important but time-consuming bioinformatics programs.
Revised:  Despite the various advantages and continuous cost reduction of SSDs, there has been little review of SSD-based profiling and performance exploration of important but time-consuming bioinformatics programs.
Edit intent: clarity
Original:  Results: We perform in-depth profiling and analysis of 23 key bioinformatics programs using multiple types of SSDs . Based on the insight obtained therefrom , we further discuss issues related to design and optimize bioinformatics algorithms and pipelines to fully exploit SSDs. The programs profiled cover traditional and emerging areas of importance, such as alignment, assembly, mapping, expression analysis, variant calling, and metagenomics.
Revised:  For an informative review, we perform in-depth profiling and analysis of 23 key bioinformatics programs using multiple types of SSDs . Based on the insight obtained therefrom , we further discuss issues related to design and optimize bioinformatics algorithms and pipelines to fully exploit SSDs. The programs profiled cover traditional and emerging areas of importance, such as alignment, assembly, mapping, expression analysis, variant calling, and metagenomics.
Edit intent: coherence
Original:  Results: We perform in-depth profiling and analysis of 23 key bioinformatics programs using multiple types of SSDs . Based on the insight obtained therefrom , we further discuss issues related to design and optimize bioinformatics algorithms and pipelines to fully exploit SSDs. The programs profiled cover traditional and emerging areas of importance, such as alignment, assembly, mapping, expression analysis, variant calling, and metagenomics.
Revised:  Results: We perform in-depth profiling and analysis of 23 key bioinformatics programs using multiple types of devices . Based on the insight obtained therefrom , we further discuss issues related to design and optimize bioinformatics algorithms and pipelines to fully exploit SSDs. The programs profiled cover traditional and emerging areas of importance, such as alignment, assembly, mapping, expression analysis, variant calling, and metagenomics.
Edit intent: clarity
Original:  Results: We perform in-depth profiling and analysis of 23 key bioinformatics programs using multiple types of SSDs . Based on the insight obtained therefrom , we further discuss issues related to design and optimize bioinformatics algorithms and pipelines to fully exploit SSDs. The programs profiled cover traditional and emerging areas of importance, such as alignment, assembly, mapping, expression analysis, variant calling, and metagenomics.
Revised:  Results: We perform in-depth profiling and analysis of 23 key bioinformatics programs using multiple types of SSDs . Based on the insight we obtain from this research , we further discuss issues related to design and optimize bioinformatics algorithms and pipelines to fully exploit SSDs. The programs profiled cover traditional and emerging areas of importance, such as alignment, assembly, mapping, expression analysis, variant calling, and metagenomics.
Edit intent: clarity
Original:  Results: We perform in-depth profiling and analysis of 23 key bioinformatics programs using multiple types of SSDs . Based on the insight obtained therefrom , we further discuss issues related to design and optimize bioinformatics algorithms and pipelines to fully exploit SSDs. The programs profiled cover traditional and emerging areas of importance, such as alignment, assembly, mapping, expression analysis, variant calling, and metagenomics.
Revised:  Results: We perform in-depth profiling and analysis of 23 key bioinformatics programs using multiple types of SSDs . Based on the insight obtained therefrom , we further discuss issues related to design and optimize bioinformatics algorithms and pipelines to fully exploit SSDs. The programs we profile cover traditional and emerging areas of importance, such as alignment, assembly, mapping, expression analysis, variant calling, and metagenomics.
Edit intent: clarity
Original:  We demonstrate how acceleration by parallelization can be combined with SSDs for extra performance and also how using SSDs can expedite important bioinformatics pipelines  such as variant calling by the Genome Analysis Toolkit (GATK) and transcriptome analysis using  RNA-seq  .
Revised:  We explain how acceleration by parallelization can be combined with SSDs for extra performance and also how using SSDs can expedite important bioinformatics pipelines such as variant calling by the Genome Analysis Toolkit (GATK) and transcriptome analysis using RNA-seq .
Edit intent: clarity
Original:  We demonstrate how acceleration by parallelization can be combined with SSDs for extra performance and also how using SSDs can expedite important bioinformatics pipelines  such as variant calling by the Genome Analysis Toolkit (GATK) and transcriptome analysis using  RNA-seq  .
Revised:  We demonstrate how acceleration by parallelization can be combined with SSDs for improved performance and also how using SSDs can expedite important bioinformatics pipelines such as variant calling by the Genome Analysis Toolkit (GATK) and transcriptome analysis using RNA-seq .
Edit intent: clarity
Original:  We demonstrate how acceleration by parallelization can be combined with SSDs for extra performance and also how using SSDs can expedite important bioinformatics pipelines  such as variant calling by the Genome Analysis Toolkit (GATK) and transcriptome analysis using  RNA-seq  .
Revised:  We demonstrate how acceleration by parallelization can be combined with SSDs for extra performance and also how using SSDs can expedite important bioinformatics pipelines , such as variant calling by the Genome Analysis Toolkit (GATK) and transcriptome analysis using RNA-seq .
Edit intent: fluency
Original:  We demonstrate how acceleration by parallelization can be combined with SSDs for extra performance and also how using SSDs can expedite important bioinformatics pipelines  such as variant calling by the Genome Analysis Toolkit (GATK) and transcriptome analysis using  RNA-seq  .
Revised:  We demonstrate how acceleration by parallelization can be combined with SSDs for extra performance and also how using SSDs can expedite important bioinformatics pipelines such as variant calling by the Genome Analysis Toolkit (GATK) and transcriptome analysis using RNA-seq ) .
Edit intent: fluency
Original:  We hope that this paper can provide useful directions and tips that should accompany future bioinformatics algorithm design procedures that properly consider new generations of powerful storage devices.
Revised:  We hope that this review can provide useful directions and tips that should accompany future bioinformatics algorithm design procedures that properly consider new generations of powerful storage devices.
Edit intent: clarity
Original:  We hope that this paper can provide useful directions and tips that should accompany future bioinformatics algorithm design procedures that properly consider new generations of powerful storage devices.
Revised:  We hope that this paper can provide useful directions and tips to accompany future bioinformatics algorithm design procedures that properly consider new generations of powerful storage devices.
Edit intent: clarity
Original:  We believe that the relational semantics is limiting: node relations only indicate that nodes in the graph are connected in some way, this without telling how these connections can be established and, hence, only providing limited insight in the structure of the graph  .
Revised:  We believe that the relational query semantics can only provide limited insight in the structure of the graph .
Edit intent: clarity
Original:  We believe that the relational semantics is limiting: node relations only indicate that nodes in the graph are connected in some way, this without telling how these connections can be established and, hence, only providing limited insight in the structure of the graph  .
Revised:  We believe that the relational semantics is limiting: node relations only indicate that nodes in the graph are connected in some way, this without telling how these connections can be established and, hence, only providing limited insight in the structure of the graph data .
Edit intent: clarity
Original:  To address the limits of the relational  semantics, we propose two path-based semantics for evaluating context-free grammars on graphs: evaluating context-free grammars to the set of all paths whose labeling is accepted by the context-free grammar, and to a single path whose labeling is accepted by the context-free grammar.
Revised:  To address the limits of the relational semantics, we propose two path-based semantics for evaluating context-free grammars on graphs: evaluating context-free grammars to the set of all paths whose labeling is accepted by the context-free grammar, and to a single such path. While focusing on context-free grammar.
Edit intent: clarity
Original: We derive tight expressions for the maximum number of k-faces, 0kd-1, of the Minkowski sum, P_1+ \cdots +P_r, of r convex d-polytopes P_1, \ldots ,P_r in R^d, where d2 and r<d, as a (recursively defined) function on the number of vertices of the polytopes.
Revised: We derive tight expressions for the maximum number of k-faces, 0kd-1, of the Minkowski sum, P_1+ ... +P_r, of r convex d-polytopes P_1, \ldots ,P_r in R^d, where d2 and r<d, as a (recursively defined) function on the number of vertices of the polytopes.
Edit intent: coherence
Original: We derive tight expressions for the maximum number of k-faces, 0kd-1, of the Minkowski sum, P_1+ \cdots +P_r, of r convex d-polytopes P_1, \ldots ,P_r in R^d, where d2 and r<d, as a (recursively defined) function on the number of vertices of the polytopes.
Revised: We derive tight expressions for the maximum number of k-faces, 0kd-1, of the Minkowski sum, P_1+ \cdots +P_r, of r convex d-polytopes P_1, ... ,P_r in R^d, where d2 and r<d, as a (recursively defined) function on the number of vertices of the polytopes.
Edit intent: clarity
Original:  In particular we refer to three dimensions of biographies : meta-data, language usage, and structure of the network built from links between articles .
Revised:  In particular we refer to three dimensions of biographies : meta-data, language , and network structure .
Edit intent: clarity
Original:  Some of these differences are reflected from the offline world documented by Wikipedia, but other differences can be attributed to gender bias in Wikipedia content.
Revised:  Some of these differences are reflected from the off-line world documented by Wikipedia, but other differences can be attributed to gender bias in Wikipedia content.
Edit intent: fluency
Original:  The recurrent signals exchanged between layers are gated adaptively based on the previous hidden state and the current input.
Revised:  The recurrent signals exchanged between layers are gated adaptively based on the previous hidden states and the current input.
Edit intent: fluency
Original:  Although recent progress has resulted in several protocols which can verify the output of a quantum computation performed by entangled but non-communicating processors, the overhead for such schemes is prohibitive , scaling at least as the 22nd power of the number of gates .
Revised:  The recent discovery of protocols for verifying computation performed by entangled but non-communicating processors, the overhead for such schemes is prohibitive , scaling at least as the 22nd power of the number of gates .
Edit intent: clarity
Original:  This approach has significantly reduced overhead, with resources scaling as a quartic polynomial in the number of gates.
Revised:  This approach has dramatically reduced overhead, with resources scaling as a quartic polynomial in the number of gates.
Edit intent: clarity
Original: The implied volatility slope has received relatively little attention in the literature on short-time asymptotics for financial models with jumps, despite its importance in model selection and calibration.
Revised: The implied volatility skew has received relatively little attention in the literature on short-time asymptotics for financial models with jumps, despite its importance in model selection and calibration.
Edit intent: clarity
Original: The implied volatility slope has received relatively little attention in the literature on short-time asymptotics for financial models with jumps, despite its importance in model selection and calibration.
Revised: The implied volatility slope has received relatively little attention in the literature on short-term asymptotics for financial models with jumps, despite its importance in model selection and calibration.
Edit intent: fluency
Original:  Our simulation results also indicate that for parameter values of relevance in finance, the asymptotic expansions give a good fit for maturities up to one month   .
Revised:  Our simulation results also indicate that for parameter values of relevance in finance, the asymptotic expansions give good fits for options with maturities up to one month .
Edit intent: clarity
Original:  Several models has been proposed for explaining the origin;
Revised:  Several models have been proposed for explaining the origin;
Edit intent: fluency
Original: Ecological patterns arise from the interplay of many different processes, and yet the emergence of consistent phenomena across a diverse range of ecological systems suggests that many patterns may in part be determined by statistical or numerical constraints.
Revised: Ecological patterns arise from the interplay of many processes, yet the emergence of consistent phenomena across a diverse range of ecological systems suggests that many patterns may in part be determined by statistical or numerical constraints.
Edit intent: clarity
Original: Ecological patterns arise from the interplay of many different processes, and yet the emergence of consistent phenomena across a diverse range of ecological systems suggests that many patterns may in part be determined by statistical or numerical constraints.
Revised: Ecological patterns arise from the interplay of many different processes, and yet the emergence of consistent phenomena across diverse ecological systems suggests that many patterns may in part be determined by statistical or numerical constraints.
Edit intent: clarity
Original: Ecological patterns arise from the interplay of many processes, yet the emergence of consistent phenomena across diverse ecological systems suggests that many patterns may in part be determined by statistical or numerical constraints.
Revised: Ecological patterns arise from the interplay of many different processes, and yet the emergence of consistent phenomena across diverse ecological systems suggests that many patterns may in part be determined by statistical or numerical constraints.
Edit intent: clarity
Original: Ecological patterns arise from the interplay of many processes, yet the emergence of consistent phenomena across diverse ecological systems suggests that many patterns may in part be determined by statistical or numerical constraints.
Revised: Ecological patterns arise from the interplay of many processes, yet the emergence of consistent phenomena across a diverse range of ecological systems suggests that many patterns may in part be determined by statistical or numerical constraints.
Edit intent: clarity
Original:  We addressed this challenge by directly comparing  a constraint-based model , the Maximum Entropy Theory of Ecology (METE) and  a process-based model , the size-structured neutral theory (SSNT).
Revised:  We tackled this challenge by directly comparing a constraint-based model , the Maximum Entropy Theory of Ecology (METE) and a process-based model , the size-structured neutral theory (SSNT).
Edit intent: fluency
Original:  We addressed this challenge by directly comparing  a constraint-based model , the Maximum Entropy Theory of Ecology (METE) and  a process-based model , the size-structured neutral theory (SSNT).
Revised:  We addressed this challenge by directly comparing models from a constraint-based model , the Maximum Entropy Theory of Ecology (METE) and a process-based model , the size-structured neutral theory (SSNT).
Edit intent: clarity
Original:  We addressed this challenge by directly comparing  a constraint-based model , the Maximum Entropy Theory of Ecology (METE) and  a process-based model , the size-structured neutral theory (SSNT).
Revised:  We addressed this challenge by directly comparing a constraint-based theory , the Maximum Entropy Theory of Ecology (METE) and a process-based model , the size-structured neutral theory (SSNT).
Edit intent: fluency