wanyu/IteraTeR_v2 huggingface dataset:
Original: Floating point  plays a central role in science, engineering, and finance by enabling developers to approximately compute with real numbers.
Revised: Floating point arithmetic plays a central role in science, engineering, and finance by enabling developers to approximately compute with real numbers.
Edit intent: clarity
Original:  This paper presents Herbgrind, an approach to help developers identify and address root causes in typical numerical code written in low-level C/C++ and Fortran.
Revised:  This paper presents Herbgrind, a tool to help developers identify and address root causes in typical numerical code written in low-level C/C++ and Fortran.
Edit intent: clarity
Original: Floating point arithmetic plays a central role in science, engineering, and finance by enabling developers to approximately compute with real numbers .
Revised: Floating-point arithmetic plays a central role in science, engineering, and finance by enabling developers to approximately compute with real numbers .
Edit intent: fluency
Original: Floating point arithmetic plays a central role in science, engineering, and finance by enabling developers to approximately compute with real numbers .
Revised: Floating point arithmetic plays a central role in science, engineering, and finance by enabling developers to approximate real arithmetic .
Edit intent: clarity
Original:  To address numerical issues in large floating-point applications, developers must identify root causes, which is difficult because floating point errors are generally silent, non-local, and non-compositional  .
Revised:  To address numerical issues in large floating-point applications, developers must identify root causes, which is difficult because floating-point errors are generally silent, non-local, and non-compositional .
Edit intent: fluency
Original:  To address numerical issues in large floating-point applications, developers must identify root causes, which is difficult because floating point errors are generally silent, non-local, and non-compositional  .
Revised:  To address numerical issues in large floating-point applications, developers must identify root causes, which is difficult because floating point errors are generally non-local, and non-compositional .
Edit intent: clarity
Original:  To address numerical issues in large floating-point applications, developers must identify root causes, which is difficult because floating point errors are generally silent, non-local, and non-compositional  .
Revised:  To address numerical issues in large floating-point applications, developers must identify root causes, which is difficult because floating point errors are generally silent, non-local, non-compositional .
Edit intent: fluency
Original:  This paper presents Herbgrind, a tool to help developers identify and address root causes in typical numerical code written in low-level C/C++ and Fortran.
Revised:  This paper presents Herbgrind, a tool to help developers identify and address root causes in numerical code written in low-level C/C++ and Fortran.
Edit intent: clarity
Original:  Herbgrind  tracks dependencies between operations and program outputs to avoid false positives , and abstracts erroneous computations to a simplified program fragment whose improvement can reduce output error.
Revised:  Herbgrind tracks dependencies between operations and program outputs to avoid false positives and abstracts erroneous computations to a simplified program fragment whose improvement can reduce output error.
Edit intent: fluency
Original: Measures of nonlinear dependence in time series often take advantage of the fact that higher-order statistics manifest in the spectral domain as dependence across frequencies, related to so-called polyspectra .
Revised: Most biological signals are non-Gaussian, reflecting their origins in highly nonlinear physiological systems. A versatile set of techniques for studying non-Gaussian signals relies on the spectral representations of higher moments, known as polyspectra, which describe forms of cross-frequency dependence that do not arise in time-invariant Gaussian signals. The most commonly used of these employ the bispectrum .
Edit intent: clarity
Original:  Bispectral techniques have found occasional use in EEG literature, but other forms of cross-frequency dependence commonly regarded as easier to interpret, have recently attracted greater interest , in particular , phase-amplitude coupling (PAC).
Revised:  Bispectral techniques have found occasional use in EEG literature, but other forms of cross-frequency dependence have drawn interest in EEG literature , in particular , phase-amplitude coupling (PAC).
Edit intent: clarity
Original:  Bispectral techniques have found occasional use in EEG literature, but other forms of cross-frequency dependence commonly regarded as easier to interpret, have recently attracted greater interest , in particular , phase-amplitude coupling (PAC).
Revised:  Bispectral techniques have found occasional use in EEG literature, but other forms of cross-frequency dependence commonly regarded as easier to interpret, have recently attracted greater interest , in particular those which address phase-amplitude coupling (PAC).
Edit intent: clarity
Original:  Here it is shown that standard measures of PAC are related to smoothings of the signal bispectrum, making them fundamentally bispectral estimators.
Revised:  Here it is shown that standard measures of PAC , which we relate to smoothings of the signal bispectrum, making them fundamentally bispectral estimators.
Edit intent: clarity
Original:  Viewed this way, however, such measures exhibit some unfavorable qualities, such as poor bias properties, lack of correct symmetry and artificial constraints on the spectral range and resolution of the estimate.
Revised:  Viewed this way, however, conventional PAC measures exhibit some unfavorable qualities, such as poor bias properties, lack of correct symmetry and artificial constraints on the spectral range and resolution of the estimate.
Edit intent: clarity
Original:  Viewed this way, however, such measures exhibit some unfavorable qualities, such as poor bias properties, lack of correct symmetry and artificial constraints on the spectral range and resolution of the estimate.
Revised:  Viewed this way, however, such measures exhibit some unfavorable qualities, including poor bias properties, lack of correct symmetry and artificial constraints on the spectral range and resolution of the estimate.
Edit intent: fluency
Original:  Future studies of phase-amplitude coupling should therefore include an explicit evaluation of the bispectrum .
Revised:  We propose guidelines for gauging the nature and origin of cross-frequency coupling with bispectral statistics .
Edit intent: clarity
Original:  Beyond clarifying the relationship between the bispectrum and PAC, these observations motivate a more general framework for the interpretation of the bispectrum  .
Revised:  Beyond clarifying the relationship between PAC and the bispectrum, the present work lays out a general framework for the interpretation of the bispectrum .
Edit intent: clarity
Original:  Methods: Open-source solutions for solving the field equation in volume conductor models of deep brain stimulation and computing the neural activation are embedded into a Python package to estimate the neural activation in dependence of the dielectric tissue properties and axon parameters by employing a spatially adaptive scheme.
Revised:  Methods: Open-source solutions for solving the field equation in volume conductor models of deep brain stimulation and computing the neural activation are embedded into a Python package to estimate the neural activation dependent on the dielectric tissue properties and axon parameters by employing a spatially adaptive scheme.
Edit intent: clarity
Original:  When the computation device in question is an automaton, it is known that the minimal reversible automaton recognizing a given language is not necessarily unique, moreover, there are languages having arbitrarily large reversible recognizers possessing no nontrivial "reversible " congruence.
Revised:  When the computation device in question is an automaton, it is known that the minimal reversible automaton recognizing a given language is not necessarily unique, moreover, there are languages having arbitrarily large reversible recognizers possessing no nontrivial reversible congruence.
Edit intent: fluency
Original:  In this paper we give a forbidden pattern capturing the reversible regular languages having only finitely many reduced reversible automata, allowing an efficient ( \mathbf{NL ) decision procedure.
Revised:  In this paper we give a forbidden pattern capturing the reversible regular languages having only finitely many reduced reversible automata, allowing an efficient ( NL ) decision procedure.
Edit intent: coherence
Original: Software Defined Networking and Network Function Virtualization are two paradigms that offer a flexible software-based network management.
Revised: Software Defined Networking and Network Function Virtualization are two paradigms that offer flexible software-based network management.
Edit intent: fluency
Original:  In this paper, we propose a formulation of this problem as an Integer Linear Program that allows  to find the best feasible paths and virtual function placement for a set of services with respect to a total financial cost, while taking into account the (total or partial)
Revised:  In this paper, we propose a formulation of this problem as an Integer Linear Program that allows one to find the best feasible paths and virtual function placement for a set of services with respect to a total financial cost, while taking into account the (total or partial)
Edit intent: clarity
Original:  A graph is called t-tough , if the removal of any cutset S leaves at most |S|/t components.
Revised:  A graph is called t-tough if the removal of any cutset S leaves at most |S|/t components.
Edit intent: fluency
Original:  A graph is minimally t-tough , if the toughness of the graph is t and the deletion of any edge from the graph decreases the toughness.
Revised:  A graph is minimally t-tough if the toughness of the graph is t and the deletion of any edge from the graph decreases the toughness.
Edit intent: fluency
Original:  We prove that recognizing minimally t-tough graphs is DP-complete for any positive integer t and for any positive rational number t \leq 1/2.
Revised:  In this paper, we prove that recognizing minimally t-tough graphs is DP-complete for any positive integer t and for any positive rational number t \leq 1/2.
Edit intent: clarity
Original:  We prove that recognizing minimally t-tough graphs is DP-complete for any positive integer t and for any positive rational number t \leq 1/2.
Revised:  We prove that recognizing minimally t-tough graphs is DP-complete for any positive rational number t \leq 1/2.
Edit intent: clarity
Original: In the neural network domain, methods for hyperparameter optimization and meta-modeling are computationally expensive due to the need to train a large number of neural network configurations.
Revised: Methods for neural network hyperparameter optimization and meta-modeling are computationally expensive due to the need to train a large number of neural network configurations.
Edit intent: clarity
Original: In the neural network domain, methods for hyperparameter optimization and meta-modeling are computationally expensive due to the need to train a large number of neural network configurations.
Revised: In the neural network domain, methods for hyperparameter optimization and meta-modeling are computationally expensive due to the need to train a large number of model configurations.
Edit intent: clarity
Original:  In this paper, we show that a simple regression model, based on support vector machines, can predict the final performance of partially trained neural network configurations using features based on network architectures, hyperparameters, and time-series validation performance data.
Revised:  In this paper, we show that a simple regression model, based on support vector machines, can predict the final performance of partially trained model configurations using features based on network architectures, hyperparameters, and time-series validation performance data.
Edit intent: clarity
Original: A group of mobile entities is given a task to explore an edge-weighted tree T , i.e.  every vertex of T has to be visited by at least one agent.
Revised: A group of mobile agents is given a task to explore an edge-weighted tree T , i.e. every vertex of T has to be visited by at least one agent.
Edit intent: clarity
Original: A group of mobile entities is given a task to explore an edge-weighted tree T , i.e.  every vertex of T has to be visited by at least one agent.
Revised: A group of mobile entities is given a task to explore an edge-weighted tree T , i.e. , every vertex of T has to be visited by at least one agent.
Edit intent: fluency
Original:  There is no centralized unit to coordinate their actions, but they can freely communicate with each other and they know the structure of T in advance .
Revised:  There is no centralized unit to coordinate their actions, but they can freely communicate with each other .
Edit intent: coherence
Original:  The goal is to construct a deterministic strategy which allows robots to complete their task optimally.
Revised:  The goal is to construct a deterministic strategy which allows agents to complete their task optimally.
Edit intent: clarity
Original:  In this paper we are interested in a cost-optimal strategy, where the cost is understood as the sum of the total distance traversed by agents and the cost of invoking them.
Revised:  In this paper we are interested in a cost-optimal strategy, where the cost is understood as the total distance traversed by agents and the cost of invoking them.
Edit intent: clarity
Original:  In this paper we are interested in a cost-optimal strategy, where the cost is understood as the sum of the total distance traversed by agents and the cost of invoking them.
Revised:  In this paper we are interested in a cost-optimal strategy, where the cost is understood as the sum of the total distance traversed by agents coupled with the cost of invoking them.
Edit intent: clarity
Original: Recent works have stressed the important role  random mutations have in the development of cancer phenotype.
Revised: Recent works have stressed the important role that random mutations have in the development of cancer phenotype.
Edit intent: fluency
Original:  We challenge this current view by means of bioinformatic data analysis and computational modeling approaches.
Revised:  We challenge this current view by means of bioinformatic data analysis and computational modelling approaches.
Edit intent: fluency
Original:  The survival of cancer cells from the primary tumour site to the secondary seeding sites depends on the occurence of very few driver mutations promoting oncogenic cell behaviours and on the order with which these mutations occur.
Revised:  The survival of cancer cells from the primary tumour site to the secondary seeding sites depends on the occurrence of very few driver mutations promoting oncogenic cell behaviours and on the order with which these mutations occur.
Edit intent: fluency
Original:  We introduce a model in the framework of Cellular Automaton to investigate the effects of generic mutations and mutation order on cancer stemness and tumour cell migration  .
Revised:  We introduce a model in the framework of Cellular Automata to investigate the effects of generic mutations and mutation order on cancer stemness and tumour cell migration .
Edit intent: fluency
Original:  Our approach models three types of mutations: drivers, for which order is important , metabolic which supports cancer growth and are estimated from existing databases, and non driver mutations.
Revised:  Our approach models three types of mutations: drivers, the order of which is relevant for the dynamics , metabolic which supports cancer growth and are estimated from existing databases, and non driver mutations.
Edit intent: clarity
Original:  Our approach models three types of mutations: drivers, for which order is important , metabolic which supports cancer growth and are estimated from existing databases, and non driver mutations.
Revised:  Our approach models three types of mutations: drivers, for which order is important , metabolic which support cancer growth and are estimated from existing databases, and non driver mutations.
Edit intent: fluency
Original:  Our approach models three types of mutations: drivers, for which order is important , metabolic which supports cancer growth and are estimated from existing databases, and non driver mutations.
Revised:  Our approach models three types of mutations: drivers, for which order is important , metabolic which supports cancer growth and are estimated from existing databases, and non--driver mutations.
Edit intent: fluency
Original:  Consequently, survival curves can be thought as the end point of the trajectories of the order-dependent and metabolic mutations .
Revised:  Further mathematical modelling of the order of mutations is presented in terms of operators .
Edit intent: clarity
Original:  We believe that our work is novel because it quantifies two important factors in cancer spreading models: the order of driver mutations and the effects of metabolic mutations.
Revised:  We believe our work is novel because it quantifies two important factors in cancer spreading models: the order of driver mutations and the effects of metabolic mutations.
Edit intent: fluency
Original:  In this paper , we present a novel  method based on biharmonic interpolationfor low-rank matrix approximation.
Revised:  In this paper we present a novel method based on biharmonic interpolationfor low-rank matrix approximation.
Edit intent: fluency
Original:  While classical differential expression analysis provides specific and hence targetable gene-level insights, it does not include any systems--level information.
Revised:  While classical differential expression analysis provides specific and hence targetable gene-level insights, it does not include any systems-level information.
Edit intent: fluency
Original:  On the other hand, pathway analyses integrate systems--level information with expression data, but are often limited in their ability to indicate specific molecular targets.
Revised:  On the other hand, pathway analyses integrate systems-level information with expression data, but are often limited in their ability to indicate specific molecular targets.
Edit intent: fluency
Original:  We introduce GeneSurrounder, an analysis method that takes into account the complex structure of interaction networks to identify specific genes that disrupt pathway activity in a disease--specific manner.
Revised:  We introduce GeneSurrounder, an analysis method that takes into account the complex structure of interaction networks to identify specific genes that disrupt pathway activity in a disease-specific manner.
Edit intent: fluency
Original:  Let G denote the spanning tree graph of G. That is, the vertices of G consist of the directed rooted spanning trees on G, and the edges of G consist of pairs of trees (t_i, t_j) such that t_j can be obtained from t_i by adding the edge from the root of t_i to the root of t_j and deleting the outgoing edge from  t_j.
Revised:  Let G denote the spanning tree graph of G. That is, the vertices of G consist of the directed rooted spanning trees on G, and the edges of G consist of pairs of trees (t_i, t_j) such that t_j can be obtained from t_i by adding the edge from the root of t_i to the root of t_j and deleting the outgoing edge from the root of t_j.
Edit intent: fluency
Original:  Our main contribution is an alternative proof of this formula, which is both simple and combinatorial  .
Revised:  We provide an alternative proof of this formula, which is both simple and combinatorial .
Edit intent: clarity
Original: Our goal in this note is to present a general approach to define the net reproduction function /functional for a large class of nonlinear physiologically structured population models.
Revised: The goal of this note is to present a general approach to define the net reproduction function /functional for a large class of nonlinear physiologically structured population models.
Edit intent: clarity
Original: Our goal in this note is to present a general approach to define the net reproduction function /functional for a large class of nonlinear physiologically structured population models.
Revised: Our goal in this note is to present a general approach to define the net reproduction function for a large class of nonlinear physiologically structured population models.
Edit intent: clarity
Original:  In particular, we are going to show that this can be achieved in a natural way by reformulating a general non\-li\-near problem as a family of linear problems ;
Revised:  In particular, we are going to show that this can be achieved in a natural way by reformulating a nonlinear problem as a family of linear problems ;
Edit intent: clarity
Original:  In particular, we are going to show that this can be achieved in a natural way by reformulating a general non\-li\-near problem as a family of linear problems ;
Revised:  In particular, we are going to show that this can be achieved in a natural way by reformulating a general non\-li\-near problem as a family of linear ones ;
Edit intent: clarity
Original:  The reformulation of a nonlinear population model as a family of linear ones is a new approach  and provides an elegant way to study qualitative questions, in general .
Revised:  The reformulation of a nonlinear population model as a family of linear ones is a new approach , and provides an elegant way to study qualitative questions, in general .
Edit intent: fluency
Original:  For nonlinear models, varying the environment naturally leads to a net reproduction function or functional, depending on the dimension of the nonlinearity .
Revised:  For nonlinear models, varying the environment naturally leads to a net reproduction function .
Edit intent: clarity
Original: In this note, we revisit the following problem: Given a convex polygon P, find the largest-area inscribed triangle.
Revised: We revisit the following problem: Given a convex polygon P, find the largest-area inscribed triangle.
Edit intent: clarity
Original:   Finally, we discuss the implications of this discovery on the literature.
Revised:  Finally, we discuss the implications of our discoveries on the literature.
Edit intent: fluency
Original:  It learns to (i) place representations of similar symbols in close proximity in a vector space, (ii) make use of such similarities to prove facts , (iii) induce logical rules, and (iv) use provided and induced logical rules for complex multi-hop reasoning.
Revised:  It learns to (i) place representations of similar symbols in close proximity in a vector space, (ii) make use of such similarities to prove queries , (iii) induce logical rules, and (iv) use provided and induced logical rules for complex multi-hop reasoning.
Edit intent: clarity
Original:  It learns to (i) place representations of similar symbols in close proximity in a vector space, (ii) make use of such similarities to prove facts , (iii) induce logical rules, and (iv) use provided and induced logical rules for complex multi-hop reasoning.
Revised:  It learns to (i) place representations of similar symbols in close proximity in a vector space, (ii) make use of such similarities to prove facts , (iii) induce logical rules, and (iv) use provided and induced logical rules for multi-hop reasoning.
Edit intent: clarity
Original: 3D mesh segmentation is an important research area in computer graphics, and there is an increasing interest in applying deep learning to this challenging area .
Revised: There is an increasing interest in applying deep learning to this challenging area .
Edit intent: coherence