wanyu/IteraTeR_v2 huggingface dataset:
Original: The current work describes a novel system devised for automatic contour extraction of 2D branching structures images obtained from 3D neurons .
Revised: The current work describes a novel system devised for automatic contour extraction of 2D images of 3D neurons .
Edit intent: clarity
Original:  Most contour-based methods for neuronal cell shape analysis fall short of suitable representation of such cells because  overlaps between neuronal processes prevent traditional contour following algorithms from entering the innermost cell regions.
Revised:  Most contour-based shape analysis methods can not be used to characterize such cells because overlaps between neuronal processes prevent traditional contour following algorithms from entering the innermost cell regions.
Edit intent: clarity
Original:  Most contour-based methods for neuronal cell shape analysis fall short of suitable representation of such cells because  overlaps between neuronal processes prevent traditional contour following algorithms from entering the innermost cell regions.
Revised:  Most contour-based methods for neuronal cell shape analysis fall short of suitable representation of such cells because of overlaps between neuronal processes prevent traditional contour following algorithms from entering the innermost cell regions.
Edit intent: fluency
Original:  First, the input image is preprocessed in order to obtain an 8-connected skeleton with one-pixel-wide branches, as well as a set of subtree seed pixels and critical regions (i.e., bifurcations and crossings).
Revised:  First, the input image is preprocessed in order to obtain an 8-connected skeleton with one-pixel-wide branches, as well as a set of critical regions (i.e., bifurcations and crossings).
Edit intent: clarity
Original:  Next, for each subtree, the tracking algorithm iteratively labels all valid pixel  branches, up to a critical region, where the algorithm determines the suitable direction to proceed.
Revised:  Next, for each subtree, the tracking stage iteratively labels all valid pixel branches, up to a critical region, where the algorithm determines the suitable direction to proceed.
Edit intent: clarity
Original:  Next, for each subtree, the tracking algorithm iteratively labels all valid pixel  branches, up to a critical region, where the algorithm determines the suitable direction to proceed.
Revised:  Next, for each subtree, the tracking algorithm iteratively labels all valid pixel of branches, up to a critical region, where the algorithm determines the suitable direction to proceed.
Edit intent: clarity
Original:  Next, for each subtree, the tracking algorithm iteratively labels all valid pixel  branches, up to a critical region, where the algorithm determines the suitable direction to proceed.
Revised:  Next, for each subtree, the tracking algorithm iteratively labels all valid pixel branches, up to a critical region, where it determines the suitable direction to proceed.
Edit intent: clarity
Original:  Experimental results using real data (neural cell images) are presented .
Revised:  The proposed method is robust and may be implemented in an efficient manner. The introduction of this approach should pave the way for more systematic application of contour-based shape analysis methods in neuronal morphology .
Edit intent: coherence
Original:  In this paper we provide a method which defines some fundamental thermodynamic functions for random Boolean networks , independent of the details of their implementation.
Revised:  In this letter we begin to investigate these questions for random Boolean networks , independent of the details of their implementation.
Edit intent: clarity
Original:  Comparisons are also made with the Twelf and nominal logic based approaches to similar reasoning .
Revised:  Brief comparisons with a few other logic based approaches to similar reasoning .
Edit intent: clarity
Original:  Comparisons are also made with the Twelf and nominal logic based approaches to similar reasoning .
Revised:  Comparisons are also made with the Twelf and nominal logic based approaches are also made .
Edit intent: clarity
Original:  This problem has been considered previously in the field of parallel computing and scheduling theory for the general case where multiprocessor platforms have K distinct speeds.
Revised:  This problem has been considered previously in the field of parallel computing and scheduling theory ; only the general case where multiprocessor platforms have K distinct speeds.
Edit intent: clarity
Original:  We also review the complexity of computing projections when the projection directions are picked at random .
Revised:  We also review the complexity of computing projections when the projection directions are in some sense non-degenerate .
Edit intent: clarity
Original:  This highlights a previously overlooked structure of the low-frequency spectrum  , namely the existence of a plateau of 24 near zero-modes with universal group theory content.
Revised:  This highlights a remarkable structure of the low-frequency spectrum , namely the existence of a plateau of 24 near zero-modes with universal group theory content.
Edit intent: clarity
Original: Given a mechanical system (M, \mathcal{F deformation quantization, which consists in constructing a star-product on the algebra of formal power series F(M) \hbar%DIFDELCMD < ]]%%% . A first step toward study of star-products is the calculation of Hochschild cohomology of \mathcal{F .
Revised: Within the framework of deformation quantization, which consists in constructing a star-product on the algebra of formal power series F(M) \hbar%DIFDELCMD < ]]%%% . A first step toward study of star-products is the calculation of Hochschild cohomology of \mathcal{F .
Edit intent: clarity
Original: Given a mechanical system (M, \mathcal{F deformation quantization, which consists in constructing a star-product on the algebra of formal power series F(M) \hbar%DIFDELCMD < ]]%%% . A first step toward study of star-products is the calculation of Hochschild cohomology of \mathcal{F .
Revised: Given a mechanical system (M, \mathcal{F deformation quantization, \hbar%DIFDELCMD < ]]%%% . A first step toward study of star-products is the calculation of Hochschild cohomology of \mathcal{F .
Edit intent: coherence
Original: Given a mechanical system (M, \mathcal{F deformation quantization, which consists in constructing a star-product on the algebra of formal power series F(M) \hbar%DIFDELCMD < ]]%%% . A first step toward study of star-products is the calculation of Hochschild cohomology of \mathcal{F .
Revised: Given a mechanical system (M, \mathcal{F deformation quantization, which consists in constructing a star-product on the algebra of formal power series F(M) %DIFDELCMD < ]]%%% . A first step toward study of star-products is the calculation of Hochschild cohomology of \mathcal{F .
Edit intent: coherence
Original: Given a mechanical system (M, \mathcal{F deformation quantization, which consists in constructing a star-product on the algebra of formal power series F(M) \hbar%DIFDELCMD < ]]%%% . A first step toward study of star-products is the calculation of Hochschild cohomology of \mathcal{F .
Revised: Given a mechanical system (M, \mathcal{F deformation quantization, which consists in constructing a star-product on the algebra of formal power series F(M) \hbar%DIFDELCMD < ]]%%% a first step towards the study of star-products is the calculation of Hochschild cohomology of \mathcal{F .
Edit intent: fluency
Original: Given a mechanical system (M, \mathcal{F deformation quantization, which consists in constructing a star-product on the algebra of formal power series F(M) \hbar%DIFDELCMD < ]]%%% . A first step toward study of star-products is the calculation of Hochschild cohomology of \mathcal{F .
Revised: Given a mechanical system (M, \mathcal{F deformation quantization, which consists in constructing a star-product on the algebra of formal power series F(M) \hbar%DIFDELCMD < ]]%%% . A first step toward study of star-products is the calculation of Hochschild cohomology .
Edit intent: clarity
Original:  The aim of this article is to determine this Hochschild cohomology in the case of singular curves of the plane -- so we rediscover, by a different way, a result proved by Fronsdal and make it more precise -- and in the case of Klein surfaces.
Revised:  The aim of this article is to determine this Hochschild cohomology in the case of singular curves of the plane ; here we recover, in a different way, a result proved by Fronsdal and make it more precise -- and in the case of Klein surfaces.
Edit intent: clarity
Original:  The aim of this article is to determine this Hochschild cohomology in the case of singular curves of the plane -- so we rediscover, by a different way, a result proved by Fronsdal and make it more precise -- and in the case of Klein surfaces.
Revised:  The aim of this article is to determine this Hochschild cohomology in the case of singular curves of the plane -- so we rediscover, by a different way, a result proved by Fronsdal and make it more precise . On the other hand, we are interested in Klein surfaces.
Edit intent: coherence
Original:  The use of a complex suggested by Kontsevich and the help of Gr\"obner bases allow us to solve the problem.
Revised:  The use of a complex suggested by Kontsevich and the help of Groebner bases allow us to solve the problem.
Edit intent: fluency
Original: In the first part of the article  it was discussed the possibility of function analysis using as a basis a couple of nonorthogonal functions and hence vectorial decomposition and a pure frequency dictionary .
Revised: In a previous paper it was discussed the possibility of function analysis using as a basis a couple of nonorthogonal functions and hence vectorial decomposition and a pure frequency dictionary .
Edit intent: clarity
Original: In the first part of the article  it was discussed the possibility of function analysis using as a basis a couple of nonorthogonal functions and hence vectorial decomposition and a pure frequency dictionary .
Revised: In the first part of the article it was discussed the viability of functional analysis using as a basis a couple of nonorthogonal functions and hence vectorial decomposition and a pure frequency dictionary .
Edit intent: clarity
Original: In the first part of the article  it was discussed the possibility of function analysis using as a basis a couple of nonorthogonal functions and hence vectorial decomposition and a pure frequency dictionary .
Revised: In the first part of the article it was discussed the possibility of function analysis using as a basis a couple of nonorthogonal functions and hence vectorial decomposition .
Edit intent: coherence
Original:  Here we switch to polar coordinates so needing only one nonorthogonal function as a basis.
Revised:  Here we switch to polar coordinates so needing only one function as a basis.
Edit intent: clarity
Original:  This decomposition appears to have an even greater range of application and many widespread consequences.
Edit intent: coherence
Original:  It will be shown that, with the analysis method developed , any function , satisfying a rather loose requisite , can be a basis.
Revised:  It will be shown that, with the analysis method developed , any function satisfying a rather loose requisite , can be a basis.
Edit intent: fluency
Original:  It will be shown that, with the analysis method developed , any function , satisfying a rather loose requisite , can be a basis.
Revised:  It will be shown that, with the analysis method developed , any function , satisfying a rather loose requisite is ontologically a basis.
Edit intent: clarity
Original:  The theory, with its two representations: vectorial and polar, appears to be the natural generalization of the Fourier Theorem to the case of nonorthogonal bases.
Revised:  This in turn generalizes the polar version of the Fourier Theorem to the case of nonorthogonal bases.
Edit intent: clarity
Original:  The theory, with its two representations: vectorial and polar, appears to be the natural generalization of the Fourier Theorem to the case of nonorthogonal bases.
Revised:  The theory, with its two representations: vectorial and polar, appears to be the natural generalization of the Fourier theorem to an ample class of nonorthogonal bases.
Edit intent: clarity
Original:  The implications of the tool range from a reformulation of the eigenproblem to real world applications . Examples of analysis and reconstruction of functions using the given algorithms and generic bases will be given.
Revised:  The implications of the tool range from a reformulation of the eigenproblem to real world applications . Examples of analysis and reconstruction of functions using the developed algorithms and generic bases will be given.
Edit intent: clarity
Original:  Some  applications that can promptly benefit from the tools developed here will be pointed out .
Revised:  Some applications that can promptly benefit from the theory, will be discussed. The implementation of a matched filter for noise suppression will be used as an example of the potential of the theory .
Edit intent: clarity
Original:  Here we recreate the correct proof .
Revised:  Here we provide a correct proof by slightly modifying Eppstein's argument .
Edit intent: clarity
Original: Recent experiments have shown that cell populations at steady state growth often exhibit broad protein distributions with exponential tails.
Revised: Proliferating cell populations at steady state growth often exhibit broad protein distributions with exponential tails.
Edit intent: clarity
Original:  The sources of this variation in a dividing population and the degree of universality of steady state distributions is a topic of much theoretical interest.
Revised:  The sources of this variation and its universality are of much theoretical interest.
Edit intent: clarity
Original:  Here we address the problem by studying the Population Balance Equation , a general framework that describes growth (or production) and division in a population .
Revised:  Here we address the problem by asymptotic analysis of the Population Balance Equation , a general framework that describes growth (or production) and division in a population .
Edit intent: clarity
Original:  Here we address the problem by studying the Population Balance Equation , a general framework that describes growth (or production) and division in a population .
Revised:  Here we address the problem by studying the Population Balance Equation .
Edit intent: clarity
Original:  We show that the tail of the steady state distribution  is determined by a combination of the production and division functions, not by each of them separately, and is insensitive to other model details.
Revised:  We show that the steady state distribution is determined by a combination of the production and division functions, not by each of them separately, and is insensitive to other model details.
Edit intent: clarity
Original:  We show that the tail of the steady state distribution  is determined by a combination of the production and division functions, not by each of them separately, and is insensitive to other model details.
Revised:  We show that the tail of the steady state distribution is determined by a combination of protein production and cell division and is insensitive to other model details.
Edit intent: clarity
Original:  Under general conditions this tail turns out to be exponential , as observed in experiments, with the correct dependence on system parameters .
Revised:  Under general conditions this tail is exponential with a dependence on parameters consistent with experiment .
Edit intent: clarity
Original:  We discuss the conditions for this effect to be dominant over other sources of variation and the relation of the results to experiments.
Revised:  We discuss the conditions for this effect to be dominant over other sources of variation and the relation to experiments.
Edit intent: clarity
Original: If modern computers are sometimes superior to cognition in some specialized tasks such as playing chess or browsing a large database, they can't beat the efficiency of biological vision for such simple tasks as recognizing a relative or following an object in a complex  background.
Revised: If modern computers are sometimes superior to humans in some specialized tasks such as playing chess or browsing a large database, they can't beat the efficiency of biological vision for such simple tasks as recognizing a relative or following an object in a complex background.
Edit intent: clarity
Original: If modern computers are sometimes superior to cognition in some specialized tasks such as playing chess or browsing a large database, they can't beat the efficiency of biological vision for such simple tasks as recognizing a relative or following an object in a complex  background.
Revised: If modern computers are sometimes superior to cognition in some specialized tasks such as playing chess or browsing a large database, they can't beat the efficiency of biological vision for such simple tasks as recognizing and following an object in a complex background.
Edit intent: clarity
Original: If modern computers are sometimes superior to cognition in some specialized tasks such as playing chess or browsing a large database, they can't beat the efficiency of biological vision for such simple tasks as recognizing a relative or following an object in a complex  background.
Revised: If modern computers are sometimes superior to cognition in some specialized tasks such as playing chess or browsing a large database, they can't beat the efficiency of biological vision for such simple tasks as recognizing a relative or following an object in a complex cluttered background.
Edit intent: clarity
Original:  We will illustrate this  by showing that in a signal matching framework, a L/LN (linear/non-linear) cascade may efficiently transform a sensory signal into a neural spiking signal and we  apply this framework to a model retina.
Revised:  We will illustrate this by showing that in a signal matching framework, a L/LN (linear/non-linear) cascade may efficiently transform a sensory signal into a neural spiking signal and we will apply this framework to a model retina.
Edit intent: fluency
Original:  We will particularly focus on bridging neuroscience and image processing and on the advantages of such an interdisciplinary approach.
Revised:  We will in particular focus on bridging neuroscience and image processing and on the advantages of such an interdisciplinary approach.
Edit intent: fluency
Original:  During the last decades, stable non-racemic steady states of non-equilibrium chemical systems have been discussed as a possible response to this problem.
Revised:  During the last decades, stable non-racemic steady states of nonequilibrium chemical systems have been discussed as a possible response to this problem.
Edit intent: fluency
Original:  More recently, the description of recycled systems was provided , in which stable products can be activated back to reactive compounds  , leading to the continuous maintaining of unidirectional reaction loops.
Revised:  More recently, the description of recycled systems was provided in which stable products can be activated back to reactive compounds , leading to the continuous maintaining of unidirectional reaction loops.
Edit intent: fluency
Original:  To face this skepticism, a full thermodynamic study of recycled systems based on only microreversible reactions is presented here .
Revised:  To face this skepticism, a full thermodynamic study of recycled systems , composed of microreversible reactions only, is presented here .
Edit intent: clarity
Original: The individualization-refinement paradigm for computing a canonical labeling and /or the automorphism group of a graph is investigated.
Revised: The individualization-refinement paradigm for computing a canonical labeling and the automorphism group of a graph is investigated.
Edit intent: fluency
Original:  New techniques are introduced with the aim of reducing the size of the associated search space .
Revised:  A new algorithmic design aimed at reducing the size of the associated search space .
Edit intent: clarity
Original:  Experimental results and comparisons with existing tools , such as  "nauty" , reveal that the presented approach produces a huge contraction of the search space .
Revised:  Experimental results and comparisons with existing software , such as "nauty" , reveal that the presented approach produces a huge contraction of the search space .
Edit intent: clarity
Original:  Experimental results and comparisons with existing tools , such as  "nauty" , reveal that the presented approach produces a huge contraction of the search space .
Revised:  Experimental results and comparisons with existing tools , such as "nauty" . It is shown that the approach presented here leads to a huge reduction in the search space .
Edit intent: clarity
Original:  We model the morphs as linear interpolations in a suitable shape space S . For triangulated 3D polygons, we prove that interpolating linearly in this shape space corresponds to the most isometric morph in 3D . We then extend this shape space to arbitrary triangulations in 3D using a number of heuristic approaches and show the practical use of the approach in preliminary experiments .
Revised:  We model the morphs as linear interpolations in a suitable shape space S . For triangulated 3D polygons, we prove that interpolating linearly in this shape space corresponds to the most isometric morph in 3D . We then extend this shape space to arbitrary triangulations in 3D using a heuristic approach and show the practical use of the approach in preliminary experiments .
Edit intent: clarity
Original:  We first show three (counter-intuitive) phenomena: (i) choosing, for each task, the initial k-sequence 1^k is not optimal, (ii) even less intuitive, but not contradictory, we can even start the scheduling from a (fictive) error state (in regard to the initial k-sequence) and (iii) the period of feasible DBP-schedules is not necessarily the task hyper-period.
Revised:  We first show three phenomena: (i) choosing, for each task, the initial k-sequence 1^k is not optimal, (ii) even less intuitive, but not contradictory, we can even start the scheduling from a (fictive) error state (in regard to the initial k-sequence) and (iii) the period of feasible DBP-schedules is not necessarily the task hyper-period.
Edit intent: clarity
Original:  We first show three (counter-intuitive) phenomena: (i) choosing, for each task, the initial k-sequence 1^k is not optimal, (ii) even less intuitive, but not contradictory, we can even start the scheduling from a (fictive) error state (in regard to the initial k-sequence) and (iii) the period of feasible DBP-schedules is not necessarily the task hyper-period.
Revised:  We first show three (counter-intuitive) phenomena: (i) choosing, for each task, the initial k-sequence 1^k is not optimal, (ii) we can even start the scheduling from a (fictive) error state (in regard to the initial k-sequence) and (iii) the period of feasible DBP-schedules is not necessarily the task hyper-period.
Edit intent: coherence
Original:  Lastly, based on our periodicity result we provide an exact feasibility test.
Revised:  Lastly, based on our periodicity result we provide an exact schedulability test.
Edit intent: clarity
Original: Objective: To assess the effectiveness of feedback controlled resonant drift  as a method for low energy defibrillation.
Revised: We aim to assess the effectiveness of feedback controlled resonant drift as a method for low energy defibrillation.
Edit intent: fluency
Original:  Methods: We use a bidomain model of cardiac tissue , with the Courtemancheet al. human atrial ionic kinetics.
Revised:  Methods: We use a bidomain model of cardiac tissue et al. human atrial ionic kinetics.
Edit intent: clarity
Original:  Methods: We use a bidomain model of cardiac tissue , with the Courtemancheet al. human atrial ionic kinetics.
Revised:  Methods: We use a bidomain model of cardiac tissue , with the Courtemanchewith human atrial ionic kinetics.
Edit intent: clarity