wanyu/IteraTeR_v2 huggingface dataset:
Original: Evolutionary computation is a promising approach to autonomously synthesize machines with abilities that resemble those of animals, but the field suffers from a lack of strong foundations.
Revised: Evolutionary robotics is a promising approach to autonomously synthesize machines with abilities that resemble those of animals, but the field suffers from a lack of strong foundations.
Edit intent: clarity
Original:  To counter theses limitations, we introduce the concept of "evolvability signatures", which picture the  statistical distribution of behavior diversity and fitness after mutations .
Revised:  To counter these limitations, we introduce the concept of "evolvability signatures", which picture the statistical distribution of behavior diversity and fitness after mutations .
Edit intent: fluency
Original:  We tested the relevance of this concept by evolving controllers for hexapod robot locomotion using five different genotype-to-phentoype mappings (direct encoding, generative encoding of open-loop and closed-loop central pattern generators, generative encoding of neural networks, and single-unit pattern generators (SUPG)).
Revised:  We tested the relevance of this concept by evolving controllers for hexapod robot locomotion using five different genotype-to-phenotype mappings (direct encoding, generative encoding of open-loop and closed-loop central pattern generators, generative encoding of neural networks, and single-unit pattern generators (SUPG)).
Edit intent: fluency
Original:  Overall, our evolvability signatures neatly complement existing task-performance benchmarks, and pave the way for stronger foundations for research in evolutionary computation .
Revised:  Overall, our evolvability signatures neatly complement existing task-performance benchmarks, and pave the way for stronger foundations for research in evolutionary robotics .
Edit intent: clarity
Original:  We show that for any finite collection A of atoms that are definable in ESO(FOC^2), the satisfiability problem of the two-variable fragment of FO(A) is NEXPTIME-complete  .
Revised:  We show that the satisfiability problems of two-variable fragment of FO(A) is NEXPTIME-complete .
Edit intent: clarity
Original:  Using this characterization, we provide (alternative) proofs of the constant-query testability of several affine-invariant properties , including low-degree polynomials .
Revised:  Using this characterization, we show that the property of being a function of a constant number of low-degree polynomials .
Edit intent: clarity
Original: A data automaton is a finite automaton equipped with variables (counters  ) ranging over a multi-sorted data domain.
Revised: A data automaton is a finite automaton equipped with variables (counters ) ranging over a multi-sorted data domain.
Edit intent: fluency
Original:  We observe, in addition to the finite alphabet of actions, the values taken by the counters along a run of the automaton , and consider the data languages recognized by these automata .
Revised:  We observe, in addition to the finite alphabet of actions, the values taken by the counters during an execution of the automaton , and consider the data languages recognized by these automata .
Edit intent: clarity
Original:  We observe, in addition to the finite alphabet of actions, the values taken by the counters along a run of the automaton , and consider the data languages recognized by these automata .
Revised:  We observe, in addition to the finite alphabet of actions, the values taken by the counters along a run of the automaton .
Edit intent: clarity
Original:  The problem addressed in this paper is the inclusion between the data languages recognized by such automata.
Revised:  The problem addressed in this paper is the inclusion between the sets of traces (data languages) recognized by such automata.
Edit intent: clarity
Original:  Since the problem is undecidable, we give an abstraction-refinement semi-algorithm , proved to be sound and complete, but whose termination is not guaranteed.
Revised:  Since the problem is undecidable, we give a semi-algorithm , proved to be sound and complete, but whose termination is not guaranteed.
Edit intent: clarity
Original:  We have implemented our technique in a  prototype tool and show promising results on several non-trivial examples.
Revised:  We have implemented our technique in a ~ prototype tool and show promising results on several non-trivial examples.
Edit intent: fluency
Original: Continuing our previous research on color image compression 1 , we move towards hyper-spectral image compression.
Revised: Continuing our previous research on color image compression , we move towards hyper-spectral image compression.
Edit intent: coherence
Original:  The principle component analysis (PCA) can be employed to reduce the dimensions of spectral images to achieve high compressibility and performance 2 . Due to processing complexity of PCA, a simple interpolation technique called cubic spline interpolation (CSI) was considered to reduce the dimensionality of spectral domain of hyper-spectral images.
Revised:  The principle component analysis (PCA) can be employed to reduce the dimensions of spectral images to achieve high compressibility and performance . Due to processing complexity of PCA, a simple interpolation technique called cubic spline interpolation (CSI) was considered to reduce the dimensionality of spectral domain of hyper-spectral images.
Edit intent: coherence
Original:  Four hyper-spectral images were taken as test images 3 . The CSI and PCA were employed one by one in the spectral domain and can be amalgamated with the JPEG, which was employed in spatial domain.
Revised:  Four hyper-spectral images were taken as test images . The CSI and PCA were employed one by one in the spectral domain and can be amalgamated with the JPEG, which was employed in spatial domain.
Edit intent: coherence
Original:  Four hyper-spectral images were taken as test images 3 . The CSI and PCA were employed one by one in the spectral domain and can be amalgamated with the JPEG, which was employed in spatial domain.
Revised:  Four hyper-spectral images were taken as test images 3 . The CSI and PCA were employed one by one in the spectral domain and were amalgamated with the JPEG, which was employed in spatial domain.
Edit intent: clarity
Original:  Three measures including compression rate (CR), processing time (Tp) and  CIEDE2000 4 were used for performance analysis.
Revised:  Three measures including compression rate (CR), processing time (Tp) and CIEDE2000 were used for performance analysis.
Edit intent: clarity
Original:  The CIEDE2000 is CIE color difference formula, best correlated with the human visual perception 1,4 . Being color scientists, we believe that color difference less than 1.0 CIEDE2000 units is bearable.
Revised:  The CIEDE2000 is CIE color difference formula, best correlated with the human visual perception . Being color scientists, we believe that color difference less than 1.0 CIEDE2000 units is bearable.
Edit intent: coherence
Original:  The CIEDE2000 is CIE color difference formula, best correlated with the human visual perception 1,4 . Being color scientists, we believe that color difference less than 1.0 CIEDE2000 units is bearable.
Revised:  The CIEDE2000 is CIE color difference formula, best correlated with the human visual perception 1,4 .
Edit intent: coherence
Original:  Test results showed that for a fixed value of compression rate (CR=6, 8, 10) , CSI based algorithm performed poor in terms of dE00, in comparison with PCA, but is still reliable because of small color difference with the original image data.
Revised:  Test results showed that for a fixed value of compression rate , CSI based algorithm performed poor in terms of dE00, in comparison with PCA, but is still reliable because of small color difference with the original image data.
Edit intent: coherence
Original: Continuing our previous research on color image compression, we move towards hyper-spectral image compression.
Revised: Continuing our previous research on color image compression, we move towards spectral image compression.
Edit intent: clarity
Original:  The performance results of both algorithms were then compared in terms of compressibility, processing complexity and reliability.
Edit intent: coherence
Original:  The CIEDE2000 is CIE color difference formula, best correlated with the human visual perception.
Edit intent: coherence
Original:  Test results showed that for a fixed value of compression rate, CSI based algorithm performed poor in terms of dE00, in comparison with PCA, but is still reliable because of small color difference with the original image data .
Revised:  Test results showed that for a fixed value of compression rate, CSI based algorithm performed poor in terms of dE00, in comparison with PCA, but is still reliable because of small color difference .
Edit intent: clarity
Original:  On the other hand it has lower complexity and is computationally much better as compared to PCA based algorithm, especially for spectral images with large size images .
Revised:  On the other hand it has lower complexity and is computationally much better as compared to PCA based algorithm, especially for spectral images with large size .
Edit intent: clarity
Original: In the present paper, we focus on susceptible-infected-susceptible dynamics on metapopulation networks in which nodes represent subpopulations  . Recent studies suggest that heterogeneous network structure between elements plays an important role in determining the threshold of infection rate at the onset of epidemics, one of fundamental quantities governing epidemic dynamics.
Revised: In this paper, we focus on susceptible-infected-susceptible dynamics on metapopulation networks in which nodes represent subpopulations . Recent studies suggest that heterogeneous network structure between elements plays an important role in determining the threshold of infection rate at the onset of epidemics, one of fundamental quantities governing epidemic dynamics.
Edit intent: coherence
Original: In the present paper, we focus on susceptible-infected-susceptible dynamics on metapopulation networks in which nodes represent subpopulations  . Recent studies suggest that heterogeneous network structure between elements plays an important role in determining the threshold of infection rate at the onset of epidemics, one of fundamental quantities governing epidemic dynamics.
Revised: In the present paper, we focus on susceptible-infected-susceptible dynamics on metapopulation networks , where nodes represent subpopulations . Recent studies suggest that heterogeneous network structure between elements plays an important role in determining the threshold of infection rate at the onset of epidemics, one of fundamental quantities governing epidemic dynamics.
Edit intent: clarity
Original: In the present paper, we focus on susceptible-infected-susceptible dynamics on metapopulation networks in which nodes represent subpopulations  . Recent studies suggest that heterogeneous network structure between elements plays an important role in determining the threshold of infection rate at the onset of epidemics, one of fundamental quantities governing epidemic dynamics.
Revised: In the present paper, we focus on susceptible-infected-susceptible dynamics on metapopulation networks in which nodes represent subpopulations . Recent studies suggest that heterogeneous network structure between elements plays an important role in determining the threshold of infection rate at the onset of epidemics, a fundamental quantity governing the epidemic dynamics.
Edit intent: fluency
Original:  We prove that the sufficient condition for the endemic threshold (i.e., its upper bound), which was previously derived based on a mean-field approximation of network structure, also holds true for arbitrary networks.
Revised:  We first prove that a sufficient condition for the endemic threshold (i.e., its upper bound), which was previously derived based on a mean-field approximation of network structure, also holds true for arbitrary networks.
Edit intent: coherence
Original:  We prove that the sufficient condition for the endemic threshold (i.e., its upper bound), which was previously derived based on a mean-field approximation of network structure, also holds true for arbitrary networks.
Revised:  We prove that the sufficient condition for the endemic threshold (i.e., its upper bound), previously derived based on a mean-field approximation of network structure, also holds true for arbitrary networks.
Edit intent: coherence
Original:  We also derive an improved condition which implies that networks with the rich-club property ( that is , high connectivity between nodes with  large number of links) are more favorable to disease spreading.
Revised:  We also derive an improved condition showing that networks with the rich-club property ( that is , high connectivity between nodes with large number of links) are more favorable to disease spreading.
Edit intent: clarity
Original:  We also derive an improved condition which implies that networks with the rich-club property ( that is , high connectivity between nodes with  large number of links) are more favorable to disease spreading.
Revised:  We also derive an improved condition which implies that networks with the rich-club property ( i.e. , high connectivity between nodes with large number of links) are more favorable to disease spreading.
Edit intent: clarity
Original:  We also derive an improved condition which implies that networks with the rich-club property ( that is , high connectivity between nodes with  large number of links) are more favorable to disease spreading.
Revised:  We also derive an improved condition which implies that networks with the rich-club property ( that is , high connectivity between nodes with a large number of links) are more favorable to disease spreading.
Edit intent: fluency
Original:  We also derive an improved condition which implies that networks with the rich-club property ( that is , high connectivity between nodes with  large number of links) are more favorable to disease spreading.
Revised:  We also derive an improved condition which implies that networks with the rich-club property ( that is , high connectivity between nodes with large number of links) are more prone to disease spreading.
Edit intent: clarity
Original:  We verify the theoretical results with agent-based numerical simulations.
Revised:  We verify the theoretical results with numerical simulations.
Edit intent: clarity
Original: The means by which cortical neural networks are able to efficiently solve inference problems remains on open question in computational neuroscience.
Revised: The means by which cortical neural networks are able to efficiently solve inference problems remains an open question in computational neuroscience.
Edit intent: fluency
Original: This paper presents the SPARE C++ library, an open source software tool conceived to build generic pattern recognition and soft computing systems.
Revised: This paper presents the SPARE C++ library, an open source software tool conceived to build pattern recognition and soft computing systems.
Edit intent: clarity
Original:  The library follows the requirement of the generality: most of the implemented algorithms are able to process user-defined input data types transparently, such as labeled graphs and generalized sequences , as well as standard feature vectors.
Revised:  The library follows the requirement of the generality: most of the implemented algorithms are able to process user-defined input data types transparently, such as labeled graphs and sequences of objects , as well as standard feature vectors.
Edit intent: clarity
Original:  In particular, as a proof of concept, we discuss two application instances involving clustering of real-valued multidimensional sequences and classification of labeled graphs data .
Revised:  In particular, as a proof of concept, we discuss two application instances involving clustering of real-valued multidimensional sequences and classification of labeled graphs .
Edit intent: clarity
Original:  Often, segments between two haplotypes are said to be IBD if they are inherited from a recent shared common ancestor without intervening recombination.
Revised:  In a common definition, two haplotypes are said to be IBD if they are inherited from a recent shared common ancestor without intervening recombination.
Edit intent: clarity
Original:  Often, segments between two haplotypes are said to be IBD if they are inherited from a recent shared common ancestor without intervening recombination.
Revised:  Often, segments between two haplotypes are said to contain an IBD segment if they share a segment that is inherited from a recent shared common ancestor without intervening recombination.
Edit intent: clarity
Original:  Long IBD blocks (> 1cM) can be efficiently detected by a number of computer programs using high-density SNP array data from a population sample.
Revised:  Long IBD segments (> 1cM) can be efficiently detected by a number of computer programs using high-density SNP array data from a population sample.
Edit intent: clarity
Original:  Long IBD blocks (> 1cM) can be efficiently detected by a number of computer programs using high-density SNP array data from a population sample.
Revised:  Long IBD blocks (> 1cM) can be efficiently detected by a number of algorithms using high-density SNP array data from a population sample.
Edit intent: clarity
Original:  However, all programs detect IBD based on contiguous segments of identity-by-state, and can therefore be due to the conflation of smaller, nearby IBD blocks .
Revised:  However, these approaches detect IBD based on contiguous segments of identity-by-state, and can therefore be due to the conflation of smaller, nearby IBD blocks .
Edit intent: clarity
Original:  However, all programs detect IBD based on contiguous segments of identity-by-state, and can therefore be due to the conflation of smaller, nearby IBD blocks .
Revised:  However, all programs detect IBD based on contiguous segments of identity-by-state, and such segments may exist due to the conflation of smaller, nearby IBD blocks .
Edit intent: clarity
Original:  However, all programs detect IBD based on contiguous segments of identity-by-state, and can therefore be due to the conflation of smaller, nearby IBD blocks .
Revised:  However, all programs detect IBD based on contiguous segments of identity-by-state, and can therefore be due to the conflation of smaller, nearby IBD segments .
Edit intent: clarity
Original:  We quantified this effect using coalescent simulations, finding that nearly 40\% of inferred blocks 1-2cM long are false conflations of two or more longer blocks , under demographic scenarios typical for modern humans.
Revised:  We quantified this effect using coalescent simulations, finding that nearly 40\% of inferred blocks 1-2cM long are results of conflations of two or more longer blocks , under demographic scenarios typical for modern humans.
Edit intent: clarity
Original:  We then present and analyze a novel estimator of the de novo mutation rate using IBD blocks , and demonstrate that the biased length distribution of the IBD segments due to conflation can strongly affect this estimator if the conflation is not modeled.
Revised:  We then present and analyze a novel estimator of the de novo mutation rate using IBD segments , and demonstrate that the biased length distribution of the IBD segments due to conflation can strongly affect this estimator if the conflation is not modeled.
Edit intent: clarity
Original:  We then present and analyze a novel estimator of the de novo mutation rate using IBD blocks , and demonstrate that the biased length distribution of the IBD segments due to conflation can strongly affect this estimator if the conflation is not modeled.
Revised:  We then present and analyze a novel estimator of the de novo mutation rate using IBD blocks , and demonstrate that the biased length distribution of the IBD segments due to conflation can lead to inflated estimates if the conflation is not modeled.
Edit intent: clarity
Original:  Thus, the conflation effect should be carefully considered, especially as methods to detect shorter IBD blocks using sequencing data are being developed .
Revised:  Understanding the conflation effect should be carefully considered, especially as methods to detect shorter IBD blocks using sequencing data are being developed .
Edit intent: coherence
Original:  Thus, the conflation effect should be carefully considered, especially as methods to detect shorter IBD blocks using sequencing data are being developed .
Revised:  Thus, the conflation effect in detail will make its correction in future methods more tractable .
Edit intent: clarity
Original:  The developed techniques also improve the state of the art in multiplicity word automata: we give an NC algorithm for minimising  word automata.
Revised:  The developed techniques also improve the state of the art in multiplicity word automata: we give an NC algorithm for minimising multiplicity word automata.
Edit intent: fluency
Original:  Finally, we consider the minimal consistency problem: does there exist an automaton with n states that is consistent with a given finite sample set mapping treesto weights ?
Revised:  Finally, we consider the minimal consistency problem: does there exist an automaton with n states that is consistent with a given finite sample of weight-labelled words or trees ?
Edit intent: clarity
Original: The syntactic structure of a sentence can be modeled as a tree where vertices are words and edges indicates syntactic dependencies between words.
Revised: The syntactic structure of a sentence can be modeled as a tree where vertices are words and edges indicate syntactic dependencies between words.
Edit intent: fluency
Original:  Our work paves the way for more powerful null hypotheses for investigating the origins of non-crossing dependencies in nature.
Revised:  Our work paves the way for more powerful null hypotheses to investigate the origins of non-crossing dependencies in nature.
Edit intent: fluency
Original: We consider a generalized model of cell population dynamics with n different phenotypes.
Revised: We consider the cell population dynamics with n different phenotypes.
Edit intent: clarity
Original:  's paper  . As an application, we will also give sufficient and necessary conditions under which the proportion of one phenotype tends to 0 or 1.
Revised:  's paper . As an application, we will give sufficient and necessary conditions under which the proportion of one phenotype tends to 0 or 1.
Edit intent: clarity
Original:  We find a remarkable consistency of a power-law, specifically lognormal, distribution across observations from auditory or visual cortex as well as midbrain nuclei, cerebellar Purkinje cells and striatal medium spiny neurons.
Revised:  We find a remarkable consistency of power-law, specifically lognormal, distribution across observations from auditory or visual cortex as well as midbrain nuclei, cerebellar Purkinje cells and striatal medium spiny neurons.
Edit intent: fluency
Original:  The difference between strongly recurrent and transfer connectivity (cortex vs. striatum and cerebellum), or the level of activation (low in cortex, high in Purkinje cells and midbrain nuclei) seems to be irrelevant for these distributions.
Revised:  The difference between strongly recurrent and transfer connectivity (cortex vs. striatum and cerebellum), or the level of activation (low in cortex, high in Purkinje cells and midbrain nuclei) turns out to be irrelevant for these distributions.
Edit intent: clarity
Original: In this paper we document lognormal distributions for spike rates, synaptic weights and intrinsic excitability (gain) for neurons in various brain areas, such as auditory or visual cortex,  cerebellum, striatum, midbrain nuclei.
Revised: In this paper , we present data for the lognormal distributions of spike rates, synaptic weights and intrinsic excitability (gain) for neurons in various brain areas, such as auditory or visual cortex, cerebellum, striatum, midbrain nuclei.
Edit intent: clarity