wanyu/IteraTeR_v2 huggingface dataset:
Original:  CSD starts by partitioning the curve skeleton of a tubular object into maximal-length sub-skeletons , minimizing an orientation objective.
Revised:  CSD starts by partitioning the curve skeleton into maximal-length sub-skeletons , minimizing an orientation objective.
Edit intent: clarity
Original:  CSD further rectify/reconstructs these semantic components using generalized cylinders.
Revised:  CSD further reconstructs the semantic components between parts using generalized cylinders.
Edit intent: clarity
Original:  We demonstrate the application of CSD in the segmentation of large-scale 3D electron microscopy image datasets of myelinated axons, the decomposition of vascular networks, and synthetic objects.
Revised:  We apply CSD for the segmentation of large-scale 3D electron microscopy image datasets of myelinated axons, the decomposition of vascular networks, and synthetic objects.
Edit intent: clarity
Original:  We demonstrate the application of CSD in the segmentation of large-scale 3D electron microscopy image datasets of myelinated axons, the decomposition of vascular networks, and synthetic objects.
Revised:  We demonstrate the application of CSD in the segmentation of axons in large 3D electron microscopy image datasets of myelinated axons, the decomposition of vascular networks, and synthetic objects.
Edit intent: clarity
Original:  We demonstrate the application of CSD in the segmentation of large-scale 3D electron microscopy image datasets of myelinated axons, the decomposition of vascular networks, and synthetic objects.
Revised:  We demonstrate the application of CSD in the segmentation of large-scale 3D electron microscopy images, and the decomposition of vascular networks, and synthetic objects.
Edit intent: clarity
Original:  We demonstrate the application of CSD in the segmentation of large-scale 3D electron microscopy image datasets of myelinated axons, the decomposition of vascular networks, and synthetic objects.
Revised:  We demonstrate the application of CSD in the segmentation of large-scale 3D electron microscopy image datasets of myelinated axons, the decomposition of vascular networks, as well as synthetic objects.
Edit intent: clarity
Original:  We also compare CSD to other state-of-the-art decomposition techniques in these applications .
Revised:  We show that CSD outperforms state-of-the-art decomposition techniques in these applications .
Edit intent: clarity
Original: We develop a cylindrical shape decomposition (CSD) algorithm to decompose an object, which is a union of several tubular structures, into its semantic components.
Revised: We develop a cylindrical shape decomposition (CSD) algorithm to decompose an object, a union of several tubular structures, into its semantic components.
Edit intent: coherence
Original:  For that, CSD partitions the curve skeleton into maximal-length sub-skeletons over an orientation function , each sub-skeleton corresponds to a semantic component.
Revised:  For that, CSD partitions the curve skeleton into maximal-length sub-skeletons over an orientation cost , each sub-skeleton corresponds to a semantic component.
Edit intent: clarity
Original:  CSD further reconstructs the semantic components between parts using generalized cylinders.
Revised:  The proposed method further reconstructs the semantic components between parts using generalized cylinders.
Edit intent: clarity
Original:  CSD further reconstructs the semantic components between parts using generalized cylinders.
Revised:  CSD further reconstructs the acquired semantic components at the intersection of object parts using generalized cylinders.
Edit intent: clarity
Original:  We apply CSD for the segmentation of axons in large 3D electron microscopy images , and the decomposition of vascular networks , as well as synthetic objects.
Revised:  We apply CSD for segmenting axons in large 3D electron microscopy images , and the decomposition of vascular networks , as well as synthetic objects.
Edit intent: clarity
Original:  We apply CSD for the segmentation of axons in large 3D electron microscopy images , and the decomposition of vascular networks , as well as synthetic objects.
Revised:  We apply CSD for the segmentation of axons in large 3D electron microscopy images and decomposing vascular networks and synthetic objects.
Edit intent: coherence
Original:  We show that CSD outperforms state-of-the-art decomposition techniques in these applications.
Revised:  We show that CSD outperforms state-of-the-art decomposition techniques in its applications.
Edit intent: clarity
Original:  Novel to our formulation is the ability to simultaneously solve interdependent synthesis goals --- the key technique , called live bidirectional evaluation, iteratively solves constraints that arise during "forward" evaluation of candidate completions and propagates examples "backward" through partial results.
Revised:  Novel to our formulation is the ability to simultaneously solve interdependent synthesis goals --- the key technique , called live bidirectional evaluation, propagates examples "backward" through partial results.
Edit intent: clarity
Original:  On benchmarks used to evaluate  a state-of-the-art example-based synthesis technique , Sketch-n-Myth requires on average 55 \% of the number of examples (even without sketches) by overcoming the example trace-completeness requirement of previous work.
Revised:  On benchmarks used to evaluate a state-of-the-art example-based synthesis tool , Sketch-n-Myth requires on average 55 \% of the number of examples (even without sketches) by overcoming the example trace-completeness requirement of previous work.
Edit intent: clarity
Original:  Compared to previous example-based synthesis techniques, live bidirectional evaluation enables Sketch-n-Myth to (a) synthesize recursive functions without trace-complete  examples and (b) specify and solve interdependent synthesis goals.
Revised:  Live bidirectional evaluation enables Sketch-n-Myth to (a) synthesize recursive functions without trace-complete examples and (b) specify and solve interdependent synthesis goals.
Edit intent: coherence
Original:  Compared to previous example-based synthesis techniques, live bidirectional evaluation enables Sketch-n-Myth to (a) synthesize recursive functions without trace-complete  examples and (b) specify and solve interdependent synthesis goals.
Revised:  Compared to previous example-based synthesis techniques, live bidirectional evaluation enables Sketch-n-Myth to (a) synthesize recursive functions without trace-complete sets of examples and (b) specify and solve interdependent synthesis goals.
Edit intent: clarity
Original: For the Tikhonov regularization of ill-posed nonlinear operator equations  in a Hilbert scale setting , the convergence of regularized solutions is studied .
Revised: For the Tikhonov regularization of ill-posed nonlinear operator equations in a Hilbert scale setting .
Edit intent: clarity
Original:  This paper introduces a class of locality-sensitive one-pass  hash algorithms that are orders of magnitude faster than the original approach.
Revised:  This paper introduces a class of one-pass hash algorithms that are orders of magnitude faster than the original approach.
Edit intent: clarity
Original:  Two of them are statistically equivalent to the original approach and can be used as direct replacements.
Revised:  Two of them are statistically equivalent to the original approach and can be used as drop-in replacements.
Edit intent: clarity
Original:  The other two may even improve the estimation error by breaking the statistical independence of signature components.
Revised:  The other two may even improve the estimation error by introducing statistical dependence between signature components.
Edit intent: clarity
Original: The question of how the information content of a particle in a flow-field can be quantified is addressed theoretically within the general framework of nonequilibrium statistical physics .
Revised: Flow-fields are ubiquitous systems that are able to transport vital signalling molecules necessary for system function. While information regarding the location and transport of such particles is often crucial, it is not well-understood how to quantify the information in such stochastic systems. Using the framework of nonequilibrium statistical physics .
Edit intent: coherence
Original:  It is observed that the rotational component of a flow-field , which characterizes the degree of irreversibility of the stochastic dynamics, does not explicitly appear in the equation that quantifies the rate of system entropy production.
Revised:  It is observed that the rotational component of a flow-field does not explicitly appear in the equation that quantifies the rate of system entropy production.
Edit intent: clarity
Original:  It is observed that the rotational component of a flow-field , which characterizes the degree of irreversibility of the stochastic dynamics, does not explicitly appear in the equation that quantifies the rate of system entropy production.
Revised:  It is observed that the rotational component of a flow-field , which characterizes the degree of irreversibility of the stochastic dynamics, does not explicitly appear in the generalized potential that governs the rate of system entropy production.
Edit intent: clarity
Original:  The residence time of a particle in an arbitrary neighborhood of a flow field is characterized in terms of the flow properties.
Revised:  Specifically, in the neighborhood of a flow field is characterized in terms of the flow properties.
Edit intent: clarity
Original:  These results shed light on how information can be measured and controlled in complex artificial and living flow-based systems.
Revised:  These results shed light on how information can be analyzed and controlled in complex artificial and living flow-based systems.
Edit intent: clarity
Original: We show that consistency of Statistical EL knowledge bases, as defined by Penaloza and Potyka in SUM 2017 4 is ExpTime-hard.
Revised: We show that the consistency problem for Statistical ontologies, defined by Pe\~{n and Potyka in SUM 2017 4 is ExpTime-hard.
Edit intent: clarity
Original:  Together with the existing ExpTime upper bound by Baader in FroCos 2017 1 , the result leads to the ExpTime-completeness of the mentioned logic.
Revised:  Together with the existing ExpTime upper bound by Baader in FroCos 2017 1 , we conclude ExpTime-completeness of the mentioned logic.
Edit intent: clarity
Original:  Together with the existing ExpTime upper bound by Baader in FroCos 2017 1 , the result leads to the ExpTime-completeness of the mentioned logic.
Revised:  Together with the existing ExpTime upper bound by Baader in FroCos 2017 1 , the result leads to the ExpTime-completeness of the logic.
Edit intent: coherence
Original:  Our proof goes via a reduction from consistency of EL extended with an atomic negation , which is known to be equivalent to the well-known ExpTime-complete description logic ALC .
Revised:  Our proof goes via a reduction from the consistency problem for EL extended with an atomic negation , which is known to be equivalent to the well-known ExpTime-complete description logic ALC .
Edit intent: clarity
Original:  Our proof goes via a reduction from consistency of EL extended with an atomic negation , which is known to be equivalent to the well-known ExpTime-complete description logic ALC .
Revised:  Our proof goes via a reduction from consistency of EL extended with negation of atomic concepts .
Edit intent: clarity
Original: We show that the consistency problem for Statistical ontologies, defined by Pe\~{n}aloza and Potyka in SUM 2017 , is ExpTime-hard.
Revised: We show that the consistency problem for Statistical ontologies, defined by Pe\~{n}aloza and Potyka , is ExpTime-hard.
Edit intent: coherence
Original:  Together with recent developments of Baader and Ecke from GCAI 2017 , we conclude ExpTime-completeness of the logic.
Revised:  Together with recent results of Baader and Ecke from GCAI 2017 , we conclude ExpTime-completeness of the logic.
Edit intent: clarity
Original:  Together with recent developments of Baader and Ecke from GCAI 2017 , we conclude ExpTime-completeness of the logic.
Revised:  Together with recent developments of Baader and Ecke , we conclude ExpTime-completeness of the logic.
Edit intent: coherence
Original: We show that the consistency problem for Statistical ontologies, defined by Pe \~{n aloza and Potyka, is ExpTime-hard.
Revised: We show that the for Statistical EL ontologies, defined by Pe \~{n aloza and Potyka, is ExpTime-hard.
Edit intent: clarity
Original: We show that the consistency problem for Statistical ontologies, defined by Pe \~{n aloza and Potyka, is ExpTime-hard.
Revised: We show that the consistency problem for Statistical ontologies, defined by Pe \~{n aloza and Potyka, is ExpTime-hard.
Edit intent: fluency
Original: The IETF's Prague L4S Requirements  expect an L4S congestion control to somehow detect the presence of a classic (RFC 3168) ECN  AQM at the bottleneck and fall back to Reno-friendly behaviour (as they do on a loss).
Revised: The IETF's Prague L4S Requirements expect an L4S congestion control to somehow detect if there is a classic ECN AQM at the bottleneck and fall back to Reno-friendly behaviour (as they do on a loss).
Edit intent: clarity
Original: The IETF's Prague L4S Requirements  expect an L4S congestion control to somehow detect the presence of a classic (RFC 3168) ECN  AQM at the bottleneck and fall back to Reno-friendly behaviour (as they do on a loss).
Revised: The IETF's Prague L4S Requirements expect an L4S congestion control to somehow detect the presence of a classic (RFC 3168) ECN AQM at the bottleneck and fall back to Reno-friendly behaviour (as it would on a loss).
Edit intent: clarity
Original:  In this study, we tested whether return-sweep saccades are also guided by font size information and whether this guidance depends on visual acuity constraints .
Revised:  In this study, we tested whether return-sweep saccades are also guided by font size information and whether this guidance depends on visual acuity of the return-sweep target area .
Edit intent: clarity
Original:  The larger font resulted in return-sweeps that landed further to the right of the line start and in a reduction of corrective saccades compared to the smaller font.
Revised:  The larger font resulted in return-sweeps that landed further to the right of the line start and in a reduction of under-sweeps compared to the smaller font.
Edit intent: clarity
Original:  This likely reflects an increase in saccadic range error with the increase in  saccade size.
Revised:  This likely reflects an increase in saccadic range error with the increase in intended saccade size.
Edit intent: clarity
Original:  Critically , however , there was no interaction between font size and line length.
Revised:  Critically , there was no interaction between font size and line length.
Edit intent: coherence
Original:  We also obtain the probability distribution of length of the hypha , and find that it tends to a Gaussian distribution function at late times.
Revised:  We also find that the probability distribution of length of the hypha , and find that it tends to a Gaussian distribution function at late times.
Edit intent: clarity
Original:  We also obtain the probability distribution of length of the hypha , and find that it tends to a Gaussian distribution function at late times.
Revised:  We also obtain the probability distribution of length of the hypha tends to a Gaussian distribution function at late times.
Edit intent: coherence
Original:  In contrast, we find that probability distribution function of the time required for growth to a specific length is a broad log-normal distribution.
Revised:  In contrast, the probability distribution function of the time required for growth to a specific length is a broad log-normal distribution.
Edit intent: coherence
Original:  In contrast, we find that probability distribution function of the time required for growth to a specific length is a broad log-normal distribution.
Revised:  In contrast, we find that probability distribution function of the time required for growth to a specific length tends to a broad log-normal distribution.
Edit intent: clarity
Original: A coalition of agents, or a single agent, has an ethical dilemma between several statements if each joint action of the coalition forces at least one specific statement among them to be true.
Revised: An agent, or a coalition of agents, or a single agent, has an ethical dilemma between several statements if each joint action of the coalition forces at least one specific statement among them to be true.
Edit intent: clarity
Original: A coalition of agents, or a single agent, has an ethical dilemma between several statements if each joint action of the coalition forces at least one specific statement among them to be true.
Revised: A coalition of agents, faces an ethical dilemma between several statements if each joint action of the coalition forces at least one specific statement among them to be true.
Edit intent: clarity
Original: A coalition of agents, or a single agent, has an ethical dilemma between several statements if each joint action of the coalition forces at least one specific statement among them to be true.
Revised: A coalition of agents, or a single agent, has an ethical dilemma between several statements if she is forced to make a conscious choice between which of these statements will be true.
Edit intent: clarity
Original:  The paper presents a sound and complete modal logical system that describes properties of dilemmas for a given limit on a sacrifice .
Revised:  The paper presents a sound and complete axiomatization of the properties of this modality with sacrifice in games with perfect information .
Edit intent: clarity
Original:  We are interested in the issue whether quantitative error bounds can be a priori guaranteed in applications (e.g. ~scientific computing, mathematical finance , machine learning).
Revised:  We are interested in the issue whether quantitative error bounds can be a priori guaranteed in applications (e.g. mathematical finance but also scientific computing and machine learning).
Edit intent: coherence
Original:  We consider here wo strategies in order to localize to a bounded set the standard kernels defined in the whole Euclidian space (exponential, multiquadric, Gaussian, truncated), namely, on one hand the class of periodic kernels defined via a discrete Fourier transform on a lattice , and on the other hand the class of transported kernelswith compact support .
Revised:  We consider two strategies in order to localize to a bounded set the standard kernels defined in the whole Euclidian space (exponential, multiquadric, Gaussian, truncated), namely, on one hand the class of periodic kernels defined via a discrete Fourier transform on a lattice , and on the other hand the class of transported kernelswith compact support .
Edit intent: clarity
Original:  We consider here wo strategies in order to localize to a bounded set the standard kernels defined in the whole Euclidian space (exponential, multiquadric, Gaussian, truncated), namely, on one hand the class of periodic kernels defined via a discrete Fourier transform on a lattice , and on the other hand the class of transported kernelswith compact support .
Revised:  We consider here wo strategies in order to localize to a bounded set the standard kernels defined in the whole Euclidian space (exponential, multiquadric, Gaussian, truncated), namely, on one hand the class of periodic kernels defined via a discrete Fourier transform on a lattice and, on the other hand the class of transported kernelswith compact support .
Edit intent: fluency
Original:  We consider here wo strategies in order to localize to a bounded set the standard kernels defined in the whole Euclidian space (exponential, multiquadric, Gaussian, truncated), namely, on one hand the class of periodic kernels defined via a discrete Fourier transform on a lattice , and on the other hand the class of transported kernelswith compact support .
Revised:  We consider here wo strategies in order to localize to a bounded set the standard kernels defined in the whole Euclidian space (exponential, multiquadric, Gaussian, truncated), namely, on one hand the class of periodic kernels defined via a discrete Fourier transform on a lattice , and on the other hand , a class of transport-based kernels .
Edit intent: clarity
Original:  First of all, based on heuristic arguments and using on a Poisson formula on a lattice, we derive theoretical bounds satisfied by the discrepancy function for periodic kernels.
Revised:  First of all, relying on a Poisson formula on a lattice, we derive theoretical bounds satisfied by the discrepancy function for periodic kernels.
Edit intent: clarity
Original:  First of all, based on heuristic arguments and using on a Poisson formula on a lattice, we derive theoretical bounds satisfied by the discrepancy function for periodic kernels.
Revised:  First of all, based on heuristic arguments and using on a Poisson formula on a lattice, we derive theoretical bounds satisfied by the discrepancy function of periodic kernels.
Edit intent: fluency
Original:  Second, for each kernel of exponential, multiquadric, Gaussian, truncated type, we perform the extensive numerical experiments required in order to generate the optimal distributions of points and the discrepancy  functions.
Revised:  Second, for each kernel of interest, we perform the extensive numerical experiments required in order to generate the optimal distributions of points and the discrepancy functions.
Edit intent: clarity
Original:  Second, for each kernel of exponential, multiquadric, Gaussian, truncated type, we perform the extensive numerical experiments required in order to generate the optimal distributions of points and the discrepancy  functions.
Revised:  Second, for each kernel of exponential, multiquadric, Gaussian, truncated type, we perform the numerical experiments that are required in order to generate the optimal distributions of points and the discrepancy functions.
Edit intent: clarity
Original:  Our numerical results  provide us with quantitative estimates of the error made with  kernel-based strategy vs. a purely random strategy , and also validate our theoretical analysis .
Revised:  Our numerical results provide us with quantitative estimates for the error made with kernel-based strategy vs. a purely random strategy , and also validate our theoretical analysis .
Edit intent: fluency
Original:  Our numerical results  provide us with quantitative estimates of the error made with  kernel-based strategy vs. a purely random strategy , and also validate our theoretical analysis .
Revised:  Our numerical results provide us with quantitative estimates of the error made with a kernel-based strategy vs. a purely random strategy , and also validate our theoretical analysis .
Edit intent: fluency
Original:  Our numerical results  provide us with quantitative estimates of the error made with  kernel-based strategy vs. a purely random strategy , and also validate our theoretical analysis .
Revised:  Our numerical results provide us with quantitative estimates of the error made with kernel-based strategy as opposed to a purely random strategy , and also validate our theoretical analysis .
Edit intent: fluency
Original:  Our numerical results  provide us with quantitative estimates of the error made with  kernel-based strategy vs. a purely random strategy , and also validate our theoretical analysis .
Revised:  Our numerical results provide us with quantitative estimates of the error made with kernel-based strategy vs. a purely random strategy .
Edit intent: clarity
Original:  Specifically, i) the accuracy of spike-coded SNNs is usually sensitive to any network change ;
Revised:  Specifically, i) the accuracy of SNNs is usually sensitive to any network change ;
Edit intent: clarity