wanyu/IteraTeR_v2 huggingface dataset:
Original:  We find that the leaky integrate-and-fire neuron cannot reproduce the f-I curves of a cortical neuron, while the leaky integrate-and-fire neuron with an adapting threshold reproduce these curves very well.
Revised:  We find that the leaky integrate-and-fire model cannot reproduce the f-I curves of a cortical neuron, while the leaky integrate-and-fire neuron with an adapting threshold reproduce these curves very well.
Edit intent: clarity
Original:  We find that the leaky integrate-and-fire neuron cannot reproduce the f-I curves of a cortical neuron, while the leaky integrate-and-fire neuron with an adapting threshold reproduce these curves very well.
Revised:  We find that the leaky integrate-and-fire neuron cannot reproduce the f-I curve of a cortical neuron, while the leaky integrate-and-fire neuron with an adapting threshold reproduce these curves very well.
Edit intent: fluency
Original:  We find that the leaky integrate-and-fire neuron cannot reproduce the f-I curves of a cortical neuron, while the leaky integrate-and-fire neuron with an adapting threshold reproduce these curves very well.
Revised:  We find that the leaky integrate-and-fire neuron cannot reproduce the f-I curves of a cortical neuron, while the leaky integrate-and-fire model with a dynamical threshold can reproduce it very well.
Edit intent: clarity
Original:   These results suggest that cortical neurons have an adaptation mechanism and that this mechanism has some significance for the computational capabilities of a cortical neuron.
Revised:  These results suggest that a cortical neuron has an adaptation mechanism and that this mechanism has some significance for the computational capabilities of a cortical neuron.
Edit intent: fluency
Original:   These results suggest that cortical neurons have an adaptation mechanism and that this mechanism has some significance for the computational capabilities of a cortical neuron.
Revised:  These results suggest that cortical neurons have an adaptation mechanism and that this mechanism has some significance for the computational properties of a neuron.
Edit intent: clarity
Original: We studied the impact of a dynamical threshold on the f-I curve,the relationship between the input and the firing rate of a neuron, in the presence of background synaptic inputs.
Revised: We studied the impact of a dynamical threshold on the f-I curve-the relationship between the input and the firing rate of a neuron, in the presence of background synaptic inputs.
Edit intent: fluency
Original: We studied the impact of a dynamical threshold on the f-I curve,the relationship between the input and the firing rate of a neuron, in the presence of background synaptic inputs.
Revised: We studied the impact of a dynamical threshold on the f-I curve,the relationship between the input and the firing rate of a neuron-in the presence of background synaptic inputs.
Edit intent: fluency
Original:  First, we found that  the leaky integrate-and-fire model cannot reproduce the f-I curve of a cortical neuron, while the leaky integrate-and-fire model with a dynamical threshold can reproduce it very well.
Revised:  First, we found that , while the leaky integrate-and-fire model cannot reproduce the f-I curve of a cortical neuron, while the leaky integrate-and-fire model with a dynamical threshold can reproduce it very well.
Edit intent: coherence
Original:  First, we found that  the leaky integrate-and-fire model cannot reproduce the f-I curve of a cortical neuron, while the leaky integrate-and-fire model with a dynamical threshold can reproduce it very well.
Revised:  First, we found that the leaky integrate-and-fire model cannot reproduce the f-I curve of a cortical neuron, the leaky integrate-and-fire model with a dynamical threshold can reproduce it very well.
Edit intent: coherence
Original:  First, we found that  the leaky integrate-and-fire model cannot reproduce the f-I curve of a cortical neuron, while the leaky integrate-and-fire model with a dynamical threshold can reproduce it very well.
Revised:  First, we found that the leaky integrate-and-fire model cannot reproduce the f-I curve of a cortical neuron, while the leaky integrate-and-fire model with dynamical threshold can reproduce it very well.
Edit intent: fluency
Original:  These results suggest that a cortical neuron has an adaptation mechanism and  the dynamical threshold has some significance for the computational properties of a neuron.
Revised:  These results suggest that a cortical neuron has an adaptation mechanism and that the dynamical threshold has some significance for the computational properties of a neuron.
Edit intent: fluency
Original: We seek a route to the equilibrium where all the agents cooperate in the iterated prisoner's dilemma game on a two-dimensional plane, focusing on the role of Tit-for-tat strategy.
Revised: We seek a route to the equilibrium where all the agents cooperate in the iterated prisoner's dilemma game on a two-dimensional plane, focusing on the role of tit-for-tat strategy.
Edit intent: fluency
Original:  When a time horizon, within which a strategy can recall the past, is one time step, an equilibrium can be achieved as cooperating strategies dominate the whole population via proliferation of Tit-for-tat . Extending the time horizon, we filter out poor strategies by simplified replicator dynamics and observe a similar evolutionary pattern to reach the cooperating equilibrium.
Revised:  When a time horizon, within which a strategy can recall the past, is one time step, an equilibrium can be achieved as cooperating strategies dominate the whole population via proliferation of tit-for-tat . Extending the time horizon, we filter out poor strategies by simplified replicator dynamics and observe a similar evolutionary pattern to reach the cooperating equilibrium.
Edit intent: fluency
Original:  In particular, the rise of a modified Tit-for-tat strategy plays a central role, which implies how a robust strategy is adopted when provided with an enhanced memory capacity.
Revised:  In particular, the rise of a modified tit-for-tat strategy plays a central role, which implies how a robust strategy is adopted when provided with an enhanced memory capacity.
Edit intent: fluency
Original: We study spectral behaviour of sparsely connected random networks under the random matrix framework.
Revised: We study spectral behavior of sparsely connected random networks under the random matrix framework.
Edit intent: fluency
Original:  As connections among  sub-networks are introduced, spacing distribution show transition from Poisson statistics to the Gaussian orthogonal  statistics of random matrix theory.
Revised:  As connections among the sub-networks are introduced, spacing distribution show transition from Poisson statistics to the Gaussian orthogonal statistics of random matrix theory.
Edit intent: fluency
Original:  As connections among  sub-networks are introduced, spacing distribution show transition from Poisson statistics to the Gaussian orthogonal  statistics of random matrix theory.
Revised:  As connections among sub-networks are introduced, the spacing distribution shows a transition from the Poisson statistics to the Gaussian orthogonal statistics of random matrix theory.
Edit intent: fluency
Original:  Eigenvalues density distribution show transition to the Wigner's semicircular behaviour for completely deformed network.
Revised:  The eigenvalue density distribution shows a transition to the Wigner's semicircular behaviour for completely deformed network.
Edit intent: fluency
Original:  Eigenvalues density distribution show transition to the Wigner's semicircular behaviour for completely deformed network.
Revised:  Eigenvalues density distribution show transition to the Wigner's semicircular behavior for a completely deformed network.
Edit intent: fluency
Original:  The range for which  \Delta_3 statistics follows Gaussian orthogonal statistics depends upon the deformation of the network from the  community structure.
Revised:  The range for which \Delta_3 statistics , follows the Gaussian orthogonal ensemble statistics depends upon the deformation of the network from the community structure.
Edit intent: clarity
Original:   Finally, we presents results for the protein-protein interaction network for Helicobacter, and compare the spectral behaviour with those of the model networks.
Revised:  Finally, we analyze the spectrum of a protein-protein interaction network for Helicobacter, and compare the spectral behaviour with those of the model networks.
Edit intent: clarity
Original:   Finally, we presents results for the protein-protein interaction network for Helicobacter, and compare the spectral behaviour with those of the model networks.
Revised:  Finally, we presents results for the protein-protein interaction network for Helicobacter, and compare the spectral behavior with those of the model networks.
Edit intent: fluency
Original:  A group of cognitive users cooperatively tries to exploit vacancies in some primary (licensed) channels whose occupancies have a Markovian evolution.
Revised:  A group of cognitive users cooperatively tries to exploit vacancies in some primary (licensed) channels whose occupancies follow a Markovian evolution.
Edit intent: clarity
Original:  We first consider the scenario where the cognitive users are aware of the distribution of the signals they receive from the primary users and they use their analog observations to track the occupancies of the various primary channels that are being monitored .
Revised:  We first consider the scenario where the cognitive users have perfect knowledge of the distribution of the signals they receive from the primary users and they use their analog observations to track the occupancies of the various primary channels that are being monitored .
Edit intent: clarity
Original:  We first consider the scenario where the cognitive users are aware of the distribution of the signals they receive from the primary users and they use their analog observations to track the occupancies of the various primary channels that are being monitored .
Revised:  We first consider the scenario where the cognitive users are aware of the distribution of the signals they receive from the primary users .
Edit intent: clarity
Original:  A group of cognitive users cooperatively tries to exploit vacancies in some primary (licensed) channels whose occupancies follow a Markovian evolution.
Revised:  A group of cognitive users cooperatively tries to exploit vacancies in primary (licensed) channels whose occupancies follow a Markovian evolution.
Edit intent: clarity
Original:  Through simulation, we show that our scheme achieves good performance relative to the upper bound and substantial improvement relative to an existing scheme.
Revised:  Through simulation, we show that our scheme achieves good performance relative to the upper bound and improved performance relative to an existing scheme.
Edit intent: clarity
Original:  We show that this algorithm out-performs the naive design that assumes a worst-case value for the parameter.
Revised:  We show that this algorithm outperforms the naive design that assumes a worst-case value for the parameter.
Edit intent: clarity
Original:  We show that this algorithm out-performs the naive design that assumes a worst-case value for the parameter.
Revised:  We show that this algorithm out-performs the naive design that assumes a worst case value for the parameter.
Edit intent: fluency
Original: Social networks influence the evolution of cooperation and they exhibit strikingly systematic patterns across a wide range of human contexts.
Revised: Social networks exhibit strikingly systematic patterns across a wide range of human contexts.
Edit intent: coherence
Original:  Both of these facts suggest that variation in the topological attributes of human social networks might have a genetic basis.
Edit intent: clarity
Original:  We propose an alternative " attract and introduce " model  that generates significant heritability as well as other important network features , and we show that this model with two simple forms of heterogeneity is well suited to the modeling of real social networks in humans.
Revised:  We propose an alternative " Attract and Introduce " model that generates significant heritability as well as other important network features , and we show that this model with two simple forms of heterogeneity is well suited to the modeling of real social networks in humans.
Edit intent: fluency
Original:  We propose an alternative " attract and introduce " model  that generates significant heritability as well as other important network features , and we show that this model with two simple forms of heterogeneity is well suited to the modeling of real social networks in humans.
Revised:  We propose an alternative " attract and introduce " model with two simple forms of heterogeneity that generates significant heritability as well as other important network features , and we show that this model with two simple forms of heterogeneity is well suited to the modeling of real social networks in humans.
Edit intent: fluency
Original:  We propose an alternative " attract and introduce " model  that generates significant heritability as well as other important network features , and we show that this model with two simple forms of heterogeneity is well suited to the modeling of real social networks in humans.
Revised:  We propose an alternative " attract and introduce " model that generates significant heritability as well as other important network features . We show that the model is well suited to the modeling of real social networks in humans.
Edit intent: coherence
Original:  We propose an alternative " attract and introduce " model  that generates significant heritability as well as other important network features , and we show that this model with two simple forms of heterogeneity is well suited to the modeling of real social networks in humans.
Revised:  We propose an alternative " attract and introduce " model that generates significant heritability as well as other important network features , and we show that this model with two simple forms of heterogeneity is well suited to real social networks in humans.
Edit intent: clarity
Original:  In vitro experiments in a gel found a  cell line that formed clusters in a region of low cell density, whereas a very similar cell line (which lacks an important mutation) does not cluster significantly.
Revised:  In vitro experiments in a gel found aIn vitro cell line that formed clusters in a region of low cell density, whereas a very similar cell line (which lacks an important mutation) does not cluster significantly.
Edit intent: fluency
Original:  In vitro experiments in a gel found a  cell line that formed clusters in a region of low cell density, whereas a very similar cell line (which lacks an important mutation) does not cluster significantly.
Revised:  In vitro experiments in a gel found a cell line that formed clusters in a region of low cell density, whereas a very similar cell line (which lacks an important mutation) did not cluster significantly.
Edit intent: fluency
Original:  We postulate that the mutation changes the strength of cell-cell adhesion.
Revised:  We hypothesize that the mutation changes the strength of cell-cell adhesion.
Edit intent: clarity
Original:  We postulate that the mutation changes the strength of cell-cell adhesion.
Revised:  We postulate that the mutation affects the strength of cell-cell adhesion.
Edit intent: clarity
Original:  We investigate this effect in a new experiment  which follows the clustering dynamics of glioma cells on a surface.
Revised:  We investigate this effect in a new experiment , which follows the clustering dynamics of glioma cells on a surface.
Edit intent: fluency
Original:  below it  the system remains homogeneous  .
Revised:  below it , the system remains homogeneous .
Edit intent: fluency
Original:  Second, when cells cluster they increase their proliferation rate.
Revised:  Second, when cells form a cluster, we have evidence that they increase their proliferation rate.
Edit intent: clarity
Original:  We propose here a method to extract excitatory and inhibitory conductances (mean and variance) using maximum likelihood criteria, and which is applicable to single Vm traces.
Revised:  We propose here a method to extract excitatory and inhibitory conductances (mean and variance) from single Vm traces.
Edit intent: coherence
Original:  Finally, comparisons of hominid populations over time with fish species helped to define what consti-tutes taxonomically relevant differences between morphological populations as expressed among both trait size ranges and through growth patterns that begin during ontogeny.
Revised:  Finally, comparisons of hominid populations over time with fish species helped to define what constitutes taxonomically relevant differences between morphological populations as expressed among both trait size ranges and through growth patterns that begin during ontogeny.
Edit intent: fluency
Original: We present an analytically tractable model for the coupled development of ocular dominance (OD) and orientation preference (OP) columns, demonstrating that OD segregation can induce the conservation of pinwheels by their crystallization in two types of periodic lattices.
Revised: We present an analytical approach for studying the coupled development of ocular dominance (OD) and orientation preference (OP) columns, demonstrating that OD segregation can induce the conservation of pinwheels by their crystallization in two types of periodic lattices.
Edit intent: clarity
Original: We present an analytically tractable model for the coupled development of ocular dominance (OD) and orientation preference (OP) columns, demonstrating that OD segregation can induce the conservation of pinwheels by their crystallization in two types of periodic lattices.
Revised: We present an analytically tractable model for the coupled development of ocular dominance and orientation preference (OP) columns, demonstrating that OD segregation can induce the conservation of pinwheels by their crystallization in two types of periodic lattices.
Edit intent: fluency
Original: We present an analytically tractable model for the coupled development of ocular dominance (OD) and orientation preference (OP) columns, demonstrating that OD segregation can induce the conservation of pinwheels by their crystallization in two types of periodic lattices.
Revised: We present an analytically tractable model for the coupled development of ocular dominance (OD) and orientation preference columns. Using this approach we demonstrate that ocular dominance segregation can induce the conservation of pinwheels by their crystallization in two types of periodic lattices.
Edit intent: clarity
Original: We present an analytically tractable model for the coupled development of ocular dominance (OD) and orientation preference (OP) columns, demonstrating that OD segregation can induce the conservation of pinwheels by their crystallization in two types of periodic lattices.
Revised: We present an analytically tractable model for the coupled development of ocular dominance (OD) and orientation preference (OP) columns, demonstrating that OD segregation can induce the stabilization and even the production of pinwheels by their crystallization in two types of periodic lattices.
Edit intent: clarity
Original:  Recently, Richard and Comet stated and proved this conjecture for systems whose dynamics is described by the iterations of a map F which operates on the product X of n finite intervals of integers.
Revised:  Recently, Richard and Comet stated and proved this conjecture for discrete dynamical systems described by the iterations of a map F which operates on the product X of n finite intervals of integers.
Edit intent: clarity
Original:  In this paper, we widely extend the result of Richard and Comet by exhibiting an upper bound on the number of fixed points for F which only depends on X and on the topology of the positive circuits of the interaction graph associated with F.
Revised:  In this paper, we extend the result of Richard and Comet by exhibiting an upper bound on the number of fixed points for F which only depends on X and on the topology of the positive circuits of the interaction graph associated with F.
Edit intent: clarity
Original:  The maps F we focus on are indeed extensively used to described the behavior of gene regulatory networks, and when such a network is studied, the first reliable data often concern its interaction graph , so that the bound we establish can  be used, in practice, to obtain valuable information about the number of stable states that the network could display.
Revised:  The maps F we focus on are extensively used to described the behavior of gene regulatory networks, and when such a network is studied, the first reliable data often concern its interaction graph , so that the bound we establish can be used, in practice, to obtain valuable information about the number of stable states that the network could display.
Edit intent: coherence
Original:  The maps F we focus on are indeed extensively used to described the behavior of gene regulatory networks, and when such a network is studied, the first reliable data often concern its interaction graph , so that the bound we establish can  be used, in practice, to obtain valuable information about the number of stable states that the network could display.
Revised:  The maps F we focus on are indeed extensively used to described the behavior of gene regulatory networks, and when such a network is studied, the first reliable data often concern its interaction graph . The bound we establish can be used, in practice, to obtain valuable information about the number of stable states that the network could display.
Edit intent: coherence
Original:  The maps F we focus on are indeed extensively used to described the behavior of gene regulatory networks, and when such a network is studied, the first reliable data often concern its interaction graph , so that the bound we establish can  be used, in practice, to obtain valuable information about the number of stable states that the network could display.
Revised:  The maps F we focus on are indeed extensively used to described the behavior of gene regulatory networks, and when such a network is studied, the first reliable data often concern its interaction graph , so that the bound we establish can then be used, in practice, to obtain valuable information about the number of stable states that the network could display.
Edit intent: coherence
Original: Motivation: We present a microscopically explicit stochastic model of population dynamics that includes birth, death, density-dependent competition and environmental fluctuations.
Revised: We present an explicit unified stochastic model of population dynamics that includes birth, death, density-dependent competition and environmental fluctuations.
Edit intent: clarity
Original: Motivation: We present a microscopically explicit stochastic model of population dynamics that includes birth, death, density-dependent competition and environmental fluctuations.
Revised: Motivation: We present a microscopically explicit stochastic model of fluctuations in population size due to random birth, death, density-dependent competition and environmental fluctuations.
Edit intent: clarity
Original:  Firstly, stochastic effects in population dynamics are critical to the understanding the behaviour of populations of small sizes - especially in regard to events such as extinction (local or global) which cannot be adequately treated by deterministic methods.
Revised:  Firstly, stochastic effects in population dynamics are critical to the understanding the behaviour of populations of small sizes - especially in regard to events such as extinction , that cannot be correctly treated by deterministic methods.
Edit intent: clarity