wanyu/IteraTeR_v2 huggingface dataset:
Original:  Achieved results demonstrate that suggested data mining framework can be used in modern performance monitoring systems for reliable  detection of random access channel sleeping cells , and as tool for overall improvement of service quality in LTE networks .
Revised:  Achieved results demonstrate that the suggested method can be used in modern performance monitoring systems for reliable detection of random access channel sleeping cells , and as tool for overall improvement of service quality in LTE networks .
Edit intent: clarity
Original:  Achieved results demonstrate that suggested data mining framework can be used in modern performance monitoring systems for reliable  detection of random access channel sleeping cells , and as tool for overall improvement of service quality in LTE networks .
Revised:  Achieved results demonstrate that suggested data mining framework can be used in modern performance monitoring systems for reliable detection of random access channel sleeping cells .
Edit intent: coherence
Original:  Specifically, it is shown that the use of off-centre Steiner vertices , positioned on the faces of the associated Voronoi diagram, typically leads to significant improvements in the shape- and size-quality of the resulting surface tessellations.
Revised:  Specifically, it is shown that the use of off-centre Steiner points , positioned on the faces of the associated Voronoi diagram, typically leads to significant improvements in the shape- and size-quality of the resulting surface tessellations.
Edit intent: clarity
Original:  The performance of the new Frontal-Delaunay scheme is investigated experimentally via a series of comparative studies that contrast its performance with that of a typical Delaunay-refinement technique.
Revised:  The performance of the new scheme is investigated experimentally via a series of comparative studies that contrast its performance with that of a typical Delaunay-refinement technique.
Edit intent: clarity
Original:  It is shown that the new Frontal-Delaunay method inherits many of the best features of classical Delaunay-refinement and advancing-front type methods, leading to the construction of smooth, high quality surface triangulations with bounded radius-edge ratios and convergence guarantees.
Revised:  It is shown that the new method inherits many of the best features of classical Delaunay-refinement and advancing-front type methods, leading to the construction of smooth, high quality surface triangulations with bounded radius-edge ratios and convergence guarantees.
Edit intent: coherence
Original:  Analysis over these data can provide real-time insight into the health of the grid, thereby improving control over operations.
Revised:  Analysis over these data can provide insight into the health of the grid, thereby improving control over operations.
Edit intent: clarity
Original:  The event-detection algorithm rapidly correlates multiple PMU data streams, providing details on events occurring within the power system in real-time .
Revised:  The event-detection algorithm rapidly correlates multiple PMU data streams, providing details on events occurring within the power system .
Edit intent: clarity
Original: Spherical viral shells with icosahedral symmetry are considered as quasicrystalline tilings.
Revised: Spherical viral shells with icosahedral symmetry have been considered as quasicrystalline tilings.
Edit intent: clarity
Original:  The approach describes in a uniform way both the structures satisfying the well-known Caspar and Klug geometrical model and the structures contradicting this model.
Revised:  The approach describes in a uniform way both the structures satisfying the well-known Caspar-Klug geometrical model and the structures contradicting this model.
Edit intent: fluency
Original:  We study duplication-mutation models for processes in natural DNA sequences and  length distributions of exact matches computed both from synthetic and natural sequences.
Revised:  We study duplication-mutation models for processes in natural DNA sequences and the length distributions of exact matches computed both from synthetic and natural sequences.
Edit intent: fluency
Original:  We study duplication-mutation models for processes in natural DNA sequences and  length distributions of exact matches computed both from synthetic and natural sequences.
Revised:  We study duplication-mutation models for processes in natural DNA sequences and length distributions of exact matches computed from both synthetic and natural sequences.
Edit intent: fluency
Original:  For these models a hierarchy of equations for various number of exact matches is represented.
Revised:  Here we present a hierarchy of equations for various number of exact matches is represented.
Edit intent: clarity
Original:  Quantitative correspondence of solutions of the equation and simulations is demonstrated.
Revised:  Quantitative correspondence of solutions of the equation to simulations is demonstrated.
Edit intent: fluency
Original: The paper discusses the asymptotic depth of the reversible circuits consisting of NOT, CNOT and 2-CNOT gates.
Revised: The paper discusses the asymptotic depth of a reversible circuit consisting of NOT, CNOT and 2-CNOT gates.
Edit intent: fluency
Original:  for circuit implementing some transformation f\colon \mathbb Z_2^n \to \mathbb Z_2^n is introduced as a function of n and the number of additional inputs N . It is proved that for the case of implementing  permutation from A(\mathbb Z_2^n)
Revised:  for circuit implementing some transformation f\colon \mathbb Z_2^n \to \mathbb Z_2^n is introduced as a function of n and the number of additional inputs N . It is proved that for the case of implementing a permutation from A(\mathbb Z_2^n)
Edit intent: fluency
Original:  with the reversible circuit having no additional inputs the depth is bounded as D(n, 0) \gtrsim 2 ^{n-1 /  \log_2 n  . It is proved that for the case of implementing  transformation f\colon \mathbb Z_2^n \to \mathbb Z_2^n with the reversible circuit having N _0 \sim 2 ^{n+1 additional inputs the depth is bounded as D(n, N _0) \lesssim 4n .
Revised:  with a reversible circuit having no additional inputs the depth is bounded as D(n, 0) \gtrsim 2 ^{n-1 / \log_2 n . It is proved that for the case of implementing transformation f\colon \mathbb Z_2^n \to \mathbb Z_2^n with the reversible circuit having N _0 \sim 2 ^{n+1 additional inputs the depth is bounded as D(n, N _0) \lesssim 4n .
Edit intent: fluency
Original:  with the reversible circuit having no additional inputs the depth is bounded as D(n, 0) \gtrsim 2 ^{n-1 /  \log_2 n  . It is proved that for the case of implementing  transformation f\colon \mathbb Z_2^n \to \mathbb Z_2^n with the reversible circuit having N _0 \sim 2 ^{n+1 additional inputs the depth is bounded as D(n, N _0) \lesssim 4n .
Revised:  with the reversible circuit having no additional inputs the depth is bounded as D(n, 0) \gtrsim 2 ^{n-1 / \log_2 n ) . It is proved that for the case of implementing transformation f\colon \mathbb Z_2^n \to \mathbb Z_2^n with the reversible circuit having N _0 \sim 2 ^{n+1 additional inputs the depth is bounded as D(n, N _0) \lesssim 4n .
Edit intent: fluency
Original:  with the reversible circuit having no additional inputs the depth is bounded as D(n, 0) \gtrsim 2 ^{n-1 /  \log_2 n  . It is proved that for the case of implementing  transformation f\colon \mathbb Z_2^n \to \mathbb Z_2^n with the reversible circuit having N _0 \sim 2 ^{n+1 additional inputs the depth is bounded as D(n, N _0) \lesssim 4n .
Revised:  with the reversible circuit having no additional inputs the depth is bounded as D(n, 0) \gtrsim 2 ^{n-1 / \log_2 n . It is proved that for the case of implementing a transformation f\colon \mathbb Z_2^n \to \mathbb Z_2^n with the reversible circuit having N _0 \sim 2 ^{n+1 additional inputs the depth is bounded as D(n, N _0) \lesssim 4n .
Edit intent: fluency
Original:  with the reversible circuit having no additional inputs the depth is bounded as D(n, 0) \gtrsim 2 ^{n-1 /  \log_2 n  . It is proved that for the case of implementing  transformation f\colon \mathbb Z_2^n \to \mathbb Z_2^n with the reversible circuit having N _0 \sim 2 ^{n+1 additional inputs the depth is bounded as D(n, N _0) \lesssim 4n .
Revised:  with the reversible circuit having no additional inputs the depth is bounded as D(n, 0) \gtrsim 2 ^{n-1 / \log_2 n . It is proved that for the case of implementing transformation f\colon \mathbb Z_2^n \to \mathbb Z_2^n with a reversible circuit having N _0 \sim 2 ^{n+1 additional inputs the depth is bounded as D(n, N _0) \lesssim 4n .
Edit intent: fluency
Original:  with the reversible circuit having no additional inputs the depth is bounded as D(n, 0) \gtrsim 2 ^{n-1 /  \log_2 n  . It is proved that for the case of implementing  transformation f\colon \mathbb Z_2^n \to \mathbb Z_2^n with the reversible circuit having N _0 \sim 2 ^{n+1 additional inputs the depth is bounded as D(n, N _0) \lesssim 4n .
Revised:  with the reversible circuit having no additional inputs the depth is bounded as D(n, 0) \gtrsim 2 ^{n-1 / \log_2 n . It is proved that for the case of implementing transformation f\colon \mathbb Z_2^n \to \mathbb Z_2^n with the reversible circuit having N _0 \sim 2 ^{n+1 additional inputs the depth is bounded as D(n, q _0) \lesssim 4n .
Edit intent: fluency
Original:  Using the generalized Lotka-Volterra equations, we show that sustainable coexistence necessitates a nonzero determinant of the interaction matrix , a requirement that is equivalent to demanding that each species is part of a non-overlapping pairing .
Revised:  Using the generalized Lotka-Volterra equations, sustainable coexistence necessitates a nonzero determinant of the interaction matrix , a requirement that is equivalent to demanding that each species is part of a non-overlapping pairing .
Edit intent: coherence
Original:  Using the generalized Lotka-Volterra equations, we show that sustainable coexistence necessitates a nonzero determinant of the interaction matrix , a requirement that is equivalent to demanding that each species is part of a non-overlapping pairing .
Revised:  Using the generalized Lotka-Volterra equations, we show that sustainable coexistence necessitates nonzero determinant of the interaction matrix , a requirement that is equivalent to demanding that each species is part of a non-overlapping pairing .
Edit intent: fluency
Original:  Using the generalized Lotka-Volterra equations, we show that sustainable coexistence necessitates a nonzero determinant of the interaction matrix , a requirement that is equivalent to demanding that each species is part of a non-overlapping pairing .
Revised:  Using the generalized Lotka-Volterra equations, we show that sustainable coexistence necessitates a nonzero determinant of the interaction matrix . Here we show that this requirement is equivalent to demanding that each species is part of a non-overlapping pairing .
Edit intent: coherence
Original:  Using the generalized Lotka-Volterra equations, we show that sustainable coexistence necessitates a nonzero determinant of the interaction matrix , a requirement that is equivalent to demanding that each species is part of a non-overlapping pairing .
Revised:  Using the generalized Lotka-Volterra equations, we show that sustainable coexistence necessitates a nonzero determinant of the interaction matrix , a requirement that is equivalent to demanding that each species be part of a non-overlapping pairing .
Edit intent: fluency
Original:  For the species richness at each trophic level, these assembly rules specify sustainable combinations.
Revised:  For the species richness at each trophic level, we derive the food web assembly rules, which specify sustainable combinations.
Edit intent: clarity
Original:  In neighboring levels, the rules allow the higher level to avert competitive exclusion at the lower, thereby incorporating apparent competition.
Revised:  In neighboring levels, these rules allow the higher level to avert competitive exclusion at the lower, thereby incorporating apparent competition.
Edit intent: fluency
Original:  In agreement with empirical datathe constraints predict high species numbers at intermediate levels and thinning at the top and bottom.
Revised:  In agreement with data, the assembly rules predict high species numbers at intermediate levels and thinning at the top and bottom.
Edit intent: clarity
Original:  Using comprehensive food web data, we demonstrate how omnivores or parasites with hosts at multiple trophic levels can loosen the constraints and increase robustness in food webs.
Revised:  Using comprehensive food web data, we demonstrate how omnivores or parasites with hosts at multiple trophic levels can loosen the constraints and help obtain coexistence in food webs.
Edit intent: clarity
Original:  We further explore how concomitant predation, caused by consumption of parasites by their hosts' predators, adds further possibilities of non-overlapping pairing and thereby supports coexistence .
Revised:  Hence, omnivory may be the glue that keeps communities intact even under extinction or ecological release of species .
Edit intent: coherence
Original: Convolutional Neural Networks (CNNs) have demonstrated its great performance in various vision tasks, such as image classification and object detection.
Revised: Convolutional neural network (CNN) models have demonstrated great success in various computer vision tasks including image classification and object detection.
Edit intent: clarity
Original:  However, there are still some areas that are untouched, such as visual tracking  .
Revised:  However, some equally important tasks such as visual tracking .
Edit intent: clarity
Original:  However, there are still some areas that are untouched, such as visual tracking  .
Revised:  However, there are still some areas that are untouched, such as visual tracking remain relatively unexplored .
Edit intent: clarity
Original:  We believe that the biggest bottleneck of applying CNN for visual tracking is lack of training data.
Revised:  We believe that a major hurdle that hinders the application of CNN to visual tracking is lack of training data.
Edit intent: clarity
Original:  The power of CNN usually relies on huge (possible millions) training data , however in visual tracking we only have one labeled sample in  the first frame .
Revised:  The power of CNN often need an enormous amount of training data in the first frame .
Edit intent: clarity
Original:  The power of CNN usually relies on huge (possible millions) training data , however in visual tracking we only have one labeled sample in  the first frame .
Revised:  The power of CNN usually relies on huge (possible millions) training data , however in visual tracking we only have one labeled sample in the order of millions, visual tracking applications typically have only one labeled example in the first frame .
Edit intent: clarity
Original:  In this paper, we address this issue by transferring rich feature hierarchies from an offline pretrained CNN into online tracking.
Revised:  In this paper, we address this issue by transferring rich feature hierarchies learned to online tracking.
Edit intent: clarity
Original:  In online tracking, the CNN is also finetuned to adapt to the appearance of the tracked target specified in the first frame of the video.
Revised:  The CNN is also finetuned to adapt to the appearance of the tracked target specified in the first frame of the video.
Edit intent: clarity
Original:  In online tracking, the CNN is also finetuned to adapt to the appearance of the tracked target specified in the first frame of the video.
Revised:  In online tracking, the CNN is also fine-tuned during online tracking to adapt to the appearance of the tracked target specified in the first frame of the video.
Edit intent: clarity
Original:  This joint optimization problem is faced by considering a suitable objective function and by adopting a genetic algorithm as global optimization strategy.
Revised:  This joint optimization problem is faced considering a suitable objective function and by adopting a genetic algorithm as global optimization strategy.
Edit intent: fluency
Original:  This joint optimization problem is faced by considering a suitable objective function and by adopting a genetic algorithm as global optimization strategy.
Revised:  This joint optimization problem is faced by considering a suitable objective function and by adopting genetic algorithms as global optimization strategy.
Edit intent: fluency
Original:  We improve the Abramov-Petkovsek reduction so as to decompose a hypergeometric term as the sum of a summable term and a non-summable one.
Revised:  We modify the Abramov-Petkovsek reduction so as to decompose a hypergeometric term as the sum of a summable term and a non-summable one.
Edit intent: clarity
Original: Biological functions are often realized by groups of interacting molecules or cells . Membership in these groups may overlap when molecules or cells are reused in multiple functions.
Revised: Biological functions are carried out by groups of interacting molecules or cells . Membership in these groups may overlap when molecules or cells are reused in multiple functions.
Edit intent: clarity
Original: Biological functions are often realized by groups of interacting molecules or cells . Membership in these groups may overlap when molecules or cells are reused in multiple functions.
Revised: Biological functions are often realized by groups of interacting molecules or cells . Membership in these communities may overlap when molecules or cells are reused in multiple functions.
Edit intent: clarity
Original: Biological functions are often realized by groups of interacting molecules or cells . Membership in these groups may overlap when molecules or cells are reused in multiple functions.
Revised: Biological functions are often realized by groups of interacting molecules or cells . Membership in these groups may overlap when biological components are involved in multiple functions.
Edit intent: clarity
Original:  These two limitations reduce our ability to accurately define clusters in biological datasets and to interpret their biological functions.
Revised:  These two limitations reduce our ability to detect biological communities, and therefore our ability to understand biological functions.
Edit intent: clarity
Original: We revisit the type-theoretic account of higher-order model-checking by Kobayashi and Ong in the light of linear logic and of its relational semantics.
Revised: In this article, we develop a new and somewhat unexpected connection between higher-order model-checking by Kobayashi and Ong in the light of linear logic and of its relational semantics.
Edit intent: clarity
Original:  We then observe that the type of this encoding is dual to the one of alternating tree automata A on the same signature.
Revised:  We then observe that the type of this encoding is dual to the one of alternating tree automata (ATA) of the same signature.
Edit intent: clarity
Original:  We then extend this result to the more difficult case of alternating parity tree automata (APT) . A meticulous analysis of the Kobayashi-Ong type system leads us to the interesting discovery that the colors of APT behave exactly as a parametric version of the exponential modality of linear logic .
Revised:  We then extend this result to alternating parity automata (APT) . A meticulous analysis of the Kobayashi-Ong type system leads us to the interesting discovery that the colors of APT behave exactly as a parametric version of the exponential modality of linear logic .
Edit intent: clarity
Original:  We then extend this result to the more difficult case of alternating parity tree automata (APT) . A meticulous analysis of the Kobayashi-Ong type system leads us to the interesting discovery that the colors of APT behave exactly as a parametric version of the exponential modality of linear logic .
Revised:  We then extend this result to the more difficult case of alternating parity tree automata (APT) by introducing a parametric version of the exponential modality of linear logic .
Edit intent: coherence
Original:  Here, we provide an alternative view of this entailment in terms of linear programming duality .
Revised:  By exploiting a previously noted alternative view of this entailment in terms of linear programming duality .
Edit intent: clarity
Original:  By exploiting a previously noted alternative view of this entailment in terms of linear programming duality, we characterize exactly the cases of entailment from arbitrary numbers of premises  .
Revised:  By exploiting a previously noted alternative view of the entailment in terms of linear programming duality, we characterize exactly the cases of entailment from arbitrary numbers of premises .
Edit intent: fluency
Original:  From the quantum law of reciprocity, we derive new empirical predictions that we call the Grand Reciprocity equations, that must be satisfied by  quantum-like models  on the condition that they are non-degenerate.
Revised:  From the quantum law of reciprocity, we derive new empirical predictions that we call the Grand Reciprocity equations, that must be satisfied by quantum-like models , on the condition that they are non-degenerate.
Edit intent: fluency
Original:  We show that existing non-degenerate quantum-like models for order effects fail this teston several existing data sets .
Revised:  Using only existing data sets, we show that most models on which these equations apply fail the test .
Edit intent: clarity
Original:  In this paper, we limit ourselves to such quantum-like models that address question order effects, i.e. cases in which given answers depend on the order of presentation of the questions.
Revised:  We consider here some such quantum-like models that address question order effects, i.e. cases in which given answers depend on the order of presentation of the questions.
Edit intent: clarity
Original:   From the quantum law of reciprocity, we derive new empirical predictions that we call the Grand Reciprocity equations, that must be satisfied by many existing quantum-like models, on the condition that they are non-degenerate .
Revised:  From the quantum law of reciprocity, we derive new empirical predictions that we call the Grand Reciprocity equations, that must be satisfied by several existing quantum-like models, on the condition that they are non-degenerate .
Edit intent: clarity
Original:   From the quantum law of reciprocity, we derive new empirical predictions that we call the Grand Reciprocity equations, that must be satisfied by many existing quantum-like models, on the condition that they are non-degenerate .
Revised:  From the quantum law of reciprocity, we derive new empirical predictions that we call the Grand Reciprocity equations, that must be satisfied by many existing quantum-like models, in their non-degenerate .
Edit intent: clarity
Original:  We take it to suggest thatdegenerate quantum-like models should be the focus of forthcoming research in the area, and that more research should be done on the empirical adequacy of  quantum-like models more generally .
Revised:  We take it to suggest thatdegenerate quantum-like models should be the focus of forthcoming research in the area, and that more research should be done on the empirical adequacy of degenerate quantum-like models more generally .
Edit intent: fluency
Original:  We take it to suggest thatdegenerate quantum-like models should be the focus of forthcoming research in the area, and that more research should be done on the empirical adequacy of  quantum-like models more generally .
Revised:  We take it to suggest thatdegenerate quantum-like models should be the focus of forthcoming research in the area, and that more research should be done on the empirical adequacy of quantum-like models in general .
Edit intent: clarity
Original:  In Part 2 we will present results of experiments with a large citation network of astrophysical papers .
Revised:  In Part 2 we will present results of experiments with with citation networks .
Edit intent: clarity