wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Application of this approach could have relevance not only to interventional therapies to target the cardiac components to prevent sudden death, but also to a wide range of systems to mitigate or prevent the imminent order-disorder phase transition
Revised:  This approach is applicable to interventional therapies to target the cardiac components to prevent sudden death, but also to a wide range of systems to mitigate or prevent the imminent order-disorder phase transition
Edit intent: clarity
Original:  Application of this approach could have relevance not only to interventional therapies to target the cardiac components to prevent sudden death, but also to a wide range of systems to mitigate or prevent the imminent order-disorder phase transition
Revised:  Application of this approach could have relevance not only to interventional therapies to prevent sudden death, but also to a wide range of systems to mitigate or prevent the imminent order-disorder phase transition
Edit intent: clarity
Original:  Application of this approach could have relevance not only to interventional therapies to target the cardiac components to prevent sudden death, but also to a wide range of systems to mitigate or prevent the imminent order-disorder phase transition
Revised:  Application of this approach could have relevance not only to interventional therapies to target the cardiac components to prevent sudden death, as well as to a wide range of systems to mitigate or prevent the imminent order-disorder phase transition
Edit intent: fluency
Original:  Application of this approach could have relevance not only to interventional therapies to target the cardiac components to prevent sudden death, but also to a wide range of systems to mitigate or prevent the imminent order-disorder phase transition
Revised:  Application of this approach could have relevance not only to interventional therapies to target the cardiac components to prevent sudden death, but also to a wide range of systems to mitigate or prevent imminent phase transitions.
Edit intent: clarity
Original:  The proposed estimation procedure does not require any interpolation processing of the original data and is applicable to quite fine resolution data. The validity of the proposed estimators is shown under the continuous-time framework  developed in our previous work Hayashi and Koike ( 2016 ).
Revised:  The proposed estimation procedure does not require any interpolation processing of the original data and is applicable to those with highest time resolution available. Consistency of the proposed estimators is shown under the continuous-time framework developed in our previous work Hayashi and Koike ( 2016 ).
Edit intent: meaning-changed
Original:  In this paper , we discuss the ways to infer causality in fMRI research . We also formulate recommendations for the future directions in this area.
Revised:  In this paper , we discuss the ways to infer causality in fMRI research : Bayesian Nets, Dynamical Causal Modelling, Granger Causality, Likelihood Ratios, LiNGAM, Patel's Tau, Structural Equation Modelling, and Transfer Entropy. We finish with formulating some recommendations for the future directions in this area.
Edit intent: meaning-changed
Original:  We give an  algorithm that decides whether a given polyhedron with n facets is castable with a single-part mold , and if so indicates how to orient the polyhedron in the mold and a direction in which the product can be pulled out without breaking the mold.
Revised:  We give an O(n)-time algorithm that decides whether a given polyhedron with n facets is castable with a single-part mold , and if so indicates how to orient the polyhedron in the mold and a direction in which the product can be pulled out without breaking the mold.
Edit intent: meaning-changed
Original:  We give an  algorithm that decides whether a given polyhedron with n facets is castable with a single-part mold , and if so indicates how to orient the polyhedron in the mold and a direction in which the product can be pulled out without breaking the mold.
Revised:  We give an algorithm that decides whether a given polyhedron with n facets is castable with a single-part mold . When possible, our algorithm provides an orientation of the polyhedron in the mold and a direction in which the product can be pulled out without breaking the mold.
Edit intent: coherence
Original:  We give an  algorithm that decides whether a given polyhedron with n facets is castable with a single-part mold , and if so indicates how to orient the polyhedron in the mold and a direction in which the product can be pulled out without breaking the mold.
Revised:  We give an algorithm that decides whether a given polyhedron with n facets is castable with a single-part mold , and if so indicates how to orient the polyhedron in the mold and a direction in which the product can be removed without breaking the mold.
Edit intent: clarity
Original:  Our algorithm runs in O(n ) time. The best previously known algorithm for this problem runs in O(n^2) time .
Revised:  Moreover, we provide an optimal \Theta(n \log n)-time algorithm to compute all valid removal directions for polyhdera that are castable with a single-part mold. Both algorithms are an improvement by a linear factor over the previously best known algorithms for both of these problems .
Edit intent: meaning-changed
Original: We introduce a general class of stochastic processes driven by a multifractional Brownian motion (mBm) and study  estimation problems of their pointwise H\"older exponents (PHE) based on a new localized generalized quadratic variation approach  .
Revised: We introduce a general class of stochastic processes driven by a multifractional Brownian motion (mBm) and study the estimation problems of their pointwise H\"older exponents (PHE) based on a new localized generalized quadratic variation approach .
Edit intent: fluency
Original: We introduce a general class of stochastic processes driven by a multifractional Brownian motion (mBm) and study  estimation problems of their pointwise H\"older exponents (PHE) based on a new localized generalized quadratic variation approach  .
Revised: We introduce a general class of stochastic processes driven by a multifractional Brownian motion (mBm) and study estimation problems of their pointwise H\"older exponents (PHE) based on a new localized generalized quadratic variation approach (LGQV) .
Edit intent: meaning-changed
Original:  By comparing our suggested approach with the other two existing benchmark estimation approaches ( classicial LGQV and oscillation approach) through a simulation study, we show that our estimator has better performance in the case where the observed process is some unknown bivariate function of time and mBm.
Revised:  By comparing our suggested approach with the other two existing benchmark estimation approaches ( classic GQV and oscillation approach) through a simulation study, we show that our estimator has better performance in the case where the observed process is some unknown bivariate function of time and mBm.
Edit intent: coherence
Original:  The time-varying feature of the PHE allows us to apply such class of multifractional processes to model stock prices under various market conditions, that are both time-dependent and region-dependent.
Revised:  Such multifractional processes, whose PHEs are time-varying feature of the PHE allows us to apply such class of multifractional processes to model stock prices under various market conditions, that are both time-dependent and region-dependent.
Edit intent: meaning-changed
Original:  In addition, we define the realization of minimal phenotypic polytopes, phenotypic toric ideals and phenotypic toric varieties as a generalization of the phenotypic polytopes described by M. Savageau, [ 12 ], [ 13 ], [ 14 ]  . The implications of the results here presented is that, in principle, they will facilitate solving large scale genetic-metabolic networks by means of toric algebraic geometry tools as well as facilitate elucidating their dynamics.
Revised:  In addition, we define the realization of minimal phenotypic polytopes, phenotypic toric ideals and phenotypic toric varieties as a generalization of the phenotypic polytopes described by M. Savageau, [ 8 ], [ 13 ], [ 14 ] . The implications of the results here presented is that, in principle, they will facilitate solving large scale genetic-metabolic networks by means of toric algebraic geometry tools as well as facilitate elucidating their dynamics.
Edit intent: meaning-changed
Original:  In addition, we define the realization of minimal phenotypic polytopes, phenotypic toric ideals and phenotypic toric varieties as a generalization of the phenotypic polytopes described by M. Savageau, [ 12 ], [ 13 ], [ 14 ]  . The implications of the results here presented is that, in principle, they will facilitate solving large scale genetic-metabolic networks by means of toric algebraic geometry tools as well as facilitate elucidating their dynamics.
Revised:  In addition, we define the realization of minimal phenotypic polytopes, phenotypic toric ideals and phenotypic toric varieties as a generalization of the phenotypic polytopes described by M. Savageau, [ 12 ], [ 9 ], [ 14 ] . The implications of the results here presented is that, in principle, they will facilitate solving large scale genetic-metabolic networks by means of toric algebraic geometry tools as well as facilitate elucidating their dynamics.
Edit intent: meaning-changed
Original:  In addition, we define the realization of minimal phenotypic polytopes, phenotypic toric ideals and phenotypic toric varieties as a generalization of the phenotypic polytopes described by M. Savageau, [ 12 ], [ 13 ], [ 14 ]  . The implications of the results here presented is that, in principle, they will facilitate solving large scale genetic-metabolic networks by means of toric algebraic geometry tools as well as facilitate elucidating their dynamics.
Revised:  In addition, we define the realization of minimal phenotypic polytopes, phenotypic toric ideals and phenotypic toric varieties as a generalization of the phenotypic polytopes described by M. Savageau, [ 12 ], [ 13 ], [ 10 ] . The implications of the results here presented is that, in principle, they will facilitate solving large scale genetic-metabolic networks by means of toric algebraic geometry tools as well as facilitate elucidating their dynamics.
Edit intent: meaning-changed
Original:  In addition, we define the realization of minimal phenotypic polytopes, phenotypic toric ideals and phenotypic toric varieties as a generalization of the phenotypic polytopes described by M. Savageau, [ 12 ], [ 13 ], [ 14 ]  . The implications of the results here presented is that, in principle, they will facilitate solving large scale genetic-metabolic networks by means of toric algebraic geometry tools as well as facilitate elucidating their dynamics.
Revised:  In addition, we define the realization of minimal phenotypic polytopes, phenotypic toric ideals and phenotypic toric varieties as a generalization of the phenotypic polytopes described by M. Savageau, [ 12 ], [ 13 ], [ 14 ] . Also we studied a synthetic oscillatory network of two genes under diverse environmental control modes, we reproduce S. Savageau results and additionally we obtain an invariant sustained oscillatory region . The implications of the results here presented is that, in principle, they will facilitate solving large scale genetic-metabolic networks by means of toric algebraic geometry tools as well as facilitate elucidating their dynamics.
Edit intent: meaning-changed
Original: Single-cell gene expression is inherently stochastic , its emergent behavior can be defined in terms of the chemical master equation describing the evolution of the mRNA and protein copy numbers as the latter N\rightarrow\infty .
Revised: Single-cell gene expression is inherently stochastic ; its emergent behavior can be defined in terms of the chemical master equation describing the evolution of the mRNA and protein copy numbers as the latter N\rightarrow\infty .
Edit intent: fluency
Original: Single-cell gene expression is inherently stochastic , its emergent behavior can be defined in terms of the chemical master equation describing the evolution of the mRNA and protein copy numbers as the latter N\rightarrow\infty .
Revised: Single-cell gene expression is inherently stochastic , its emergent behavior can be defined in terms of the chemical master equation describing the evolution of the mRNA and protein copy numbers as the latter tends to infinity .
Edit intent: clarity
Original:  We establish two types of "macroscopic limits": the Kurtz limit is consistent with the classical chemical kinetics, while the L\'evy limit provides a theoretical foundation for an empirical equation proposed in [Phys.
Revised:  We establish two types of "macroscopic limits": the Kurtz limit is consistent with the classical chemical kinetics, while the L\'{e limit provides a theoretical foundation for an empirical equation proposed in [Phys.
Edit intent: meaning-changed
Original:  0pt%DIFAUXCMD gives an algorithm for c-approximate nearest neighbor search without false negatives with the query time O(d^2) and the pre-processing time O(n^{O(\frac{1{c-1}})}), for c<2.}
Revised:  Combining the dimension reduction with the algorithm presented in \mbox{%DIFAUXCMD motwani0pt%DIFAUXCMD gives an algorithm for c-approximate nearest neighbor search without false negatives with the query time O(d^2) and the pre-processing time O(n^{O(\frac{1{c-1}})}), for c<2.}
Edit intent: meaning-changed
Original:  In a linear regression model with homoscedastic Normal noise, I consider James-Stein type shrinkage in the estimation of nuisance parameters associated with control variables.
Revised: Shrinkage estimation usually reduces variance at the cost of bias. But when we care only about some parameters of a model, I show that we can reduce variance without incurring bias if we have additional information about the distribution of covariates. In a linear regression model with homoscedastic Normal noise, I consider James-Stein type shrinkage in the estimation of nuisance parameters associated with control variables.
Edit intent: meaning-changed
Original:  For at least three control variables and exogenous treatment, I show that the standard least-squares estimator is dominated with respect to squared-error loss in the treatment effect even among unbiased estimators and even when the target parameter is low-dimensional.
Revised:  For at least three control variables and exogenous treatment, I establish that the standard least-squares estimator is dominated with respect to squared-error loss in the treatment effect even among unbiased estimators and even when the target parameter is low-dimensional.
Edit intent: clarity
Original:  I construct the dominating estimator by a variant of James-Stein shrinkage in an appropriate high-dimensional Normal-means problem ; it can be understood as an invariant generalized Bayes estimator with an uninformative (improper) Jeffreys prior in the target parameter.
Revised:  I construct the dominating estimator by a variant of James-Stein shrinkage in an appropriate high-dimensional Normal-means problem . It can be interpreted as an invariant generalized Bayes estimator with an uninformative (improper) Jeffreys prior in the target parameter.
Edit intent: clarity
Original:  In a two-stage linear regression model with Normal noise, I consider James-Stein type shrinkage in the estimation of the first-stage instrumental variable coefficients.
Revised: The two-stage least-squares (2SLS) estimator is known to be biased when its first-stage fit is poor. I show that better first-stage prediction can alleviate this bias. In a two-stage linear regression model with Normal noise, I consider James-Stein type shrinkage in the estimation of the first-stage instrumental variable coefficients.
Edit intent: meaning-changed
Original:  I construct the dominating estimator by a variant of James-Stein  shrinkage in a first-stage high-dimensional Normal-means problem followed by a control-function approach in the second stage ;
Revised:  I construct the dominating estimator by a variant of James-Stein type shrinkage in a first-stage high-dimensional Normal-means problem followed by a control-function approach in the second stage ;
Edit intent: meaning-changed
Original:  I construct the dominating estimator by a variant of James-Stein  shrinkage in a first-stage high-dimensional Normal-means problem followed by a control-function approach in the second stage ; it preserves invariances of the structural instrumental variable equations.
Revised:  I construct the dominating estimator by a variant of James-Stein shrinkage in a first-stage high-dimensional Normal-means problem followed by a control-function approach in the second stage . It preserves invariances of the structural instrumental variable equations.
Edit intent: fluency
Original:  Gr\"unbaum conjectured that the number of triangular cells p_3 in digon-free arrangements of n pairwise intersecting pseudocircles is at least 2n-4.
Revised:  Gr\"{u conjectured that the number of triangular cells p_3 in digon-free arrangements of n pairwise intersecting pseudocircles is at least 2n-4.
Edit intent: meaning-changed
Original:  Gr\"{u conjectured that the number of triangular cells p_3 in digon-free arrangements of n pairwise intersecting pseudocircles is at least 2n-4.
Revised:  Gr\"unbaum conjectured that the number of triangular cells p_3 in digon-free arrangements of n pairwise intersecting pseudocircles is at least 2n-4.
Edit intent: meaning-changed
Original:  This is essentially best possible because  families of pairwise intersecting arrangements of n pseudocircles with p_3/n^2 \to 2/ 3 as n%DIFDELCMD < \to %%% \infty are known.
Revised:  This is essentially best possible because there are families of pairwise intersecting arrangements of n pseudocircles with p_3/n^2 \to 2/ 3 as n%DIFDELCMD < \to %%% \infty are known.
Edit intent: clarity
Original:  This is essentially best possible because  families of pairwise intersecting arrangements of n pseudocircles with p_3/n^2 \to 2/ 3 as n%DIFDELCMD < \to %%% \infty are known.
Revised:  This is essentially best possible because families of pairwise intersecting arrangements of n pseudocircles with p_3/n^2 \to 2/ %DIFDELCMD < \to %%% \infty are known.
Edit intent: clarity
Original:  This is essentially best possible because  families of pairwise intersecting arrangements of n pseudocircles with p_3/n^2 \to 2/ 3 as n%DIFDELCMD < \to %%% \infty are known.
Revised:  This is essentially best possible because families of pairwise intersecting arrangements of n pseudocircles with p_3/n^2 \to 2/ 3 as n%DIFDELCMD < \to %%% 3.
Edit intent: clarity
Original:  The proposed system performs with an accuracy of 90.07 \%. The decoded waggle orientation has an average error of -2.92 \deg%DIFDELCMD < } %%% (SD = 7.37 \deg%DIFDELCMD < }%%% ), well within the range of human error.
Revised:  The proposed system performs with an accuracy of 90.07 \deg%DIFDELCMD < } %%% (SD = 7.37 \deg%DIFDELCMD < }%%% ), well within the range of human error.
Edit intent: coherence
Original:  The decoded waggle orientation has an average error of -2.92 \deg%DIFDELCMD < } %%% (SD = 7.37 \deg%DIFDELCMD < }%%% ), well within the range of human error.
Revised:  The decoded waggle orientation has an average error of -2.92 %DIFDELCMD < } %%% (SD = 7.37 \deg%DIFDELCMD < }%%% ), well within the range of human error.
Edit intent: fluency
Original:  The decoded waggle orientation has an average error of -2.92 \deg%DIFDELCMD < } %%% (SD = 7.37 \deg%DIFDELCMD < }%%% ), well within the range of human error.
Revised:  The decoded waggle orientation has an average error of -2.92 \deg%DIFDELCMD < } %%% \deg%DIFDELCMD < }%%% ), well within the range of human error.
Edit intent: coherence
Original:  The decoded waggle orientation has an average error of -2.92 \deg%DIFDELCMD < } %%% (SD = 7.37 \deg%DIFDELCMD < }%%% ), well within the range of human error.
Revised:  The decoded waggle orientation has an average error of -2.92 \deg%DIFDELCMD < } %%% (SD = 7.37 %DIFDELCMD < }%%% ), well within the range of human error.
Edit intent: fluency
Original:  The decoded waggle orientation has an average error of -2.92 \deg%DIFDELCMD < } %%% (SD = 7.37 \deg%DIFDELCMD < }%%% ), well within the range of human error. To evaluate and exemplify the system's performance, a group of bees was trained to an artificial feeder, and all dances in the colony were automatically detected, decoded and mapped. The system presented here is the first of this kind made publicly available, including source code and hardware specifications. We hope this will foster quantitative analyses of the honey bee waggle dance.
Revised:  The decoded waggle orientation has an average error of -2.92 \deg%DIFDELCMD < } %%% (SD = 7.37 \deg%DIFDELCMD < }%%% 
Edit intent: coherence
Original: Biomonitoring of waterbodies is vital as the number of anthropogenic stressors on aquatic ecosystems keeps growing. However, the continuous decrease in funding makes it impossible to meet monitoring goals or sustain traditional manual sample processing. In this paper, we review what kind of statistical tools can be used to enhance the cost efficiency of biomonitoring: We explore automated identification of freshwater macroinvertebrates which are used as one indicator group in biomonitoring of aquatic ecosystems. We present the first classification results of a new imaging system producing multiple images per specimen. Moreover, these results are compared with the results of human experts. On a data set of 29 taxonomical groups, automated classification produces a higher average accuracythan human experts .
Revised: The step of expert taxa recognition currently slows down the response time of many bioassessments. Shifting to quicker and cheaper state-of-the-art machine learning approaches is still met with expert scepticism towards the ability and logic of machines. In our study, we investigate both the differences in accuracy and in the identification logic of taxonomic experts and machines. We propose a systematic approach utilizing deep Convolutional Neural Nets with the transfer learning paradigm and extensively evaluate it over a multi-label and multi-pose taxonomic dataset specifically created for this comparison. We also study the prediction accuracy on different ranks of taxonomic hierarchy in detail. Our results revealed that human experts using actual specimens yield the lowest classification error. However, our proposed, much faster, automated approach using deep Convolutional Neural Nets comes very close to human accuracy. Contrary to previous findings in the literature, we find that machines following a typical flat classification approach commonly used in machine learning performs better than forcing machines to adopt a hierarchical, local per parent node approach used by human taxonomic experts. Finally, we publicly share our unique dataset to serve as a public benchmark dataset in this field .
Edit intent: meaning-changed
Original:  We propose a systematic approach utilizing deep Convolutional Neural Nets with the transfer learning paradigm and extensively evaluate it over a multi-label and multi-pose taxonomic dataset  specifically created for this comparison.
Revised:  We propose a systematic approach utilizing deep Convolutional Neural Nets with the transfer learning paradigm and extensively evaluate it over a multi-label and multi-pose taxonomic dataset with hierarchical labels specifically created for this comparison.
Edit intent: meaning-changed