wanyu/IteraTeR_v2 huggingface dataset:
Original:  }\det\left( A_{\backslash\left\{ j\right\} }-\lambda _{k}I\right) \] }\left( \right) \left( \right) ^{\prime}}\left( \right) \left( \lambda\right) }{d\lambda} and A_{\backslash\left\{ j\right\} } is obtained from A by removal of row j and column j, suggests us to consider the square eigenvector component as a graph centrality metric for node j that } reflects the impact of the removal of node m from the graph at a different eigenfrequencyof that graph matrix .
Revised:  }\det\left( A_{\backslash\left\{ j\right\} }-\lambda _{k}I\right) \] }\left( \right) \left( \right) ^{\prime}}\left( \lambda\right) \left( \lambda\right) }{d\lambda} and A_{\backslash\left\{ j\right\} } is obtained from A by removal of row j and column j, suggests us to consider the square eigenvector component as a graph centrality metric for node j that } reflects the impact of the removal of node m from the graph at a different eigenfrequencyof that graph matrix .
Edit intent: fluency
Original:  }\det\left( A_{\backslash\left\{ j\right\} }-\lambda _{k}I\right) \] }\left( \right) \left( \right) ^{\prime}}\left( \right) \left( \lambda\right) }{d\lambda} and A_{\backslash\left\{ j\right\} } is obtained from A by removal of row j and column j, suggests us to consider the square eigenvector component as a graph centrality metric for node j that } reflects the impact of the removal of node m from the graph at a different eigenfrequencyof that graph matrix .
Revised:  }\det\left( A_{\backslash\left\{ j\right\} }-\lambda _{k}I\right) \] }\left( \right) \left( \right) ^{\prime}}\left( \right) \left( \lambda\right) }{d\lambda} and A_{\backslash\left\{ j\right\} } is obtained from A by removal of row j and column j, suggests us to consider the square eigenvector component as a graph centrality metric for node j that } reflects the impact of the removal of node j from the graph at a different eigenfrequencyof that graph matrix .
Edit intent: clarity
Original:  In particular, the new expression \[ \left( x_{k}\right)
Revised:  In particular, the expression \[ \left( x_{k}\right)
Edit intent: clarity
Original:  However, in contrast to minimum bandwidth regenerating  codes, where a random set of  certain size of available nodes is used for a node repair, the repairs with FR codes are table based.
Revised:  However, in contrast to minimum bandwidth regenerating codes, where a random set of a certain size of available nodes is used for a node repair, the repairs with FR codes are table based.
Edit intent: fluency
Original:   In this work  we consider bounds on the fractional repetition capacity  .
Revised:  In this work , we consider bounds on the fractional repetition capacity .
Edit intent: fluency
Original:  The constructions of optimal FR codes are based on combinatorial designs and on different families of regular and biregular graphs.
Revised:  The constructions of these FR codes are based on combinatorial designs and on different families of regular and biregular graphs.
Edit intent: clarity
Original:  The constructions of optimal FR codes are based on combinatorial designs and on different families of regular and biregular graphs.
Revised:  The constructions of optimal FR codes are based on combinatorial designs and on families of regular and biregular graphs.
Edit intent: clarity
Original:  Finding optimal codes raises some interesting questions in graph theory.
Revised:  These constructions of FR codes for given parameters raise some interesting questions in graph theory.
Edit intent: clarity
Original:  We discuss these questions and their solutions .
Revised:  These questions and some of their solutions are discussed in this paper .
Edit intent: clarity
Original: We present a faster Monte Carlo algorithm for the interpolation of a straight-line program to find a sparse polynomial f over an arbitrary finite field of size q. We assume a priori bounds D and T are given on the degree and number of terms of f.
Revised: We present a new Monte Carlo algorithm for the interpolation of a straight-line program to find a sparse polynomial f over an arbitrary finite field of size q. We assume a priori bounds D and T are given on the degree and number of terms of f.
Edit intent: clarity
Original: We present a faster Monte Carlo algorithm for the interpolation of a straight-line program to find a sparse polynomial f over an arbitrary finite field of size q. We assume a priori bounds D and T are given on the degree and number of terms of f.
Revised: We present a faster Monte Carlo algorithm for the interpolation of a straight-line program as a sparse polynomial f over an arbitrary finite field of size q. We assume a priori bounds D and T are given on the degree and number of terms of f.
Edit intent: clarity
Original:  By making effective use of the information contained in the coefficients themselves, this new algorithm improves on the bit complexity of previous methods by a "soft-Oh" factor of T, log D, or log q.
Revised:  By making effective use of the information contained in the coefficients themselves, this new algorithm improves on the bit complexity of previous methods by a "soft-Oh" factor of T, \log D, or log q.
Edit intent: fluency
Original: We show that termination of oblivious chase is undecidable.
Revised: We show that all--instances termination of chase is undecidable.
Edit intent: clarity
Original:  Datalog^\exists program), whether the \cal T-oblivious chase on D will terminate for every finite database instance .
Revised:  Datalog^\exists program), whether the \cal T-chase on D will terminate for every finite database instance .
Edit intent: fluency
Original:  The arity we need for the proof is three.
Revised:  The arity we need for our undecidability proof is three.
Edit intent: clarity
Original: Networks are widely used to represent the interaction pattern in complex systems.
Revised: Networks are widely used to represent interaction pattern among the components in complex systems.
Edit intent: clarity
Original:  Structures of real networks from different domain may vary quite significantly , and so the dynamicson the network.
Revised:  Structures of real networks from differ- ent domains may vary quite significantly , and so the dynamicson the network.
Edit intent: fluency
Original:  Which also plays an important role in communication and information spreading on networks .
Revised:  Which also plays an important role in communication and information spreading on a network .
Edit intent: clarity
Original:  Here we have explored underlying structures of different biological networks which support faster spreading  and are better in communication between nodes in them.
Revised:  Here we have explored underlying structures of different biological networks which support faster spreading of information and are better in communication between nodes in them.
Edit intent: clarity
Original:  In this regard, we have analyzed the good expansion property , from large spectral gap , and communicability between nodes in those networks . Different epidemic models are also used to study the same.
Revised:  In this regard, we have analyzed the good expansion property by using the spectral gap and communicability between nodes in those networks . Different epidemic models are also used to study the same.
Edit intent: clarity
Original:  In this regard, we have analyzed the good expansion property , from large spectral gap , and communicability between nodes in those networks . Different epidemic models are also used to study the same.
Revised:  In this regard, we have analyzed the good expansion property , from large spectral gap , and communicability between nodes . Different epidemic models are also used to study the same.
Edit intent: clarity
Original:  Moreover we have explored the structural conformation and properties which might be cause for better communication.
Revised:  Moreover we have explored the structural conformation and properties which may be responsible for better communication.
Edit intent: clarity
Original:  It proved to be an NP-hard problem, which justifies heuristic methods for its resolution  .
Revised:  It proved to be an NP-hard problem, which justifies heuristics methods for its resolution .
Edit intent: fluency
Original: A new projection operator of cylindrical algebraic decomposition (CAD) is proposed.
Revised: A new projection operator based on cylindrical algebraic decomposition (CAD) is proposed.
Edit intent: clarity
Original:  In general, the gcd computation produces smaller projection factor sets and thus fewer open cells.
Revised:  In general, the gcd computation produces smaller projection factor sets and fewer open cells.
Edit intent: clarity
Original:  Some examples that are difficult to be solved by existing tools  have been worked out efficiently by our program based on the new operator .
Revised:  Some examples that are difficult to be solved by existing tools , have been worked out efficiently by our program based on the new operator .
Edit intent: fluency
Original:  Some examples that are difficult to be solved by existing tools  have been worked out efficiently by our program based on the new operator .
Revised:  Some examples that are difficult to be solved by existing tools have been worked out efficiently by our program based on the new method .
Edit intent: clarity
Original: This paper studies the applicability of evolutionary algorithms, particularly, the evolution strategies family to estimation of a degradation parameter  (referred as kappa parameter  ) for the shear design of reinforced concrete beams, a problem which have an expensive computational cost and highly relevant in the design of pillars and reinforced concrete structures, which however, has not been covered extensively in the present literature.
Revised: This paper studies the applicability of evolutionary algorithms, particularly, the evolution strategies family to estimation of a degradation parameter problem (referred as kappa parameter ) for the shear design of reinforced concrete beams, a problem which have an expensive computational cost and highly relevant in the design of pillars and reinforced concrete structures, which however, has not been covered extensively in the present literature.
Edit intent: clarity
Original: This paper studies the applicability of evolutionary algorithms, particularly, the evolution strategies family to estimation of a degradation parameter  (referred as kappa parameter  ) for the shear design of reinforced concrete beams, a problem which have an expensive computational cost and highly relevant in the design of pillars and reinforced concrete structures, which however, has not been covered extensively in the present literature.
Revised: This paper studies the applicability of evolutionary algorithms, particularly, the evolution strategies family to estimation of a degradation parameter (referred as kappa parameter ) for the shear design of reinforced concrete beams, a problem which have an expensive computational cost and highly relevant in the design of pillars and reinforced concrete structures, which however, has not been sufficiently studied in current literature.
Edit intent: clarity
Original: This paper studies the applicability of evolutionary algorithms, particularly, the evolution strategies family to estimation of a degradation parameter problem (referred as kappa parameter estimation) for the shear design of reinforced concrete beams, a problem which have an expensive computational cost and highly relevant in the design of pillars and reinforced concrete structures, which however, has not been sufficiently studied in current literature .
Revised: This paper studies the applicability of evolutionary algorithms, particularly, the evolution strategies family in order to estimate a degradation parameter problem (referred as kappa parameter estimation) for the shear design of reinforced concrete beams, a problem which have an expensive computational cost and highly relevant in the design of pillars and reinforced concrete structures, which however, has not been sufficiently studied in current literature .
Edit intent: coherence
Original: This paper studies the applicability of evolutionary algorithms, particularly, the evolution strategies family to estimation of a degradation parameter problem (referred as kappa parameter estimation) for the shear design of reinforced concrete beams, a problem which have an expensive computational cost and highly relevant in the design of pillars and reinforced concrete structures, which however, has not been sufficiently studied in current literature .
Revised: This paper studies the applicability of evolutionary algorithms, particularly, the evolution strategies family to estimation of a degradation parameter in the shear design of reinforced concrete beams, a problem which have an expensive computational cost and highly relevant in the design of pillars and reinforced concrete structures, which however, has not been sufficiently studied in current literature .
Edit intent: coherence
Original: This paper studies the applicability of evolutionary algorithms, particularly, the evolution strategies family to estimation of a degradation parameter problem (referred as kappa parameter estimation) for the shear design of reinforced concrete beams, a problem which have an expensive computational cost and highly relevant in the design of pillars and reinforced concrete structures, which however, has not been sufficiently studied in current literature .
Revised: This paper studies the applicability of evolutionary algorithms, particularly, the evolution strategies family to estimation of a degradation parameter problem (referred as kappa parameter estimation) for the shear design of reinforced concrete members. This problem represents a great computational task and is highly relevant in the design of pillars and reinforced concrete structures, which however, has not been sufficiently studied in current literature .
Edit intent: clarity
Original:  You are viewing a draft, the authors appreciate corrections, comments and suggestions to this work at josea.garcia.exts@juntadeandalucia.es .
Revised:  You are viewing a draft, the authors appreciate corrections, comments and suggestions to this work .
Edit intent: coherence
Original:  Results: A5-miseq can produce high quality and microbial genome assemblies  on a laptop computer without any parameter tuning.
Revised:  Results: A5-miseq can produce high quality microbial genome assemblies on a laptop computer without any parameter tuning.
Edit intent: clarity
Original: The general stable roommates problem with n agents has time and space complexity O(n^2)  . Random instances can be solved faster and with less memory, however.
Revised: The stable roommates problem with n agents has time and space complexity O(n^2) . Random instances can be solved faster and with less memory, however.
Edit intent: clarity
Original:  More specifically, for arbitrary coprime polynomials f, g \in Z[x,y] and an arbitrary polynomial h \in Z[x,y], each of total degree less than n and with integer coefficients of absolute value less than 2^\tau, we show that each of the following problems can be solved in a deterministic way with a number of bit operations bounded by O(n^6+n^5\tau), where the tilde means that we ignore polylogarithmic factors in n and \tau:
Revised:  More specifically, for arbitrary coprime polynomials f, g \in Z[x,y] and an arbitrary polynomial h \in Z[x,y], each of total degree less than n and with integer coefficients of absolute value less than 2^\tau, we show that each of the following problems can be solved in a deterministic way with a number of bit operations bounded by O(n^6+n^5\tau), where we ignore polylogarithmic factors in n and \tau:
Edit intent: coherence
Original:  We show that an explicit construction of a non-deterministic automaton (NFA) of size f(k)\cdot n^{O(1)} for L_k(n) implies an algorithm of running time O(f(k)\cdot n^{O(1)}\cdot \log W) for MIN-WT SIMPLE k-PATH when the weights are non-negative or the constructed NFA is a acyclic as a directed graph.
Revised:  We show that an explicit construction of a non-deterministic automaton (NFA) of size f(k)\cdot n^{O(1)} for L_k(n) implies an algorithm of running time O(f(k)\cdot n^{O(1)}\cdot \log W) for MIN-WT SIMPLE k-PATH when the weights are non-negative or the constructed NFA is acyclic as a directed graph.
Edit intent: fluency
Original:  We show how such hash-URIs can be used for approaches like nanopublications to make not only specific resources but their entire reference trees verifiable.
Revised:  We call them trusty URIs and we show how they can be used for approaches like nanopublications to make not only specific resources but their entire reference trees verifiable.
Edit intent: clarity
Original: In this paper, we propose an image block loss restoration method based on the notion of sparse representation.
Revised: In this paper, we propose a method for image block loss restoration method based on the notion of sparse representation.
Edit intent: clarity
Original: In this paper, we propose an image block loss restoration method based on the notion of sparse representation.
Revised: In this paper, we propose an image block loss restoration based on the notion of sparse representation.
Edit intent: clarity
Original:  The sparsity pattern is exploited as side information to efficiently restore block losses , by iteratively imposing the constraints of spatial and transform domains on the corrupted image.
Revised:  We use the sparsity pattern as side information to efficiently restore block losses , by iteratively imposing the constraints of spatial and transform domains on the corrupted image.
Edit intent: clarity
Original:  The sparsity pattern is exploited as side information to efficiently restore block losses , by iteratively imposing the constraints of spatial and transform domains on the corrupted image.
Revised:  The sparsity pattern is exploited as side information to efficiently restore block losses by iteratively imposing the constraints of spatial and transform domains on the corrupted image.
Edit intent: fluency
Original:  Mathematical analysis and extensive simulations are performed to evaluate the method and investigate the efficiency of the proposed techniques.
Revised:  Mathematical analysis and extensive simulations are performed to validate the method and investigate the efficiency of the proposed techniques.
Edit intent: clarity
Original:  The results verify that the suggested method outperforms its counterparts for image block loss restoration.
Revised:  The results verify that the proposed method outperforms its counterparts for image block loss restoration.
Edit intent: clarity
Original: We propose a generic dynamic programming algorithm for computing the inverses of a multiplicative function.
Revised: We propose a generic algorithm for computing the inverses of a multiplicative function.
Edit intent: clarity
Original:  Our algorithm relies only upon on the author and citation graphs available for the whole period covered by the WoS.
Revised:  Our algorithm relies only upon the author and citation graphs available for the whole period covered by the WoS.
Edit intent: fluency
Original:  A pair-wise publication similarity metric, which is based on common co-authors, self-citations, shared references and citations, is established to perform a two-step agglomerative clustering that first connects linked papers and then merges similar clusters.
Revised:  A pair-wise publication similarity metric, which is based on common co-authors, self-citations, shared references and citations, is established to perform a two-step agglomerative clustering that first connects individual papers and then merges similar clusters.
Edit intent: clarity
Original:  This parameterized model is optimized towards an h-index based recall , which favors the inclusion of well-cited publications, and a name-initials-based precision using WoS metadata and cross-referenced Google Scholar profiles.
Revised:  This parameterized model is optimized using an h-index based recall , which favors the inclusion of well-cited publications, and a name-initials-based precision using WoS metadata and cross-referenced Google Scholar profiles.
Edit intent: clarity
Original:  This parameterized model is optimized towards an h-index based recall , which favors the inclusion of well-cited publications, and a name-initials-based precision using WoS metadata and cross-referenced Google Scholar profiles.
Revised:  This parameterized model is optimized towards an h-index based recall measure, favoring the correct assignment of well-cited publications, and a name-initials-based precision using WoS metadata and cross-referenced Google Scholar profiles.
Edit intent: clarity
Original:  When investigated in ISSAC '13, TTICAD theory was shown to provide lower cell counts and a decreased computation time than traditional sign-invariant CAD theory.
Edit intent: coherence
Original:  Secondly, the computation uses regular chains theory to  build a cylindrical decomposition of complex space (CCD) incrementally by polynomial , which is then refined to a CAD.
Revised:  Secondly, the computation uses regular chains theory to first build a cylindrical decomposition of complex space (CCD) incrementally by polynomial , which is then refined to a CAD.
Edit intent: coherence
Original: Evolutionary algorithms (EAs), a large class of general purpose optimization algorithms inspired from  natural phenomena, are widely used in various industrial optimizations and often show excellent performance.
Revised: Evolutionary algorithms (EAs), a large class of general purpose optimization algorithms inspired from the natural phenomena, are widely used in various industrial optimizations and often show excellent performance.
Edit intent: fluency
Original:  We summarize a large range of EAs into the sampling-and-learning framework .
Revised:  By summarizing a large range of EAs into the sampling-and-learning framework .
Edit intent: fluency
Original:  We study the framework with the learning subroutine being restricted as binary classifications , which results in the sampling-and-classification (SAC) algorithms.
Revised:  We particularly focus on the framework with the learning subroutine being restricted as binary classifications , which results in the sampling-and-classification (SAC) algorithms.
Edit intent: clarity
Original:  We study the framework with the learning subroutine being restricted as binary classifications , which results in the sampling-and-classification (SAC) algorithms.
Revised:  We study the framework with the learning subroutine being restricted as a binary classification , which results in the sampling-and-classification (SAC) algorithms.
Edit intent: fluency
Original:  With the learning theory results, we give a general upper bound on the PAA query complexity of SAC algorithms.
Revised:  With the help of the learning theory, we obtain a general upper bound on the PAA query complexity of SAC algorithms.
Edit intent: clarity
Original:  but secondly, SAC algorithms can achieve a polynomial reduction of the complexity of the uniform search . Under the error-successive-level independence condition, we show that a super-polynomial reduction of the complexity can be achieved.
Revised:  but secondly, SAC algorithms can achieve polynomial speedup to the uniform search, but not super-polynomial speedup . Under the error-successive-level independence condition, we show that a super-polynomial reduction of the complexity can be achieved.
Edit intent: clarity
Original:  but secondly, SAC algorithms can achieve a polynomial reduction of the complexity of the uniform search . Under the error-successive-level independence condition, we show that a super-polynomial reduction of the complexity can be achieved.
Revised:  but secondly, SAC algorithms can achieve a polynomial reduction of the complexity of the uniform search . Under the error-successive-level independence condition, we show that super-polynomial reduction of the complexity can be achieved.
Edit intent: fluency