wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our extensive simulation results on both synthetic and real-world networks, such as Epinions and Slashdot, confirm our theoretical analysis on  diffusion dynamics, and demonstrate the efficacy  our influence maximization algorithm over other heuristic algorithms . Moreover, our identification of the class of anti-balanced graphs is new and could be of independent interest to social network analysis .
Revised:  Extensive simulation results on both synthetic and real-world networks, such as Epinions and Slashdot, confirm our theoretical analysis on diffusion dynamics, and demonstrate the efficacy our influence maximization algorithm over other heuristic algorithms . Moreover, our identification of the class of anti-balanced graphs is new and could be of independent interest to social network analysis .
Edit intent: fluency
Original:  Our extensive simulation results on both synthetic and real-world networks, such as Epinions and Slashdot, confirm our theoretical analysis on  diffusion dynamics, and demonstrate the efficacy  our influence maximization algorithm over other heuristic algorithms . Moreover, our identification of the class of anti-balanced graphs is new and could be of independent interest to social network analysis .
Revised:  Our extensive simulation results on both synthetic and real-world networks, such as Epinions and Slashdot, confirm our theoretical analysis on influence diffusion dynamics, and demonstrate the efficacy our influence maximization algorithm over other heuristic algorithms . Moreover, our identification of the class of anti-balanced graphs is new and could be of independent interest to social network analysis .
Edit intent: fluency
Original:  Our extensive simulation results on both synthetic and real-world networks, such as Epinions and Slashdot, confirm our theoretical analysis on  diffusion dynamics, and demonstrate the efficacy  our influence maximization algorithm over other heuristic algorithms . Moreover, our identification of the class of anti-balanced graphs is new and could be of independent interest to social network analysis .
Revised:  Our extensive simulation results on both synthetic and real-world networks, such as Epinions and Slashdot, confirm our theoretical analysis on diffusion dynamics, and demonstrate the efficacy of our influence maximization algorithm over other heuristic algorithms . Moreover, our identification of the class of anti-balanced graphs is new and could be of independent interest to social network analysis .
Edit intent: fluency
Original:  Our extensive simulation results on both synthetic and real-world networks, such as Epinions and Slashdot, confirm our theoretical analysis on  diffusion dynamics, and demonstrate the efficacy  our influence maximization algorithm over other heuristic algorithms . Moreover, our identification of the class of anti-balanced graphs is new and could be of independent interest to social network analysis .
Revised:  Our extensive simulation results on both synthetic and real-world networks, such as Epinions and Slashdot, confirm our theoretical analysis on diffusion dynamics, and demonstrate the efficacy our influence maximization algorithm over other heuristic algorithms .
Edit intent: coherence
Original: Self-Organization properties of the nodes play an important role in an autonomous wireless sensor environment in achieving network wide characteristics.
Revised: It is highly desirable and challenging for a wireless ad hoc network to have self-organization properties in order to achieve network wide characteristics.
Edit intent: clarity
Original:  To succeed in our goal, our algorithm first identifies logical regions using Lateral Inhibition technique, then identifies  nodes that beamform and  the beam properties using Flocking analogy.
Revised:  To succeed in our goal, our algorithm first identifies logical regions using Lateral Inhibition technique, then identifies the nodes that beamform and the beam properties using Flocking analogy.
Edit intent: fluency
Original:  To succeed in our goal, our algorithm first identifies logical regions using Lateral Inhibition technique, then identifies  nodes that beamform and  the beam properties using Flocking analogy.
Revised:  To succeed in our goal, our algorithm first identifies logical regions using Lateral Inhibition technique, then identifies nodes that beamform and finally the beam properties using Flocking analogy.
Edit intent: coherence
Original:  From the results, we also show the effect  on average path length, network topology and connectivityfor varying region size created using Lateral Inhibition .
Revised:  From the results, we also show the effect on average path length, clustering coefficient and connectivity .
Edit intent: clarity
Original: In a group testing scheme  a set of tests is designed to identify a small number t of defective items among a large set (of size N) of items.
Revised: In a group testing a set of tests is designed to identify a small number t of defective items among a large set (of size N) of items.
Edit intent: clarity
Original: In a group testing scheme  a set of tests is designed to identify a small number t of defective items among a large set (of size N) of items.
Revised: In a group testing scheme scheme, a set of tests is designed to identify a small number t of defective items among a large set (of size N) of items.
Edit intent: fluency
Original:  In this setting  designing a testing scheme is equivalent to the construction of a disjunct matrix , an M x N matrix where the union of supports of any t columns does not contain the support of any other column.
Revised:  In this setting , designing a testing scheme is equivalent to the construction of a disjunct matrix , an M x N matrix where the union of supports of any t columns does not contain the support of any other column.
Edit intent: fluency
Original:  In this setting  designing a testing scheme is equivalent to the construction of a disjunct matrix , an M x N matrix where the union of supports of any t columns does not contain the support of any other column.
Revised:  In this setting designing a testing scheme is equivalent to the construction of a disjunct matrix , an M x N matrix where the union of supports of any t columns does not contain the support of any other column.
Edit intent: fluency
Original:   \emph{  In this paper we relax the definition of disjunct matrix.
Revised:  and their\emph{ In this paper we relax the definition of disjunct matrix.
Edit intent: fluency
Original:   \emph{  In this paper we relax the definition of disjunct matrix.
Revised:  \emph{ . In this paper we relax the definition of disjunct matrix.
Edit intent: fluency
Original:  We introduce a new reduction method that produces strongly restricted instances of the Shortest Superstring problem, in which the maximal orbit size is eight (with no character appearing more than eight times) and all given strings having length at most six . Based on this reduction method, we are able to improve the best up to now known approximation lower bound for the Shortest Superstring problem and the Maximal Compression problem by an order of magnitude.
Revised:  We introduce a new reduction method that produces strongly restricted instances of the Shortest Superstring problem, in which the maximal orbit size is six (with no character appearing more than eight times) and all given strings having length at most six . Based on this reduction method, we are able to improve the best up to now known approximation lower bound for the Shortest Superstring problem and the Maximal Compression problem by an order of magnitude.
Edit intent: fluency
Original:  We introduce a new reduction method that produces strongly restricted instances of the Shortest Superstring problem, in which the maximal orbit size is eight (with no character appearing more than eight times) and all given strings having length at most six . Based on this reduction method, we are able to improve the best up to now known approximation lower bound for the Shortest Superstring problem and the Maximal Compression problem by an order of magnitude.
Revised:  We introduce a new reduction method that produces strongly restricted instances of the Shortest Superstring problem, in which the maximal orbit size is eight (with no character appearing more than six times) and all given strings having length at most six . Based on this reduction method, we are able to improve the best up to now known approximation lower bound for the Shortest Superstring problem and the Maximal Compression problem by an order of magnitude.
Edit intent: fluency
Original: Ohba conjectured that every graph G with |V(G)|%DIFDELCMD < \le %%% 2 \chi(G)+1 has its choice number equal its chromatic number.
Revised: %DIFDELCMD < \le %%% 2 \chi(G)+1 has its choice number equal its chromatic number.
Edit intent: coherence
Original:  The on-line choice number of a graph is a variation of the choice number defined through a two person game , and is always at least as large as its choice number . Based on the result that for k%DIFDELCMD < \ge %%% 3, the complete multipartite graph K_{2\star (k-1), 3 on-line k-choosable, the\le  on-line version of Ohba 's conjecture is modified in [P. Huang, T. Wong and X. Zhu, Application of polynomial method to on-line colouring of graphs, European J. Combin., 2011] as follows :
Revised:  The on-line choice number of a graph is a variation of the choice number defined through a two person game . It is at least as large as its choice number . Based on the result that for k%DIFDELCMD < \ge %%% 3, the complete multipartite graph K_{2\star (k-1), 3 on-line k-choosable, the\le on-line version of Ohba 's conjecture is modified in [P. Huang, T. Wong and X. Zhu, Application of polynomial method to on-line colouring of graphs, European J. Combin., 2011] as follows :
Edit intent: coherence
Original:  The on-line choice number of a graph is a variation of the choice number defined through a two person game , and is always at least as large as its choice number . Based on the result that for k%DIFDELCMD < \ge %%% 3, the complete multipartite graph K_{2\star (k-1), 3 on-line k-choosable, the\le  on-line version of Ohba 's conjecture is modified in [P. Huang, T. Wong and X. Zhu, Application of polynomial method to on-line colouring of graphs, European J. Combin., 2011] as follows :
Revised:  The on-line choice number of a graph is a variation of the choice number defined through a two person game , and is always at least as large as %DIFDELCMD < \ge %%% 3, the complete multipartite graph K_{2\star (k-1), 3 on-line k-choosable, the\le on-line version of Ohba 's conjecture is modified in [P. Huang, T. Wong and X. Zhu, Application of polynomial method to on-line colouring of graphs, European J. Combin., 2011] as follows :
Edit intent: clarity
Original:  The on-line choice number of a graph is a variation of the choice number defined through a two person game , and is always at least as large as its choice number . Based on the result that for k%DIFDELCMD < \ge %%% 3, the complete multipartite graph K_{2\star (k-1), 3 on-line k-choosable, the\le  on-line version of Ohba 's conjecture is modified in [P. Huang, T. Wong and X. Zhu, Application of polynomial method to on-line colouring of graphs, European J. Combin., 2011] as follows :
Revised:  The on-line choice number of a graph is a variation of the choice number defined through a two person game , and is always at least as large as its choice number . Based on the result that for k%DIFDELCMD < \ge %%% 3, the complete multipartite graph K_{2\star (k-1), 3 on-line k-choosable, the\le on-line version of Ohba conjecture was proposed in [P. Huang, T. Wong and X. Zhu, Application of polynomial method to on-line colouring of graphs, European J. Combin., 2011] as follows :
Edit intent: clarity
Original:  The on-line choice number of a graph is a variation of the choice number defined through a two person game , and is always at least as large as its choice number . Based on the result that for k%DIFDELCMD < \ge %%% 3, the complete multipartite graph K_{2\star (k-1), 3 on-line k-choosable, the\le  on-line version of Ohba 's conjecture is modified in [P. Huang, T. Wong and X. Zhu, Application of polynomial method to on-line colouring of graphs, European J. Combin., 2011] as follows :
Revised:  The on-line choice number of a graph is a variation of the choice number defined through a two person game , and is always at least as large as its choice number . Based on the result that for k%DIFDELCMD < \ge %%% 3, the complete multipartite graph K_{2\star (k-1), 3 on-line k-choosable, the\le on-line version of Ohba 's conjecture is modified in [P. Huang, T. Wong and X. Zhu, Application of polynomial method to on-line colouring of graphs, European J. Combin., 2011] :
Edit intent: clarity
Original:  In this paper , we prove that for any graph G, there is an integer n such that the join G + K_n of G and K_n has its on-line choice number equal chromatic number.
Revised:  This paper confirms the on-line choice number equal chromatic number.
Edit intent: clarity
Original:  Then we show that the on-line version of Ohba conjecture is true if G has independence number at most 3.
Revised:  Then we show that the on-line version of Ohba conjecture for graphs G with independence number at most 3.
Edit intent: clarity
Original:  Finally , we prove that the\le  on-line choice number of K_{3 \star k choice number of K_{3 \star k .
Revised:  Finally , we prove that the\le on-line choice number of K_{3 \star k .
Edit intent: fluency
Original: Many nations , universities, and regional governments commit resources to promote the dissemination of scientific and technical knowledge.
Revised: Nations , universities, and regional governments commit resources to promote the dissemination of scientific and technical knowledge.
Edit intent: clarity
Original:  The emphasis has been on knowledge-based innovation and the economic function of the university in terms of technology transfer, intellectual property, university-industry-government relations, etc.
Revised:  One focuses on knowledge-based innovation and the economic function of the university in terms of technology transfer, intellectual property, university-industry-government relations, etc.
Edit intent: clarity
Original:  The emphasis has been on knowledge-based innovation and the economic function of the university in terms of technology transfer, intellectual property, university-industry-government relations, etc.
Revised:  The emphasis has been on knowledge-based innovations and the economic function of the university in terms of technology transfer, intellectual property, university-industry-government relations, etc.
Edit intent: fluency
Original:  Faculties other than engineering or applied sciences  may not be able to recognize opportunities in this "linear model" of technology transfer.
Revised:  Faculties other than engineering or applied sciences , however, may not be able to recognize opportunities in this "linear model" of technology transfer.
Edit intent: coherence
Original:  In our opinion, more options for relating demand and supply in terms of innovations can then be explored.
Revised:  We elaborate a non-market perspective on the third mission in terms of innovations can then be explored.
Edit intent: clarity
Original:  In this study, we elaborate on an idea originally developed in the context of the Dutch science shops in the late 1980s: the two Amsterdam universities were questionnaired about keywords and expertise at the level of individual researchers.
Revised:  In this study, we elaborate on an idea originally developed in the context of the Dutch science shops , the university staff was questionnaired about keywords and expertise at the level of individual researchers.
Edit intent: clarity
Original: Though machine learning has been applied to the foreign exchange market for  quiet some time now, and neural networks  have been shown to yield good results, in modern approaches neural network systems are optimized through the traditional methods , and their input signals are vectors containing prices and other indicator elements.
Revised: Though machine learning has been applied to the foreign exchange market for quiet some time now, and neural networks have been shown to yield good results, in most modern approaches the NN systems are optimized through the traditional methods , and their input signals are vectors containing prices and other indicator elements.
Edit intent: clarity
Original: Though machine learning has been applied to the foreign exchange market for  quiet some time now, and neural networks  have been shown to yield good results, in modern approaches neural network systems are optimized through the traditional methods , and their input signals are vectors containing prices and other indicator elements.
Revised: Though machine learning has been applied to the foreign exchange market for quiet some time now, and neural networks have been shown to yield good results, in modern approaches neural network systems are optimized through the traditional methods , and their input signals are price lists, and lists composed of other technical indicator elements.
Edit intent: clarity
Original:  The aim of this paper is twofold , the presentation and testing of the application of topology and weight evolving artificial neural network (TWEANN) systems to automated currency trading, and the use of chart images as input to a geometrical regularity aware indirectly encoded neural network systems   .
Revised:  The aim of this paper is twofold : the presentation and testing of the application of topology and weight evolving artificial neural network (TWEANN) systems to automated currency trading, and the use of chart images as input to a geometrical regularity aware indirectly encoded neural network systems .
Edit intent: fluency
Original:  The aim of this paper is twofold , the presentation and testing of the application of topology and weight evolving artificial neural network (TWEANN) systems to automated currency trading, and the use of chart images as input to a geometrical regularity aware indirectly encoded neural network systems   .
Revised:  The aim of this paper is twofold , the presentation and testing of the application of topology and weight evolving artificial neural network (TWEANN) systems to automated currency trading, and the use of chart images as input to geometrical regularity aware indirectly encoded neural network systems .
Edit intent: fluency
Original:  This paper presents the benchmark results of neural network based automated currency trading systems evolved using TWEANNs, and compares the  generalization capabilities of these direct encoded neural networks which use the standard  price vector inputs, and the indirect (substrate) encoded neural networks which use chart images as input.
Revised:  This paper presents the benchmark results of NN based automated currency trading systems evolved using TWEANNs, and compares the generalization capabilities of these direct encoded neural networks which use the standard price vector inputs, and the indirect (substrate) encoded neural networks which use chart images as input.
Edit intent: clarity
Original:  This paper presents the benchmark results of neural network based automated currency trading systems evolved using TWEANNs, and compares the  generalization capabilities of these direct encoded neural networks which use the standard  price vector inputs, and the indirect (substrate) encoded neural networks which use chart images as input.
Revised:  This paper presents the benchmark results of neural network based automated currency trading systems evolved using TWEANNs, and compares the performance and generalization capabilities of these direct encoded neural networks which use the standard price vector inputs, and the indirect (substrate) encoded neural networks which use chart images as input.
Edit intent: clarity
Original:  This paper presents the benchmark results of neural network based automated currency trading systems evolved using TWEANNs, and compares the  generalization capabilities of these direct encoded neural networks which use the standard  price vector inputs, and the indirect (substrate) encoded neural networks which use chart images as input.
Revised:  This paper presents the benchmark results of neural network based automated currency trading systems evolved using TWEANNs, and compares the generalization capabilities of these direct encoded NNs which use the standard price vector inputs, and the indirect (substrate) encoded neural networks which use chart images as input.
Edit intent: clarity
Original:  This paper presents the benchmark results of neural network based automated currency trading systems evolved using TWEANNs, and compares the  generalization capabilities of these direct encoded neural networks which use the standard  price vector inputs, and the indirect (substrate) encoded neural networks which use chart images as input.
Revised:  This paper presents the benchmark results of neural network based automated currency trading systems evolved using TWEANNs, and compares the generalization capabilities of these direct encoded neural networks which use the standard price vector inputs, and the indirect (substrate) encoded NNs which use charts as input.
Edit intent: clarity
Original:  The TWEANN algorithm used to evolve these currency trading agents is the memetic algorithm based TWEANN  called Deus Ex Neural Network (DXNN) platform.
Revised:  The TWEANN algorithm used to evolve these currency trading agents is the memetic algorithm based TWEANN system called Deus Ex Neural Network (DXNN) platform.
Edit intent: clarity
Original:  We first consider programs which do not have any additional memory.
Revised:  We first consider programs which do not have any memory.
Edit intent: clarity
Original:   Second, we show that allowing programs to use additional memory is also incorporated in our framework.
Revised:  Second, we show that allowing programs to use memory is also incorporated in our framework.
Edit intent: clarity
Original:  We quantify the gains obtained by using additional memory.
Revised:  We quantify the gains obtained by using memory.
Edit intent: clarity
Original:  This leads to shorter programs and allows  to use only binary instructions, which is not sufficient in general when no memory is used.
Revised:  This leads to shorter programs and allows us to use only binary instructions, which is not sufficient in general when no memory is used.
Edit intent: fluency
Original:  We introduce a novel combinatorial framework for procedural programming languages, where programs are only allowed to update one variable at a time.
Revised:  This uses a combinatorial framework for procedural programming languages, where programs are only allowed to update one variable at a time.
Edit intent: clarity
Original:  We prove that any function of all the variables can be computed this way in a number of updateswhich grows linearly with the number of variables.
Revised:  We prove that any function of n variables can be computed this way in a number of updateswhich grows linearly with the number of variables.
Edit intent: clarity
Original:  This shows that the idea of combining variables instead of simply moving them around  not only allows for memoryless programs, but also yields shorter programs.
Revised:  This shows that combining variables, instead of simply moving them around not only allows for memoryless programs, but also yields shorter programs.
Edit intent: clarity
Original:  This shows that the idea of combining variables instead of simply moving them around  not only allows for memoryless programs, but also yields shorter programs.
Revised:  This shows that the idea of combining variables instead of simply moving them around , not only allows for memoryless programs, but also yields shorter programs.
Edit intent: fluency
Original:  We  quantify the gains obtained by using memory .
Revised:  We then quantify the gains obtained by using memory .
Edit intent: coherence