wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this paper, we propose two extensions of DSME that allow to adopt \tau to the current traffic pattern.
Revised:  In this paper, we propose two extensions of DSME that allow to adopt \tau to the current traffic pattern.
Edit intent: fluency
Original:  We explore the interplay of various adoption rates of the contact-tracing app, different levels of testing capacity, and behavioural factors , to assess the ability of this track-and-trace strategy to mitigate the epidemic.
Revised:  We explore the interplay of various adoption rates of the contact-tracing app, different levels of testing capacity, and behavioural factors , to assess the impact on the epidemic.
Edit intent: clarity
Original:  Results suggest that the app can contribute substantially to the reduction of infections in the population  , although complete suppression of the virus is unlikely to be achieved.
Revised:  Results suggest that the app can contribute substantially to reducing infection rates in the population , although complete suppression of the virus is unlikely to be achieved.
Edit intent: clarity
Original:  AHTP admits a trivial factor t approximation algorithm as it can be cast as an instance of vertex cover on a structured t-uniform hypergraph that is a ``blown-up'' version of H. Our main result is an approximation algorithm with ratio t{2 simple hypergraph with hyperedges intersecting in at most one element .
Revised:  AHTP admits a trivial factor t approximation algorithm as it can be cast as an instance of vertex cover on a structured t-uniform hypergraph that is a ``blown-up'' version of H. Our main result is an approximation algorithm with ratio t{2 simple hypergraph with hyperedges intersecting in at most one vertex .
Edit intent: clarity
Original:  We prove that vertex cover on simple t-uniform hypergraphs is as hard to approximate as general t-uniform hypergraphs.
Revised:  We prove that vertex cover on simple t-uniform hypergraphs.
Edit intent: clarity
Original:  Additionally, we show that children under age five and the elderly are at high risk from COVID-19 because of their overreacting to the viral infection.
Revised:  Additionally, we show that children under age five and the elderly may be at high risk from COVID-19 because of their overreacting to the viral infection.
Edit intent: clarity
Original:  Moreover, we uncover that populations of Oceania and Africa react significantly more intensively to SARS-CoV-2 infection than those of Europe and Asia, which explains why African Americans were shown to be at increased risk of dying from COVID-19  . Finally, our study indicates that for two viral genome sequences of the same origin, their evolution order may be determined from the ratio of mutation type C>T over T>C.
Revised:  Moreover, we uncover that populations of Oceania and Africa react significantly more intensively to SARS-CoV-2 infection than those of Europe and Asia, which may explain why African Americans were shown to be at increased risk of dying from COVID-19 . Finally, our study indicates that for two viral genome sequences of the same origin, their evolution order may be determined from the ratio of mutation type C>T over T>C.
Edit intent: fluency
Original:  We previously proposed that internal model uncertainty drives these changes, whereby the sensorimotor system reacts to the change in dynamics by upregulating stiffness and feedback gains to reduce the effect of model errors.
Revised:  We previously proposed that internal model uncertainty drives these changes, whereby the sensorimotor system reacts to the change in dynamics by up regulating stiffness and feedback gains to reduce the effect of model errors.
Edit intent: fluency
Original:  In this regard, we also highlight the role of the period acting as an unknown parameter, which is critical being it directly linked to the course of time.
Revised:  In this regard, we also highlight the role of the period acting as an unknown parameter, which is critical since it is directly linked to the course of time.
Edit intent: coherence
Original:  Finally, we prove that the finite element method is convergent, while  limit ourselves to comment on the unfeasibility of this approach as far as the spectral element method is concerned.
Revised:  Finally, we prove that the finite element method is convergent, while we limit ourselves to comment on the unfeasibility of this approach as far as the spectral element method is concerned.
Edit intent: fluency
Original:  Finally, we prove that the finite element method is convergent, while  limit ourselves to comment on the unfeasibility of this approach as far as the spectral element method is concerned.
Revised:  Finally, we prove that the finite element method is convergent, while limit ourselves to commenting on the infeasibility of this approach as far as the spectral element method is concerned.
Edit intent: fluency
Original: Communicative gestures and speech prosody are tightly linked.
Revised: Communicative gestures and speech acoustic are tightly linked.
Edit intent: clarity
Original:  Our objective is to predict the timing of gestures according to the prosody .
Revised:  Our objective is to predict the timing of gestures according to the acoustic .
Edit intent: clarity
Original:  The model is trained on a corpus of natural dyadic interaction where the speech prosody and the gesture phases and types have been annotated.
Revised:  The model is trained on a corpus of natural dyadic interaction where the speech acoustic and the gesture phases and types have been annotated.
Edit intent: clarity
Original:  We also find that a model trained on the data of one speaker only also works for the other speaker of the same conversation.
Revised:  We also find that a model trained on the data of one given speaker also works for the other speaker of the same conversation.
Edit intent: clarity
Original:  Lastly, we also find that including eyebrow movements as a form of beat gesture improves the performance .
Revised:  We also perform a subjective experiment to measure how respondents judge the naturalness, the time consistency, and the semantic consistency of the generated gesture timing of a virtual agent. Our respondents rate the output of our model favorably .
Edit intent: coherence
Original: We derive a residual based a-posteriori error estimate for the outer normal derivative of approximations to Poisson's problem .
Revised: We derive a residual based a-posteriori error estimate for the outer normal flux of approximations to Poisson's problem .
Edit intent: clarity
Original: Nowadays, loss-based TCP congestion controls in general and CUBIC specifically became the de facto standard for the Internet for many operating systems . BBR congestion control challenges the loss-based approach by modeling the network based on estimated bandwidth and round-trip time.
Revised: Nowadays, loss-based TCP congestion controls in general and CUBIC specifically became the de facto standard for the Internet . BBR congestion control challenges the loss-based approach by modeling the network based on estimated bandwidth and round-trip time.
Edit intent: clarity
Original:  In this paper, we will go over experimental data gathered on the Dropbox Edge Network.
Revised:  In this paper, we go over experimental data gathered on the Dropbox Edge Network.
Edit intent: fluency
Original:  We compare BBRv2 to BBRv1 and CUBIC and show that BBRv2 is a definite improvement over both of them.
Revised:  We compare BBRv2 to BBRv1 and CUBIC showing that BBRv2 is a definite improvement over both of them.
Edit intent: coherence
Original:  In this paper, we describe a natural way to transform any rooted phylogenetic network into a simpler canonical network, which has desirable mathematical and computational properties, and is based only on the ` visible' nodes in the original network.
Revised:  In this paper, we describe a natural way to transform any rooted phylogenetic network into a simpler canonical network, which has desirable mathematical and computational properties, and is based only on the ' visible' nodes in the original network.
Edit intent: fluency
Original: Using a large dataset on major stock indexes and FX rates, we test the robustness of the rough fractional volatility model over different time scales .
Revised: Using a large dataset on major FX rates, we test the robustness of the rough fractional volatility model over different time scales .
Edit intent: clarity
Original:  Our findings lead to new stylized facts regarding the volatility that are not described by models introduced so far: in the fractal analysis using the absolute moment approach, log-log plots are nonlinear and reveal very low perceived Hurst exponents at small scales , consistent with the rough framework, and higher perceived Hurst exponents for larger scales , along with stationarity of the volatility.
Revised:  Our findings lead to new stylized facts in the log-log plots are nonlinear and reveal very low perceived Hurst exponents at small scales , consistent with the rough framework, and higher perceived Hurst exponents for larger scales , along with stationarity of the volatility.
Edit intent: clarity
Original:  Our findings lead to new stylized facts regarding the volatility that are not described by models introduced so far: in the fractal analysis using the absolute moment approach, log-log plots are nonlinear and reveal very low perceived Hurst exponents at small scales , consistent with the rough framework, and higher perceived Hurst exponents for larger scales , along with stationarity of the volatility.
Revised:  Our findings lead to new stylized facts regarding the volatility that are not described by models introduced so far: in the fractal analysis using the absolute moment approach, log-log plots are nonlinear and reveal very low perceived Hurst exponents at small scales is consistent with the rough framework, and higher perceived Hurst exponents for larger scales , along with stationarity of the volatility.
Edit intent: fluency
Original:  Our findings lead to new stylized facts regarding the volatility that are not described by models introduced so far: in the fractal analysis using the absolute moment approach, log-log plots are nonlinear and reveal very low perceived Hurst exponents at small scales , consistent with the rough framework, and higher perceived Hurst exponents for larger scales , along with stationarity of the volatility.
Revised:  Our findings lead to new stylized facts regarding the volatility that are not described by models introduced so far: in the fractal analysis using the absolute moment approach, log-log plots are nonlinear and reveal very low perceived Hurst exponents at small scales , consistent with the rough framework, while the higher perceived Hurst exponents for larger scales , along with stationarity of the volatility.
Edit intent: coherence
Original:  To address this gap we developed a planning kit that is organized around 12 key decision that organizers need to make when preparing and running a hackathon, and the tradeoffs that drive decision-making.
Revised:  To address this gap we developed a planning kit that is organized around 12 key decision that organizers need to make when preparing and running a hackathon, and the tradeoffs that drive decision-making.
Edit intent: fluency
Original:  The problem of sampling a single edge in this model has been considered by Eden and Rosenbaum (SOSA 18).
Revised:  The problem of sampling a single edge in this model has been raised by Eden and Rosenbaum (SOSA 18).
Edit intent: clarity
Original:  That is, can we get an improved amortized per-sample cost if we allow a more costly preprocessing phase?
Revised:  That is, can we get an improved amortized per-sample cost if we allow a preprocessing phase?
Edit intent: clarity
Original:  A spectral analysis is presented , and the oscillations in the data are replicated using sinusoidal resynthesis.
Revised:  A spectral analysis is presented , and the oscillations are replicated using sinusoidal resynthesis.
Edit intent: clarity
Original:  In addition, empirical data from the COVID-19 epidemic in New York City (NYC) and Chicago, as well as 50 US states provide a consistent characterization of the level of heterogeneity.
Revised:  In addition, empirical data from the COVID-19 epidemic as well as 50 US states provide a consistent characterization of the level of heterogeneity.
Edit intent: coherence
Original:  Our estimates suggest that the hardest-hit areas, such as NYC, are close to the heterogeneity-modified herd immunity threshold following the first wave of the epidemic .
Revised:  Our estimates suggest that the hardest-hit areas, such as NYC, have achieved TCI following the first wave of the epidemic .
Edit intent: clarity
Original:  In developing fully automated algorithms for treatment planning, we have two main objectives: to produce plans that are 1) pareto optimal and 2) clinically acceptable.
Revised:  In developing fully automated algorithms for treatment planning, we have two main objectives: to produce plans that are 1) Pareto optimal and 2) clinically acceptable.
Edit intent: fluency
Original:  Here, we propose the pareto optimal projection search (POPS) algorithm, which provides a general framework for directly searching the pareto front.
Revised:  Here, we propose the Pareto optimal projection search (POPS) algorithm, which provides a general framework for directly searching the pareto front.
Edit intent: fluency
Original:  Here, we propose the pareto optimal projection search (POPS) algorithm, which provides a general framework for directly searching the pareto front.
Revised:  Here, we propose the pareto optimal projection search (POPS) algorithm, which provides a general framework for directly searching the Pareto front. Methods:
Edit intent: coherence
Original:  As one possible quantitative measure of treatment plan quality, we adopt a clinical acceptability scoring function (SF) modified from the previously developed general evaluation metric (GEM).
Revised:  As one possible quantitative measure of treatment plan quality, we construct a clinical acceptability scoring function (SF) modified from the previously developed general evaluation metric (GEM).
Edit intent: clarity
Original:   Our fully automated POPS algorithm addresses many key limitations of other automated planning approaches, and we anticipate that it will substantially improve treatment planning workflow.
Revised:  Significance: Our fully automated POPS algorithm addresses many key limitations of other automated planning approaches, and we anticipate that it will substantially improve treatment planning workflow.
Edit intent: coherence
Original: This paper is devoted to the condition number of the total least squares problem with linear equality constraint (TLSE).
Revised: TThis paper is devoted to the condition number of the total least squares problem with linear equality constraint (TLSE).
Edit intent: fluency
Original: This paper is devoted to the condition number of the total least squares problem with linear equality constraint (TLSE).
Revised: This paper is devoted to condition numbers of the total least squares problem with linear equality constraint (TLSE).
Edit intent: fluency
Original:  With novel  techniques, closed formulae for the normwise, mixed and componentwise condition numbers of the TLSE problem are derived.
Revised:  With novel techniques, closed formulae for normwise, mixed and componentwise condition numbers of the TLSE problem are derived.
Edit intent: fluency
Original:  Compact expressions and upper bounds for these condition numbers are also given to avoid the costly Kronecker product-based operations.
Revised:  Compactexpressionsandupper bounds for these condition numbers are also given to avoid the costly Kronecker product-based operations.
Edit intent: fluency
Original: TThis paper is devoted to condition numbers of the total least squares problem with linear equality constraint (TLSE).
Revised: This paper is devoted to condition numbers of the total least squares problem with linear equality constraint (TLSE).
Edit intent: fluency
Original:  Compactexpressionsandupper bounds for these condition numbers are also given to avoid the costly Kronecker product-based operations.
Revised:  Compact expressions and upper bounds for these condition numbers are also given to avoid the costly Kronecker product-based operations.
Edit intent: fluency
Original:  Compact expressions and upper bounds for these condition numbers are also given to avoid the costly Kronecker product-based operations.
Revised:  Computable expressions and upper bounds for these condition numbers are also given to avoid the costly Kronecker product-based operations.
Edit intent: clarity
Original:  For TLSE problems with equilibratory input data, numerical experiments illustrate that normwise condition number-based estimate is sharp to evaluate the forward error of the solution, while for sparse and badly scaled matrices, mixed and componentwise condition numbers-based estimations are much tighter.
Revised:  For TLSE problems with equilibratory input data, numerical experiments illustrate that normwise condition number-based estimate is sharp to evaluate the forward error of the solution, while for sparse and badly scaled matrices, mixed and componentwise condition numbers-based estimates are much tighter.
Edit intent: fluency
Original:  We propose an opening and closing strategy aiming at immunizing the graph while infecting the minimum number of individuals, while guaranteeing the population is now robust to future infections.
Revised:  We propose an opening and closing strategy aiming at immunizing the graph while infecting the minimum number of individuals, guaranteeing the population is now robust to future infections.
Edit intent: fluency
Original: Deep neural network models are becoming  popular and have  used in various tasks such as computer vision, speech recognition, and natural language processing.
Revised: Deep neural network models are becoming popular and have been used in various tasks such as computer vision, speech recognition, and natural language processing.
Edit intent: clarity
Original:   We introduce an alternative adjoint-based numerical optimization strategy that aims at enabling large-scale nonlinear thermal network optimization.
Revised:  We introduce an alternative adjoint-based numerical optimization strategy to enable large-scale nonlinear thermal network optimization.
Edit intent: coherence
Original:  Secondly, we present a numerical continuation strategy that gradually forces the continuous optimization method towards discrete design variable choices.
Revised:  Secondly, we present a numerical continuation strategy that gradually forces the design variables towards discrete design variable choices.
Edit intent: clarity
Original:  Secondly, we present a numerical continuation strategy that gradually forces the continuous optimization method towards discrete design variable choices.
Revised:  Secondly, we present a numerical continuation strategy that gradually forces the continuous optimization method towards discrete design choices.
Edit intent: clarity
Original:  As such,  network topology and discrete pipe size choices are determined simultaneously.
Revised:  As such, optimal network topology and discrete pipe size choices are determined simultaneously.
Edit intent: clarity
Original:  As such,  network topology and discrete pipe size choices are determined simultaneously.
Revised:  As such, network topology and pipe sizes are determined simultaneously.
Edit intent: clarity
Original:  Finally, we employ the algorithm for the design of a fictitious but realistically-sized district heating network with 160 consumers.
Revised:  Finally, we demonstrate the scalability of the algorithm by designing a fictitious district heating network with 160 consumers.
Edit intent: clarity
Original:  Moreover, the importance of embedding a non-linear transport model is clear from a temperature-induced variation in the consumer flow rates of 72 \%.
Revised:  Moreover, the importance of embedding the non-linear transport model is clear from a temperature-induced variation in the consumer flow rates of 72 \%.
Edit intent: fluency
Original:  The neighborhood polynomial of a graph G is the generating function of subsets of vertices in G that have a common neighbor.
Revised:  The neighborhood polynomial of a graph is the generating function of subsets of vertices in G that have a common neighbor.
Edit intent: fluency
Original:  The neighborhood polynomial of a graph G is the generating function of subsets of vertices in G that have a common neighbor.
Revised:  The neighborhood polynomial of a graph G is the generating function of subsets of its vertices that have a common neighbor.
Edit intent: clarity
Original:  The leafage of a chordal graphs is the minimum number of leaves in the host tree of a subtree representation.
Revised:  the leafage of a chordal graphs is the minimum number of leaves in the host tree of a subtree representation.
Edit intent: fluency
Original:  Along this way, we significantly simplify the argument that is used in the previous work for k-Disjoint Paths with Congestion-c by Amiri et al  .
Revised:  Our algorithm is based on the earlier algorithm for k-Disjonit Paths with Congestion-c by Amiri et al .
Edit intent: clarity
Original:  We introduce a relaxation of the problem, namely, k-Disjonit Shortest Paths with Congestion-c where every vertex is allowed to route up to c paths.
Revised:  We introduce a generalization of the problem, namely, k-Disjonit Shortest Paths with Congestion-c where every vertex is allowed to route up to c paths.
Edit intent: clarity
Original:  We introduce a relaxation of the problem, namely, k-Disjonit Shortest Paths with Congestion-c where every vertex is allowed to route up to c paths.
Revised:  We introduce a relaxation of the problem, namely, k-Disjoint Shortest Paths with Congestion-c where every vertex is allowed to route up to c paths.
Edit intent: fluency
Original:  We provide a simple algorithm to solve the k-Disjonit Shortest Paths with Congestion-c problem in time f(k) n^{O(k-c)} on DAGs.
Revised:  We provide a simple algorithm to solve the problem in time f(k) n^{O(k-c)} on DAGs.
Edit intent: coherence
Original: Coordinated online behaviors are an important part of information and influence operations, as they allow a more effective disinformation's spread.
Revised: Coordinated online behaviors are an essential part of information and influence operations, as they allow a more effective disinformation's spread.
Edit intent: clarity
Original:  Most studies on coordinated behaviors involved manual investigations  and the few existing computational approaches make bold assumptions or oversimplify the problem to make it tractable.
Revised:  Most studies on coordinated behaviors involved manual investigations , and the few existing computational approaches make bold assumptions or oversimplify the problem to make it tractable.
Edit intent: fluency
Original:  Our proposal extends existing systems and goes beyond limiting binary classifications of coordinated and uncoordinated behaviors.
Revised:  Our research extends existing systems and goes beyond limiting binary classifications of coordinated and uncoordinated behaviors.
Edit intent: clarity
Original:  It allows to uncover different patterns of coordination and to estimate the degree of coordination that characterizes different communities.
Revised:  It allows to expose different coordination patterns and to estimate the degree of coordination that characterizes different communities.
Edit intent: clarity
Original:  It allows to uncover different patterns of coordination and to estimate the degree of coordination that characterizes different communities.
Revised:  It allows to uncover different patterns of coordination and to estimate the degree of coordination that characterizes diverse communities.
Edit intent: fluency
Original:  Our work conveys both theoretical and practical implications , and provides more nuanced and fine-grained results for studying online  manipulation.
Revised:  Our work conveys both theoretical and practical implications and provides more nuanced and fine-grained results for studying online manipulation.
Edit intent: fluency