wanyu/IteraTeR_v2 huggingface dataset:
Original:  Finally, experimental analysis  to check whether the defined design objectives are indeed met in the target environment and detailed characterization experiments are performed to improve the mechanistic models and detect missing design goals .
Revised:  Finally, experimental analysis to check whether the defined design objectives are indeed met in the target environment and detailed characterization experiments are performed to improve the mechanistic models and detect missing design requirements .
Edit intent: clarity
Original: Artificial RNA molecules with novel functionality have many applications in synthentic biology, pharmacy and white biotechnology.
Revised: Artificial RNA molecules with novel functionality have many applications in synthetic biology, pharmacy and white biotechnology.
Edit intent: fluency
Original: Starting from the Avellaneda--Stoikov framework, we consider a market maker who wants to optimally set bid/ask quotes over a finite time interval , to maximize her expected utility.
Revised: Starting from the Avellaneda-Stoikov framework, we consider a market maker who wants to optimally set bid/ask quotes over a finite time interval , to maximize her expected utility.
Edit intent: fluency
Original: Starting from the Avellaneda--Stoikov framework, we consider a market maker who wants to optimally set bid/ask quotes over a finite time interval , to maximize her expected utility.
Revised: Starting from the Avellaneda--Stoikov framework, we consider a market maker who wants to optimally set bid/ask quotes over a finite time horizon , to maximize her expected utility.
Edit intent: clarity
Original:  This effect becomes higher  the longer the waiting time in between orders.
Revised:  This effect becomes higher , the longer the waiting time in between orders.
Edit intent: fluency
Original: Within the original Material Point Method (MPM)  , discontinuous gradients of the piece-wise linear basis functions lead to so-called `grid-crossing errors' when particles cross element boundaries.
Revised: The Material Point Method (MPM) , discontinuous gradients of the piece-wise linear basis functions lead to so-called `grid-crossing errors' when particles cross element boundaries.
Edit intent: clarity
Original: Within the original Material Point Method (MPM)  , discontinuous gradients of the piece-wise linear basis functions lead to so-called `grid-crossing errors' when particles cross element boundaries.
Revised: Within the original Material Point Method (MPM) , discontinuous gradients of the piecewise-linear basis functions lead to so-called `grid-crossing errors' when particles cross element boundaries.
Edit intent: fluency
Original:  Numerical results , presented for a two-dimensional benchmark, show the potential of these basis functions within MPM  .
Revised:  Numerical results demonstrate the potential of these basis functions within MPM .
Edit intent: clarity
Original: The vertex coloring problem is a well-known NP-hard problem and has many applications in operations research , especially in scheduling.
Revised: The vertex coloring problem is a well-known NP-hard problem and has many applications in operations research and in scheduling.
Edit intent: coherence
Original:  We propose a simple initial solution generator,  the recycle method, which makes use of the legal (k+1)-coloring that has been found.
Revised:  We highlight a simple initial solution generator, the recycle method, which makes use of the legal (k+1)-coloring that has been found.
Edit intent: clarity
Original:  We propose a simple initial solution generator,  the recycle method, which makes use of the legal (k+1)-coloring that has been found.
Revised:  We propose a simple initial solution generator, which we call the recycle method, which makes use of the legal (k+1)-coloring that has been found.
Edit intent: coherence
Original:  An initial solution generated by the method is expected to guide a general heuristic algorithm to find a legal k-coloring quickly , as demonstrated by experimental studies.
Revised:  An initial solution generated by the method is expected to guide a heuristic algorithm to find a legal k-coloring quickly , as demonstrated by experimental studies.
Edit intent: clarity
Original:  For example, TABUCOL, a conventional tabu search algorithm, achieves k=240 for the R1000.5 DIMACS graph when the recycle method is employed as the initial solution generator .
Revised:  The results suggest that the recycle method should be used as the standard initial solution generator .
Edit intent: clarity
Original: In this short communication I present a study on cortical thickness and functional networks ' coupling topology by cortical lobes.
Revised: This study aims to investigate topological organization of cortical thickness and functional networks ' coupling topology by cortical lobes.
Edit intent: clarity
Original: In this short communication I present a study on cortical thickness and functional networks ' coupling topology by cortical lobes.
Revised: In this short communication I present a study on cortical thickness and functional networks by cortical lobes.
Edit intent: clarity
Original:  First, I demonstrated modular organisation of these networks by the cortical surface frontal, temporal, parietal and occipital divisions.
Revised:  First, I demonstrated modular organization of these networks by the cortical surface frontal, temporal, parietal and occipital divisions.
Edit intent: fluency
Original:  Secondly, I mapped the coupling topology of cortical thickness and functional networks for positive and negative correlations.
Revised:  Secondly, I mapped the overlapping edges of cortical thickness and functional networks for positive and negative correlations.
Edit intent: clarity
Original:  Finally, I showed that the coupled positive correlations map onto within-lobe cortical interactions and negative onto between-lobes interactions.
Revised:  Finally, I showed that overlapping positive edges map onto within-lobe cortical interactions and negative onto between-lobes interactions.
Edit intent: clarity
Original:  Over the last twenty years, a large body of literature in diverse areas of computer science has been published that investigated many different aspects, models, and algorithms for automatically placing external labels for a given set of features.
Revised:  Over the last twenty years, a large body of literature in diverse areas of computer science has been published that investigates many different aspects, models, and algorithms for automatically placing external labels for a given set of features.
Edit intent: fluency
Original:  To tackle these challenges, we propose a Hierarchical Attentive Heterogeneous information network Embedding (HAHE) model which is capable of learning personalized meta-path preferences for each node as well as updating the embedding information for each new node efficiently with only its neighbor node information.
Revised:  To tackle these challenges, we propose aHierarchical Attentive Heterogeneous information network Embedding (HAHE) model which is capable of learning personalized meta-path preferences for each node as well as updating the embedding information for each new node efficiently with only its neighbor node information.
Edit intent: fluency
Original:  Extensive experiments on several real-world datasets show that our proposed HAHE \model model significantly outperforms the state-of-the-art methods in terms of various evaluation metrics .
Revised:  Extensive experiments on several real-world datasets show that our proposed \model model significantly outperforms the state-of-the-art methods in terms of various evaluation metrics .
Edit intent: clarity
Original:  Extensive experiments on several real-world datasets show that our proposed HAHE \model model significantly outperforms the state-of-the-art methods in terms of various evaluation metrics .
Revised:  Extensive experiments on several real-world datasets show that our proposed HAHE \model model significantly outperforms the state-of-the-art methods in terms of various data mining tasks .
Edit intent: clarity
Original:  Here we examine the characteristics of ideal and near--ideal observers in a task of this type.
Revised:  Here we examine the characteristics of ideal and near-ideal observers in a task of this type.
Edit intent: fluency
Original:  We then exploit this result to implement a non-equilibrium rate model which estimates the degree of substrate expansion as a function of the free energy provided by ATP hydrolysis.
Revised:  We then exploit this result to implement a non-equilibrium rate model which estimates the degree of expansion as a function of the free energy provided by ATP hydrolysis.
Edit intent: clarity
Original:  It has been shown that their computational power is rather limited: They can only compute the predicates  expressible in Presburger arithmetic.
Revised:  Their computational power is rather limited: They can only compute the predicates expressible in Presburger arithmetic.
Edit intent: coherence
Original:  In the new framework, corresponding processes are strictly increasing, solve random ODEs , and are composed with geometric Brownian motion to obtain price processes .
Revised:  In the new framework, corresponding processes are strictly increasing, solve random ODEs , and are composed with geometric Brownian motion .
Edit intent: clarity
Original:  When sensible initial values are chosen, IVP solutions are also strictly increasing, and the IVPs' solution set is shown to contain all differentiable bijections on the non-negative reals.
Revised:  When sensible initial values are chosen, IVP solutions are also strictly increasing, and the solution set of such IVPs is shown to contain all differentiable bijections on the non-negative reals.
Edit intent: clarity
Original:  Despite this generality, new well-posedness results establish the uniqueness of solutions going forwards in time , and continuity of the IVPs' solution map .
Revised:  Despite this generality, new well-posedness results establish the uniqueness of solutions going forwards in time .
Edit intent: clarity
Original:  The framework explains how Heston price processes can converge to an interval-valued generalisation of the NIG Levy process, and reveals a deeper relationship between integrated CIR processes and the IG Levy process.
Revised:  The framework shows how Heston price processes can converge to an interval-valued generalisation of the NIG Levy process, and reveals a deeper relationship between integrated CIR processes and the IG Levy process.
Edit intent: clarity
Original:  The framework explains how Heston price processes can converge to an interval-valued generalisation of the NIG Levy process, and reveals a deeper relationship between integrated CIR processes and the IG Levy process.
Revised:  The framework explains how Heston price processes can converge to an interval-valued generalisation of the NIG Levy process, and reveals a deeper relationship between integrated CIR processes and the IG process.
Edit intent: fluency
Original:  Implied volatilities from this model are simulated, and exhibit features characteristic of leading `rough' volatility models.
Revised:  This model's implied volatilities are simulated, and exhibit features characteristic of leading `rough' volatility models.
Edit intent: clarity
Original:  Implied volatilities from this model are simulated, and exhibit features characteristic of leading `rough' volatility models.
Revised:  Implied volatilities from this model are simulated, and exhibit features characteristic of leading volatility models.
Edit intent: clarity
Original:  This problem is challenging, because there are different types of Air-to-Ground (A2G) connections, i.e., satellites and Direct Air-to-Ground (DA2G) links.
Revised:  This problem is challenging, due to different types of Air-to-Ground (A2G) connections, i.e., satellites and Direct Air-to-Ground (DA2G) links.
Edit intent: coherence
Original:  This problem is challenging, because there are different types of Air-to-Ground (A2G) connections, i.e., satellites and Direct Air-to-Ground (DA2G) links.
Revised:  This problem is challenging, because there are different types of Air-to-Ground (A2G) connections, i.e., satellites and Direct-Air-to-Ground (DA2G) links.
Edit intent: fluency
Original:  Furthermore, due to the changing positions of a flight , it is important to consider adapting the service location accordingly.
Revised:  Furthermore, due to the flights' movements , it is important to consider adapting the service location accordingly.
Edit intent: clarity
Original:  In this work, we formulate two Mixed Integer Linear Programs (MILPs) for the problem of Joint Service Placement and Routing (JSPR): i) Static (S-JSPR), and ii) Mobility-Aware (MA-JSPR) in Space-Air-Ground Integrated Networks (SAGIN), where the objective is to minimize the total cost.
Revised:  In this work, we formulate two Mixed Integer Linear Programs (MILPs) for the problem of Joint Service Placement and Routing (JSPR): i) Static (S-JSPR), and ii) Mobility-Aware (MA-JSPR) in Space-Air-Ground Integrated Networks (SAGIN), with the objective of minimizing the total cost.
Edit intent: coherence
Original:  In this work, we formulate two Mixed Integer Linear Programs (MILPs) for the problem of Joint Service Placement and Routing (JSPR): i) Static (S-JSPR), and ii) Mobility-Aware  (MA-JSPR) in Space-Air-Ground Integrated Networks (SAGIN), with the objective of minimizing the total cost.
Revised:  In this work, we formulate two Mixed Integer Linear Programs (MILPs) for the problem of Joint Service Placement and Routing (JSPR): i) Static (S-JSPR), and ii) Mobility-Aware ~ (MA-JSPR) in Space-Air-Ground Integrated Networks (SAGIN), with the objective of minimizing the total cost.
Edit intent: fluency
Original: The loss of a few neurons in a brain often does not result in a visible loss of function.
Revised: The loss of a few neurons in a brain rarely results in any visible loss of function.
Edit intent: clarity
Original: An important issue in bibliometrics is the weighting of co-authorship in the production of scientific collaborations, which are becoming the standard modality of research activity in many disciplines.
Revised: An important issue in bibliometrics is the weighing of co-authorship in the production of scientific collaborations, which are becoming the standard modality of research activity in many disciplines.
Edit intent: fluency
Original:  Applications include in particular highly-oscillatory Kubo oscillators and spatial discretizations of  nonlinear Schr\"odinger equation with fast white noise dispersion.
Revised:  Applications include in particular highly-oscillatory Kubo oscillators and spatial discretizations of the nonlinear Schr\"odinger equation with fast white noise dispersion.
Edit intent: fluency
Original:  Our goal is to provide a comprehensive formal analysis of the performance of this algorithm on certain "easy" reference problems in a black-box setting, namely the problem of sorting items by transpositions and the problem OneMax, which asks to maximize the number of ones occurring in a bitstring.
Revised:  We provide a comprehensive formal analysis of the performance of this algorithm on certain "easy" reference problems in a black-box setting, namely the problem of sorting items by transpositions and the problem OneMax, which asks to maximize the number of ones occurring in a bitstring.
Edit intent: clarity
Original:  Our goal is to provide a comprehensive formal analysis of the performance of this algorithm on certain "easy" reference problems in a black-box setting, namely the problem of sorting items by transpositions and the problem OneMax, which asks to maximize the number of ones occurring in a bitstring.
Revised:  Our goal is to provide a comprehensive formal analysis of the performance of this algorithm on certain "easy" reference problems in a black-box setting, namely the sorting problem and the problem OneMax, which asks to maximize the number of ones occurring in a bitstring.
Edit intent: clarity
Original:  We provide a Markov-model of the proposed algorithm and obtain from it upper and lower bounds on the expected number of function evaluations needed by the algorithm to solve the reference problems .
Revised:  We provide a Markov-model of the proposed algorithm to obtain upper and lower bounds on the expected number of function evaluations needed by the algorithm to solve the reference problems .
Edit intent: clarity
Original:  We provide a Markov-model of the proposed algorithm and obtain from it upper and lower bounds on the expected number of function evaluations needed by the algorithm to solve the reference problems .
Revised:  We provide a Markov-model of the proposed algorithm and obtain from it upper and lower bounds on its expected optimization time .
Edit intent: clarity
Original:  For a suitable choice of the algorithm parameters the expected optimization time of the proposed algorithm is comparable to known results for an evolutionary algorithm.
Revised:  We show that for a suitable choice of the algorithm parameters the expected optimization time of the proposed algorithm is comparable to known results for an evolutionary algorithm.
Edit intent: coherence
Original:  For a suitable choice of the algorithm parameters the expected optimization time of the proposed algorithm is comparable to known results for an evolutionary algorithm.
Revised:  For a suitable choice of algorithm parameters the expected optimization time of the proposed algorithm is comparable to known results for an evolutionary algorithm.
Edit intent: fluency
Original:  For a suitable choice of the algorithm parameters the expected optimization time of the proposed algorithm is comparable to known results for an evolutionary algorithm.
Revised:  For a suitable choice of the algorithm parameters the expected optimization time is comparable to known results for an evolutionary algorithm.
Edit intent: clarity
Original:  In order to obtain our results , we introduce an indistinguishability property for the states of a Markov chain and provide bounds on the solution of a recurrence equation with non-constant coefficients by integration .
Revised:  In order to obtain our results we introduce the notion of indistinguishability of states of a Markov chain and provide bounds on the solution of a recurrence equation with non-constant coefficients by integration .
Edit intent: clarity
Original:  We provide a comprehensive formal analysis of the performance of this algorithm on certain "easy" reference problems in a black-box setting, namely the sorting problem and the problem OneMAX . In our analysis we use a Markov-model of the proposed algorithm to obtain upper and lower bounds on its expected optimization time.
Revised:  We provide a comprehensive formal analysis of the performance of this algorithm on certain "easy" reference problems in a black-box setting, namely the sorting problem and the problem OneMax . In our analysis we use a Markov-model of the proposed algorithm to obtain upper and lower bounds on its expected optimization time.
Edit intent: fluency
Original:  We provide a comprehensive formal analysis of the performance of this algorithm on certain "easy" reference problems in a black-box setting, namely the sorting problem and the problem OneMAX . In our analysis we use a Markov-model of the proposed algorithm to obtain upper and lower bounds on its expected optimization time.
Revised:  We provide a comprehensive formal analysis of the performance of this algorithm on certain "easy" reference problems in a black-box setting, namely the sorting problem and the problem OneMAX . In our analysis we use a Markov model of the proposed algorithm to obtain upper and lower bounds on its expected optimization time.
Edit intent: fluency
Original:  Our bounds are essentially tight with respect to the Markov-model .
Revised:  Our bounds are essentially tight with respect to the Markov model .
Edit intent: fluency
Original: Isogeometric Analysis allows high-order discretizations of boundary value problems using a number of degrees of freedom which is as small as for a low-order method.
Revised: Isogeometric Analysis is a high-order discretizations of boundary value problems using a number of degrees of freedom which is as small as for a low-order method.
Edit intent: clarity
Original: Isogeometric Analysis allows high-order discretizations of boundary value problems using a number of degrees of freedom which is as small as for a low-order method.
Revised: Isogeometric Analysis allows high-order discretization method for boundary value problems using a number of degrees of freedom which is as small as for a low-order method.
Edit intent: fluency
Original: Isogeometric Analysis allows high-order discretizations of boundary value problems using a number of degrees of freedom which is as small as for a low-order method.
Revised: Isogeometric Analysis allows high-order discretizations of boundary value problems that uses a number of degrees of freedom which is as small as for a low-order method.
Edit intent: fluency
Original:  In non-trivial cases, the computational domain is typically decomposed into several patches , where for each patch a separate isogeometric discretization is chosen .
Revised:  In non-trivial cases, the domain is decomposed into patches having separate parameterizations and separate discretization spaces .
Edit intent: clarity
Original:  If the discretization agrees on the interfaces between the patches, the coupling can be done in a conforming way.
Revised:  If the discretization spaces agree on the interfaces between the patches, the coupling can be done in a conforming way.
Edit intent: clarity
Original:  Hyperparameter optimization is unnecessarily slowwhen optimizers waste time exploring redundant options ( i.e., pairs of tunings with indistinguishably different results) .
Revised:  Hyperparameter optimization is unnecessarily slowwhen optimizers waste time exploring "redundant tunings"', i.e., pairs of tunings with indistinguishably different results) .
Edit intent: clarity
Original:  Hyperparameter optimization is unnecessarily slowwhen optimizers waste time exploring redundant options ( i.e., pairs of tunings with indistinguishably different results) .
Revised:  Hyperparameter optimization is unnecessarily slowwhen optimizers waste time exploring redundant options ( i.e., pairs of tunings which lead to indistinguishable results .
Edit intent: clarity
Original:  By ignoring redundant tunings, the Dodge(E) hyperparameter optimization toolcan run orders of magnitude faster, yet still find better tunings than prior state-of-the-art algorithms (for software defect prediction and software text mining) .
Revised:  By ignoring redundant tunings, DODGE, a tuning tool, runs orders of magnitude faster, yet still find better tunings than prior state-of-the-art algorithms (for software defect prediction and software text mining) .
Edit intent: clarity
Original:  By ignoring redundant tunings, the Dodge(E) hyperparameter optimization toolcan run orders of magnitude faster, yet still find better tunings than prior state-of-the-art algorithms (for software defect prediction and software text mining) .
Revised:  By ignoring redundant tunings, the Dodge(E) hyperparameter optimization toolcan run orders of magnitude faster, while also generating learners with more accurate predictions than seen in prior state-of-the-art algorithms (for software defect prediction and software text mining) .
Edit intent: clarity
Original:  By ignoring redundant tunings, the Dodge(E) hyperparameter optimization toolcan run orders of magnitude faster, yet still find better tunings than prior state-of-the-art algorithms (for software defect prediction and software text mining) .
Revised:  By ignoring redundant tunings, the Dodge(E) hyperparameter optimization toolcan run orders of magnitude faster, yet still find better tunings than prior state-of-the-art approaches .
Edit intent: clarity