wanyu/IteraTeR_v2 huggingface dataset:
Original: Although researchers often discuss the popularity of meta-heuristics ( MH ), there has been a paucity of data to  support the notion that MH are growing in prominence compared to deterministic methods (DM) . Here we provide the first evidence that MH usage is not only growing, but  appears to have surpassed DM as the algorithm framework of choice for solving optimization problems.
Revised: Although researchers often discuss the popularity of meta-heuristics ( MH ), there has been a paucity of data to support the notion that MH are growing in prominence compared to deterministic methods (DM) . Here we provide the first evidence that MH usage is not only growing, but indeed appears to have surpassed DM as the algorithm framework of choice for solving optimization problems.
Edit intent: coherence
Original:  We argue that a more compelling explanation would directly account for the manner in which most MH success has been achieved, e.g. through customization to a particular problem environment.
Revised:  We argue that a compelling and comprehensive explanation should directly account for the manner in which most MH success has been achieved, e.g. through customization to a particular problem environment.
Edit intent: clarity
Original: Although researchers often discuss the rising popularity of nature-inspired meta-heuristics (NIM), there has been a paucity of data to directly support the notion that NIM are growing in prominence compared to other optimization techniques.
Revised: Although researchers often comment on the rising popularity of nature-inspired meta-heuristics (NIM), there has been a paucity of data to directly support the notion that NIM are growing in prominence compared to other optimization techniques.
Edit intent: style
Original: Although researchers often discuss the rising popularity of nature-inspired meta-heuristics (NIM), there has been a paucity of data to directly support the notion that NIM are growing in prominence compared to other optimization techniques.
Revised: Although researchers often discuss the rising popularity of nature-inspired meta-heuristics (NIM), there has been a paucity of data to directly support the claim that NIM are growing in prominence compared to other optimization techniques.
Edit intent: clarity
Original:  Here we provide the first evidence that NIM usage is not only growing, but indeed appears to have surpassed mathematical optimization techniques (MOT) in several important metrics related to academic research activity (publication frequency) and commercial activity (patenting frequency).
Revised:  This study presents evidence that the use of NIM is not only growing, but indeed appears to have surpassed mathematical optimization techniques (MOT) in several important metrics related to academic research activity (publication frequency) and commercial activity (patenting frequency).
Edit intent: clarity
Original:  Motivated by these findings, this paper aims to review and discuss the origins of this growing NIM dominance.
Revised:  Motivated by these findings, this article discusses some of the possible origins of this growing NIM dominance.
Edit intent: clarity
Original:  We argue that a compelling and comprehensive explanation should directly account for the manner in which most NIM success has actually been achieved, e.g. through hybridization and customization to different problem environments.
Revised:  I argue that a compelling and comprehensive explanation should directly account for the manner in which most NIM success has actually been achieved, e.g. through hybridization and customization to different problem environments.
Edit intent: fluency
Original:  By taking a problem lifecycle perspective, this paper explores and expands upon the hypothesis that nature-inspired meta-heuristics derive much of their utility from being flexible.
Revised:  By taking a problem lifecycle perspective, this paper offers a fresh look at the hypothesis that nature-inspired meta-heuristics derive much of their utility from being flexible.
Edit intent: clarity
Original:  We discuss global trends within the business environments where optimization algorithms are applied and we speculate that highly flexible algorithm frameworks will become increasingly popular within our diverse and rapidly changing world.
Revised:  We discuss global trends within the business environments where optimization algorithms are applied and I speculate that highly flexible algorithm frameworks will become increasingly popular within our diverse and rapidly changing world.
Edit intent: style
Original:  We discuss global trends within the business environments where optimization algorithms are applied and we speculate that highly flexible algorithm frameworks will become increasingly popular within our diverse and rapidly changing world.
Revised:  We discuss global trends within the business environments where optimization algorithms are applied and we speculate that highly flexible algorithm frameworks could become increasingly popular within our diverse and rapidly changing world.
Edit intent: clarity
Original: We study the phase diagram of the standard pair approximation equations for two different models in population dynamics, the Susceptible-Infective-Recovered-Susceptible model of infection spread and a predator-prey interaction model, on a network of homogeneous degree k.
Revised: We study the phase diagram of the standard pair approximation equations for two different models in population dynamics, the susceptible-infective-recovered-susceptible model of infection spread and a predator-prey interaction model, on a network of homogeneous degree k.
Edit intent: fluency
Original:  A file is split into several pieces called chunks, the general simple principle  is that once a node of the system has retrieved a chunk , it may become a server for this chunk.
Revised:  A file is split into several pieces called chunks, the general simple principle of these systems is that once a node of the system has retrieved a chunk , it may become a server for this chunk.
Edit intent: clarity
Original:  A file is split into several pieces called chunks, the general simple principle  is that once a node of the system has retrieved a chunk , it may become a server for this chunk.
Revised:  A file is split into several pieces called chunks, the general simple principle is that once a node has retrieved a chunk , it may become a server for this chunk.
Edit intent: clarity
Original:  A file is split into several pieces called chunks, the general simple principle  is that once a node of the system has retrieved a chunk , it may become a server for this chunk.
Revised:  A file is split into several pieces called chunks, the general simple principle is that once a node of the system has retrieved a file , it may become a server for this chunk.
Edit intent: fluency
Original: An algebraic tree t is one determined by a finite system of fixed point equations.
Revised: An algebraic tree T is one determined by a finite system of fixed point equations.
Edit intent: fluency
Original:  The frontier \Fr( t ) of an algebraic tree t is linearly ordered by the lexicographic order \lex.
Revised:  The frontier \Fr( T ) of an algebraic tree t is linearly ordered by the lexicographic order \lex.
Edit intent: fluency
Original:  The highlights of this work : (i) an algorithm to sort a list of numbers with optimal expected limiting complexity;
Revised:  The highlights of this work : (i) sorting a sequence of numbers
Edit intent: clarity
Original:  and (ii) an algorithm to compute the Delaunay triangulation of a set of points with optimal expected limiting complexity.
Revised:  and (ii) computing the Delaunay triangulation of a set of points with optimal expected limiting complexity.
Edit intent: clarity
Original:  In both cases, the algorithm begins with a training phase during which it adjusts itself to the input distribution, followed by a stationary regime in which the algorithm settles to its optimized incarnation .
Revised:  The algorithms begin with a training phase during which it adjusts itself to the input distribution, followed by a stationary regime in which the algorithm settles to its optimized incarnation .
Edit intent: clarity
Original:  In both cases, the algorithm begins with a training phase during which it adjusts itself to the input distribution, followed by a stationary regime in which the algorithm settles to its optimized incarnation .
Revised:  In both cases, the algorithm begins with a training phase during which they collect information about the input distribution, followed by a stationary regime in which the algorithm settles to its optimized incarnation .
Edit intent: clarity
Original:  In both cases, the algorithm begins with a training phase during which it adjusts itself to the input distribution, followed by a stationary regime in which the algorithm settles to its optimized incarnation .
Revised:  In both cases, the algorithm begins with a training phase during which it adjusts itself to the input distribution, followed by a stationary regime in which the algorithms settle to their optimized incarnations .
Edit intent: clarity
Original: In this paper we consider a class of BSDE with drivers of quadratic growth, on a stochastic basis generated by continuous local martingales.
Revised: In this paper we consider a class of BSDEs with drivers of quadratic growth, on a stochastic basis generated by continuous local martingales.
Edit intent: fluency
Original:  We first derive the Markov property of a forward-backward system (FBSDE) if the generating martingale is a strong Markov process.
Revised:  We first derive the Markov property of a forward--backward system (FBSDE) if the generating martingale is a strong Markov process.
Edit intent: fluency
Original:  This is the first time that differential equations have been used to establish upper bounds on a satisfiability threshold  , and our techniques may apply to various classical problems as well.
Revised:  Our use of differential equation to establish upper bounds on a satisfiability threshold , and our techniques may apply to various classical problems as well.
Edit intent: coherence
Original: We show how the necessary and sufficient conditions for the NFL to apply can be reduced to the single requirement of the set of objectives under consideration being closed under permutation, and quantify the extent to which a set of objectives not closed under permutation can give rise to a performance difference between two algorithms.
Revised: We show how the necessary and sufficient conditions for the NFL to apply can be reduced to the single requirement of the set of objective functions under consideration being closed under permutation, and quantify the extent to which a set of objectives not closed under permutation can give rise to a performance difference between two algorithms.
Edit intent: clarity
Original:  Then we provide a more refined definition of performance under we to show that revisiting algorithms are always trumped by enumerative ones.
Revised:  Then we provide a more refined definition of performance under which we show that revisiting algorithms are always trumped by enumerative ones.
Edit intent: clarity
Original:  For our kernelization algorithm we find a subclass of tournaments where one can find a minimum sized feedback arc set in polynomial time and use the known polynomial time approximation scheme for k-FAST.
Revised:  Our kernelization algorithm solves the problem on a subclass of tournaments where one can find a minimum sized feedback arc set in polynomial time and use the known polynomial time approximation scheme for k-FAST.
Edit intent: clarity
Original:  For our kernelization algorithm we find a subclass of tournaments where one can find a minimum sized feedback arc set in polynomial time and use the known polynomial time approximation scheme for k-FAST.
Revised:  For our kernelization algorithm we find a subclass of tournaments in polynomial time and use the known polynomial time approximation scheme for k-FAST.
Edit intent: coherence
Original:  For our kernelization algorithm we find a subclass of tournaments where one can find a minimum sized feedback arc set in polynomial time and use the known polynomial time approximation scheme for k-FAST.
Revised:  For our kernelization algorithm we find a subclass of tournaments where one can find a minimum sized feedback arc set in polynomial time and uses a known polynomial time approximation scheme for k-FAST.
Edit intent: fluency
Original:  The idea is that the computation is done without such logic operations as AND or OR , or any other conventional bit logic operations .
Revised:  The idea is that the computation can be done without logic operations such as AND or OR , or any other conventional bit logic operations .
Edit intent: clarity
Original:  The idea is that the computation is done without such logic operations as AND or OR , or any other conventional bit logic operations .
Revised:  The idea is that the computation is done without such logic operations as AND or OR .
Edit intent: clarity
Original:  The compiler and emulator of the language with sample programs can freely be downloaded from the web .
Revised:  The compiler and emulator of this language with sample programs can freely be downloaded from the web .
Edit intent: fluency
Original:  The compiler and emulator of the language with sample programs can freely be downloaded from the web .
Revised:  The compiler and emulator of the language with sample programs are available on the Internet .
Edit intent: clarity
Original:  We extract the page's title, generate the page's lexical signature (LS), query the bookmarking website delicious.com for the page's tags and generate a LS from the page's link neighborhood.
Revised:  We extract the page's title, generate the page's lexical signature (LS), obtain the page's tags from the bookmarking website delicious.com for the page's tags and generate a LS from the page's link neighborhood.
Edit intent: clarity
Original:  We extract the page's title, generate the page's lexical signature (LS), query the bookmarking website delicious.com for the page's tags and generate a LS from the page's link neighborhood.
Revised:  We extract the page's title, generate the page's lexical signature (LS), query the bookmarking website delicious.com and generate a LS from the page's link neighborhood.
Edit intent: clarity
Original:  Our results show that both LSs and titles perform fairly well with over 60\% URLs returned top ranked from Yahoo  .
Revised:  Our results show that both LSs and titles perform fairly well with over 60\% URIs returned top ranked from Yahoo .
Edit intent: clarity
Original:  Our results show that both LSs and titles perform fairly well with over 60\% URLs returned top ranked from Yahoo  .
Revised:  Our results show that both LSs and titles perform fairly well with over 60\% URLs returned top ranked from Yahoo ! .
Edit intent: fluency
Original:  This combination accounts for more than 75\% top ranked URLs .
Revised:  This combination accounts for more than 75\% top ranked URIs .
Edit intent: fluency
Original: An efficient algorithm is presented for factoring polynomials over an algebraic extension field.
Revised: An efficient algorithm is proposed for factoring polynomials over an algebraic extension field.
Edit intent: clarity
Original:  If the  ideal is given by its Gr\"obner basis, no extra Gr\"obner basis computation is needed for factoring a polynomial over the extension field.
Revised:  If the ideal is given by its Gr\"obner basis, no extra Gr\"obner basis computation is needed for factoring a polynomial over this extension field.
Edit intent: fluency
Original:  We will only use linear algebra to get a polynomial over the base field by a generic linear map , and this polynomial will be factorized over the base field.
Revised:  Nothing more than linear algebraic technique is used to get a polynomial over the base field by a generic linear map , and this polynomial will be factorized over the base field.
Edit intent: clarity
Original:  We will only use linear algebra to get a polynomial over the base field by a generic linear map , and this polynomial will be factorized over the base field.
Revised:  We will only use linear algebra to get a polynomial over the ground field by a generic linear map , and this polynomial will be factorized over the base field.
Edit intent: fluency
Original:  We will only use linear algebra to get a polynomial over the base field by a generic linear map , and this polynomial will be factorized over the base field.
Revised:  We will only use linear algebra to get a polynomial over the base field by a generic linear map . Then this polynomial is factorized over the base field.
Edit intent: coherence
Original:  We will only use linear algebra to get a polynomial over the base field by a generic linear map , and this polynomial will be factorized over the base field.
Revised:  We will only use linear algebra to get a polynomial over the base field by a generic linear map , and this polynomial will be factorized over the ground field.
Edit intent: fluency
Original:  From these factors, the factorization of the polynomial over the extension field can be obtained.
Revised:  From these factors, the factorization of the polynomial over the extension field is obtained.
Edit intent: clarity
Original:  The  algorithm has been implemented and the experiments show that our algorithm is very efficient  .
Revised:  The algorithm has been implemented and computer experiments indicate that the new algorithm is very efficient .
Edit intent: clarity
Original:  We propose a method to visualize the wiring diagram, which reflects network information flow.
Revised:  We propose a method to visualize the wiring diagram, which reflects network signal flow.
Edit intent: clarity
Original:  We calculate statistical and topological properties of the network, such as degree distributions, synaptic multiplicities, and small-world properties, that help in understanding network information propagation.
Revised:  We calculate statistical and topological properties of the network, such as degree distributions, synaptic multiplicities, and small-world properties, that help in understanding network signal propagation.
Edit intent: clarity
Original:  The wiring diagram reported here can help in understanding the mechanistic basis of behavior by generating predictions about future experiments involving genetic perturbations, laser ablations, or monitoring propagation of  activity in response to stimulation.
Revised:  The wiring diagram reported here can help in understanding the mechanistic basis of behavior by generating predictions about future experiments involving genetic perturbations, laser ablations, or monitoring propagation of neuronal activity in response to stimulation.
Edit intent: clarity
Original: We demonstrate a device made of molecules and nanoparticles, a nanoparticle organic memory field-effect transistor (NOMFET), which exhibits the main behavior of a biological spiking synapse.
Revised: We demonstrate a device made of molecules and nanoparticles, a nanoparticle organic memory filed-effect transistor (NOMFET), which exhibits the main behavior of a biological spiking synapse.
Edit intent: fluency
Original:  Short-term plasticity, facilitating and depressing behaviors can be  programmed.
Revised:  Facilitating and depressing synaptic behaviors can be programmed.
Edit intent: clarity
Original:  We can tailor the dynamic behavior in the frequency/time domain by adjusting the size of both the NPs and the NOMFET.
Edit intent: coherence
Original:  These results open the way to use NOMFET in dynamical neuromorphic computing circuits, or as a building block of neuroelectronics for interfacing biologic neurons or neuronal logic devices with solid-state devices and circuits.
Revised:  These results open the way to use NOMFET in dynamical neuromorphic computing circuits.
Edit intent: coherence
Original:  We elucidate the ``pushdown'' mechanism, whereby the ornate enumeration of primitive MZVs, by weight and depth, is reconciled with the far simpler enumeration of primitive Euler sums.
Revised:  We elucidate the "pushdown" mechanism, whereby the ornate enumeration of primitive MZVs, by weight and depth, is reconciled with the far simpler enumeration of primitive Euler sums.
Edit intent: fluency
Original: We investigate diffusion-limited reactions between a diffusing particle and a target site on a semiflexible polymer, a key component of DNA-protein interaction and polymerization of cytoskeletal filaments.
Revised: We investigate diffusion-limited reactions between a diffusing particle and a target site on a semiflexible polymer, a key factor determining the kinetics of DNA-protein interaction and polymerization of cytoskeletal filaments.
Edit intent: clarity
Original: We investigate diffusion-limited reactions between a diffusing particle and a target site on a semiflexible polymer, a key component of DNA-protein interaction and polymerization of cytoskeletal filaments.
Revised: We investigate diffusion-limited reactions between a diffusing particle and a target site on a semiflexible polymer, a key component of DNA-protein binding and polymerization of cytoskeletal filaments.
Edit intent: clarity
Original:  Our theory focuses on two competing effects: internal polymer fluctuations, which speed up association, and  hydrodynamic coupling between the particle and chain, which inhibits association.
Revised:  Our theory focuses on two competing effects: internal polymer fluctuations, which speed up association, and the hydrodynamic coupling between the particle and chain, which inhibits association.
Edit intent: fluency
Original:  Our theory focuses on two competing effects: internal polymer fluctuations, which speed up association, and  hydrodynamic coupling between the particle and chain, which inhibits association.
Revised:  Our theory focuses on two competing effects: internal polymer fluctuations, which speed up association, and hydrodynamic coupling between the diffusing particle and the chain, which inhibits association.
Edit intent: clarity
Original:  The association rate depends on the stiffness of the polymer and the particle size, exhibiting a maximum as a function of persistence length and a minimum with particle radius.
Revised:  The association rate depends on the stiffness of the polymer and the particle size, exhibiting a maximum as a function of persistence length and a minimum for intermediate particle radius.
Edit intent: clarity
Original:  The quantitative predictions made by the theory can be tested in single molecule experiments .
Revised:  The quantitative predictions made by the theory can be tested experimentally .
Edit intent: clarity
Original:  We prove that it is surprisingly efficient on reformulated problems, in which the columns of the constraint matrix are short, and near orthogonal, i.e. a reduced basis of the generated lattice . Precisely, when the entries of the constraint matrix are from {1, ..., M} for a large enough M, branch-and-bound solves almost all reformulated instances at the rootnode.
Revised:  We prove that it is surprisingly efficient on reformulated problems, in which the columns of the constraint matrix are short, and near orthogonal, i.e. a reduced basis of the generated lattice ; when the entries of the constraint matrix are from {1, ..., M} for a large enough M, branch-and-bound solves almost all reformulated instances at the rootnode.
Edit intent: coherence
Original: The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints.
Revised: The degree of a CSP instance is the maximum number of times that any variable appears in the scopes of constraints.
Edit intent: clarity
Original:  We consider the approximate counting problem for Boolean CSPs with bounded-degree instances  for constraint languages containing the two unary constant relations {0} and {1}.
Revised:  We consider the approximate counting problem for Boolean CSP with bounded-degree instances for constraint languages containing the two unary constant relations {0} and {1}.
Edit intent: fluency