wanyu/IteraTeR_v2 huggingface dataset:
Original:  A simple application of the Central Limit Theorem shows that, the scheme of equidistribution of credit among the co-authors of a paper will give us the most probable value of the I-index (with an associated small standard deviation which decreases with increasing h-index).
Revised:  A simple application of the Central Limit Theorem shows that, the scheme of equidistribution of credit among the coauthors of a paper will give us the most probable value of the I-index (with an associated small standard deviation which decreases with increasing h-index).
Edit intent: fluency
Original:  I show that the total citations (N_c), the h-index and the I-index are three independent parameters (within their bounds), and together they give a comprehensive idea of an author's overall research merit .
Revised:  I show that the total citations (N_c), the h-index and the I-index are three independent parameters (within their bounds), and together they give a comprehensive idea of an author's overall research performance .
Edit intent: clarity
Original: Analysis of criminal networks are inherently difficult because of the nature of the topic.
Revised: Analysis of criminal networks is inherently difficult because of the nature of the topic.
Edit intent: fluency
Original:  Criminal networks are covert and most  information is not publicly available.
Revised:  Criminal networks are covert and most of the information is not publicly available.
Edit intent: clarity
Original:  This leads to small datasets available  analysis.
Revised:  This leads to small datasets available for analysis.
Edit intent: clarity
Original:  The links between entities indicates that there is a connection between these entities such as involving in the same criminal event, having commercial ties, and  memberships in the same criminal organization etc .
Revised:  The links between entities indicates that there is a connection between these entities such as involvement in the same criminal event, having commercial ties, and memberships in the same criminal organization etc .
Edit intent: fluency
Original:  The links between entities indicates that there is a connection between these entities such as involving in the same criminal event, having commercial ties, and  memberships in the same criminal organization etc .
Revised:  The links between entities indicates that there is a connection between these entities such as involving in the same criminal event, having commercial ties, and /or memberships in the same criminal organization etc .
Edit intent: clarity
Original:  The links between entities indicates that there is a connection between these entities such as involving in the same criminal event, having commercial ties, and  memberships in the same criminal organization etc .
Revised:  The links between entities indicates that there is a connection between these entities such as involving in the same criminal event, having commercial ties, and memberships in the same criminal organization .
Edit intent: clarity
Original:  Revealing hidden links introduces new information, e.g. affliation of a suspected individual with a criminal organization, which may not be known with public information.
Revised:  Revealing hidden links introduces new information, e.g. affiliation of a suspected individual with a criminal organization, which may not be known with public information.
Edit intent: fluency
Original:  What will we be able to find if we can run analysis on a large dataset and use link prediction to reveal the implicit connections?
Revised:  What will we be able to find if we can run analysis on a larger dataset and use link prediction to reveal the implicit connections?
Edit intent: fluency
Original:  We plan to answer this question by using a dataset that is an order of magnitude more than  most criminal networks analysis.
Revised:  We plan to answer this question by using a dataset that is an order of magnitude more than what is used in most criminal networks analysis.
Edit intent: clarity
Original:  With a more complete picture of the network, we can potentially use this data to thwart criminal organizations and/or take a pareto approach in targeting key nodes.
Revised:  With a more complete picture of the network, we can potentially use this data to thwart criminal organizations and/or take a Pareto approach in targeting key nodes.
Edit intent: fluency
Original: In the context of fog computing, we consider a simple case when data centers  installed at the edge of the network are backed up by a central (bigger) data center.
Revised: In the context of fog computing, we consider a simple case when data centers are installed at the edge of the network are backed up by a central (bigger) data center.
Edit intent: clarity
Original:  We assume that if a request arrives at an overloaded data center,  it is forwarded to the other data center with a given probability.
Revised:  We assume that if a request arrives at an overloaded data center, then it is forwarded to the other data center with a given probability.
Edit intent: coherence
Original:  We assume that if a request arrives at an overloaded data center,  it is forwarded to the other data center with a given probability.
Revised:  We assume that if a request arrives at an overloaded data center, it is forwarded to a neighboring data center with a given probability.
Edit intent: clarity
Original:  Both data centers are assumed to have a large number of servers (rescaling of the system) and that traffic to one of them is causing saturation so that the other data center may help to cope with this saturation regime by reducing the rejection of requests.
Revised:  Both data centers are assumed to have a large number of servers and that traffic to one of them is causing saturation so that the other data center may help to cope with this saturation regime by reducing the rejection of requests.
Edit intent: clarity
Original:  Both data centers are assumed to have a large number of servers (rescaling of the system) and that traffic to one of them is causing saturation so that the other data center may help to cope with this saturation regime by reducing the rejection of requests.
Revised:  Both data centers are assumed to have a large number of servers (rescaling of the system) and that traffic at some of them is causing saturation so that the other data center may help to cope with this saturation regime by reducing the rejection of requests.
Edit intent: clarity
Original:  Both data centers are assumed to have a large number of servers (rescaling of the system) and that traffic to one of them is causing saturation so that the other data center may help to cope with this saturation regime by reducing the rejection of requests.
Revised:  Both data centers are assumed to have a large number of servers (rescaling of the system) and that traffic to one of them is causing saturation . In this case the other data center may help to cope with this saturation regime by reducing the rejection of requests.
Edit intent: coherence
Original:  Both data centers are assumed to have a large number of servers (rescaling of the system) and that traffic to one of them is causing saturation so that the other data center may help to cope with this saturation regime by reducing the rejection of requests.
Revised:  Both data centers are assumed to have a large number of servers (rescaling of the system) and that traffic to one of them is causing saturation so that the other data centers may help to cope with this saturation regime by reducing the rejection of requests.
Edit intent: fluency
Original:  Both data centers are assumed to have a large number of servers (rescaling of the system) and that traffic to one of them is causing saturation so that the other data center may help to cope with this saturation regime by reducing the rejection of requests.
Revised:  Both data centers are assumed to have a large number of servers (rescaling of the system) and that traffic to one of them is causing saturation so that the other data center may help to cope with this saturation regime by accepting some of the rejected requests.
Edit intent: clarity
Original:  Our aim here is to qualitatively estimate the gain achieved by the collaboration of the two data centers.
Revised:  Our aim is to qualitatively estimate the gain achieved by the collaboration of the two data centers.
Edit intent: coherence
Original:  Our aim here is to qualitatively estimate the gain achieved by the collaboration of the two data centers.
Revised:  Our aim here is to qualitatively estimate the gain achieved via cooperation between neighboring data centers.
Edit intent: clarity
Original: In this paper we propose and study a technique to reduce the number of parameters and computation time in fully-connected layers of neural network using Kronecker product, at a mild cost of the prediction quality.
Revised: In this paper we propose and study a technique to reduce the number of parameters and computation time in fully-connected layers of neural networks using Kronecker product, at a mild cost of the prediction quality.
Edit intent: fluency
Original:  The technique proceeds by replacing Fully-Connected layers with so-called Kronecker Fully-Connected layers, where the weight matrices of the FC layers are approximated by linear combinations of multiple Kronecker product of smaller matrices.
Revised:  The technique proceeds by replacing Fully-Connected layers with so-called Kronecker Fully-Connected layers, where the weight matrices of the FC layers are approximated by linear combinations of multiple Kronecker products of smaller matrices.
Edit intent: clarity
Original:  In particular, given a model trained on SVHN dataset, we can construct a new KFC model with 73\\% reduction in total number of parameters, while the error only rises mildly.
Revised:  In particular, given a model trained on SVHN dataset, we are able to construct a new KFC model with 73\\% reduction in total number of parameters, while the error only rises mildly.
Edit intent: clarity
Original:  If we only compare the KFC layer with its counterpart fully-connected layer, the reduction in  number of parameters is more than 99\\%.
Revised:  If we only compare the KFC layer with its counterpart fully-connected layer, the reduction in the number of parameters is more than 99\\%.
Edit intent: fluency
Original:  If we only compare the KFC layer with its counterpart fully-connected layer, the reduction in  number of parameters is more than 99\\%.
Revised:  If we only compare the KFC layer with its counterpart fully-connected layer, the reduction in number of parameters exceeds 99\\%.
Edit intent: clarity
Original:  Further experiments on MNIST, SVHN and some Chinese Character recognition models also demonstrates effectiveness of our technique.
Revised:  Further experiments on MNIST, SVHN and some Chinese Character recognition models also demonstrate effectiveness of our technique.
Edit intent: fluency
Original:  We demonstrate the applicability of our approach by identifying known historical filtering events as well as events injected synthetically into a dataset , and evaluate the sensitivity of this technique against different classes of censorship events.
Revised:  We demonstrate the effectiveness of this approach against known historical filtering events as well as events injected synthetically into a dataset , and evaluate the sensitivity of this technique against different classes of censorship events.
Edit intent: clarity
Original:  We demonstrate the applicability of our approach by identifying known historical filtering events as well as events injected synthetically into a dataset , and evaluate the sensitivity of this technique against different classes of censorship events.
Revised:  We demonstrate the applicability of our approach by identifying known historical filtering events as well as synthetically injected anomalous events , and evaluate the sensitivity of this technique against different classes of censorship events.
Edit intent: clarity
Original:  Importantly, our results show that usage of circumvention tools, such as those provided by the Tor Project, act not only as direct indicators of network censorship but also as a meaningful proxy variable for related events  such as protests  in which internet use is restricted.
Revised:  Importantly, our results show that usage of circumvention tools, such as the Tor Project, act not only as direct indicators of network censorship but also as a meaningful proxy variable for related events such as protests in which internet use is restricted.
Edit intent: clarity
Original:  Importantly, our results show that usage of circumvention tools, such as those provided by the Tor Project, act not only as direct indicators of network censorship but also as a meaningful proxy variable for related events  such as protests  in which internet use is restricted.
Revised:  Importantly, our results show that usage of circumvention tools, such as those provided by the Tor Project, act not only as direct indicators of network filtering but also as a meaningful proxy variable for related events such as protests in which internet use is restricted.
Edit intent: clarity
Original:  Importantly, our results show that usage of circumvention tools, such as those provided by the Tor Project, act not only as direct indicators of network censorship but also as a meaningful proxy variable for related events  such as protests  in which internet use is restricted.
Revised:  Importantly, our results show that usage of circumvention tools, such as those provided by the Tor Project, act not only as direct indicators of network censorship but also as a meaningful proxy variable for related events , such as protests in which internet use is restricted.
Edit intent: fluency
Original: Motivated by the desire to detect automatically instances of internet filtering and censorship, we propose an approach based on principle component analysis to identify per-country anomalous periods in the usage of censorship circumvention tools , and demonstrate the applicability of this approach with global usage statistics from the Tor Project.
Revised: We develop a means to detect ongoing per-country anomalous periods in the usage of censorship circumvention tools , and demonstrate the applicability of this approach with global usage statistics from the Tor Project.
Edit intent: clarity
Original: This paper addresses the problem of finding a class  representative itemsets up to subitemset isomorphism.
Revised: This paper addresses the problem of finding a class of representative itemsets up to subitemset isomorphism.
Edit intent: fluency
Original:  Although only super-exponential algorithms for solving the problem exist in the literature, the complexity classification of the problem has never been addressed.
Revised:  Although only exponential algorithms for solving the problem exist in the literature, the complexity classification of the problem has never been addressed.
Edit intent: clarity
Original:  We prove that the problem of checking if two itemsets are isomorphic to each other is GI-Complete ;
Revised:  We prove that the problem of checking whether two itemsets are isomorphic to each other is GI-Complete ;
Edit intent: fluency
Original:  the Graph Isomorphism (GI) problem is known to be in NP and LWPP, but widely believed to not be P nor NP-Complete.
Revised:  the Graph Isomorphism (GI) problem is known to be in NP and LWPP, but widely believed to be neither P nor NP-Complete.
Edit intent: fluency
Original:  We show that on an n\times n input PSD matrix M%DIFDELCMD < }%%% , if the initial point is well conditioned, then the algorithm finds an \epsilon-accurate solution in O%DIFDELCMD < \left(%%% \kappa^{3/2 \log \left\|{M\right\|_F}{\epsilon}}%DIFDELCMD < \right)
Revised:  We show that on an n\times n input PSD matrix %DIFDELCMD < }%%% , if the initial point is well conditioned, then the algorithm finds an \epsilon-accurate solution in O%DIFDELCMD < \left(%%% \kappa^{3/2 \log \left\|{M\right\|_F}{\epsilon}}%DIFDELCMD < \right)
Edit intent: clarity
Original:  We show that on an n\times n input PSD matrix M%DIFDELCMD < }%%% , if the initial point is well conditioned, then the algorithm finds an \epsilon-accurate solution in O%DIFDELCMD < \left(%%% \kappa^{3/2 \log \left\|{M\right\|_F}{\epsilon}}%DIFDELCMD < \right)
Revised:  We show that on an n\times n input PSD matrix M%DIFDELCMD < }%%% , if the initial point is well conditioned, then the algorithm finds an \epsilon-accurate %DIFDELCMD < \left(%%% \kappa^{3/2 \log \left\|{M\right\|_F}{\epsilon}}%DIFDELCMD < \right)
Edit intent: clarity
Original:  %%%  iterations, where \kappa is the condition number of M. Each iteration involves three matrix multiplications (and does not use either matrix inversions or solutions of linear system),giving a total run time of O%DIFDELCMD < \left(%%% n^{\omega\kappa^{3/2}\log\left\|{M\right\|_F}{\epsilon}}%DIFDELCMD < \right)%%% , where \omega is the matrix multiplication exponent.
Revised:  %%% iterations, where %DIFDELCMD < \left(%%% n^{\omega\kappa^{3/2}\log\left\|{M\right\|_F}{\epsilon}}%DIFDELCMD < \right)%%% , where \omega is the matrix multiplication exponent.
Edit intent: coherence
Original: During 2008-2015, twenty-two introductory workshops on graph and geometric algorithms were organized for teachers and students (undergraduate, post-graduate and doctoral) of engineering colleges and universities at different states and union territories of Indian .
Revised: During 2008-2015, twenty-two introductory workshops on graph and geometric algorithms were organized for teachers and students (undergraduate, post-graduate and doctoral) of engineering colleges and universities at different states and union territories of India .
Edit intent: fluency
Original: For a graph G, let \mathcal{C number of fixed points in a network f\in \mathcal{C the number of maximal independent sets in H\in\mathcal{H.
Revised: Given a graph G, let \mathcal{C number of fixed points in a network f\in \mathcal{C the number of maximal independent sets in H\in\mathcal{H.
Edit intent: fluency
Original: For a graph G, let \mathcal{C number of fixed points in a network f\in \mathcal{C the number of maximal independent sets in H\in\mathcal{H.
Revised: For a graph G, let \mathcal{C number of fixed points in a network f\in \mathcal{C the number of maximal independent sets in .
Edit intent: coherence
Original:  Thus if G has no induced C_4 then H\in\mathcal{H\mathrm{mis}(H)=\max_{f\in\mathcal{C}}\mathrm{fix}(f)=\mathrm{mis}(G), and this contrasts with following complexity result: It }  is coNP-hard to decide if \max_{f\in\mathcal{C}\mathrm{fix}(f)=\mathrm{mis}(G) or if \max_{H\in\mathcal{H}}\mathrm{mis}(H)=\mathrm{mis}(G)}  , even if G has a unique induced copy of C_4.
Revised:  Thus if G has no induced C_4 then H\in\mathcal{H\mathrm{mis}(H)=\max_{f\in\mathcal{C}}\mathrm{fix}(f)=\mathrm{mis}(G), and this contrasts with following complexity result: It } is coNP-hard to decide if }\mathrm{fix}(f)=\mathrm{mis}(G) or if \max_{H\in\mathcal{H}}\mathrm{mis}(H)=\mathrm{mis}(G)} , even if G has a unique induced copy of C_4.
Edit intent: fluency
Original:  Thus if G has no induced C_4 then H\in\mathcal{H\mathrm{mis}(H)=\max_{f\in\mathcal{C}}\mathrm{fix}(f)=\mathrm{mis}(G), and this contrasts with following complexity result: It }  is coNP-hard to decide if \max_{f\in\mathcal{C}\mathrm{fix}(f)=\mathrm{mis}(G) or if \max_{H\in\mathcal{H}}\mathrm{mis}(H)=\mathrm{mis}(G)}  , even if G has a unique induced copy of C_4.
Revised:  Thus if G has no induced C_4 then H\in\mathcal{H\mathrm{mis}(H)=\max_{f\in\mathcal{C}}\mathrm{fix}(f)=\mathrm{mis}(G), and this contrasts with following complexity result: It } is coNP-hard to decide if \max_{f\in\mathcal{C}\mathrm{fix}(f)=\mathrm{mis}(G) or if \max_{H\in\mathcal{H}}\mathrm{mis}(H)=\mathrm{mis}(G)} , even if G has a unique induced C_4.
Edit intent: clarity
Original:  We also note that among *linear* codes capable of correcting k deletions, the (k+1)-fold repetition code is essentially the best possible.
Edit intent: coherence
Original: Many datasets can be viewed as a noisy sampling of an underlying topological space.
Revised: Many data sets can be viewed as a noisy sampling of an underlying topological space.
Edit intent: clarity
Original:  Topological data analysis aims to understand and exploit this underlying structure for the purpose of knowledge discovery.
Revised:  A suite of tools in topological data analysis allows one to exploit this structure for the purpose of knowledge discovery.
Edit intent: clarity
Original:  A fundamental tool of the discipline is persistent homology , which captures underlying data-driven, scale-dependent homological information.
Revised:  One such tool is persistent homology , which captures underlying data-driven, scale-dependent homological information.
Edit intent: clarity
Original: Many data sets can be viewed as a noisy sampling of an underlying topological space.
Revised: Many datasets can be viewed as a noisy sampling of an underlying topological space.
Edit intent: clarity
Original:  A suite of tools in topological data analysis allows one to exploit this structure for the purpose of knowledge discovery.
Revised:  A suite of tools in topological data analysis can characterize this structure for the purpose of knowledge discovery.
Edit intent: clarity
Original:  One such tool is persistent homology  which provides a multiscale description of the homological features within a data set . A useful representation of this homological information is a persistence diagram (PD).
Revised:  One such tool is persistent homology , which provides a multiscale description of the homological features within a data set . A useful representation of this homological information is a persistence diagram (PD).
Edit intent: fluency
Original:  One such tool is persistent homology  which provides a multiscale description of the homological features within a data set . A useful representation of this homological information is a persistence diagram (PD).
Revised:  One such tool is persistent homology which provides a multiscale description of the homological features within a dataset . A useful representation of this homological information is a persistence diagram (PD).
Edit intent: clarity
Original:  The space of PDs can be given a metric structure allowing a given diagram to be used as a statistic for the purpose of comparison against other diagrams .
Revised:  Efforts have been made to map PDs into spaces with additional structure valuable to machine learning tasks .
Edit intent: clarity
Original:  The PI is a vector representation allowing the application of vector-based machine learning tools, such as linear and sparse support vector machines .
Revised:  The PI is a vector representation allowing the application of vector-based machine learning tools, such as linear sparse support vector machines .
Edit intent: clarity
Original:  To further illustrate the PI technique, linear and sparse support vector machines are implemented on this data set and classification is performed on additional data arising from a discrete dynamical system called the linked twist map  .
Revised:  To further illustrate the PI technique, linear and sparse support vector machines are implemented on this data set and classification is performed on additional data arising from a discrete dynamical system ( the linked twist map .
Edit intent: coherence
Original: Several recent experiments have suggested that sharply bent DNA has a surprisingly high bending flexibility, but the cause  is poorly understood.
Revised: Several recent experiments suggest that sharply bent DNA has a surprisingly high bending flexibility, but the cause is poorly understood.
Edit intent: coherence
Original: Several recent experiments have suggested that sharply bent DNA has a surprisingly high bending flexibility, but the cause  is poorly understood.
Revised: Several recent experiments have suggested that sharply bent DNA has a surprisingly high bending flexibility, but the cause of this flexibility is poorly understood.
Edit intent: clarity
Original:  It has been demonstrated that excitation of flexible defects can explain the results;
Revised:  Although excitation of flexible defects can explain the results;
Edit intent: coherence