wanyu/IteraTeR_v2 huggingface dataset:
Original:  It is impervious to  power side-channel attacks, which exploit asymmetric reads / writes for 0 and 1 logic levels, and photonic side-channel attacks , which monitor photo-emission signatures from the chip backside .
Revised:  It is impervious to power side-channel attacks, which exploit asymmetric reads / write signatures for 0 and 1 logic levels, and photonic side-channel attacks , which monitor photo-emission signatures from the chip backside .
Edit intent: fluency
Original:  It is impervious to  power side-channel attacks, which exploit asymmetric reads / writes for 0 and 1 logic levels, and photonic side-channel attacks , which monitor photo-emission signatures from the chip backside .
Revised:  It is impervious to power side-channel attacks, which exploit asymmetric reads / writes for 0 and 1 logic levels, and photonic side-channel attacks which monitor photo-emission signatures from the chip backside .
Edit intent: fluency
Original: For a graph G= (V,E), a double Roman dominating function (DRDF) is a function f : V \to \{0,1,2,3\} having the property that if f (v) = 0, then vertex v must have at least two neighbors assigned 2 under f or  one neighbor u with f (u) = 3, and if f (v) = 1, then vertex v must have at least one neighbor u with f (u) \ge 2.
Revised: For a graph G= (V,E), a double Roman dominating function (DRDF) is a function f : V \to \{0,1,2,3\} having the property that if f (v) = 0, then vertex v must have at least two neighbors assigned 2 under f or at least one neighbor u with f (u) = 3, and if f (v) = 1, then vertex v must have at least one neighbor u with f (u) \ge 2.
Edit intent: fluency
Original:  In this paper, we consider the double Roman domination problem (DRDP) , which is an optimization problem of finding the DRDF f such that v\in V f (v) is minimum.
Revised:  In this paper, we consider the double Roman domination problem , which is an optimization problem of finding the DRDF f such that v\in V f (v) is minimum.
Edit intent: clarity
Original:  Further, we prove that some of our ILP formulations are equivalent to the others regardless of the variables relaxation or usage of less number of constraints and variables.
Revised:  Further, we prove that some of our ILP formulations are equivalent to the others regardless of the variable relaxation or usage of less number of constraints and variables.
Edit intent: fluency
Original:  Further, we prove that some of our ILP formulations are equivalent to the others regardless of the variables relaxation or usage of less number of constraints and variables.
Revised:  Further, we prove that some of our ILP formulations are equivalent to the others regardless of the variables relaxation or usage of a smaller number of constraints and variables.
Edit intent: fluency
Original:  Additionally, we use one ILP formulation to give an H(2(\Delta+1))-approximation algorithm and provide an in approximability result for this problem .
Revised:  Additionally, we use one ILP formulation to give an H(2(\Delta+1))-approximation algorithm .
Edit intent: coherence
Original:  All proposed ILP formulations and approximation algorithm are evaluated on randomly generated graphs to compare the performance.
Revised:  All proposed formulations and approximation algorithm are evaluated on randomly generated graphs to compare the performance.
Edit intent: clarity
Original:  In this modeling study, we introduce frequency dynamics into a system of coupled oscillators, where each oscillator represents the local mean-field model of a brain region.
Revised:  In this modeling study, we introduced frequency dynamics into a system of coupled oscillators, where each oscillator represents the local mean-field model of a brain region.
Edit intent: fluency
Original:  We first show that the collective behavior of interacting oscillators reproduces previously shown features of brain dynamics.
Revised:  We first showed that the collective behavior of interacting oscillators reproduces previously shown features of brain dynamics.
Edit intent: fluency
Original:  Our analysis of static and dynamic measures of simulated BOLD fMRI signals support the notion that the frequency of each oscillator is modulated by flow of activity in its neighborhood.
Edit intent: coherence
Original:  Second, we examine the effects of simulated lesions in gray brain matter by applying a new perturbation protocol to our model.
Revised:  Second, we examined the effect of simulated lesions in gray brain matter by applying a new perturbation protocol to our model.
Edit intent: fluency
Original:  Second, we examine the effects of simulated lesions in gray brain matter by applying a new perturbation protocol to our model.
Revised:  Second, we examine the effects of simulated lesions in gray matter by applying a new perturbation protocol to our model.
Edit intent: clarity
Original:  Second, we examine the effects of simulated lesions in gray brain matter by applying a new perturbation protocol to our model.
Revised:  Second, we examine the effects of simulated lesions in gray brain matter by applying a new perturbation protocol to the brain model.
Edit intent: fluency
Original:  We present a new approach to map the effects of vulnerability in brain networks and introducing a measure of regional hazardousness based on mapping of the degree of divergence in a feature space consisting of graph theoretical measures.
Revised:  We present a new approach to map the effects of vulnerability in brain networks and introduce a measure of regional hazardousness based on mapping of the degree of divergence in a feature space consisting of graph theoretical measures.
Edit intent: fluency
Original:  We present a new approach to map the effects of vulnerability in brain networks and introducing a measure of regional hazardousness based on mapping of the degree of divergence in a feature space consisting of graph theoretical measures.
Revised:  We present a new approach to map the effects of vulnerability in brain networks and introducing a measure of regional hazardousness based on mapping of the degree of divergence in a feature space 
Edit intent: coherence
Original:  The proposed scheme has the following features: it is linearly implicit, it preserves two invariants of the equation, its unique solvability is guaranteed without any restrictions on space and time stepsizes .
Revised:  The proposed scheme has the following features: it is linearly implicit, it preserves two invariants of the equation, its unique solvability is guaranteed without any restrictions on space and time step sizes .
Edit intent: fluency
Original: The performance of modern computation is characterized by locality of reference, that is, it is cheaper to access data that has been accessed recently than a random piece of data.
Revised: The performance of modern computation is characterized by locality of reference, that is, it is faster to access data that has been accessed recently than a random piece of data.
Edit intent: clarity
Original:  Our network is trained on a subset of the LiTS (Liver Tumor Segmentation) challenge and evaluated on data provided from the radiological center in Innsbruck .
Revised:  Our networks are trained on a subset of the LiTS (Liver Tumor Segmentation) challenge and evaluated on data provided from the radiological center in Innsbruck .
Edit intent: fluency
Original:  Our network is trained on a subset of the LiTS (Liver Tumor Segmentation) challenge and evaluated on data provided from the radiological center in Innsbruck .
Revised:  Our network is trained on a subset of the LiTS (Liver Tumor Segmentation) Challenge and evaluated on data provided from the radiological center in Innsbruck .
Edit intent: fluency
Original:  Our network is trained on a subset of the LiTS (Liver Tumor Segmentation) challenge and evaluated on data provided from the radiological center in Innsbruck .
Revised:  Our network is trained on a subset of the LiTS (Liver Tumor Segmentation) challenge and evaluated on data .
Edit intent: clarity
Original: In recent years, there has been an explosion of new metaheuristic algorithms that explore different sources of inspiration within the biological and natural worlds.
Revised: In recent years, a plethora of new metaheuristic algorithms that explore different sources of inspiration within the biological and natural worlds.
Edit intent: clarity
Original: In recent years, there has been an explosion of new metaheuristic algorithms that explore different sources of inspiration within the biological and natural worlds.
Revised: In recent years, there has been an explosion of new metaheuristic algorithms have explored different sources of inspiration within the biological and natural worlds.
Edit intent: clarity
Original:  This , in turn, makes it difficult to both comprehend these algorithms and understand their relationships to other metaheuristics.
Revised:  This makes it difficult to both comprehend these algorithms and understand their relationships to other metaheuristics.
Edit intent: coherence
Original:  This , in turn, makes it difficult to both comprehend these algorithms and understand their relationships to other metaheuristics.
Revised:  This , in turn, makes it difficult to both comprehend how these algorithms work and understand their relationships to other metaheuristics.
Edit intent: clarity
Original:  This guide attempts to address this issue, at least to some extent, by providing  descriptions of the 32 most cited nature-inspired algorithms published in the last 20 yearsusing standard metaheuristic terms .
Revised:  This paper attempts to address this issue, at least to some extent, by providing descriptions of the 32 most cited nature-inspired algorithms published in the last 20 yearsusing standard metaheuristic terms .
Edit intent: clarity
Original:  This guide attempts to address this issue, at least to some extent, by providing  descriptions of the 32 most cited nature-inspired algorithms published in the last 20 yearsusing standard metaheuristic terms .
Revised:  This guide attempts to address this issue, at least to some extent, by providing accessible descriptions of the 32 most cited nature-inspired algorithms published in the last 20 yearsusing standard metaheuristic terms .
Edit intent: clarity
Original:  This guide attempts to address this issue, at least to some extent, by providing  descriptions of the 32 most cited nature-inspired algorithms published in the last 20 yearsusing standard metaheuristic terms .
Revised:  This guide attempts to address this issue, at least to some extent, by providing descriptions of the most cited nature-inspired algorithms published in the last 20 yearsusing standard metaheuristic terms .
Edit intent: clarity
Original:  This guide attempts to address this issue, at least to some extent, by providing  descriptions of the 32 most cited nature-inspired algorithms published in the last 20 yearsusing standard metaheuristic terms .
Revised:  This guide attempts to address this issue, at least to some extent, by providing descriptions of the 32 most cited nature-inspired algorithms published in the last twenty years .
Edit intent: clarity
Original:  The k-center problem has recently been shown to be NP-hard, even in the case where k=1, i.e. the minimum enclosing ball under the Fr\'echet distance .
Revised:  Building upon recent hardness results for the minimum-enclosing-ball problem under the Fr\'echet distance .
Edit intent: clarity
Original:  We extend these results by showing that also the k-median problem is NP-hard for k=1.
Revised:  We extend these results by showing that also the k-median problem is NP-hard .
Edit intent: clarity
Original: The reconfiguration graph R_k(G) of the k-colourings of a graph G contains as its vertex set the k-colourings of G and two colourings are joined by an edge if they differ in colour on just one vertex of G. We answer a question of Bonamy, Johnson, Lignos, Patel and Paulusma by constructing for each k \geq 3  a k-colourable weakly chordal graph G such that R_{k+1}(G) is disconnected.
Revised: The reconfiguration graph R_k(G) of the k-colourings of a graph G contains as its vertex set the k-colourings of G and two colourings are joined by an edge if they differ in colour on just one vertex of G. We show that for each k \geq 3 a k-colourable weakly chordal graph G such that R_{k+1}(G) is disconnected.
Edit intent: clarity
Original: The reconfiguration graph R_k(G) of the k-colourings of a graph G contains as its vertex set the k-colourings of G and two colourings are joined by an edge if they differ in colour on just one vertex of G. We answer a question of Bonamy, Johnson, Lignos, Patel and Paulusma by constructing for each k \geq 3  a k-colourable weakly chordal graph G such that R_{k+1}(G) is disconnected.
Revised: The reconfiguration graph R_k(G) of the k-colourings of a graph G contains as its vertex set the k-colourings of G and two colourings are joined by an edge if they differ in colour on just one vertex of G. We answer a question of Bonamy, Johnson, Lignos, Patel and Paulusma by constructing for each k \geq 3 there is a k-colourable weakly chordal graph G such that R_{k+1}(G) is disconnected.
Edit intent: clarity
Original:  We also introduce a subclass of k-colourable weakly chordal graphs which we call k-colour compact and show that for each k-colour compact graph G on n vertices, R_{k+1}(G) has diameter O(n^2).
Revised:  We also introduce a subclass of k-colourable weakly chordal graphs which we call k-colourable compact graphs and show that for each k-colour compact graph G on n vertices, R_{k+1}(G) has diameter O(n^2).
Edit intent: fluency
Original:  We also introduce a subclass of k-colourable weakly chordal graphs which we call k-colour compact and show that for each k-colour compact graph G on n vertices, R_{k+1}(G) has diameter O(n^2).
Revised:  We also introduce a subclass of k-colourable weakly chordal graphs which we call k-colour compact and show that for each k-colourable compact graph G on n vertices, R_{k+1}(G) has diameter O(n^2).
Edit intent: fluency
Original:  We then couple this Lagrangian framework with a meshfree Generalized Finite Difference Method (GFDM) to approximate surface differential operators, which together gives a method to solve PDEs on evolving manifolds.
Revised:  We then couple this Lagrangian framework with a meshfree Generalized Finite Difference Method (GFDM) to approximate surface differential operators, which together give a method to solve PDEs on evolving manifolds.
Edit intent: fluency
Original:  We find that gradient signals grow exponentially in depth and that these exploding gradients cannot be eliminated by tuning the initial weight variances or by adjusting the nonlinear activation function.
Revised:  Our theory shows that gradient signals grow exponentially in depth and that these exploding gradients cannot be eliminated by tuning the initial weight variances or by adjusting the nonlinear activation function.
Edit intent: clarity
Original:  For rugged landscapes, however, the elitist policy can perform very poorly if the group size is large .
Revised:  For rugged landscapes, however, the elitist policy can perform very poorly for certain group sizes .
Edit intent: clarity
Original:  Due to the additional consideration of connections between examples ( e.g., \eg articles with citation link tend to be in the same class), graph neural networks could be more sensitive to the perturbations, since the perturbations from connected examples exacerbate the impact on a target example.
Revised:  Due to the additional consideration of connections between examples ( \eg articles with citation link tend to be in the same class), graph neural networks could be more sensitive to the perturbations, since the perturbations from connected examples exacerbate the impact on a target example.
Edit intent: clarity
Original:  We propose Graph Adversarial Training ( GAT ), which takes the impact from connected examples into account when learning to construct and resist perturbations.
Revised:  We propose Graph Adversarial Training ( GraphAT ), which takes the impact from connected examples into account when learning to construct and resist perturbations.
Edit intent: fluency
Original:  We give a general formulation of GAT , which can be seen as a dynamic regularization scheme based on the graph structure.
Revised:  We give a general formulation of GraphAT , which can be seen as a dynamic regularization scheme based on the graph structure.
Edit intent: fluency
Original:  To demonstrate the utility of GAT , we employ it on a state-of-the-art graph neural network model --- Graph Convolutional Network (GCN).
Revised:  To demonstrate the utility of GraphAT , we employ it on a state-of-the-art graph neural network model --- Graph Convolutional Network (GCN).
Edit intent: fluency
Original:  We conduct experiments on two citation graphs (Citeseer and Cora) and a knowledge graph (NELL), verifying the effectiveness of GAT which outperforms normal training on GCN by 4.51\% in node classification accuracy.
Revised:  We conduct experiments on two citation graphs (Citeseer and Cora) and a knowledge graph (NELL), verifying the effectiveness of GraphAT which outperforms normal training on GCN by 4.51\% in node classification accuracy.
Edit intent: fluency
Original: We present the WebProt\'eg\'e application to develop ontologies represented in the Web Ontology Language (OWL).
Revised: We present WebProt\'eg\'e application to develop ontologies represented in the Web Ontology Language (OWL).
Edit intent: fluency
Original: We present the WebProt\'eg\'e application to develop ontologies represented in the Web Ontology Language (OWL).
Revised: We present the WebProt\'eg\'e , a tool to develop ontologies represented in the Web Ontology Language (OWL).
Edit intent: clarity
Original:  WebProt\'eg\'e is a cloud-based application that allows users to collaboratively edit OWL ontologies, and it is available for use at URL WebProt\'eg\'e currently hosts more than 66 ,000 OWL ontology projects and has over 50,000 user accounts.
Revised:  WebProt\'eg\'e is a cloud-based application that allows users to collaboratively edit OWL ontologies, and it is available for use at URL WebProt\'ege\'e currently hosts more than 66 ,000 OWL ontology projects and has over 50,000 user accounts.
Edit intent: fluency
Original:  Here we introduce a simple generative model for continuous valued relational data and study the network ensemble obtained by thresholding it.
Revised:  Here we introduce a simple model for correlated relational data and study the network ensemble obtained by thresholding it.
Edit intent: clarity
Original:  We find that some, but not all, of the properties associated with complex networks can be seen after thresholding  , even though the underlying data is not "complex".
Revised:  We find that some, but not all, of the properties associated with complex networks can be seen after thresholding , even though the underlying data are not "complex".
Edit intent: fluency
Original:  In particular, we observe heavy-tailed degree distributions,  large numbers of triangles, and short path lengths, while we do not observe non-vanishing clustering or community structure.
Revised:  In particular, we observe heavy-tailed degree distributions, a large numbers of triangles, and short path lengths, while we do not observe non-vanishing clustering or community structure.
Edit intent: fluency
Original:  This work has been submitted as a chapter in P. Benner, S. Grivet-Talocia, A. Quarteroni, G. Rozza, W.H.A. Schilders, L.M. Sileira.
Revised:  This work has been accepted as a chapter in P. Benner, S. Grivet-Talocia, A. Quarteroni, G. Rozza, W.H.A. Schilders, L.M. Sileira.
Edit intent: clarity
Original:  SA-CCR has major issues including: lack of self-consistency for linear trades;
Revised: From SA-CCR has major issues including: lack of self-consistency for linear trades;
Edit intent: fluency
Original:  The execution platform included up to 64 dual-socket nodes, each socket mounting 8 Intel Xeon Haswell processor cores @ 2.40GHz clock  .
Revised:  The execution platform included up to 64 dual-socket nodes, each socket mounting 8 Intel Xeon Haswell processor cores @ 2.40GHz clock rates .
Edit intent: clarity
Original:  Our regularity conditions are weaker than the usual Euclidean operator norm regularity properties, allowing us to show faster bounds for a much larger class of distributions than would be possible with the usual Euclidean operator norm approach, including in statistics and machine learning applications where the data satisfy a certain incoherence condition.
Revised:  In many settings, our regularity conditions are weaker than the usual Euclidean operator norm regularity properties, allowing us to show faster bounds for a much larger class of distributions than would be possible with the usual Euclidean operator norm approach, including in statistics and machine learning applications where the data satisfy a certain incoherence condition.
Edit intent: clarity
Original: A growing interest has been witnessed recently  in building nearest neighbor search solutions within Elasticsearch--one of the most popular full-text search engines.
Revised: A growing interest has been witnessed recently in building nearest neighbor search (NNS) solutions on top of full-text search engines.
Edit intent: clarity
Original: By combining three techniques : bit operation, substring filtering and data preprocessing with permutation  , we develop a novel approach called FENSHSES (Fast Exact Neighbor Search in Hamming Space on Elasticsearch), which achieves dramatic speed-ups over the existing term match baseline.
Revised: By combining three techniques : bit operation, substring filtering and data preprocessing with permutation , we develop a novel engineering solution for full-text search engines to efficiently accomplish this special but important NNS task. In the experiment, we show that our proposed approach enables full-text search engines to achieve significant speed-ups over the existing term match baseline.
Edit intent: coherence
Original:  For oxygen, accounting for nonlinear kinetics using physiological parameter values, our model predicts that the threshold between flow-limited and diffusion-limited transport is not significantly affected by metabolism, but the partitioning of fluxes between the villous tissue and the capillary network depends strongly on the flow regime.
Revised:  For oxygen, accounting for nonlinear kinetics using physiological parameter values, our model predicts that villous metabolism does not significantly impact oxygen transfer to fetal blood, although the partitioning of fluxes between the villous tissue and the capillary network depends strongly on the flow regime.
Edit intent: clarity
Original:  We present a simple algebraic approximation for solute uptake rate as a function of flow conditions, metabolism rate and villus geometry.
Revised:  We present a simple algebraic approximation for solute uptake rate as a function of flow conditions, metabolic rate and villous geometry.
Edit intent: fluency
Original: Cortical slow oscillations are an emergent property of the cortical network,  hallmark of low complexity brain states like sleep, and representing a default activity pattern.
Revised: Cortical slow oscillations are an emergent property of the cortical network, a hallmark of low complexity brain states like sleep, and representing a default activity pattern.
Edit intent: fluency
Original: Cortical slow oscillations are an emergent property of the cortical network,  hallmark of low complexity brain states like sleep, and representing a default activity pattern.
Revised: Cortical slow oscillations are an emergent property of the cortical network, hallmark of low complexity brain states like sleep, and represent a default activity pattern.
Edit intent: fluency
Original:  One institutional analysis framework that has been useful in the design of traditional institutions is the body of resource governance literature known as the ``Ostrom Workshop''
Revised:  One institutional analysis framework that has been useful in the design of traditional institutions is the body of resource governance literature known as the "Ostrom Workshop"
Edit intent: fluency