wanyu/IteraTeR_v2 huggingface dataset:
Original:  We also examine global and local complex networks indexes , in particular, correlation plots between the recently introduced Lobby (or Hirsh H(1)) index and Degree, Betweenness and Closeness centralities.
Revised:  We also analyze local and global complex networks measures , in particular, correlation plots between the recently introduced Lobby (or Hirsh H(1)) index and Degree, Betweenness and Closeness centralities.
Edit intent: clarity
Original: We devise  dynamic algorithms for the following (weak ) visibility polygon computation problems: * Maintaining visibility polygon of a fixed point located interior to  simple polygon amid vertex insertions and deletions to  simple polygon.
Revised: We devise the following dynamic algorithms for the following (weak ) visibility polygon computation problems: * Maintaining visibility polygon of a fixed point located interior to simple polygon amid vertex insertions and deletions to simple polygon.
Edit intent: fluency
Original: We devise  dynamic algorithms for the following (weak ) visibility polygon computation problems: * Maintaining visibility polygon of a fixed point located interior to  simple polygon amid vertex insertions and deletions to  simple polygon.
Revised: We devise dynamic algorithms for the following (weak ) visibility polygon computation problems: * Maintaining visibility polygon of a fixed point located interior to the simple polygon amid vertex insertions and deletions to simple polygon.
Edit intent: fluency
Original: We devise  dynamic algorithms for the following (weak ) visibility polygon computation problems: * Maintaining visibility polygon of a fixed point located interior to  simple polygon amid vertex insertions and deletions to  simple polygon.
Revised: We devise dynamic algorithms for the following (weak ) visibility polygon computation problems: * Maintaining visibility polygon of a fixed point located interior to simple polygon amid vertex insertions and deletions to the simple polygon.
Edit intent: fluency
Original:   * Answering visibility polygon query corresponding to any point located exterior to simple polygon amid vertex insertions and deletions to  simple polygon.
Revised:  * Answering visibility polygon query corresponding to any point located exterior to simple polygon amid vertex insertions and deletions to the simple polygon.
Edit intent: fluency
Original:  If p is not exterior to the current simple polygon  then the visibility polygon of p is computed.
Revised:  If p is not exterior to the current simple polygon , then the visibility polygon of p is computed.
Edit intent: fluency
Original:  Each of these algorithms require preprocessing the initial simple polygon .
Revised:  Each of these algorithms requires preprocessing the initial simple polygon .
Edit intent: fluency
Original: A word w isextending a subset of states S of a deterministic finite automaton , if the set of states mapped to S by w (the preimage of S under the action of w ) is larger than S.
Revised: extending a subset of states S of a deterministic finite automaton , if the set of states mapped to S by w (the preimage of S under the action of w ) is larger than S.
Edit intent: clarity
Original: A word w isextending a subset of states S of a deterministic finite automaton , if the set of states mapped to S by w (the preimage of S under the action of w ) is larger than S.
Revised: A word w isGiven a subset of states S of a deterministic finite automaton , if the set of states mapped to S by w (the preimage of S under the action of w ) is larger than S.
Edit intent: fluency
Original: A word w isextending a subset of states S of a deterministic finite automaton , if the set of states mapped to S by w (the preimage of S under the action of w ) is larger than S.
Revised: A word w isextending a subset of states S of a deterministic finite automaton and a word w, the preimage is the subset of all states that are mapped to a state from S by the action of w ) is larger than S.
Edit intent: clarity
Original:  We study  computational complexity of three problems related to the existence of words yielding certain preimages, which are especially motivated by the theory of synchronizing automata.
Revised:  We study the computational complexity of three problems related to the existence of words yielding certain preimages, which are especially motivated by the theory of synchronizing automata.
Edit intent: fluency
Original:  The third problem problem is whether there exists a word resizing the subset (giving a preimage of a different size).
Revised:  The third problem is whether there exists a word resizing the subset (giving a preimage of a different size).
Edit intent: fluency
Original:  Since usually our problems are computationally hard, we additionally consider parametrized complexity by the size of the given subset.
Revised:  Because in most cases our problems are computationally hard, we additionally consider parametrized complexity by the size of the given subset.
Edit intent: clarity
Original: Given a subset of states S of a deterministic finite automaton and a word w, the preimage is the subset of all states that are mapped to a state from S by the action of w.
Revised: Given a subset of states S of a deterministic finite automaton and a word w, the preimage is the subset of all states mapped to a state from S by the action of w.
Edit intent: clarity
Original: Given a subset of states S of a deterministic finite automaton and a word w, the preimage is the subset of all states that are mapped to a state from S by the action of w.
Revised: Given a subset of states S of a deterministic finite automaton and a word w, the preimage is the subset of all states that are mapped to a state in S by the action of w.
Edit intent: clarity
Original:  We study the computational complexity of three problems related to the existence of words yielding certain preimages, which are especially motivated by the theory of synchronizing automata .
Revised:  We study three natural problems concerning words giving certain preimages .
Edit intent: clarity
Original:  The first problem is whether, for a given subset, there exists a word extending the subset (giving a larger preimage).
Revised:  The first problem is whether, for a given subset, there exists a word extending the subset (giving a larger preimage).
Edit intent: fluency
Original:  The second problem is whether there exists a word totally extending the subset  (giving the whole set of states ) -- it is equivalent to the problem whether there exists an avoiding word for the complementary subset.
Revised:  The second problem is whether there exists a totally extending (giving the whole set of states ) -- it is equivalent to the problem whether there exists an avoiding word for the complementary subset.
Edit intent: fluency
Original:  The second problem is whether there exists a word totally extending the subset  (giving the whole set of states ) -- it is equivalent to the problem whether there exists an avoiding word for the complementary subset.
Revised:  The second problem is whether there exists a word totally extending the subset (giving the whole set of states ) -- it is equivalent to the problem whether there exists an avoiding word for the complementary subset.
Edit intent: fluency
Original:  The third problem is whether there exists a word resizing the subset (giving a preimage of a different size)  .
Revised:  The third problem is whether there exists a resizing .
Edit intent: coherence
Original:  We also consider the variants of the problem where an upper bound on the length of the word is given in the input.
Revised:  We also consider variants where the length of the word is given in the input.
Edit intent: clarity
Original:  For the case that k is not bounded by a constant, we present a new hardness proof, establishing that the problem is strongly NP-hard, even when only two different capacity values occur and the number of paths is polynomial in the size of the input.  }
Revised:  For the case that k is not bounded by a constant, we present a new hardness proof, establishing that the problem is strongly NP-hard, even when only two different capacity values occur and the number of paths is polynomial in the size of the input. }.
Edit intent: fluency
Original: We consider relative error low rank approximation of %DIFDELCMD < {\it %%% tensors with respect to the Frobenius norm: given an order-q tensor A \in R^{i=1^q n_i}, output a rank-k tensor B for which \|A-B\|_F^2 \leq (1+\epsilon)OPT, where OPT = \textrm{rank-k~A'} \|A-A'\|_F^2.
Revised: We consider relative error low rank approximation of %DIFDELCMD < {\it %%% tensors with respect to the Frobenius norm: given an order-q tensor A \in R^{i=1^q n_i}, output a rank-k tensor B for which \|A-B\|_F^2 \leq (1+\epsilon)OPT, where OPT = \textrm{rank-k~A'} \|A-A'\|_F^2.
Edit intent: fluency
Original:  i.e., ne can reconstruct the inputs from the outputs.
Revised:  i.e., one can reconstruct the inputs from the outputs.
Edit intent: clarity
Original:  In this paper  we study reverse engineering of reversible logic circuits, including reverse engineering of non-reversible functions embedded into reversible circuits.
Revised:  In this paper , we study reverse engineering of reversible logic circuits, including reverse engineering of non-reversible functions embedded into reversible circuits.
Edit intent: fluency
Original:  We propose quantitative parameters to characterise a life trajectory, and analyse a large-scale data set of nearly 7 , 000 songs from Gaon Chart, a major weekly Korean Pop (K-Pop) chart that cover a span of six years.
Revised:  We propose quantitative parameters to characterise a life trajectory, and analyse a large-scale data set of nearly 7 \, 000 songs from Gaon Chart, a major weekly Korean Pop (K-Pop) chart that cover a span of six years.
Edit intent: fluency
Original:  We find that a significant role is played by non-musical extrinsic factors such as the  might of production companies and possibly established fan base in the on-chart success of songs, strongly indicative of the commodified nature of modern cultural products.
Revised:  We find that a significant role is played by non-musical extrinsic factors such as the might of production companies in the on-chart success of songs, strongly indicative of the commodified nature of modern cultural products.
Edit intent: clarity
Original: Recent advances of next generation sequencing technologies have facilitated  deoxyribonucleic acid (DNA) to be used as a novel covert channel in steganography.
Revised: Recent advances in next-generation sequencing technologies have facilitated deoxyribonucleic acid (DNA) to be used as a novel covert channel in steganography.
Edit intent: clarity
Original: Recent advances of next generation sequencing technologies have facilitated  deoxyribonucleic acid (DNA) to be used as a novel covert channel in steganography.
Revised: Recent advances of next generation sequencing technologies have facilitated the use of deoxyribonucleic acid (DNA) to be used as a novel covert channel in steganography.
Edit intent: fluency
Original: Recent advances of next generation sequencing technologies have facilitated  deoxyribonucleic acid (DNA) to be used as a novel covert channel in steganography.
Revised: Recent advances of next generation sequencing technologies have facilitated deoxyribonucleic acid (DNA) as a novel covert channel in steganography.
Edit intent: clarity
Original: Recent advances of next generation sequencing technologies have facilitated  deoxyribonucleic acid (DNA) to be used as a novel covert channel in steganography.
Revised: Recent advances of next generation sequencing technologies have facilitated deoxyribonucleic acid (DNA) to be used as a novel covert channels in steganography.
Edit intent: fluency
Original:  There exist various methods in other domains to detect hidden messages in conventional covert channels , however, they have not been applied to DNA steganography.
Revised:  There are various methods that exist in other domains to detect hidden messages in conventional covert channels , however, they have not been applied to DNA steganography.
Edit intent: coherence
Original:  There exist various methods in other domains to detect hidden messages in conventional covert channels , however, they have not been applied to DNA steganography.
Revised:  There exist various methods in other domains to detect hidden messages in conventional covert channels . However, they have not been applied to DNA steganography.
Edit intent: fluency
Original:  The current most common detection schemes, frequency analysis-based methods, often miss the important signals when directly applied to DNA steganography since the methods depend on the distribution of the number of sequence characters.
Revised:  The current most common detection approaches, namely frequency analysis-based methods, often miss the important signals when directly applied to DNA steganography since the methods depend on the distribution of the number of sequence characters.
Edit intent: clarity
Original:  The current most common detection schemes, frequency analysis-based methods, often miss the important signals when directly applied to DNA steganography since the methods depend on the distribution of the number of sequence characters.
Revised:  The current most common detection schemes, frequency analysis-based methods, often overlook important signals when directly applied to DNA steganography since the methods depend on the distribution of the number of sequence characters.
Edit intent: clarity
Original:  The current most common detection schemes, frequency analysis-based methods, often miss the important signals when directly applied to DNA steganography since the methods depend on the distribution of the number of sequence characters.
Revised:  The current most common detection schemes, frequency analysis-based methods, often miss the important signals when directly applied to DNA steganography because those methods depend on the distribution of the number of sequence characters.
Edit intent: clarity
Original:  To address the existing limitation, we propose a general sequence learning-based DNA steganalysis framework.
Revised:  To address this limitation, we propose a general sequence learning-based DNA steganalysis framework.
Edit intent: clarity
Original:  Our approach learns intrinsic distribution of coding and non-coding sequences and detects hidden messages by exploiting distribution variations after hiding  messages.
Revised:  Our approach learns intrinsic distribution of coding and non-coding sequences and detects hidden messages by exploiting distribution variations after hiding these messages.
Edit intent: clarity
Original:  Using deep recurrent neural networks (RNNs), our framework identifies the distribution variations by using the classification score  whether a sequence is to be a coding or non-coding sequence.
Revised:  Using deep recurrent neural networks (RNNs), our framework identifies the distribution variations by using the classification score to predict whether a sequence is to be a coding or non-coding sequence.
Edit intent: clarity
Original:  We compared our method to various existing methods and biological sequence analysis methods implemented on top of our framework.
Revised:  We compare our proposed method to various existing methods and biological sequence analysis methods implemented on top of our framework.
Edit intent: clarity
Original:  According to our experimental results, our approach delivers a robust detection performance regardless of sequence lengths .
Revised:  According to our experimental results, our approach delivers a robust detection performance compared to other tools .
Edit intent: clarity
Original:  Could we delegate universal quantum computations to this server, using only classical communication between client and server, in a way that is information-theoretically blind (i.e., the server learns nothing about the input  apart from its size , with no cryptographic assumptions required)?
Revised:  Could we delegate universal quantum computations to this server, using only classical communication between client and server, in a way that is information-theoretically blind (i.e., the server learns nothing about the input to the computation apart from its size , with no cryptographic assumptions required)?
Edit intent: clarity
Original:  We give a complexity theoretic upper bound , namely%DIFDELCMD < {\sf %%% QCMA/qpoly \cap%DIFDELCMD < {\sf %%% coQCMA/qpoly , on the types of functions that admit such a scheme.
Revised:  We give a complexity theoretic upper bound , namely%DIFDELCMD < {\sf %%% \cap%DIFDELCMD < {\sf %%% coQCMA/qpoly , on the types of functions that admit such a scheme.
Edit intent: fluency
Original:  We give a complexity theoretic upper bound , namely%DIFDELCMD < {\sf %%% QCMA/qpoly \cap%DIFDELCMD < {\sf %%% coQCMA/qpoly , on the types of functions that admit such a scheme.
Revised:  We give a complexity theoretic upper bound , namely%DIFDELCMD < {\sf %%% QCMA/qpoly %DIFDELCMD < {\sf %%% coQCMA/qpoly , on the types of functions that admit such a scheme.
Edit intent: coherence
Original:  We give a complexity theoretic upper bound , namely%DIFDELCMD < {\sf %%% QCMA/qpoly \cap%DIFDELCMD < {\sf %%% coQCMA/qpoly , on the types of functions that admit such a scheme.
Revised:  We give a complexity theoretic upper bound , namely%DIFDELCMD < {\sf %%% QCMA/qpoly \cap%DIFDELCMD < {\sf %%% , on the types of functions that admit such a scheme.
Edit intent: fluency
Original:  This upper bound then lets us show that , under plausible complexity assumptions, such a protocol is no more useful than classical schemes for delegating%DIFDELCMD < {\sf %%% NP -hard problems to the server.
Revised:  This upper bound then lets us show that , under plausible complexity assumptions, such a protocol %DIFDELCMD < {\sf %%% NP -hard problems to the server.
Edit intent: clarity
Original: The widespread use of multisensor technology and the emergence of big data sets have created the necessity to develop more versatile tools to represent large and multimodal data such as higher-order tensors.
Revised: The widespread use of multisensor technology and the emergence of big datasets have created the necessity to develop more versatile tools to represent large and multimodal data such as higher-order tensors.
Edit intent: clarity
Original: The widespread use of multisensor technology and the emergence of big data sets have created the necessity to develop more versatile tools to represent large and multimodal data such as higher-order tensors.
Revised: The widespread use of multisensor technology and the emergence of big data sets have created the need to develop tools to reduce, approximate, and classify large and multimodal data such as higher-order tensors.
Edit intent: clarity
Original:  Tensor decomposition based methods have been shown to be flexible in the choice of the constraints and to extract more general latent components in such datacompared to matrix-based methods .
Revised:  While early approaches focused on matrix and vector based methods to represent these higher-order data, more recently it has been shown that tensor decomposition methods are better equipped to capture couplings across their different modes .
Edit intent: coherence
Original:  For these reasons, tensor decompositions have found applications in many different signal processing problems including dimensionality reduction, signal separation, linear regression, feature extraction, and classification.
Revised:  For these reasons, tensor decomposition methods have found applications in many different signal processing problems including dimensionality reduction, signal separation, linear regression, feature extraction, and classification.
Edit intent: clarity
Original:  However, most of the existing tensor decomposition methods are founded on the principle of finding a low-rank approximation in a linear subspace structure, where the definition of the rank may change depending on the particular decomposition.
Revised:  However, most of the existing tensor decomposition methods are based on the principle of finding a low-rank approximation in a linear subspace structure, where the definition of the rank may change depending on the particular decomposition.
Edit intent: coherence
Original:  Since most data are not necessarily low-rank in a linear subspace, this often results in high approximation errors or low compression rates.
Revised:  Since many datasets are not necessarily low-rank in a linear subspace, this often results in high approximation errors or low compression rates.
Edit intent: clarity
Original:  In particular, we develop a multi-scale higher-order singular value decomposition (MS-HoSVD) approach where a given tensor is first permuted and then partitioned into several sub-tensors each of which can be represented as a low-rank tensor increasing the efficiencyof the representation .
Revised:  In particular, we develop a multi-scale higher-order singular value decomposition (MS-HoSVD) approach where a given tensor is first permuted and then partitioned into several sub-tensors each of which can be represented as a low-rank tensor with increased representational efficiency .
Edit intent: clarity
Original:  The proposed approach is evaluated for two different signal processing applications: dimensionality reduction and classification  .
Revised:  The proposed approach is evaluated for dimensionality reduction and classification .
Edit intent: clarity
Original:  Meanwhile, we also show how an algorithm  can be adapted and implemented with AVX-512 . We report a performance study on the Intel KNL where our approach is faster than the GNU C++ sort algorithm for any size in both integer and double floating-point arithmetics by a  factor of 4 in average .
Revised:  Meanwhile, we also show how an algorithm can be adapted and enhanced by the AVX-512 . We report a performance study on the Intel KNL where our approach is faster than the GNU C++ sort algorithm for any size in both integer and double floating-point arithmetics by a factor of 4 in average .
Edit intent: clarity
Original:  Meanwhile, we also show how an algorithm  can be adapted and implemented with AVX-512 . We report a performance study on the Intel KNL where our approach is faster than the GNU C++ sort algorithm for any size in both integer and double floating-point arithmetics by a  factor of 4 in average .
Revised:  Meanwhile, we also show how an algorithm can be adapted and implemented with AVX-512 . We report a performance study on the Intel KNL where our approach is faster than the GNU C++ sort algorithm for any size in both integer and double floating-point arithmetics by a sort algorithm by a speedup factor of 4 in average .
Edit intent: clarity
Original: A new statistical physics model is introduced for describing the interaction of bacteria with anti-microbial drugs (AMDs) which we show can reproduce qualitative features of the emergence of single and double anti-microbial resistance (AMR) through natural selection.
Revised: This work introduces a new statistical physics model is introduced for describing the interaction of bacteria with anti-microbial drugs (AMDs) which we show can reproduce qualitative features of the emergence of single and double anti-microbial resistance (AMR) through natural selection.
Edit intent: clarity
Original: A new statistical physics model is introduced for describing the interaction of bacteria with anti-microbial drugs (AMDs) which we show can reproduce qualitative features of the emergence of single and double anti-microbial resistance (AMR) through natural selection.
Revised: A new statistical physics lattice model of bacteria interacting with anti-microbial drugs (AMDs) which we show can reproduce qualitative features of the emergence of single and double anti-microbial resistance (AMR) through natural selection.
Edit intent: clarity