wanyu/IteraTeR_v2 huggingface dataset:
Original:  We find a remarkable consistency of power-law , specifically lognormal, distributions for rates, weights and gains in all brain areas , such as cortex, cerebellum, striatum, midbrain .
Revised:  We find a remarkable consistency of heavy-tailed , specifically lognormal, distributions for rates, weights and gains in all brain areas , such as cortex, cerebellum, striatum, midbrain .
Edit intent: clarity
Original:  We find a remarkable consistency of power-law , specifically lognormal, distributions for rates, weights and gains in all brain areas , such as cortex, cerebellum, striatum, midbrain .
Revised:  We find a remarkable consistency of power-law , specifically lognormal, distributions for rates, weights and gains in all brain areas examined .
Edit intent: clarity
Original:  Secondly, we created a generic neural model to show that Hebbian learning will create and maintain lognormal distributions.
Revised:  Secondly, we created a generic neural model to investigate adaptive learning rules that create and maintain lognormal distributions.
Edit intent: clarity
Original:  We could prove with the model that not only weights  but also intrinsic gains  need to have strong Hebbian learning in order to produce and maintain the experimentally attested distributions.
Revised:  We conclusively demonstrate that not only weights but also intrinsic gains need to have strong Hebbian learning in order to produce and maintain the experimentally attested distributions.
Edit intent: clarity
Original:  We could prove with the model that not only weights  but also intrinsic gains  need to have strong Hebbian learning in order to produce and maintain the experimentally attested distributions.
Revised:  We could prove with the model that not only weights , but also intrinsic gains need to have strong Hebbian learning in order to produce and maintain the experimentally attested distributions.
Edit intent: fluency
Original:  We could prove with the model that not only weights  but also intrinsic gains  need to have strong Hebbian learning in order to produce and maintain the experimentally attested distributions.
Revised:  We could prove with the model that not only weights but also intrinsic gains , need to have strong Hebbian learning in order to produce and maintain the experimentally attested distributions.
Edit intent: fluency
Original:  This settles a long-standing question about the type of plasticity exhibited by intrinsic excitability.
Revised:  This provides a solution to the long-standing question about the type of plasticity exhibited by intrinsic excitability.
Edit intent: clarity
Original:  In this paper, we first consider the general framework of Poisson Point Processes transformations and we obtain analytic expressions for the joint cumulants off filtered shot noise processes with multiplicative noise , in the general case of variable input rate .
Revised:  In this paper, we apply the general framework of Poisson Point Processes transformations and we obtain analytic expressions for the joint cumulants off filtered shot noise processes with multiplicative noise , in the general case of variable input rate .
Edit intent: coherence
Original:  In this paper, we first consider the general framework of Poisson Point Processes transformations and we obtain analytic expressions for the joint cumulants off filtered shot noise processes with multiplicative noise , in the general case of variable input rate .
Revised:  In this paper, we first consider the general framework of Poisson Point Processes transformations and we obtain analytic expressions for the joint cumulants of filtered shot noise processes with multiplicative noise , in the general case of variable input rate .
Edit intent: fluency
Original:  In this paper, we first consider the general framework of Poisson Point Processes transformations and we obtain analytic expressions for the joint cumulants off filtered shot noise processes with multiplicative noise , in the general case of variable input rate .
Revised:  In this paper, we first consider the general framework of Poisson Point Processes transformations and we obtain analytic expressions for the joint cumulants off filtered shot noise processes with multiplicative noise .
Edit intent: coherence
Original:  This work opens the perspective of obtaining analytic access to important statistical properties of conductance-based neuronal models such as the Vm distribution and the first passage time.
Revised:  This work opens the perspective of obtaining analytic access to important statistical properties of conductance-based neuronal models such as the the first passage time.
Edit intent: clarity
Original:  In this study we investigated motor skill learning using a path tracking task, where  subjects had to track various curved paths as fast as possible, in the absence of any external perturbations.
Revised:  In this study we investigated motor skill learning using a path tracking task, where human subjects had to track various curved paths as fast as possible, in the absence of any external perturbations.
Edit intent: clarity
Original:  We found that subjects become better with practice, producing faster and smoother movements even when tracking novel untrained paths.
Revised:  Subjects became better with practice, producing faster and smoother movements even when tracking novel untrained paths.
Edit intent: coherence
Original:  Using a "searchlight" paradigm, where only a short segment of the path ahead of the cursor was shown, we found that subjects with a higher tracking skill demonstrated larger planning horizon, i.e. took a longer chunk of the future path into account when computing the control policy for the upcoming movement segment.
Revised:  Using a "searchlight" paradigm, where only a short segment of the path ahead of the cursor was shown, we found that subjects with a higher tracking skill took a longer chunk of the future path into account when computing the control policy for the upcoming movement segment.
Edit intent: clarity
Original:  This suggests that the motor system uses receding horizon control, and its horizon length can increase with practice, resulting in an increased accuracyof the movement controller .
Revised:  We observed the same effects in a second experiment where tracking speed was fixed and subjects were practicing to increase their accuracy. These findings demonstrate that human subjects increase their planning horizon when acquiring a motor skill .
Edit intent: coherence
Original:  Here we provide another canonization algorithm for fuzzy finite automata\cal  over a complete residuated lattice \cal  , based on the degrees of inclusion of particular fuzzy languages determined by states and fuzzy sets of states of \cal  the fuzzy finite automaton that is determinized.
Revised:  Here we provide another canonization method for a fuzzy finite automaton\cal over a complete residuated lattice \cal , based on the degrees of inclusion of particular fuzzy languages determined by states and fuzzy sets of states of \cal the fuzzy finite automaton that is determinized.
Edit intent: clarity
Original:  Here we provide another canonization algorithm for fuzzy finite automata\cal  over a complete residuated lattice \cal  , based on the degrees of inclusion of particular fuzzy languages determined by states and fuzzy sets of states of \cal  the fuzzy finite automaton that is determinized.
Revised:  Here we provide another canonization algorithm for fuzzy finite automata\cal over a complete residuated lattice \cal , based on the degrees of inclusion of the right fuzzy languages associated with states of \cal the fuzzy finite automaton that is determinized.
Edit intent: clarity
Original:  If the\cal \cal  basic operations in the underlying complete residuated lattice\cal  can be performed in constant time, this canonization algorithm has the same computational time as all other determinization algorithms provided in [ 9 ], [11], [12] , 13%DIFDELCMD < ]%%% , including the Brzozowski type determinization .
Revised:  If the\cal \cal basic operations in the residuated lattice\cal can be performed in constant time, this canonization algorithm has the same computational time as all other determinization algorithms provided in [ 9 ], [11], [12] , 13%DIFDELCMD < ]%%% , including the Brzozowski type determinization .
Edit intent: clarity
Original:  If the\cal \cal  basic operations in the underlying complete residuated lattice\cal  can be performed in constant time, this canonization algorithm has the same computational time as all other determinization algorithms provided in [ 9 ], [11], [12] , 13%DIFDELCMD < ]%%% , including the Brzozowski type determinization .
Revised:  If the\cal \cal basic operations in the underlying complete residuated lattice\cal can be performed in constant time, it has the same computational time as all other determinization algorithms provided in [ 9 ], [11], [12] , 13%DIFDELCMD < ]%%% , including the Brzozowski type determinization .
Edit intent: clarity
Original:  If the\cal \cal  basic operations in the underlying complete residuated lattice\cal  can be performed in constant time, this canonization algorithm has the same computational time as all other determinization algorithms provided in [ 9 ], [11], [12] , 13%DIFDELCMD < ]%%% , including the Brzozowski type determinization .
Revised:  If the\cal \cal basic operations in the underlying complete residuated lattice\cal can be performed in constant time, this canonization algorithm has the same computational time as all other determinization procedures provided in [ 9 ], [11], [12] , 13%DIFDELCMD < ]%%% , including the Brzozowski type determinization .
Edit intent: clarity
Original:  If the\cal \cal  basic operations in the underlying complete residuated lattice\cal  can be performed in constant time, this canonization algorithm has the same computational time as all other determinization algorithms provided in [ 9 ], [11], [12] , 13%DIFDELCMD < ]%%% , including the Brzozowski type determinization .
Revised:  If the\cal \cal basic operations in the underlying complete residuated lattice\cal can be performed in constant time, this canonization algorithm has the same computational time as all other determinization algorithms provided in [ 9 ], [11], [12] 13%DIFDELCMD < ]%%% , including the Brzozowski type determinization .
Edit intent: fluency
Original:  If the\cal \cal  basic operations in the underlying complete residuated lattice\cal  can be performed in constant time, this canonization algorithm has the same computational time as all other determinization algorithms provided in [ 9 ], [11], [12] , 13%DIFDELCMD < ]%%% , including the Brzozowski type determinization .
Revised:  If the\cal \cal basic operations in the underlying complete residuated lattice\cal can be performed in constant time, this canonization algorithm has the same computational time as all other determinization algorithms provided in [ 9 ], [11], [12] , %DIFDELCMD < ]%%% , including the Brzozowski type determinization .
Edit intent: fluency
Original: Democrats in the US say that taxes can be used to "grease the wheels" of the economy and create wealth enough to recover taxes and thereby increase employment;
Revised: Democrats in the US say that taxes can be used to "grease the wheels" of the economy to create wealth and to increase employment;
Edit intent: clarity
Original:  the Republicans say that taxation discourages investmentand so increases unemployment.
Revised:  Republicans contend that government spending is wasteful and discourages investment, thereby increasing unemployment.
Edit intent: clarity
Original:  Democrats in the United States argue that government spending can be used to "grease the wheels" of the economy  to create wealth and to increase employment;
Revised:  Democrats in the United States argued that government spending can be used to "grease the wheels" of the economy to create wealth and to increase employment;
Edit intent: fluency
Original:  Democrats in the United States argue that government spending can be used to "grease the wheels" of the economy  to create wealth and to increase employment;
Revised:  Democrats in the United States argue that government spending could be utilized to "grease the wheels" of the economy to create wealth and to increase employment;
Edit intent: clarity
Original:  Democrats in the United States argue that government spending can be used to "grease the wheels" of the economy  to create wealth and to increase employment;
Revised:  Democrats in the United States argue that government spending can be used to "grease the wheels" of the economy in order to create wealth and to increase employment;
Edit intent: clarity
Original:  Republicans contend that government spending is wasteful and discourages investment, thereby increasing unemployment.
Revised:  Republicans , on the other hand, contended that government spending is wasteful and discourages investment, thereby increasing unemployment.
Edit intent: clarity
Original:  Republicans contend that government spending is wasteful and discourages investment, thereby increasing unemployment.
Revised:  Republicans contend that government spending is wasteful and discouraged investment, thereby increasing unemployment.
Edit intent: fluency
Original: We study a continuous time non-conservative stochastic process of N non negative variables which represent the membrane potentials of N neurons{\it  {\it   .
Revised: We study a stochastic process describing the continuous time evolution of the membrane potentials of N neurons{\it {\it .
Edit intent: clarity
Original: We study a continuous time non-conservative stochastic process of N non negative variables which represent the membrane potentials of N neurons{\it  {\it   .
Revised: We study a continuous time non-conservative stochastic process of N non negative variables which represent the membrane potentials of N neurons{\it ,{\it .
Edit intent: fluency
Original:  Each neuron spikes randomly (and independently of the others) at a rate which depends on its membrane potential.
Revised:  Each neuron spikes randomly following a point process with rate depending on its membrane potential.
Edit intent: clarity
Original:  When a neuron spikes, its membrane potential is immediately reset to a resting  potential 0 and simultaneously it gives an additional positive energy to the membrane potentials of the neurons which are connected by chemical synapses to the spiking one.
Revised:  When a neuron spikes, its membrane potential is immediately reset to a resting potential of the neurons which are connected by chemical synapses to the spiking one.
Edit intent: coherence
Original:  In addition , between consecutive spikes, the system follows a deterministic motion due to both electrical synapses and the leakage effect.
Revised:  In addition , between consecutive spikes, the system follows a deterministic motion due both to electrical synapses and the leakage effect.
Edit intent: fluency
Original:  The first pushes the system towards its center of mass , while the later attracts the membrane potential of each neuron to the resting state .
Revised:  The first pushes the system towards its average potential , while the later attracts the membrane potential of each neuron to the resting state .
Edit intent: clarity
Original:  The first pushes the system towards its center of mass , while the later attracts the membrane potential of each neuron to the resting state .
Revised:  The first pushes the system towards its center of mass , while the later attracts the membrane potential of each neuron to the resting value .
Edit intent: clarity
Original:  We show that the process converges exponentially to a unique invariant measure which, when leaking is present, is supported by the configuration with all potentials equal to 0 and the neurons have almost surely only a finite number of spikes .
Revised:  We show that in the absence leakage the process converges exponentially to a unique invariant measure which, when leaking is present, is supported by the configuration with all potentials equal to 0 and the neurons have almost surely only a finite number of spikes .
Edit intent: clarity
Original:  We specialize this result to the class of bireversible transducers and we show that the property of being not free is equivalent to have a finite Schreier graphs in the boundary of the enriched dual pointed on some essentially non-trivial point.
Revised:  We specialize this result to the class of bireversible transducers and we show that the property of being not free is equivalent to have a finite Schreier graph in the boundary of the enriched dual pointed on some essentially non-trivial point.
Edit intent: fluency
Original:  From these results we derive some consequences from the algorithmic, algebraic and the dynamic point of view.
Revised:  From these results we derive some consequences from the dynamical, algorithmic and algebraic point of view.
Edit intent: fluency
Original:  In the last part  we address the problem of finding examples of non-bireversible transducers defining free groups, we show examples of transducers with sink accessible from every state which generate free groups, and, in general, we link this problem to the existence of certain words with interesting combinatorial and geometrical properties.
Revised:  In the last part of the paper we address the problem of finding examples of non-bireversible transducers defining free groups, we show examples of transducers with sink accessible from every state which generate free groups, and, in general, we link this problem to the existence of certain words with interesting combinatorial and geometrical properties.
Edit intent: clarity
Original:  In the last part  we address the problem of finding examples of non-bireversible transducers defining free groups, we show examples of transducers with sink accessible from every state which generate free groups, and, in general, we link this problem to the existence of certain words with interesting combinatorial and geometrical properties.
Revised:  In the last part we address the problem of finding examples of non-bireversible transducers defining free groups, we show examples of transducers with sink accessible from every state which generate free groups, and, in general, we link this problem to the nonexistence of certain words with interesting combinatorial and geometrical properties.
Edit intent: clarity
Original: The cyclic bandwidth sum problem (CBSP) consists of finding a labeling of the vertices of an undirected and unweighted graph with a fixed number of vertices with distinct integers such that the sum of (cyclic) difference of labels of adjacent vertices is minimized.
Revised: The cyclic bandwidth sum problem . It consists in finding a labeling of the vertices of an undirected and unweighted graph with a fixed number of vertices with distinct integers such that the sum of (cyclic) difference of labels of adjacent vertices is minimized.
Edit intent: clarity
Original: The cyclic bandwidth sum problem (CBSP) consists of finding a labeling of the vertices of an undirected and unweighted graph with a fixed number of vertices with distinct integers such that the sum of (cyclic) difference of labels of adjacent vertices is minimized.
Revised: The cyclic bandwidth sum problem (CBSP) consists of finding a labeling of the vertices of an undirected and unweighted graph with distinct integers such that the sum of (cyclic) difference of labels of adjacent vertices is minimized.
Edit intent: clarity
Original:  Although theoretical results exist that give optimal value of cyclic bandwidth sum (CBS) for standard graphs, there are neither results in the general case, nor explicit methods to reach this optimal result.
Revised:  Although theoretical results exist that give optimal value of cyclic bandwidth sum for standard graphs, there are neither results in the general case, nor explicit methods to reach this optimal result.
Edit intent: clarity
Original:  In addition to this lack of theoretical knowledge, only a few methods have been proposed to approximately solve the CBSP . In this paper, we introduce a new algorithm to find an approximate solution for CBSP and an associated labeling.
Revised:  In addition to this lack of theoretical knowledge, only a few methods have been proposed to approximately solve this problem . In this paper, we introduce a new algorithm to find an approximate solution for CBSP and an associated labeling.
Edit intent: clarity
Original:  In addition to this lack of theoretical knowledge, only a few methods have been proposed to approximately solve the CBSP . In this paper, we introduce a new algorithm to find an approximate solution for CBSP and an associated labeling.
Revised:  In addition to this lack of theoretical knowledge, only a few methods have been proposed to approximately solve the CBSP . In this paper, we introduce a new heuristic to find an approximate solution for CBSP and an associated labeling.
Edit intent: clarity
Original:  The heuristic is a two-step algorithm: the first step consists of traveling the graph to find a set of paths which follow the structure of the graph, using a similarity criterion based on the Jaccard index to jump from one vertex to the next one.
Revised:  The heuristic is a two-step algorithm: the first step consists of traversing the graph to find a set of paths which follow the structure of the graph, using a similarity criterion based on the Jaccard index to jump from one vertex to the next one.
Edit intent: fluency
Original:  The second step consists of merging all the previously obtained paths, based on a greedy approach that extends a partial solution by inserting a new path at the position that minimizes the cyclic bandwidth sum.
Revised:  The second step is the merging of all obtained paths, based on a greedy approach that extends a partial solution by inserting a new path at the position that minimizes the cyclic bandwidth sum.
Edit intent: clarity
Original:  In this paper, the first comprehensive tutorial on the use of matching theory, a Nobel-prize winning framework, for resource management in wireless networks is developed.
Revised:  In this paper, the first comprehensive tutorial on the use of matching theory, a Nobelprize winning framework, for resource management in wireless networks is developed.
Edit intent: fluency
Original:  After introducing the basic concepts of matching , a novel classification that provides a wireless-oriented view on matching theory is proposed.
Revised:  After introducing the basic concepts of matching , a novel , wireless-oriented view on matching theory is proposed.
Edit intent: clarity
Original:  After introducing the basic concepts of matching , a novel classification that provides a wireless-oriented view on matching theory is proposed.
Revised:  After introducing the basic concepts of matching , a novel classification that provides a wireless-oriented classification of matching theory is proposed.
Edit intent: clarity
Original:  For each proposed class, the fundamental components, key properties, and solution concepts , are discussed .
Revised:  Then, the key solution concepts and algorithmic implementations of this framework are exposed .
Edit intent: clarity
Original: We introduce several novel and computationally efficient methods for detecting " core-periphery structure" in networks.
Revised: We introduce several novel and computationally efficient methods for detecting " core--periphery structure" in networks.
Edit intent: fluency
Original:  Core-periphery structure is a type of meso-scale structure that includes densely-connected core vertices and sparsely-connected peripheral vertices.
Revised:  Core--periphery structure is a type of meso-scale structure that includes densely-connected core vertices and sparsely-connected peripheral vertices.
Edit intent: fluency
Original:  Core-periphery structure is a type of meso-scale structure that includes densely-connected core vertices and sparsely-connected peripheral vertices.
Revised:  Core-periphery structure is a type of mesoscale structure that includes densely-connected core vertices and sparsely-connected peripheral vertices.
Edit intent: fluency