wanyu/IteraTeR_v2 huggingface dataset:
Original:  We prove that there exists a constant q_{p,k^\star such that if q < q\SUBSCRIPT}%DIFDELCMD < {%%% p , k %DIFDELCMD < \MBLOCKRIGHTBRACE%%% ^\star then a \sigma-almost-consensus is still reached in O(1) rounds, while, if q > q _{p,k^\star, the process spends n^{\omega(1)} rounds in a metastable phase where the fraction of volume in state \sigma is around a constant value depending only on p and k}  .
Revised:  We prove that there exists a constant q_{p,k^\star such that if q < q\SUBSCRIPT}%DIFDELCMD < {%%% p , k %DIFDELCMD < \MBLOCKRIGHTBRACE%%% ^\star then a \sigma-almost-consensus is still reached in O(1) rounds, while, if q > q ^\star, the process spends n^{\omega(1)} rounds in a metastable phase where the fraction of volume in state \sigma is around a constant value depending only on p and k} .
Edit intent: clarity
Original:  In this article, we show that n ^{ 4n-o (n)} order types can be realized on an integer grid of polynomial size, which is essentially best-possible .
Revised:  In this article, we show that n ^{ 4n-o (n)} order types can be realized on an integer grid of polynomial size, which is essentially best possible .
Edit intent: fluency
Original:  Overall, our proposed algorithm has performed better with varying margin between 10\% to 23\% comparing to the reference methods.
Revised:  Overall, our proposed algorithm has performed better with varying margin between 10\% to 23\% compared to the reference methods.
Edit intent: fluency
Original: The point inclusion tests for polygons, in other words the point in polygon (PIP) algorithms  are fundamental tools for many scientific fields related to computational geometry  and they have been studied for a long time.
Revised: The point inclusion tests for polygons, in other words the point-in-polygon (PIP) algorithms are fundamental tools for many scientific fields related to computational geometry and they have been studied for a long time.
Edit intent: fluency
Original: The point inclusion tests for polygons, in other words the point in polygon (PIP) algorithms  are fundamental tools for many scientific fields related to computational geometry  and they have been studied for a long time.
Revised: The point inclusion tests for polygons, in other words the point in polygon (PIP) algorithms , are fundamental tools for many scientific fields related to computational geometry and they have been studied for a long time.
Edit intent: fluency
Original: The point inclusion tests for polygons, in other words the point in polygon (PIP) algorithms  are fundamental tools for many scientific fields related to computational geometry  and they have been studied for a long time.
Revised: The point inclusion tests for polygons, in other words the point in polygon (PIP) algorithms are fundamental tools for many scientific fields related to computational geometry , and they have been studied for a long time.
Edit intent: fluency
Original:   PIP algorithms get direct or indirect geometric definition of a polygonal entity  and validate its containment of a given point.
Revised:  The PIP algorithms get direct or indirect geometric definition of a polygonal entity and validate its containment of a given point.
Edit intent: fluency
Original:   PIP algorithms get direct or indirect geometric definition of a polygonal entity  and validate its containment of a given point.
Revised:  PIP algorithms get direct or indirect geometric definition of a polygonal entity , and validate its containment of a given point.
Edit intent: fluency
Original:  The PIP algorithms  which are working directly on the geometric entities  derive linear boundary definitions for the edges of the polygon .
Revised:  The PIP algorithms , which are working directly on the geometric entities derive linear boundary definitions for the edges of the polygon .
Edit intent: fluency
Original:  The PIP algorithms  which are working directly on the geometric entities  derive linear boundary definitions for the edges of the polygon .
Revised:  The PIP algorithms which are working directly on the geometric entities , derive linear boundary definitions for the edges of the polygon .
Edit intent: fluency
Original:  The PIP algorithms  which are working directly on the geometric entities  derive linear boundary definitions for the edges of the polygon .
Revised:  The PIP algorithms which are working directly on the geometric entities derive linear boundary definitions for the edges of the polygons .
Edit intent: fluency
Original:  Moreover, almost all direct test methods rely on the two point form of the line equation to partition the space into half-spaces.
Revised:  Moreover, almost all direct test methods rely on the two-point form of the line equation to partition the space into half-spaces.
Edit intent: fluency
Original:  Voronoi tessellations consist of convex polygons  which are defined between generator points.
Revised:  Voronoi tessellations consist of convex polygons , which are defined between generator points.
Edit intent: fluency
Original:  Therefore, Voronoi tessellations have become an inspiration for us to develop a new approach of PIP testing specialized for convex polygons.
Revised:  Therefore, Voronoi tessellations have become an inspiration for us to develop a new approach of the PIP testing, specialized for convex polygons.
Edit intent: fluency
Original:  For generalization of the comparisons the ray crossing\textit{ algorithm is used as another reference.
Revised:  For generalization of the comparisons ,\textit{ algorithm is used as another reference.
Edit intent: clarity
Original:  For generalization of the comparisons the ray crossing\textit{ algorithm is used as another reference.
Revised:  For generalization of the comparisons the ray crossing\textit{the ray crossing algorithm is used as another reference.
Edit intent: fluency
Original:  Overall , our proposed algorithm has performed better with varying margin between 10\% to 23\% compared to the reference methods .
Revised:  Overall , our proposed algorithm can have comparable performance characteristics with the reference algorithms. Moreover, it has simplicity, both from a geometric representation and the mental model .
Edit intent: coherence
Original: This paper is based on the observation that, during epidemics , the choice of which individuals must be tested has an important impact on the effectiveness of selective confinement measures.
Revised: This paper is based on the observation that, during epidemics , the choice of which individuals should be tested has an important impact on the effectiveness of selective confinement measures.
Edit intent: clarity
Original:  The second is a lesser-documented point-to-point interpolation method, where the interior and exterior quantities for flux evaluations are interpolated from elements lying on the opposing side of the interface.
Revised:  The second is a less-documented point-to-point interpolation method, where the interior and exterior quantities for flux evaluations are interpolated from elements lying on the opposing side of the interface.
Edit intent: fluency
Original:  To concretely define the concept of the anomaly and its different manifestations  the typology employs four dimensions: data type, cardinality of relationship  , data structure and data distribution.
Revised:  To concretely define the concept of the anomaly and its different manifestations , the typology employs four dimensions: data type, cardinality of relationship , data structure and data distribution.
Edit intent: fluency
Original:  The concept of the anomaly is generally ill-defined and perceived as vague and domain-dependent.
Revised:  The concept of the anomaly is usually ill-defined and perceived as vague and domain-dependent.
Edit intent: clarity
Original:  To concretely define the concept of the anomaly and its different manifestations, the typology employs five dimensions: data type, cardinality of relationship, anomaly level, data structure  and data distribution.
Revised:  To concretely define the concept of the anomaly and its different manifestations, the typology employs five dimensions: data type, cardinality of relationship, anomaly level, data structure , and data distribution.
Edit intent: fluency
Original:  The concept of the anomaly is usually ill-defined and perceived as vague and domain-dependent.
Revised:  The concept of the anomaly is typically ill-defined and perceived as vague and domain-dependent.
Edit intent: fluency
Original:  By means of an extensive literature review this study therefore offers the first theoretically principled and domain-independent typology of data anomalies , and presents a full overview of anomaly types and subtypes.
Revised:  By means of an extensive literature review this study therefore offers the first theoretically principled and domain-independent typology of data anomalies and presents a full overview of anomaly types and subtypes.
Edit intent: fluency
Original:  These fundamental and data-centric dimensions naturally yield 3 broad groups, 9 basic types  and 63 subtypes of anomalies.
Revised:  These fundamental and data-centric dimensions naturally yield 3 broad groups, 9 basic types , and 63 subtypes of anomalies.
Edit intent: fluency
Original: We consider approximation rates of sparsely connected deep rectified linear unit (ReLU) and rectified power unit (RePU) neural networks for functions in Besov spaces B^q(L^p) in arbitrary dimension d, on bounded or unbounded domains.
Revised: We consider approximation rates of sparsely connected deep rectified linear unit (ReLU) and rectified power unit (RePU) neural networks for functions in Besov spaces B^q(L^p) in arbitrary dimension d, on general domains.
Edit intent: clarity
Original:  We show that RePU networks with a fixed activation function attain optimal  approximation rates for functions in the Besov space B^\tau(L^\tau) on the critical embedding line 1/\tau=\alpha/d+1/p for arbitrary smoothness order \alpha>0.
Revised:  We show that networks with a fixed activation function attain optimal approximation rates for functions in the Besov space B^\tau(L^\tau) on the critical embedding line 1/\tau=\alpha/d+1/p for arbitrary smoothness order \alpha>0.
Edit intent: clarity
Original:  We show that RePU networks with a fixed activation function attain optimal  approximation rates for functions in the Besov space B^\tau(L^\tau) on the critical embedding line 1/\tau=\alpha/d+1/p for arbitrary smoothness order \alpha>0.
Revised:  We show that RePU networks with a fixed activation function attain optimal approximation rates for functions in the Besov space B^\tau(L^\tau) on the critical embedding line 1/\tau=\alpha/d+1/p for arbitrary smoothness order \alpha>0.
Edit intent: fluency
Original:  Moreover, we show that ReLU networks attain near to optimal rates for any Besov space strictly above the critical line.
Edit intent: coherence
Original:  This result allows us to estimate that in the early stages of the pandemic in the USA, nearly 81 %DIFDELCMD < \\%%% %DIF < of  new cases were a result of the top 10 %DIFDELCMD < \\%%% %DIF < of most infectious individuals.abstract 
Revised:  This result allows us to estimate that in the early stages of the pandemic in the USA, over 81 %DIFDELCMD < \\%%% %DIF < of new cases were a result of the top 10 %DIFDELCMD < \\%%% %DIF < of most infectious individuals.abstract 
Edit intent: clarity
Original:  We have equipped a hybrid Prius research vehicle with a roof-mounted microphone array, and show on data collected with this sensor setup that wall reflections provide information on the presence and direction of  approaching vehicles.
Revised:  We have equipped a research vehicle with a roof-mounted microphone array, and show on data collected with this sensor setup that wall reflections provide information on the presence and direction of approaching vehicles.
Edit intent: clarity
Original:  Since the  ego-vehicle position within the local geometry affects the perceived patterns, we systematically study several locations and acoustic environments , and investigate generalization across these environments.
Revised:  Since the local geometry around the ego-vehicle position within the local geometry affects the perceived patterns, we systematically study several locations and acoustic environments , and investigate generalization across these environments.
Edit intent: clarity
Original:  Since the  ego-vehicle position within the local geometry affects the perceived patterns, we systematically study several locations and acoustic environments , and investigate generalization across these environments.
Revised:  Since the ego-vehicle affects the perceived patterns, we systematically study several locations and acoustic environments , and investigate generalization across these environments.
Edit intent: clarity
Original:  Since the  ego-vehicle position within the local geometry affects the perceived patterns, we systematically study several locations and acoustic environments , and investigate generalization across these environments.
Revised:  Since the ego-vehicle position within the local geometry affects the perceived patterns, we systematically study several environment types , and investigate generalization across these environments.
Edit intent: clarity
Original:  The common machine learning approaches make use of the labelled sensor data to automatically learn how to make detections.
Revised:  The common machine learning approaches make use of the labeled sensor data to automatically learn how to make detections.
Edit intent: fluency
Original:  The OREBA dataset aims to provide a comprehensive multi-sensor recording of communal intake occasions for researchers interested in automatic detection of intake gestures .
Revised:  The OREBA dataset aims to provide a comprehensive multi-sensor recording of communal intake occasions for researchers interested in intake gesture detection .
Edit intent: clarity
Original:  We report the details of data collection and annotation, as well as technical details of sensor processing.
Revised:  We report the details of data collection and annotation, as well as details of sensor processing.
Edit intent: clarity
Original:  The OREBA dataset aims to provide a comprehensive multi-sensor recording of communal intake occasions for researchers interested in intake gesture detection.
Revised:  The OREBA dataset aims to provide comprehensive multi-sensor recording of communal intake occasions for researchers interested in intake gesture detection.
Edit intent: fluency
Original:  The OREBA dataset aims to provide a comprehensive multi-sensor recording of communal intake occasions for researchers interested in intake gesture detection.
Revised:  The OREBA dataset aims to provide a comprehensive multi-sensor data recorded during the course of communal meals for researchers interested in intake gesture detection.
Edit intent: clarity
Original:  A new ISA requires compiler updates and hardware updates, but those are happening in any case.
Revised:  A new ISA requires compiler and hardware updates, but those are happening in any case.
Edit intent: fluency
Original:  A new ISA requires compiler updates and hardware updates, but those are happening in any case.
Revised:  A new ISA requires compiler updates and hardware updates, but these are happening in any case.
Edit intent: clarity
Original:  This paper introduces BasicBlocker, a generic ISA modification that works for all common ISAs and that removes most of the performance benefit of speculative execution.
Revised:  This paper introduces BasicBlocker, a generic ISA modification that works for all common ISAs and that removes most of the performance benefit that would have been provided by speculative execution.
Edit intent: clarity
Original:  To demonstrate  feasibility of BasicBlocker, this paper defines a BBRISC-V variant of the RISC-V ISA , reports implementations of a BBRISC-V  soft core and  an associated compiler , and presents a performance comparison for a variety of benchmark programs.
Revised:  To demonstrate the feasibility of BasicBlocker, this paper defines a BBRISC-V variant of the RISC-V ISA , reports implementations of a BBRISC-V soft core and an associated compiler , and presents a performance comparison for a variety of benchmark programs.
Edit intent: fluency
Original:  To demonstrate  feasibility of BasicBlocker, this paper defines a BBRISC-V variant of the RISC-V ISA , reports implementations of a BBRISC-V  soft core and  an associated compiler , and presents a performance comparison for a variety of benchmark programs.
Revised:  To demonstrate feasibility of BasicBlocker, this paper defines a variant of the RISC-V ISA , reports implementations of a BBRISC-V soft core and an associated compiler , and presents a performance comparison for a variety of benchmark programs.
Edit intent: fluency
Original:  To demonstrate  feasibility of BasicBlocker, this paper defines a BBRISC-V variant of the RISC-V ISA , reports implementations of a BBRISC-V  soft core and  an associated compiler , and presents a performance comparison for a variety of benchmark programs.
Revised:  To demonstrate feasibility of BasicBlocker, this paper defines a BBRISC-V variant of the RISC-V ISA called BBRISC-V soft core and an associated compiler , and presents a performance comparison for a variety of benchmark programs.
Edit intent: clarity
Original:  To demonstrate  feasibility of BasicBlocker, this paper defines a BBRISC-V variant of the RISC-V ISA , reports implementations of a BBRISC-V  soft core and  an associated compiler , and presents a performance comparison for a variety of benchmark programs.
Revised:  To demonstrate feasibility of BasicBlocker, this paper defines a BBRISC-V variant of the RISC-V ISA , reports implementations of a BBRISC-V soft core and an associated compiler and a variety of benchmark programs.
Edit intent: clarity
Original:  It is based on the signed distance function to the curves or other objects from a fixed set of landmark points.
Revised:  It is based on the signed distance function to the curves or other objects from a fixed set of landmark points.
Edit intent: fluency
Original:  In the general noisy case, almost sure convergence of the methods fitting into the framework is proved when line searches and suitably decaying step lengths are combined.
Revised:  In the general noisy case, almost sure convergence of the methods fitting into this framework combine line searches and suitably decaying step lengths are combined.
Edit intent: clarity
Original:  Extensions include the doubly robust g-computation  , which is less frequently applied, in particular in clinical studies.
Revised:  Extensions include the g-computation , which is less frequently applied, in particular in clinical studies.
Edit intent: clarity
Original:  Extensions include the doubly robust g-computation  , which is less frequently applied, in particular in clinical studies.
Revised:  Extensions include the doubly robust g-computation approach , which is less frequently applied, in particular in clinical studies.
Edit intent: clarity
Original:  R code for the g-computation is provided.
Revised:  R code for the simulations is provided.
Edit intent: clarity
Original:  This is, to the best of our knowledge, the first closed-form solution for a three-dimensional deterministic compartmental model of epidemics.
Edit intent: coherence
Original:  The nonlinear dynamics of this modified SIR system is analyzed and the exact computation of some epidemiologically relevant quantities is performed  .
Revised:  The dynamics of this modified SIR system is analyzed and the exact computation of some epidemiologically relevant quantities is performed .
Edit intent: clarity
Original:  The nonlinear dynamics of this modified SIR system is analyzed and the exact computation of some epidemiologically relevant quantities is performed  .
Revised:  The nonlinear dynamics of this modified SIR system is analysed and the exact computation of some epidemiologically relevant quantities is performed .
Edit intent: fluency
Original:  The dynamics of this modified SIR system is analysed and the exact computation of some epidemiologically relevant quantities is performed , since both models have been recently used in order to describe the essentials of the dynamics of the COVID-19 pandemic .
Revised:  The dynamics of this modified SIR system is analysed and the exact computation of some epidemiologically relevant quantities is performed .
Edit intent: coherence
Original:  Since the considered planning problem is NP-Hard, and therefore very challenging to be solved even for small problem instances, we design an efficient heuristic, called PLanning Algorithm Towards EMF Emissions Assessment (PLATEA) , to practically solve it.
Revised:  Since the considered planning problem is NP-Hard, and therefore very challenging to be solved even for small problem instances, we design an efficient heuristic, called PLATEA , to practically solve it.
Edit intent: coherence
Original:  Results, obtained over a realistic scenario that includes EMF exposure from pre-5G technologies (e.g., 2G, 3G, 4G), prove that PLATEA retrieves a planning that ensures 5G service and restrictive EMF constraints.
Revised:  Results, obtained over a realistic scenario that includes EMF exposure from pre-5G technologies (e.g., 2G, 3G, 4G), prove that the cellular planning selected by PLATEA ensures 5G service and restrictive EMF constraints.
Edit intent: clarity
Original:  However, we demonstrate that the results are strongly affected by: i) the relative weight between gNB installation costs and 5G service coverage level, ii) the scaling parameters to estimate the exposure generated by 5G gNBs, and iii) the amount of exposure from pre-5G technologies  .
Revised:  However, we demonstrate that the results are strongly affected by: i) the relative weight between gNB installation costs and 5G service coverage level, ii) the scaling parameters to estimate the exposure generated by 5G gNBs, iii) the amount of exposure from pre-5G technologies .
Edit intent: fluency
Original:  While the use of SPARQL endpoints is strongly supported by Semantic Web experts, it hinders broader use of these data by common Web users, engineers and develop-ers unfamiliar with Semantic Web technologies, who normally rely on Web RESTful APIs for querying Web-available data and creating applications with them.
Revised:  While the use of SPARQL endpoints is strongly supported by Semantic Web experts, it hinders broader use of these data by common Web users, engineers and develop-ers unfamiliar with Semantic Web technologies, who normally rely on Web RESTful APIs for querying Web-available data and creating applications over them.
Edit intent: clarity
Original:  We provide evidence for the use of RAMOSE to provide REST API access to RDF data within OpenCitations triplestores , and we show the benefits of RAMOSE in terms of the number of queries made by external users to such RDF data  compared with the direct access via the SPARQL endpoint.
Revised:  We provide evidence that the use of RAMOSE to provide REST API access to RDF data within OpenCitations triplestores , and we show the benefits of RAMOSE in terms of the number of queries made by external users to such RDF data compared with the direct access via the SPARQL endpoint.
Edit intent: fluency
Original:  We provide evidence for the use of RAMOSE to provide REST API access to RDF data within OpenCitations triplestores , and we show the benefits of RAMOSE in terms of the number of queries made by external users to such RDF data  compared with the direct access via the SPARQL endpoint.
Revised:  We provide evidence for the use of RAMOSE to provide REST API access to RDF data within OpenCitations triplestores is beneficial in terms of the number of queries made by external users to such RDF data compared with the direct access via the SPARQL endpoint.
Edit intent: clarity