wanyu/IteraTeR_v2 huggingface dataset:
Original:  The CoV-Spectrum website  brings together SARS-CoV-2 data from different sources , applies analyses, and presents the results in interactive and easy shareable plots . Results include the proportion of  variants over time,  demographic and geographic distributions, hospitalization and death probabilities, estimates for transmission fitness advantage , insights obtained from wastewater samples , and general information and references about SARS-CoV-2 variants.
Revised: Summary: The CoV-Spectrum website brings together SARS-CoV-2 data from different sources , applies analyses, and presents the results in interactive and easy shareable plots . Results include the proportion of variants over time, demographic and geographic distributions, hospitalization and death probabilities, estimates for transmission fitness advantage , insights obtained from wastewater samples , and general information and references about SARS-CoV-2 variants.
Edit intent: coherence
Original:  The CoV-Spectrum website  brings together SARS-CoV-2 data from different sources , applies analyses, and presents the results in interactive and easy shareable plots . Results include the proportion of  variants over time,  demographic and geographic distributions, hospitalization and death probabilities, estimates for transmission fitness advantage , insights obtained from wastewater samples , and general information and references about SARS-CoV-2 variants.
Revised:  The CoV-Spectrum website brings together SARS-CoV-2 data from different sources and applies analyses . Results include the proportion of variants over time, demographic and geographic distributions, hospitalization and death probabilities, estimates for transmission fitness advantage , insights obtained from wastewater samples , and general information and references about SARS-CoV-2 variants.
Edit intent: coherence
Original:  The CoV-Spectrum website  brings together SARS-CoV-2 data from different sources , applies analyses, and presents the results in interactive and easy shareable plots . Results include the proportion of  variants over time,  demographic and geographic distributions, hospitalization and death probabilities, estimates for transmission fitness advantage , insights obtained from wastewater samples , and general information and references about SARS-CoV-2 variants.
Revised:  The CoV-Spectrum website brings together SARS-CoV-2 data from different sources , applies analyses, and presents the results in interactive and easy shareable plots . Results include the proportion of different variants over time, demographic and geographic distributions, hospitalization and death probabilities, estimates for transmission fitness advantage , insights obtained from wastewater samples , and general information and references about SARS-CoV-2 variants.
Edit intent: fluency
Original:  The CoV-Spectrum website  brings together SARS-CoV-2 data from different sources , applies analyses, and presents the results in interactive and easy shareable plots . Results include the proportion of  variants over time,  demographic and geographic distributions, hospitalization and death probabilities, estimates for transmission fitness advantage , insights obtained from wastewater samples , and general information and references about SARS-CoV-2 variants.
Revised:  The CoV-Spectrum website brings together SARS-CoV-2 data from different sources , applies analyses, and presents the results in interactive and easy shareable plots . Results include the proportion of variants over time, their demographic and geographic distributions, hospitalization and death probabilities, estimates for transmission fitness advantage , insights obtained from wastewater samples , and general information and references about SARS-CoV-2 variants.
Edit intent: clarity
Original:  The CoV-Spectrum website  brings together SARS-CoV-2 data from different sources , applies analyses, and presents the results in interactive and easy shareable plots . Results include the proportion of  variants over time,  demographic and geographic distributions, hospitalization and death probabilities, estimates for transmission fitness advantage , insights obtained from wastewater samples , and general information and references about SARS-CoV-2 variants.
Revised:  The CoV-Spectrum website brings together SARS-CoV-2 data from different sources , applies analyses, and presents the results in interactive and easy shareable plots . Results include the proportion of variants over time, demographic and geographic distributions, hospitalization and death probabilities, estimates for transmission fitness advantage and insights obtained from wastewater samples , and general information and references about SARS-CoV-2 variants.
Edit intent: fluency
Original:  CoV-Spectrum is available at URL It is open-source, the code is hosted on URL
Revised:  CoV-Spectrum is available at URL The code is released under the GPL-3.0 license at URL
Edit intent: clarity
Original:  } }  By solving a positive semidefinite program, one can reduce a system of real quadratic equations to a system of the type q_i(x)=\alpha_i, i=1, \ldots, m, where q_i: { %DIFDELCMD < \Bbb %%%  R}^n \longrightarrow { %DIFDELCMD < \Bbb %%%  R} are quadratic forms and \alpha_i=  q_i.
Revised:  } } are quadratic forms. By solving a positive semidefinite program, one can reduce a system of real quadratic equations to a system of the type q_i(x)=\alpha_i, i=1, \ldots, m, where q_i: { %DIFDELCMD < \Bbb %%% R}^n \longrightarrow { %DIFDELCMD < \Bbb %%% R} are quadratic forms and \alpha_i= q_i.
Edit intent: fluency
Original:  } }  By solving a positive semidefinite program, one can reduce a system of real quadratic equations to a system of the type q_i(x)=\alpha_i, i=1, \ldots, m, where q_i: { %DIFDELCMD < \Bbb %%%  R}^n \longrightarrow { %DIFDELCMD < \Bbb %%%  R} are quadratic forms and \alpha_i=  q_i.
Revised:  } } By solving a positive semidefinite program, one can reduce it to another system of the type q_i(x)=\alpha_i, i=1, \ldots, m, where q_i: { %DIFDELCMD < \Bbb %%% R}^n \longrightarrow { %DIFDELCMD < \Bbb %%% R} are quadratic forms and \alpha_i= q_i.
Edit intent: clarity
Original:  We prove a sufficient condition for the latter system to have a solution x \in { %DIFDELCMD < \Bbb %%%  R}^n : assuming that the operator norms of the n \times n matrices Q_i of q_i do not exceed 1, the smallest eigenvalue the m \times m matrix with the (i, j)-th entry equal (Q_i Q_j) is at least \gamma n^{2/3 m ^2 \ln n }  for an absolute constant \gamma >0.
Revised:  We prove that the latter system to have a solution x \in { %DIFDELCMD < \Bbb %%% R}^n : assuming that the operator norms of the n \times n matrices Q_i of q_i do not exceed 1, the smallest eigenvalue the m \times m matrix with the (i, j)-th entry equal (Q_i Q_j) is at least \gamma n^{2/3 m ^2 \ln n } for an absolute constant \gamma >0.
Edit intent: clarity
Original:  We prove a sufficient condition for the latter system to have a solution x \in { %DIFDELCMD < \Bbb %%%  R}^n : assuming that the operator norms of the n \times n matrices Q_i of q_i do not exceed 1, the smallest eigenvalue the m \times m matrix with the (i, j)-th entry equal (Q_i Q_j) is at least \gamma n^{2/3 m ^2 \ln n }  for an absolute constant \gamma >0.
Revised:  We prove a sufficient condition for the latter system has solution x \in { %DIFDELCMD < \Bbb %%% R}^n : assuming that the operator norms of the n \times n matrices Q_i of q_i do not exceed 1, the smallest eigenvalue the m \times m matrix with the (i, j)-th entry equal (Q_i Q_j) is at least \gamma n^{2/3 m ^2 \ln n } for an absolute constant \gamma >0.
Edit intent: clarity
Original:  We prove a sufficient condition for the latter system to have a solution x \in { %DIFDELCMD < \Bbb %%%  R}^n : assuming that the operator norms of the n \times n matrices Q_i of q_i do not exceed 1, the smallest eigenvalue the m \times m matrix with the (i, j)-th entry equal (Q_i Q_j) is at least \gamma n^{2/3 m ^2 \ln n }  for an absolute constant \gamma >0.
Revised:  We prove a sufficient condition for the latter system to have a solution x \in { %DIFDELCMD < \Bbb %%% \mathbb R}^n : assuming that the operator norms of the n \times n matrices Q_i of q_i do not exceed 1, the smallest eigenvalue the m \times m matrix with the (i, j)-th entry equal (Q_i Q_j) is at least \gamma n^{2/3 m ^2 \ln n } for an absolute constant \gamma >0.
Edit intent: clarity
Original:  We prove a sufficient condition for the latter system to have a solution x \in { %DIFDELCMD < \Bbb %%%  R}^n : assuming that the operator norms of the n \times n matrices Q_i of q_i do not exceed 1, the smallest eigenvalue the m \times m matrix with the (i, j)-th entry equal (Q_i Q_j) is at least \gamma n^{2/3 m ^2 \ln n }  for an absolute constant \gamma >0.
Revised:  We prove a sufficient condition for the latter system to have a solution x \in { %DIFDELCMD < \Bbb %%% R}^n (Q_i Q_j) is at least \gamma n^{2/3 m ^2 \ln n } for an absolute constant \gamma >0.
Edit intent: coherence
Original:  In particular, this happens when n \gg m^6 and the forms q_i are sufficiently generic.
Edit intent: coherence
Original:  We prove a similar sufficient condition for a homogeneous system of quadratic equations to have a non-trivial solution  .
Revised:  We prove a similar sufficient condition for a system of homogeneous quadratic equations to have a non-trivial solution .
Edit intent: fluency
Original: This paper describes the winning approach in the public SwissText 2021  competition on dialect recognition and translation of Swiss German speech to standard German text .
Revised: This paper describes the winning approach in the public SwissText 2021 competition on dialect recognition and translation .
Edit intent: clarity
Original: The connectivity and resource-constrained nature of IoT, and in particular single-board devices , opens up to cybersecurity concerns affecting the Industrial Internet of Things ( IIoT) .
Revised: The connectivity and resource-constrained nature of single-board devices , opens up to cybersecurity concerns affecting the Industrial Internet of Things ( IIoT) .
Edit intent: coherence
Original: The connectivity and resource-constrained nature of IoT, and in particular single-board devices , opens up to cybersecurity concerns affecting the Industrial Internet of Things ( IIoT) .
Revised: The connectivity and resource-constrained nature of IoT, and in particular single-board devices opens up to cybersecurity concerns affecting the Industrial Internet of Things ( IIoT) .
Edit intent: fluency
Original: The connectivity and resource-constrained nature of IoT, and in particular single-board devices , opens up to cybersecurity concerns affecting the Industrial Internet of Things ( IIoT) .
Revised: The connectivity and resource-constrained nature of IoT, and in particular single-board devices , opens up to cybersecurity concerns affecting Internet of Things ( IIoT) .
Edit intent: clarity
Original: The connectivity and resource-constrained nature of IoT, and in particular single-board devices , opens up to cybersecurity concerns affecting the Industrial Internet of Things ( IIoT) .
Revised: The connectivity and resource-constrained nature of IoT, and in particular single-board devices , opens up to cybersecurity concerns affecting the Industrial Internet of Things ( IoT) scenarios .
Edit intent: clarity
Original:  Evil IoT twins are malicious devices, with identical hardware and software configurations to authorized ones, that can provoke sensitive information leakages, data poisoning, or privilege escalation in industrial scenarios.
Revised:  Evil IoT twins are malicious devices, with identical hardware and software configurations to authorized ones, that can provoke sensitive information leakages, data poisoning, or privilege escalation in IoT scenarios.
Edit intent: clarity
Original:  A complimentary approach and a step towards completely in silico experiments , is to synthesise the imagery itself.
Revised:  A complimentary approach and a step towards in silico experimentation , is to synthesise the imagery itself.
Edit intent: clarity
Original:  A promising solution, and the focus of this work, is coded computation, which advocates the use of error-correcting codes to improve the performance of distributed computing through ``smart'' data redundancy.
Revised:  A promising solution, and the focus of this work, is coded computation, which advocates the use of error-correcting codes to improve the performance of distributed computing through "smart" data redundancy.
Edit intent: fluency
Original:  We take advantage of the ``garbage terms'' that naturally arise when polynomials are constructed in the design of MatDot-CMPC and PolyDot-CMPC to reduce the number of workers needed for privacy-preserving computation.
Revised:  We take advantage of the "garbage terms" that naturally arise when polynomials are constructed in the design of MatDot-CMPC and PolyDot-CMPC to reduce the number of workers needed for privacy-preserving computation.
Edit intent: fluency
Original: This work presents a suitable mathematical analysis to understand the properties of convergence and bounded variation  of a new fully discrete locally conservative Lagrangian--Eulerian explicit numerical scheme to the entropy solution in the sense of Kruzhkov via weak asymptotic method.
Revised: In this paper, we study both convergence and bounded variation of a new fully discrete locally conservative Lagrangian--Eulerian explicit numerical scheme to the entropy solution in the sense of Kruzhkov via weak asymptotic method.
Edit intent: clarity
Original: This work presents a suitable mathematical analysis to understand the properties of convergence and bounded variation  of a new fully discrete locally conservative Lagrangian--Eulerian explicit numerical scheme to the entropy solution in the sense of Kruzhkov via weak asymptotic method.
Revised: This work presents a suitable mathematical analysis to understand the properties of convergence and bounded variation of a new fully discrete conservative Lagrangian--Eulerian explicit numerical scheme to the entropy solution in the sense of Kruzhkov via weak asymptotic method.
Edit intent: clarity
Original: This work presents a suitable mathematical analysis to understand the properties of convergence and bounded variation  of a new fully discrete locally conservative Lagrangian--Eulerian explicit numerical scheme to the entropy solution in the sense of Kruzhkov via weak asymptotic method.
Revised: This work presents a suitable mathematical analysis to understand the properties of convergence and bounded variation of a new fully discrete locally conservative Lagrangian--Eulerian numerical scheme to the entropy solution in the sense of Kruzhkov via weak asymptotic method.
Edit intent: clarity
Original: This work presents a suitable mathematical analysis to understand the properties of convergence and bounded variation  of a new fully discrete locally conservative Lagrangian--Eulerian explicit numerical scheme to the entropy solution in the sense of Kruzhkov via weak asymptotic method.
Revised: This work presents a suitable mathematical analysis to understand the properties of convergence and bounded variation of a new fully discrete locally conservative Lagrangian--Eulerian explicit scheme to the entropy solution in the sense of Kruzhkov via weak asymptotic method.
Edit intent: clarity
Original: Predicting the future motion of multiple agents is necessary for planning in dynamic environments.
Revised: Predicting the motion of multiple agents is necessary for planning in dynamic environments.
Edit intent: clarity
Original:  This task is challenging for autonomous driving since agents (e.g. , vehicles and pedestrians) and their associated behaviors may be diverse and influence each other . Most prior work has focused on first predicting independent futures for each agent based on all past motion, and then planning against these independent predictions.
Revised:  This task is challenging for autonomous driving since agents (e.g. vehicles and pedestrians) and their associated behaviors may be diverse and influence each other . Most prior work has focused on first predicting independent futures for each agent based on all past motion, and then planning against these independent predictions.
Edit intent: fluency
Original:  This task is challenging for autonomous driving since agents (e.g. , vehicles and pedestrians) and their associated behaviors may be diverse and influence each other . Most prior work has focused on first predicting independent futures for each agent based on all past motion, and then planning against these independent predictions.
Revised:  This task is challenging for autonomous driving since agents (e.g. , vehicles and pedestrians) and their associated behaviors may be diverse and influence one another . Most prior work has focused on first predicting independent futures for each agent based on all past motion, and then planning against these independent predictions.
Edit intent: fluency
Original:  This task is challenging for autonomous driving since agents (e.g. , vehicles and pedestrians) and their associated behaviors may be diverse and influence each other . Most prior work has focused on first predicting independent futures for each agent based on all past motion, and then planning against these independent predictions.
Revised:  This task is challenging for autonomous driving since agents (e.g. , vehicles and pedestrians) and their associated behaviors may be diverse and influence each other . Most prior work have focused on predicting independent futures for each agent based on all past motion, and then planning against these independent predictions.
Edit intent: clarity
Original:  This task is challenging for autonomous driving since agents (e.g. , vehicles and pedestrians) and their associated behaviors may be diverse and influence each other . Most prior work has focused on first predicting independent futures for each agent based on all past motion, and then planning against these independent predictions.
Revised:  This task is challenging for autonomous driving since agents (e.g. , vehicles and pedestrians) and their associated behaviors may be diverse and influence each other . Most prior work has focused on first predicting independent futures for each agent based on all past motion, and planning against these independent predictions.
Edit intent: coherence
Original:  However, planning against fixed predictions can suffer from the inability to represent the future interaction possibilities between different agents, leading to sub-optimal planning.
Revised:  However, planning against independent predictions can make it challenging to represent the future interaction possibilities between different agents, leading to sub-optimal planning.
Edit intent: clarity
Original:  In this work, we formulate a model for predicting the behavior of all agents jointly in real-world driving environments in a unified manner .
Revised:  In this work, we formulate a model for predicting the behavior of all agents jointly , producing consistent futures that account for interactions between agents .
Edit intent: clarity
Original:  Our model architecture fuses heterogeneous world state in a unified Transformer architecture by employing attention across road elements, agent interactions  and time steps.
Revised:  Our model architecture employs attention to combine features across road elements, agent interactions and time steps.
Edit intent: clarity
Original:  Our model architecture fuses heterogeneous world state in a unified Transformer architecture by employing attention across road elements, agent interactions  and time steps.
Revised:  Our model architecture fuses heterogeneous world state in a unified Transformer architecture by employing attention across road elements, agent interactions , and time steps.
Edit intent: fluency
Original: We analyse the performance of passage retrieval models in the presence of complex (multi-hop) questions to provide a better understanding of how retrieval systems behave when multiple hops of reasoning are needed.
Edit intent: clarity
Original:  In simple open-domain question answering (QA), dense passage retrieval has become one of the standard approaches for retrieving the relevant passages to infer an answer.
Revised:  In simple open-domain question answering (QA), dense retrieval has become one of the standard approaches for retrieving the relevant passages to infer an answer.
Edit intent: fluency
Original:  Recently, dense passage retrieval also achieved state-of-the-art results in multi-hop QA, where aggregating information from multiple documents and reasoning over them is required.
Revised:  Recently, dense retrieval also achieved state-of-the-art results in multi-hop QA, where aggregating information from multiple documents and reasoning over them is required.
Edit intent: clarity
Original:  Recently, dense passage retrieval also achieved state-of-the-art results in multi-hop QA, where aggregating information from multiple documents and reasoning over them is required.
Revised:  Recently, dense passage retrieval also achieved state-of-the-art results in multi-hop QA, where aggregating information from multiple pieces of information and reasoning over them is required.
Edit intent: clarity
Original:  However, so far, the dense retrieval models are not evaluated properly concerning the multi-hop nature of the problem: models are typically evaluated by the end result of the retrieval pipeline, which leaves unclear where their success lies .
Revised:  Despite their success, dense retrieval methods are computationally intensive, requiring multiple GPUs to train .
Edit intent: coherence
Original:  Moreover, we introduce a hybrid (lexical and dense) retrieval approach that is highly competitive with the state-of-the-art dense retrieval model , while requiring substantially less computational resources.
Revised:  Moreover, we introduce a hybrid (lexical and dense) retrieval approach that is highly competitive with the state-of-the-art dense retrieval models , while requiring substantially less computational resources.
Edit intent: fluency
Original:  The classical Feynman-Kac theorem says that the solution to a broad class of second order parabolic equation is the mean of a particular diffusion.
Revised:  The classical Feynman-Kac theorem says that the solution to a broad class of second order parabolic equations is the mean of a particular diffusion.
Edit intent: fluency
Original:  Specifically, we are given a set T of n points in R^d and a parameter 0< \alpha <\frac 1 2 such that an \alpha-fraction of the points in T are i.i.d. samples from a well-behaved distribution D and the remaining (1-\alpha)-fraction of the points are arbitrary.
Revised:  Specifically, we are given a set T of n points in R^d and a parameter 0< \alpha <\frac 1 2 such that an \alpha-fraction of the points in T are i.i.d. samples from a well-behaved distribution D and the remaining (1-\alpha)-fraction are arbitrary.
Edit intent: clarity
Original:  The goal is to output a small list of vectors  at least one of which is close to the mean of D.
Revised:  The goal is to output a small list of vectors , at least one of which is close to the mean of D.
Edit intent: fluency
Original:  As our main contribution, we develop new algorithms for list-decodable mean estimation, achieving nearly-optimal statistical guarantees, with running time n ^{1 + o(1) } d . All prior algorithms for this problem had additional polynomial factors in \frac 1 \alpha.
Revised:  We develop new algorithms for list-decodable mean estimation, achieving nearly-optimal statistical guarantees, with running time n ^{1 + o(1) } d . All prior algorithms for this problem had additional polynomial factors in \frac 1 \alpha.
Edit intent: clarity