wanyu/IteraTeR_v2 huggingface dataset:
Original:  Meta-F* is not a new language: it is embedded into F* simply as a new, custom effect, which readily enables safe interactions between programs and metaprograms on equal footing.
Revised:  Meta-F* is not a new language: it is embedded into F* effect, which readily enables safe interactions between programs and metaprograms on equal footing.
Edit intent: clarity
Original:  The main novelty of Meta-F* is allowing to use tactics and metaprogramming to discharge assertions not solvable by SMT, or to just simplify them into well-behaved SMT fragments.
Revised:  The main novelty of Meta-F* is allowing the use of tactics and metaprogramming to discharge assertions not solvable by SMT, or to just simplify them into well-behaved SMT fragments.
Edit intent: fluency
Original:  Unlike FP-growth, our algorithm is designed to focus on the specific multiple itemsets of interest and hence its time and memory costs are better .
Revised:  The GFP-growth algorithm is designed to focus on the specific multiple itemsets of interest and hence its time and memory costs are better .
Edit intent: clarity
Original:  Unlike FP-growth, our algorithm is designed to focus on the specific multiple itemsets of interest and hence its time and memory costs are better .
Revised:  Unlike FP-growth, our algorithm is designed to focus on the specific multitude itemsets of interest and hence its time and memory costs are better .
Edit intent: fluency
Original:  Unlike FP-growth, our algorithm is designed to focus on the specific multiple itemsets of interest and hence its time and memory costs are better .
Revised:  Unlike FP-growth, our algorithm is designed to focus on the specific multiple itemsets of interest and optimizes the time and memory costs are better .
Edit intent: clarity
Original:  Unlike FP-growth, our algorithm is designed to focus on the specific multiple itemsets of interest and hence its time and memory costs are better .
Revised:  Unlike FP-growth, our algorithm is designed to focus on the specific multiple itemsets of interest and hence its time and memory costs .
Edit intent: clarity
Original:  We show that for a number of different problems, a solution can be devised which takes advantage of the efficient implementation of multi-targeted mining for boosting the performance.
Revised:  We show that for a number of different problems, a solution can be devised which takes advantage of the efficient implementation of multitude-targeted mining for boosting the performance.
Edit intent: fluency
Original:  We prove some theoretical properties of the Minority-Report Algorithm and demonstrate its superior performance using simulations and real data.
Revised:  We prove some theoretical properties of the Minority-Report Algorithm and demonstrate its performance gain using simulations and real data.
Edit intent: clarity
Original:  EnvelopeNets is a construction method that exploits this finding to design convolutional neural nets (CNNs) in a fraction of the time needed by conventional search methods.
Revised:  NAC exploits this finding to design convolutional neural nets (CNNs) in a fraction of the time needed by conventional search methods.
Edit intent: clarity
Original:  EnvelopeNets is a construction method that exploits this finding to design convolutional neural nets (CNNs) in a fraction of the time needed by conventional search methods.
Revised:  EnvelopeNets is a construction method that exploits this finding to construct convolutional neural nets (CNNs) in a fraction of the time needed by conventional search methods.
Edit intent: clarity
Original:  Furthermore, we provide a new filtering method for point cloud data to anisotropically smooth the position data to fit the estimated normals.
Revised:  Furthermore, we provide a new filtering method for point cloud data to smooth the position data to fit the estimated normals.
Edit intent: clarity
Original:  In software defined networking (SDN) architecture, a central management of the forwarding elements (i. e. switches and routers) is accomplished by a central unit, which can be programmed directly to perform fundamental networking tasks or implementing any other additional services.
Revised:  In software defined networking (SDN) represents a promising networking architecture that combines central management and network programmability. SDN separates the control plane from the data plane and moves the network management to a central point, called the controller, that can be programmed directly to perform fundamental networking tasks or implementing any other additional services.
Edit intent: coherence
Original:  In this study, we provide a detailed overview of current efforts and recent advancements to include AI in SDN-based networks .
Revised:  In this study, we provide a detailed overview of the recent efforts to include AI in SDN-based networks .
Edit intent: clarity
Original:  but also to deploy and integrate numerous sensors and actuators throughout the city infrastructure - such is also widely know as the Internet of Things (IoT).
Revised:  but also to deploy and integrate numerous sensors and actuators throughout the city infrastructure - which is also widely know as the Internet of Things (IoT).
Edit intent: clarity
Original:  but also to deploy and integrate numerous sensors and actuators throughout the city infrastructure - such is also widely know as the Internet of Things (IoT).
Revised:  but also to deploy and integrate numerous sensors and actuators throughout the city infrastructure - such is also widely known as the Internet of Things (IoT).
Edit intent: fluency
Original:  The large amount of redundancy present in real-world complex networks is inherited  by such measures , and this has practical consequences which have not yet been explored in full generality, nor systematically exploited by network practitioners.
Revised:  The large amount of redundancy present in real-world complex networks is inherited by such measures . This has practical consequences which have not yet been explored in full generality, nor systematically exploited by network practitioners.
Edit intent: coherence
Original:  Here we present a complete theory for the study of symmetry in empirical networks and their effects on arbitrary network measures, and show how this can be exploited in practice in a number of ways, from redundancy compression, to computational reduction.
Revised:  Here we present a general and comprehensive study of the effect of network symmetry on arbitrary network measures, and show how this can be exploited in practice in a number of ways, from redundancy compression, to computational reduction.
Edit intent: clarity
Original: Virtually all network analyses involve structural measures or metrics between pairs of vertices, or of the vertices themselves, and the large amount of symmetry present in real-world complex networks is inherited and often amplified by such measures.
Revised: Virtually all network analyses involve structural measures between pairs of vertices, or of the vertices themselves, and the large amount of symmetry present in real-world complex networks is inherited and often amplified by such measures.
Edit intent: clarity
Original: Virtually all network analyses involve structural measures or metrics between pairs of vertices, or of the vertices themselves, and the large amount of symmetry present in real-world complex networks is inherited and often amplified by such measures.
Revised: Virtually all network analyses involve structural measures or metrics between pairs of vertices, or of the vertices themselves, and the large amount of symmetry present in real-world complex networks is inherited by such measures.
Edit intent: coherence
Original:  Here we present a general and comprehensive study of the effect of network symmetry on arbitrary network measures, and show how this can be exploited in practice in a number of ways, from redundancy compression, to computational reduction.
Revised:  Here we study the effect of network symmetry on arbitrary network measures, and show how this can be exploited in practice in a number of ways, from redundancy compression, to computational reduction.
Edit intent: clarity
Original:  Computing and decomposing network symmetries is very efficient in practice, and we test real-world examples up to several million nodes.
Revised:  Computing network symmetries is very efficient in practice, and we test real-world examples up to several million nodes.
Edit intent: clarity
Original:  Some of these signatures contain undistinguishable natural component but most of them are of purely anthropogenic origin.
Revised:  Some of these signatures contain undistinguishable natural components but most of them are of purely anthropogenic origin.
Edit intent: fluency
Original:  The Great Deceleration indicates a gradual progress towards a sustainable future.
Revised:  The second half of the 20th century does not mark the beginning of the Anthropocene but most likely the beginning of the end of the strong anthropogenic impacts, maybe even the beginning of a transition to a sustainable future.
Edit intent: coherence
Original:  In order to preserve scientific integrity of the Anthropocene it would be better to use the correct interpretation of anthropogenic signatures .
Revised:  The Anthropocene is a unique stage in human experience but it has no clearly marked beginning and it is probably not a new geological epoch .
Edit intent: coherence
Original:  In the theory of networks, an interesting expression proposed in [PRL {\bf 89} 208701 (2002)] for degree-degree correlation coefficient r_{j  ,k  }   has been in use.
Revised:  In the theory of networks, a curious expression proposed in [PRL {\bf 89} 208701 (2002)] for degree-degree correlation coefficient r_{j ,k } has been in use.
Edit intent: clarity
Original:  We prove that the suggested expression is incorrect overall and one should rather use the conventional form .
Revised:  We realize that the suggested expression is incorrect overall and one should rather use the conventional form .
Edit intent: clarity
Original: Rich-club ordering refers to  tendency of nodes with a high degree to be more interconnected than expected.
Revised: Rich-club ordering refers to the tendency of nodes with a high degree to be more interconnected than expected.
Edit intent: fluency
Original:  In this paper we consider the concept of rich-club ordering when generalized to structural measures different from the node degree and to non-structural measures (i.e. to node metadata).
Revised:  In this paper we consider the concept of rich-club ordering when generalized to structural measures that differ from the node degree and to non-structural measures (i.e. to node metadata).
Edit intent: clarity
Original:  Once defined a framework for the evaluation of generalized rich-club ordering (GRCO)  , we investigate such a phenomenon in real networks provided with node metadata.
Revised:  Once a framework for the evaluation of generalized rich-club ordering (GRCO) , we investigate such a phenomenon in real networks provided with node metadata.
Edit intent: coherence
Original:  By considering different notions of node richness  we compare structural and non-structural rich-club ordering, observing how external information about the network nodes is able to validate the presence of elites in networked systems.
Revised:  By considering different notions of node richness , we compare structural and non-structural rich-club ordering, observing how external information about the network nodes is able to validate the presence of elites in networked systems.
Edit intent: fluency
Original:  By considering different notions of node richness  we compare structural and non-structural rich-club ordering, observing how external information about the network nodes is able to validate the presence of elites in networked systems.
Revised:  By considering different notions of node richness we compare structural and non-structural rich-club ordering, observing how external information about the network nodes is able to validate the presence of rich-clubs in networked systems.
Edit intent: clarity
Original: In this position paper, we describe our vision of the future of machine-based programming through a categorical examination of three pillars of research.
Revised: In this position paper, we describe our vision of the future of machine programming through a categorical examination of three pillars of research.
Edit intent: clarity
Original: Top-down and bottom-up , as well as low-level and high-level factors influence where we fixate when viewing natural scenes.
Revised: Bottom-up and top-down , as well as low-level and high-level factors influence where we fixate when viewing natural scenes.
Edit intent: fluency
Original:  For this purpose we develop a simple saliency model , which uses the internal representation of a recent early spatial vision model as input and thus measures the influence of the low-level bottom-up factor.
Revised:  For this purpose we develop a saliency model which is based on the internal representation of a recent early spatial vision model as input and thus measures the influence of the low-level bottom-up factor.
Edit intent: clarity
Original:  For this purpose we develop a simple saliency model , which uses the internal representation of a recent early spatial vision model as input and thus measures the influence of the low-level bottom-up factor.
Revised:  For this purpose we develop a simple saliency model , which uses the internal representation of a recent early spatial vision model to measure the low-level bottom-up factor.
Edit intent: coherence
Original:  To measure the influence of high-level bottom-up features, we use DeepGaze II, a recent DNN-based saliency model.
Revised:  To measure the influence of high-level bottom-up features, we use a recent DNN-based saliency model.
Edit intent: clarity
Original:  To vary top-down influences, we evaluate the models on a large Corpus dataset with a memorization task andon a large visual search dataset.
Revised:  To account for top-down influences, we evaluate the models on a large Corpus dataset with a memorization task andon a large visual search dataset.
Edit intent: clarity
Original:  The initial exploration and the equilibrium state target similar areas which are determined largely top-down in the search dataset and are better predicted on the Corpus dataset when including high-level features.
Revised:  The initial exploration and in the steady state are related to similar areas of interest, which are better predicted when including high-level features.
Edit intent: clarity
Original:  In  contrast, the first fixation targets a different fixation density and contains a strong central fixation bias , but also the strongest guidance by the image .
Revised:  In contrast, the first fixation follows a different fixation density and contains a strong central fixation bias , but also the strongest guidance by the image .
Edit intent: clarity
Original:  In  contrast, the first fixation targets a different fixation density and contains a strong central fixation bias , but also the strongest guidance by the image .
Revised:  In contrast, the first fixation targets a different fixation density and contains a strong central fixation bias .
Edit intent: clarity
Original:  Nonetheless, the first fixations are better predicted by including high-level information as early as 200ms after image onset  .
Revised:  Nonetheless, first fixations are better predicted by including high-level information as early as 200ms after image onset .
Edit intent: coherence
Original:  Nonetheless, the first fixations are better predicted by including high-level information as early as 200ms after image onset  .
Revised:  Nonetheless, the first fixations are guided strongly by image properties and as early as 200ms after image onset .
Edit intent: clarity
Original:  Nonetheless, the first fixations are better predicted by including high-level information as early as 200ms after image onset  .
Revised:  Nonetheless, the first fixations are better predicted by including high-level information as early as 200 ms after image onset .
Edit intent: fluency
Original:  Later eye movements are better explained by including high-level features , but this high-level bottom-up control can be overruled by top-down influences.
Revised:  Later eye movements are better explained when high-level features , but this high-level bottom-up control can be overruled by top-down influences.
Edit intent: clarity
Original:  Later eye movements are better explained by including high-level features , but this high-level bottom-up control can be overruled by top-down influences.
Revised:  Later eye movements are better explained by including high-level features are considered, and later this high-level bottom-up control can be overruled by top-down influences.
Edit intent: coherence
Original:  To train polynomial regression models and factorization machines of up to 141K features over the join of a real-world dataset of up to 86M tuples, AC/DC needs up to 30 minutes on one core of a commodity machine.
Revised:  To train polynomial regression models and factorization machines of up to 141K features over the natural join of all relations from a real-world dataset of up to 86M tuples, AC/DC needs up to 30 minutes on one core of a commodity machine.
Edit intent: clarity
Original: This work studies the problem of modeling non-linear visual processes by learning linear generative models from observed sequences.
Revised: This work studies the problem of modeling visual processes by learning linear generative models from observed sequences.
Edit intent: clarity
Original:  After discussing several conditions for linearizing neural networks, we propose an architecture that allows Variational Autoencoders to simultaneously learn the non-linear observation as well as the linear state-transition from a sequence of observed frames.
Revised:  After discussing several conditions for linearizing neural networks, we propose an architecture that allows Variational Autoencoders to simultaneously learn a non-linear observation as well as the linear state-transition from a sequence of observed frames.
Edit intent: fluency
Original:  At higher savanna tree cover , irregular cycles develop near the front in which forests can persist for centuries to millenia after which they are replaced by savannas in decades.
Revised:  At higher savanna tree cover near the front in which forests can persist for centuries to millenia after which they are replaced by savannas in decades.
Edit intent: clarity
Original: A graph class \mathcal{F has the induced Erdos-P\'osa property if there exists a function f such that for every graph G and every positive integer k, G contains either k pairwise vertex-disjoint induced subgraphs that belong to F, or a vertex set of size at most f(k) hitting all induced copies of graphs in F. Kim and Kwon (SODA'18) showed that for a cycle C_{\ell} of length \ell, the set of C_{\ell}-subdivisions has the induced Erdos-P\'osa property if and only if \ell\le 4.
Revised: A class \mathcal{F has the induced Erdos-P\'osa property if there exists a function f such that for every graph G and every positive integer k, G contains either k pairwise vertex-disjoint induced subgraphs that belong to F, or a vertex set of size at most f(k) hitting all induced copies of graphs in F. Kim and Kwon (SODA'18) showed that for a cycle C_{\ell} of length \ell, the set of C_{\ell}-subdivisions has the induced Erdos-P\'osa property if and only if \ell\le 4.
Edit intent: fluency
Original: A graph class \mathcal{F has the induced Erdos-P\'osa property if there exists a function f such that for every graph G and every positive integer k, G contains either k pairwise vertex-disjoint induced subgraphs that belong to F, or a vertex set of size at most f(k) hitting all induced copies of graphs in F. Kim and Kwon (SODA'18) showed that for a cycle C_{\ell} of length \ell, the set of C_{\ell}-subdivisions has the induced Erdos-P\'osa property if and only if \ell\le 4.
Revised: A graph class \mathcal{F has the induced Erdos-P\'osa property if there exists a function f such that for every graph G and every positive integer k, G contains either k pairwise vertex-disjoint induced subgraphs that belong to F, or a vertex set of size at most f(k) hitting all induced copies of graphs in F. Kim and Kwon (SODA'18) showed that for a cycle C_{\ell} of length \ell, the class of C_{\ell}-subdivisions has the induced Erdos-P\'osa property if and only if \ell\le 4.
Edit intent: clarity
Original:  In this paper, we investigate whether subdivisions of H have the induced Erdos-P\'osa property for other graphs H. We completely settle the case where H is a forest or a complete bipartite graph.
Revised:  In this paper, we investigate whether or not the class of H-subdivisions has the induced Erdos-P\'osa property for other graphs H. We completely settle the case where H is a forest or a complete bipartite graph.
Edit intent: clarity
Original:  In this paper, we investigate whether subdivisions of H have the induced Erdos-P\'osa property for other graphs H. We completely settle the case where H is a forest or a complete bipartite graph.
Revised:  In this paper, we investigate whether subdivisions of H have the induced Erdos-P\'osa property for other graphs H. We completely settle the case when H is a forest or a complete bipartite graph.
Edit intent: fluency
Original:  Regarding the general case, we identify necessary conditions on H for its subdivisions to have the induced Erdos-P\'osa property.
Revised:  Regarding the general case, we identify necessary conditions on H for the class of H-subdivisions to have the induced Erdos-P\'osa property.
Edit intent: clarity
Original:  For this, we describe three basic constructions that can be used to prove that  subdivisions of a graph do not have the induced Erd\H{o}s-P\'osa property.
Revised:  For this, we provide three basic constructions that can be used to prove that subdivisions of a graph do not have the induced Erd\H{o}s-P\'osa property.
Edit intent: clarity
Original:  For this, we describe three basic constructions that can be used to prove that  subdivisions of a graph do not have the induced Erd\H{o}s-P\'osa property.
Revised:  For this, we describe three basic constructions that are useful to prove that subdivisions of a graph do not have the induced Erd\H{o}s-P\'osa property.
Edit intent: clarity
Original:  For this, we describe three basic constructions that can be used to prove that  subdivisions of a graph do not have the induced Erd\H{o}s-P\'osa property.
Revised:  For this, we describe three basic constructions that can be used to prove that subdivisions of a graph does not have the induced Erd\H{o}s-P\'osa property.
Edit intent: fluency
Original:  Among remaining graphs, we prove that the subdivisions of the diamond, the 1-pan, and the 2-pan have the induced Erd\H{o}s-P\'osa property.
Revised:  Among remaining graphs, we prove that the subdivisions of the diamond, the 1-pan, or the 2-pan have the induced Erd\H{o}s-P\'osa property.
Edit intent: fluency
Original: Recent works show that power-proportional data centers can save energy cost by dynamically adjusting active servers based on real time workload.
Revised: Recent studies have shown that power-proportional data centers can save energy cost by dynamically adjusting active servers based on real time workload.
Edit intent: clarity
Original:  The data center activates servers when the workload increases and transfers servers to sleep mode during periods of low load.
Revised:  The data center activates servers when the workload increases while some servers can be put into the sleep mode during periods of low load.
Edit intent: clarity
Original:  In this paper, we investigate the right-sizing problem with heterogeneous data centers including various operational cost and switching cost to find the optimal number of active servers in a online setting .
Revised:  In this paper, we investigate the right-sizing problem for heterogeneous data centers including various operational cost and switching cost to find the optimal number of active servers in a online setting .
Edit intent: fluency