wanyu/IteraTeR_v2 huggingface dataset:
Original:  We compare the CSR5-based SpMV algorithm with 11 state-of-the-art formats / algorithms on four mainstream processors using 14 regular and 10 irregular matrices as a benchmark suite.
Revised:  We compare the CSR5-based SpMV algorithm with 11 state-of-the-art formats and algorithms on four mainstream processors using 14 regular and 10 irregular matrices as a benchmark suite.
Edit intent: fluency
Original:  For the 10 irregular matrices, the CSR5 obtains average performance improvement of 17.6 \%, 28.5\%, 173.0\% and 293.3\% (up to 213.3\%, \\%DIF > , 28.5\\%, 173.0\\% and 293.
Revised:  For the 10 irregular matrices, the CSR5 obtains average performance improvement of 17.6 \\%DIF > , 28.5\\%, 173.0\\% and 293.
Edit intent: coherence
Original:  Using the Skip-gram neural networks, protein sequences are represented with a single dense n-dimensional vector.
Revised:  In this method, we adopt artificial neural network approaches and represent a protein sequence with a single dense n-dimensional vector.
Edit intent: clarity
Original:  This methodwas evaluated by classifying protein sequences obtained from Swiss-Prot belonging to 7,027 protein families  where an average family classification accuracy of 94%DIFDELCMD < \\%%% %DIF < \pm 0.03%DIFDELCMD < \\%%% %DIF < was obtained, outperforming existing family classification methods.
Revised:  This methodwas evaluated by classifying protein sequences obtained from Swiss-Prot belonging to 7,027 protein families , where an average family classification accuracy of 94%DIFDELCMD < \\%%% %DIF < \pm 0.03%DIFDELCMD < \\%%% %DIF < was obtained, outperforming existing family classification methods.
Edit intent: fluency
Original:  This methodwas evaluated by classifying protein sequences obtained from Swiss-Prot belonging to 7,027 protein families  where an average family classification accuracy of 94%DIFDELCMD < \\%%% %DIF < \pm 0.03%DIFDELCMD < \\%%% %DIF < was obtained, outperforming existing family classification methods.
Revised:  This methodwas evaluated by classifying protein sequences obtained from Swiss-Prot belonging to 7,027 protein families where an average family classification accuracy of %DIFDELCMD < \\%%% %DIF < \pm 0.03%DIFDELCMD < \\%%% %DIF < was obtained, outperforming existing family classification methods.
Edit intent: clarity
Original:  Two databases of disordered sequences were used: the DisProt database as well as a database featuring the disordered regions of nucleoporins rich with phenylalanine-glycine repeats (FG-Nups).
Revised:  Two databases of disordered sequences are used: the DisProt database as well as a database featuring the disordered regions of nucleoporins rich with phenylalanine-glycine repeats (FG-Nups).
Edit intent: fluency
Original:  Using support vector machine classifiers, FG-Nup sequences were distinguished from structured  Protein Data Bank (PDB) sequences with 99.81%DIFDELCMD < \\%%% %DIF < accuracy, and unstructured DisProt sequences  from structured DisProt sequences with 100.0 %DIFDELCMD < \\%%% %DIF < accuracy.
Revised:  Using support vector machine classifiers, FG-Nup sequences are distinguished from structured Protein Data Bank (PDB) sequences with 99.81%DIFDELCMD < \\%%% %DIF < accuracy, and unstructured DisProt sequences from structured DisProt sequences with 100.0 %DIFDELCMD < \\%%% %DIF < accuracy.
Edit intent: fluency
Original:  Using support vector machine classifiers, FG-Nup sequences were distinguished from structured  Protein Data Bank (PDB) sequences with 99.81%DIFDELCMD < \\%%% %DIF < accuracy, and unstructured DisProt sequences  from structured DisProt sequences with 100.0 %DIFDELCMD < \\%%% %DIF < accuracy.
Revised:  Using support vector machine classifiers, FG-Nup sequences were distinguished from structured protein sequences found in Protein Data Bank (PDB) sequences with 99.81%DIFDELCMD < \\%%% %DIF < accuracy, and unstructured DisProt sequences from structured DisProt sequences with 100.0 %DIFDELCMD < \\%%% %DIF < accuracy.
Edit intent: clarity
Original:  Using support vector machine classifiers, FG-Nup sequences were distinguished from structured  Protein Data Bank (PDB) sequences with 99.81%DIFDELCMD < \\%%% %DIF < accuracy, and unstructured DisProt sequences  from structured DisProt sequences with 100.0 %DIFDELCMD < \\%%% %DIF < accuracy.
Revised:  Using support vector machine classifiers, FG-Nup sequences were distinguished from structured Protein Data Bank (PDB) %DIFDELCMD < \\%%% %DIF < accuracy, and unstructured DisProt sequences from structured DisProt sequences with 100.0 %DIFDELCMD < \\%%% %DIF < accuracy.
Edit intent: clarity
Original:  These results indicate  that by only providing sequence data for various proteins into this model,  information about protein structure can be determined with high accuracy.
Revised:  These results indicate that by only providing sequence data for various proteins into this model, accurate information about protein structure can be determined with high accuracy.
Edit intent: clarity
Original:  Owners of this data strive to obtain insights from it, often by applying machine learning algorithms . Many machine learning algorithms , however, do not scale well to cope with the ever increasing volumes of data.
Revised:  Owners of this data strive to obtain insights from it, often by applying machine learning algorithms often face scalability bottlenecks when they are applied to large-scale data.
Edit intent: clarity
Original: Genome rearrangements can be modeled by k-breaks, which break a genome at k positions and glue the resulting fragments in a new order.
Revised: Genome rearrangements can be modeled as k-breaks, which break a genome at k positions and glue the resulting fragments in a new order.
Edit intent: fluency
Original:  While k-break rearrangements for k>3 have not been observed in evolution, they are used in cancer genomics to model chromothripsis, a catastrophic event of multiple breakages happening  in a genome simultaneously .
Revised:  While k-break rearrangements for k>3 have not been observed in evolution, they are used in cancer genomics to model chromothripsis, a catastrophic event of multiple breakages happening simultaneously in a genome simultaneously .
Edit intent: fluency
Original:  While k-break rearrangements for k>3 have not been observed in evolution, they are used in cancer genomics to model chromothripsis, a catastrophic event of multiple breakages happening  in a genome simultaneously .
Revised:  While k-break rearrangements for k>3 have not been observed in evolution, they are used in cancer genomics to model chromothripsis, a catastrophic event of multiple breakages happening in a genome .
Edit intent: clarity
Original:  It is known that the k-break distance between two genomes (i.e., the minimal number of k-breaks needed to transform one genome into the other) can be computed in terms of cycle lengths of the breakpoint graph of these genomes.
Revised:  It is known that the k-break distance between two genomes (i.e., the minimum number of k-breaks needed to transform one genome into the other) can be computed in terms of cycle lengths of the breakpoint graph of these genomes.
Edit intent: fluency
Original:  It is known that the k-break distance between two genomes (i.e., the minimal number of k-breaks needed to transform one genome into the other) can be computed in terms of cycle lengths of the breakpoint graph of these genomes.
Revised:  It is known that the k-break distance between two genomes (i.e., the minimal number of k-breaks required to transform one genome into the other) can be computed in terms of cycle lengths of the breakpoint graph of these genomes.
Edit intent: fluency
Original:  It is known that the k-break distance between two genomes (i.e., the minimal number of k-breaks needed to transform one genome into the other) can be computed in terms of cycle lengths of the breakpoint graph of these genomes.
Revised:  It is known that the k-break distance between two genomes (i.e., the minimal number of k-breaks needed to transform one genome into the other) can be computed in terms of cycle lengths in the breakpoint graph of these genomes.
Edit intent: clarity
Original:  In the current work, we address the combinatorial problem of enumeration of genomes at a given k-break distance from a fixed  genome.
Revised:  In the current work, we address the combinatorial problem of enumerating genomes at a given k-break distance from a fixed genome.
Edit intent: fluency
Original:  More generally, we enumerate genome pairs, whose breakpoint graph has a fixed distribution of cycle lengths.
Revised:  More generally, we enumerate genome pairs, whose breakpoint graph has a given distribution of cycle lengths.
Edit intent: clarity
Original:  We show that the perfect recovery is possible for graph signals bandlimited under the graph Fourier transform , and the sampled signal coefficients form a new graph signal, whose corresponding graph structure is constructed from the original graph structure, preserving frequency contents.
Revised:  We show that perfect recovery is possible for graph signals bandlimited under the graph Fourier transform , and the sampled signal coefficients form a new graph signal, whose corresponding graph structure is constructed from the original graph structure, preserving frequency contents.
Edit intent: fluency
Original:  We show that the perfect recovery is possible for graph signals bandlimited under the graph Fourier transform , and the sampled signal coefficients form a new graph signal, whose corresponding graph structure is constructed from the original graph structure, preserving frequency contents.
Revised:  We show that the perfect recovery is possible for graph signals bandlimited under the graph Fourier transform . The sampled signal coefficients form a new graph signal, whose corresponding graph structure is constructed from the original graph structure, preserving frequency contents.
Edit intent: coherence
Original:  We further establish the connection to frames with maximal robustness to erasures as well as compressed sensing, and show how to choose the optimal sampling operator, how random sampling works on circulant graphs and Erdos-R\'enyi graphs, and how to handle full-band graph signals by using graph filter banks.
Revised:  We further establish the connection to frames with maximal robustness to erasures as well as for Erdos-R\'enyi graphs, and how to handle full-band graph signals by using graph filter banks.
Edit intent: clarity
Original:  We show that for each case, the proposed sampling theory achieves perfect recovery with high probability}  . Finally, we apply the proposed sampling theory to semi-supervised classification of online blogs and digit images, where we achieve similar or better performance with fewer labeled samples compared to the previous work.
Revised:  We show that for each case, the proposed sampling theory achieves perfect recovery with high probability} . Finally, we apply the proposed sampling theory to semi-supervised classification on online blogs and digit images, where we achieve similar or better performance with fewer labeled samples compared to the previous work.
Edit intent: fluency
Original:  We show that for each case, the proposed sampling theory achieves perfect recovery with high probability}  . Finally, we apply the proposed sampling theory to semi-supervised classification of online blogs and digit images, where we achieve similar or better performance with fewer labeled samples compared to the previous work.
Revised:  We show that for each case, the proposed sampling theory achieves perfect recovery with high probability} . Finally, we apply the proposed sampling theory to semi-supervised classification of online blogs and digit images, where we achieve similar or better performance with fewer labeled samples compared to previous work.
Edit intent: fluency
Original:  The voltage dependence of the derived forward rate function for Na+ channel inactivationhas an exponential dependence on the membrane potential for small depolarizations and approaches a constant value for larger depolarizations, whereas the voltage dependence of the backward rate function is exponential, and each rate has a similar form to the Hodgkin-Huxley empirical rate functions for Na+ channel inactivation in the squid axon.
Revised:  The voltage dependence of the derived forward rate function for Na+ activation and inactivation, and have a voltage dependence that is consistent with the empirically determined Hodgkin-Huxley expressions, and exhibit saturation for both depolarized and hyperpolarized clamp potentials. exponential, and each rate has a similar form to the Hodgkin-Huxley empirical rate functions for Na+ channel inactivation in the squid axon.
Edit intent: clarity
Original:  the forward and backward inactivation rate functions may be derived from a solution to the master eqution for interdependent Na+ activation and inactivation , and have a voltage dependence that is consistent with the empirically determined Hodgkin-Huxley expressions, and exhibit saturation for both depolarized and hyperpolarized clamp potentials .exponential, and each rate has a similar form to the Hodgkin-Huxley empirical rate functions for Na+ channel inactivation in the squid axon .
Revised:  the forward and backward inactivation rate functions may be derived from a solution to the master equation for interdependent activation and inactivation , and have a voltage dependence that is consistent with the empirically determined Hodgkin-Huxley expressions, and exhibit saturation for both depolarized and hyperpolarized clamp potentials .exponential, and each rate has a similar form to the Hodgkin-Huxley empirical rate functions for Na+ channel inactivation in the squid axon .
Edit intent: fluency
Original:  the forward and backward inactivation rate functions may be derived from a solution to the master eqution for interdependent Na+ activation and inactivation , and have a voltage dependence that is consistent with the empirically determined Hodgkin-Huxley expressions, and exhibit saturation for both depolarized and hyperpolarized clamp potentials .exponential, and each rate has a similar form to the Hodgkin-Huxley empirical rate functions for Na+ channel inactivation in the squid axon .
Revised:  the forward and backward inactivation rate functions may be derived from a solution to the master eqution for interdependent Na+ activation and inactivation . The rate functions have a voltage dependence that is consistent with the empirically determined Hodgkin-Huxley expressions, and exhibit saturation for both depolarized and hyperpolarized clamp potentials .exponential, and each rate has a similar form to the Hodgkin-Huxley empirical rate functions for Na+ channel inactivation in the squid axon .
Edit intent: clarity
Original:  the forward and backward inactivation rate functions may be derived from a solution to the master eqution for interdependent Na+ activation and inactivation , and have a voltage dependence that is consistent with the empirically determined Hodgkin-Huxley expressions, and exhibit saturation for both depolarized and hyperpolarized clamp potentials .exponential, and each rate has a similar form to the Hodgkin-Huxley empirical rate functions for Na+ channel inactivation in the squid axon .
Revised:  the forward and backward inactivation rate functions may be derived from a solution to the master eqution for interdependent Na+ activation and inactivation , and have a voltage dependence that is consistent with the Hodgkin-Huxley empirically determined expressions, and exhibit saturation for both depolarized and hyperpolarized clamp potentials .exponential, and each rate has a similar form to the Hodgkin-Huxley empirical rate functions for Na+ channel inactivation in the squid axon .
Edit intent: fluency
Original:  the forward and backward inactivation rate functions may be derived from a solution to the master eqution for interdependent Na+ activation and inactivation , and have a voltage dependence that is consistent with the empirically determined Hodgkin-Huxley expressions, and exhibit saturation for both depolarized and hyperpolarized clamp potentials .exponential, and each rate has a similar form to the Hodgkin-Huxley empirical rate functions for Na+ channel inactivation in the squid axon .
Revised:  the forward and backward inactivation rate functions may be derived from a solution to the master eqution for interdependent Na+ activation and inactivation , and have a voltage dependence that is consistent with the empirically determined Hodgkin-Huxley expressions, and exhibit saturation for both depolarized and hyperpolarized clamp potentials .
Edit intent: coherence
Original: We live in a "global village " where electronic communication has eliminated the geographical barriers of information exchange.
Revised: We live in a global village where electronic communication has eliminated the geographical barriers of information exchange.
Edit intent: fluency
Original:  With global information exchange, the road is open to worldwide convergence of opinions and interests.
Revised:  The road is now open to worldwide convergence of opinions and interests.
Edit intent: clarity
Original:  Later, numerous new giant viruses were found in oceans and freshwater reservoirs , some of them having even 2,500 genes.
Revised:  Later, numerous new giant viruses were found in oceans and freshwater habitats , some of them having even 2,500 genes.
Edit intent: clarity
Original:  scales in both time and space with the entropy of that underlying database---to perform similarity search, a fundamental operation in datascience . Using these ideas, we present accelerated versions of standard tools for use by practitioners in the three domains of high-throughput drug screening, metagenomics, and protein structure search, none of which have any loss in specificity or significant loss in sensitivity :
Revised:  scales in both time and space with the entropy of that underlying database---to perform similarity search, a fundamental operation in datascience . Using these ideas, we present accelerated versions of standard tools , with no loss in specificity or significant loss in sensitivity :
Edit intent: clarity
Original:  scales in both time and space with the entropy of that underlying database---to perform similarity search, a fundamental operation in datascience . Using these ideas, we present accelerated versions of standard tools for use by practitioners in the three domains of high-throughput drug screening, metagenomics, and protein structure search, none of which have any loss in specificity or significant loss in sensitivity :
Revised:  scales in both time and space with the entropy of that underlying database---to perform similarity search, a fundamental operation in datascience . Using these ideas, we present accelerated versions of standard tools for use by practitioners in the three domains of high-throughput drug screening, metagenomics, and protein structure search, none of which have any loss in specificity and little loss in sensitivity :
Edit intent: clarity
Original:  We propose an approach , Register Sharing, that utilizes the wasted registers in SMs to launch more thread blocks and hence increases the number of resident threads .
Revised:  We propose an approach that shares the resources of SM to utilize the wasted resources by launching more thread blocks and hence increases the number of resident threads .
Edit intent: clarity
Original:  We further propose three optimizations that make effective use of these extra thread blocks to hide long execution latencies and hence reduce the number of stall cycles.
Revised:  We further propose optimizations to hide long execution latencies and hence reduce the number of stall cycles.
Edit intent: clarity
Original:  We further propose three optimizations that make effective use of these extra thread blocks to hide long execution latencies and hence reduce the number of stall cycles.
Revised:  We further propose three optimizations that make effective use of these extra thread blocks to hide long execution latencies , thus reducing the number of stall cycles.
Edit intent: clarity
Original:  We experimentally validated our approach using GPGPU-Sim simulator  on several applications from 3 different benchmark suites: GPGPU-Sim, Rodinia,  and Parboil.
Revised:  We implemented our approach in GPGPU-Sim simulator on several applications from 3 different benchmark suites: GPGPU-Sim, Rodinia, and Parboil.
Edit intent: clarity
Original:  We observed a maximum improvement of 24\% and an average improvement of 11\% with a very small hardware overhead .
Revised:  We observed that with register sharing, applications show maximum improvement of 24\% and an average improvement of 11\% with a very small hardware overhead .
Edit intent: clarity
Original:  We observed a maximum improvement of 24\% and an average improvement of 11\% with a very small hardware overhead .
Revised:  We observed a maximum improvement of 24\% , and average improvement of 11\% with a very small hardware overhead .
Edit intent: fluency
Original:  The asymmetry of the underlying game leads to fixation probabilities that are derived from frequency-independent selection, in contrast to the analagous single-population symmetric-game case (Fudenberg and Imhof , 2006).
Revised:  The asymmetry of the underlying game leads to fixation probabilities that are derived from frequency-independent selection, in contrast to the analogous single-population symmetric-game case (Fudenberg and Imhof , 2006).
Edit intent: fluency
Original:  The asymmetry of the underlying game leads to fixation probabilities that are derived from frequency-independent selection, in contrast to the analagous single-population symmetric-game case (Fudenberg and Imhof , 2006).
Revised:  The asymmetry of the underlying game leads to fixation probabilities that are derived from frequency-independent selection, in contrast to the analagous single-population symmetric-game case (Fudenberg and Imhof 2006).
Edit intent: fluency
Original:  This frequency-independence is useful in that it allows us to employ results from the population genetics literature to calculate the stationary distribution of the evolutionary process, giving sharper, and sometimes even analytic, results.
Revised:  This frequency independence is useful in that it allows us to employ results from the population genetics literature to calculate the stationary distribution of the evolutionary process, giving sharper, and sometimes even analytic, results.
Edit intent: clarity
Original: This paper presents a clarification of the relationship between a real-time pricing (RTP) algorithm, which we derived on the basis of a dual decomposition framework, and a linear function submission-based double auction (LFS-DA) algorithm for regional smart grids.
Revised: A linear function submission-based double auction (LFS-DA) algorithm for regional smart grids.
Edit intent: coherence
Original: This paper presents a clarification of the relationship between a real-time pricing (RTP) algorithm, which we derived on the basis of a dual decomposition framework, and a linear function submission-based double auction (LFS-DA) algorithm for regional smart grids.
Revised: This paper presents a clarification of the relationship between a real-time pricing (RTP) algorithm, which we derived on the basis of a dual decomposition framework, and a linear function submission-based double-auction (LFS-DA) algorithm for regional smart grids.
Edit intent: fluency
Original:  The double auction technique involves the use of linear demand and supply functions by multi-agents when they submit bids and asks to an auctioneer in a regional electricity market.
Revised:  The double auction technique involves the use of linear demand and supply functions when they submit bids and asks to an auctioneer in a regional electricity market.
Edit intent: clarity