wanyu/IteraTeR_full_sent huggingface dataset:
Original:  We perform evaluations on multiple downstream tasks on the GLUE benchmark and IMDB reviews with standard sequence length, and find that our Nystr\"omformer performs comparably, or in a few cases, even slightly better, than standard Transformer.
Revised:  We perform evaluations on multiple downstream tasks on the GLUE benchmark and IMDB reviews with standard sequence length, and find that our Nystr\"omformer performs comparably, or in a few cases, even slightly better, than standard self-attention. On longer sequence tasks in the Long Range Arena (LRA) benchmark, Nystr\"{o
Edit intent: meaning-changed
Original:  The proposed PCI, established and demonstrated at the US county level, exhibits a strong positive association with SafeGraph population movement records (10 percent penetration in the US population) and Facebook  social connectedness index (SCI), a popular connectivity index based on social networks.
Revised:  The proposed PCI, established and demonstrated at the US county level, exhibits a strong positive association with SafeGraph population movement records (10 percent penetration in the US population) and Facebook 's social connectedness index (SCI), a popular connectivity index based on social networks.
Edit intent: clarity
Original:  Our investigation further suggests that PCI has great potential in addressing real-world problems that require place connectivity knowledge, exemplified with two applications: 1) modeling the spatial spread of a contagious disease (e.g., COVID-19 ) , and 2) modeling hurricane evacuation destination choices .
Revised:  Our investigation further suggests that PCI has great potential in addressing real-world problems that require place connectivity knowledge, exemplified with two applications: 1) modeling the spatial spread of COVID-19 ) , and 2) modeling hurricane evacuation destination choices .
Edit intent: clarity
Original:  Our investigation further suggests that PCI has great potential in addressing real-world problems that require place connectivity knowledge, exemplified with two applications: 1) modeling the spatial spread of a contagious disease (e.g., COVID-19 ) , and 2) modeling hurricane evacuation destination choices .
Revised:  Our investigation further suggests that PCI has great potential in addressing real-world problems that require place connectivity knowledge, exemplified with two applications: 1) modeling the spatial spread of a contagious disease (e.g., COVID-19 during the early stage of the pandemic , and 2) modeling hurricane evacuation destination choices .
Edit intent: meaning-changed
Original:  Our investigation further suggests that PCI has great potential in addressing real-world problems that require place connectivity knowledge, exemplified with two applications: 1) modeling the spatial spread of a contagious disease (e.g., COVID-19 ) , and 2) modeling hurricane evacuation destination choices .
Revised:  Our investigation further suggests that PCI has great potential in addressing real-world problems that require place connectivity knowledge, exemplified with two applications: 1) modeling the spatial spread of a contagious disease (e.g., COVID-19 ) , and 2) modeling hurricane evacuation destination choice .
Edit intent: fluency
Original:  In this study, we introduced a  place connectivity index (PCI) based on spatial interactions among places revealed by geotagged tweets as a multiscale, spatiotemporal-continuous , and easy-to-implement measurement.
Revised:  In this study, we introduced a global multi-scale place connectivity index (PCI) based on spatial interactions among places revealed by geotagged tweets as a multiscale, spatiotemporal-continuous , and easy-to-implement measurement.
Edit intent: meaning-changed
Original:  In this study, we introduced a  place connectivity index (PCI) based on spatial interactions among places revealed by geotagged tweets as a multiscale, spatiotemporal-continuous , and easy-to-implement measurement.
Revised:  In this study, we introduced a place connectivity index (PCI) based on spatial interactions among places revealed by geotagged tweets as a spatiotemporal-continuous , and easy-to-implement measurement.
Edit intent: clarity
Original:  In this study, we introduced a  place connectivity index (PCI) based on spatial interactions among places revealed by geotagged tweets as a multiscale, spatiotemporal-continuous , and easy-to-implement measurement.
Revised:  In this study, we introduced a place connectivity index (PCI) based on spatial interactions among places revealed by geotagged tweets as a multiscale, spatiotemporal-continuous and easy-to-implement measurement.
Edit intent: fluency
Original:  The proposed PCI, established and demonstrated at the US county level, exhibits a strong positive association with SafeGraph population movement records (10 percent penetration in the US population) and Facebook's social connectedness index (SCI), a popular connectivity index based on social networks.
Revised:  The multi-scale PCI, demonstrated at the US county level, exhibits a strong positive association with SafeGraph population movement records (10 percent penetration in the US population) and Facebook's social connectedness index (SCI), a popular connectivity index based on social networks.
Edit intent: clarity
Original:  Our investigation further suggests that PCI has great potential in addressing real-world problems that require place connectivity knowledge, exemplified with two applications: 1) modeling the spatial spread of COVID-19 during the early stage of the pandemic , and 2) modeling hurricane evacuation destination choice.
Revised:  Our investigation further suggests that PCI has great potential in addressing real-world problems that require place connectivity knowledge, exemplified with two applications: 1) modeling the spatial spread of COVID-19 during the early stage of the pandemic and 2) modeling hurricane evacuation destination choice.
Edit intent: fluency
Original:  Simultaneous Localization and Mapping (SLAM) has found an increasing utilization lately, such as self-driving cars, robot navigation, 3D mapping, virtual reality (VR) and augmented reality (AR), etc., empowering both industry and daily life.
Revised: Due to the complicated procedure and costly hardware, Simultaneous Localization and Mapping (SLAM) has found an increasing utilization lately, such as self-driving cars, robot navigation, 3D mapping, virtual reality (VR) and augmented reality (AR), etc., empowering both industry and daily life.
Edit intent: meaning-changed
Original:  Simultaneous Localization and Mapping (SLAM) has found an increasing utilization lately, such as self-driving cars, robot navigation, 3D mapping, virtual reality (VR) and augmented reality (AR), etc., empowering both industry and daily life. Although the state-of-the-art algorithms where developers have spared no effort are source of intelligence, it is the datasets that dedicate behind and raise us higher. The employment of datasetsis essentially a kind of simulation but profits many aspects - capacity of drilling algorithm hourly, exemption of costly hardware and ground truth system, and equitable benchmark for evaluation. However, as a branch of great significance, still the datasets have not drawn wide attention nor been reviewed thoroughly. Hence in this article, we strive to give a comprehensive and open access review of SLAM related datasets and evaluation, which are scarcely surveyed while highly demanded by researchers and engineers, looking forward to serving as not only a dictionary but also a development proposal.
Revised:  Simultaneous Localization and Mapping (SLAM) has been heavily dependent on public datasets for drill and evaluation, leading to many impressive demos and good benchmark scores. However, with a huge contrast, SLAM is still struggling on the way towards mature deployment, which sounds a warning: some of the datasets are overexposed, causing biased usage and evaluation. This raises the problem on how to comprehensively access the existing datasets and correctly select them. Moreover, limitations do exist in current datasets, then how to build new ones and which directions to go? Nevertheless, a comprehensive survey which can tackle the above issues does not exist yet, while urgently demanded by the community. To fill the gap, this paper strives to cover a range of cohesive topics about SLAM related datasets and evaluation, which are scarcely surveyed while highly demanded by researchers and engineers, looking forward to serving as not only a dictionary but also a development proposal.
Edit intent: meaning-changed
Original:  Hence in this article, we strive to give a comprehensive and open access review of SLAM related datasets and evaluation, which are scarcely surveyed while highly demanded by researchers and engineers, looking forward to serving as not only a dictionary but also a development proposal. The paper starts with the methodology of dataset collection, and a taxonomy of SLAM related tasks. Then followed with the main portion - comprehensively survey the existing SLAM related datasetsby category with our considerate introductions and insights. Furthermore, we talk about the evaluation criteria, which are necessary to quantify the algorithm performance on the dataset and inspect the defects.
Revised:  Hence in this article, we strive to give a comprehensive and open access review of SLAM related datasets , including general collection methodology and fundamental characteristic dimensions, SLAM related tasks taxonomy and datasets categorization, introduction of state-of-the-arts, overview and comparison of existing datasets, review of evaluation criteria, which are necessary to quantify the algorithm performance on the dataset and inspect the defects.
Edit intent: meaning-changed
Original:  Furthermore, we talk about the evaluation criteria, which are necessary to quantify the algorithm performance on the dataset and inspect the defects. At the end, we summarize the weakness of datasets and evaluation - which could well result in the weakness of topical algorithms - to promote bridging the gap fundamentally .
Revised:  Furthermore, we talk about the evaluation criteria, and analyses and discussions about current limitations and future directions, looking forward to not only guiding the dataset selection, but also promoting the dataset research .
Edit intent: coherence
Original:  Thus our proposed gait synthesizer works as a fast MPC-style planner to guarantee the stability of robots . Simulation and experimental results on an 8 degrees of freedom (DoF) bipedal robot are provided to show the performance and robustness of this method for walking and standing.
Revised:  Thus our proposed gait synthesizer works as a fast MPC-style planner to guarantee the feasibility and stability of the full dimensional robot . Simulation and experimental results on an 8 degrees of freedom (DoF) bipedal robot are provided to show the performance and robustness of this method for walking and standing.
Edit intent: meaning-changed
Original:  Thus our proposed gait synthesizer works as a fast MPC-style planner to guarantee the stability of robots . Simulation and experimental results on an 8 degrees of freedom (DoF) bipedal robot are provided to show the performance and robustness of this method for walking and standing.
Revised:  Thus our proposed gait synthesizer works as a fast MPC-style planner to guarantee the stability of robots . Simulation and experimental results on an 8 degrees of freedom (DoF) bipedal robot are provided to show the performance and robustness of this approach for walking and standing.
Edit intent: clarity
Original:  While directly solving these problems is extremely time-consuming, we propose a predictive gait synthesizer to solve them quickly online . Based on the full dimensional model, a library of gaits with different speeds and periods is first constructed offline.
Revised:  While directly solving these problems is extremely time-consuming, we propose a predictive gait synthesizer to offer immediate solutions . Based on the full dimensional model, a library of gaits with different speeds and periods is first constructed offline.
Edit intent: clarity
Original:  While directly solving these problems is extremely time-consuming, we propose a predictive gait synthesizer to solve them quickly online . Based on the full dimensional model, a library of gaits with different speeds and periods is first constructed offline.
Revised:  While directly solving these problems is extremely time-consuming, we propose a predictive gait synthesizer to solve them quickly online . Based on the full-dimensional model, a library of gaits with different speeds and periods is first constructed offline.
Edit intent: fluency
Original:  We prove that the generated gaits are feasible solutions of the MPC optimization problems. Thus our proposed gait synthesizer works as a fast MPC-style planner to guarantee the feasibility and stability of the full dimensional robot .
Revised:  We prove that the constructed MPC problem can ensure the uniform ultimate boundedness (UUB) of the CoM states and show that our proposed gait synthesizer works as a fast MPC-style planner to guarantee the feasibility and stability of the full dimensional robot .
Edit intent: meaning-changed
Original: Finding Bertram's optimal trading strategy for a pair of cointegrated assets following the Ornstein-Uhlenbeck price difference process can be formulated as an unconstrained convex optimization problem for maximization of expected profit per unit of time.
Revised: Finding Bertram's optimal trading strategy for a pair of cointegrated assets following the Ornstein--Uhlenbeck price difference process can be formulated as an unconstrained convex optimization problem for maximization of expected profit per unit of time.
Edit intent: fluency
Original:  We generalize this model to the form where the riskiness of profit, measured by its per-time-unit volatility, is controlled (e.g. in case of existence of limits on riskiness of trading strategies imposed by regulatory bodies).
Revised:  This model is generalized to the form where the riskiness of profit, measured by its per-time-unit volatility, is controlled (e.g. in case of existence of limits on riskiness of trading strategies imposed by regulatory bodies).
Edit intent: clarity
Original:  We also investigate the problem critical for practice that parameters of the price difference process are never known exactly and are imprecisely estimated from an observed finite sample . We show how the imprecision affects the optimal trading strategy and quantify the loss caused by the imprecise estimate compared to a theoretical trader knowing the parameters exactly  .
Revised:  We also investigate the problem critical for practice that parameters of the price difference process are never known exactly and are imprecisely estimated from an observed finite sample is investigated (recalling that this problem is critical for practice). It is shown how the imprecision affects the optimal trading strategy and quantify the loss caused by the imprecise estimate compared to a theoretical trader knowing the parameters exactly .
Edit intent: coherence
Original:  We show how the imprecision affects the optimal trading strategy and quantify the loss caused by the imprecise estimate compared to a theoretical trader knowing the parameters exactly  .
Revised:  We show how the imprecision affects the optimal trading strategy and quantify the loss caused by the imprecise estimate compared to a theoretical trader knowing the parameters exactly . The main results focus on the geometric and optimization-theoretic viewpoint of the risk-bounded trading strategy and the imprecision resulting from the statistical estimates .
Edit intent: meaning-changed
Original: This part of my thesis would use several statistical measures to examine the degree of India's GVC engagement.Those measures can be classified according to the levels of vertical integration, such as measures of backward integration, measures of forward integration, and some other statistical measures. I have summarised the main measures of forward and backward dimensions as well as the other crucial measures of India's GVC engagement in the following sections .
Revised: My study would follow two phases of analysis i.e. the first phase/preliminary view would be developed through the widest range of available and applicable methodologies followed by a second phase/in-depth assessment and discussion of the identified challenges, opportunities, and policy options .
Edit intent: clarity
Original: My study would follow two phases of analysis i.e. the first phase/preliminary view would be developed through the widest range of available and applicable methodologies followed by a second phase/in-depth assessment and discussion of the identified challenges, opportunities, and policy options .
Revised: The global production (as a system of creating values) is eventually forming a vast web of value chains that explains the transitional structures of global trade and development of the world economy. It is truly a new wave of globalisation, and we can term it as the global value chains (GVCs), creating the nexus among firms, workers and consumers around the globe. The emergence of this new scenario is asking how an economy's businesses, producers and employees are connecting to the global economy and capturing the gains out of it regarding different dimensions of economic development. Indeed, this GVC approach is very crucial for understanding URLanisation of the global industries (including firms) through analysing the statics and dynamics of different economic players involved in this complex global production network. Its widespread notion deals with various global issues (including regional value chains also) from the top down to the bottom up, founding a scope for policy analysis .
Edit intent: meaning-changed
Original:  Meanwhile, the sizes of many molecular datasets are far smaller than many other datasets in typical deep learning applications , and most hyperparameter optimization (HPO) methods have not been explored in terms of their efficiencies on such small datasets in  molecular domain.
Revised:  Meanwhile, many molecular datasets are far smaller than many other datasets in typical deep learning applications , and most hyperparameter optimization (HPO) methods have not been explored in terms of their efficiencies on such small datasets in molecular domain.
Edit intent: clarity
Original:  Meanwhile, the sizes of many molecular datasets are far smaller than many other datasets in typical deep learning applications , and most hyperparameter optimization (HPO) methods have not been explored in terms of their efficiencies on such small datasets in  molecular domain.
Revised:  Meanwhile, the sizes of many molecular datasets are far smaller than many other datasets in typical deep learning applications . Most hyperparameter optimization (HPO) methods have not been explored in terms of their efficiencies on such small datasets in molecular domain.
Edit intent: coherence
Original:  Meanwhile, the sizes of many molecular datasets are far smaller than many other datasets in typical deep learning applications , and most hyperparameter optimization (HPO) methods have not been explored in terms of their efficiencies on such small datasets in  molecular domain.
Revised:  Meanwhile, the sizes of many molecular datasets are far smaller than many other datasets in typical deep learning applications , and most hyperparameter optimization (HPO) methods have not been explored in terms of their efficiencies on such small datasets in the molecular domain.
Edit intent: fluency
Original:  In particular, we obtain an O(\log^* \Delta)-round CONGEST algorithm for ( 2 \Delta -1) -edge coloring when \Delta \ge \log ^2 n, and a poly(\log\log n)-round algorithm  in general.
Revised:  In particular, we obtain an O(\log^* \Delta)-round CONGEST algorithm for ( 1+\epsilon) \Delta -1) -edge coloring when \Delta \ge \log ^2 n, and a poly(\log\log n)-round algorithm in general.
Edit intent: meaning-changed
Original:  In particular, we obtain an O(\log^* \Delta)-round CONGEST algorithm for ( 2 \Delta -1) -edge coloring when \Delta \ge \log ^2 n, and a poly(\log\log n)-round algorithm  in general.
Revised:  In particular, we obtain an O(\log^* \Delta)-round CONGEST algorithm for ( 2 \Delta -edge coloring when \Delta \ge \log ^2 n, and a poly(\log\log n)-round algorithm in general.
Edit intent: meaning-changed
Original:  In particular, we obtain an O(\log^* \Delta)-round CONGEST algorithm for ( 2 \Delta -1) -edge coloring when \Delta \ge \log ^2 n, and a poly(\log\log n)-round algorithm  in general.
Revised:  In particular, we obtain an O(\log^* \Delta)-round CONGEST algorithm for ( 2 \Delta -1) -edge coloring when \Delta \ge \log ^{1+1/\log^*n n, and a poly(\log\log n)-round algorithm in general.
Edit intent: meaning-changed
Original:  In particular, we obtain an O(\log^* \Delta)-round CONGEST algorithm for ( 2 \Delta -1) -edge coloring when \Delta \ge \log ^2 n, and a poly(\log\log n)-round algorithm  in general.
Revised:  In particular, we obtain an O(\log^* \Delta)-round CONGEST algorithm for ( 2 \Delta -1) -edge coloring when \Delta \ge \log ^2 n, and a poly(\log\log n)-round algorithm for (2\Delta-1)-edge coloring in general.
Edit intent: fluency
Original: Solving wave equations in a time-parallel manner is challenging, and the algorithm based on the block \alpha-circulant preconditioning technique has shown its advantage in many existing studies (where \alpha\in(0, 1) is a free parameter).
Revised: Solving evolutionary equations in a time-parallel manner is challenging, and the algorithm based on the block \alpha-circulant preconditioning technique has shown its advantage in many existing studies (where \alpha\in(0, 1) is a free parameter).
Edit intent: meaning-changed
Original: Solving wave equations in a time-parallel manner is challenging, and the algorithm based on the block \alpha-circulant preconditioning technique has shown its advantage in many existing studies (where \alpha\in(0, 1) is a free parameter).
Revised: Solving wave equations in a parallel-in-time manner is an attractive topic and many algorithms are proposed in recent two decades. The algorithm based on the block \alpha-circulant preconditioning technique has shown its advantage in many existing studies (where \alpha\in(0, 1) is a free parameter).
Edit intent: meaning-changed
Original: Solving wave equations in a time-parallel manner is challenging, and the algorithm based on the block \alpha-circulant preconditioning technique has shown its advantage in many existing studies (where \alpha\in(0, 1) is a free parameter). Considerable efforts have been devoted to exploring the  spectral radius of the preconditioned matrix and this leads to many case-by-case studies depending on the used time-integrator.
Revised: Solving wave equations in a time-parallel manner is challenging, and the algorithm based on the block \alpha-circulant preconditioning technique has shown promising advantages, especially for wave propagation problems. By fast Fourier transform for factorizing the involved circulant matrices, the preconditioned iteration can be computed efficiently via the so-called diagonalization technique, which yields a direct parallel implementation across all time levels. In recent years, considerable efforts have been devoted to exploring the spectral radius of the preconditioned matrix and this leads to many case-by-case studies depending on the used time-integrator.
Edit intent: meaning-changed
Original:  Considerable efforts have been devoted to exploring the  spectral radius of the preconditioned matrix and this leads to many case-by-case studies depending on the used time-integrator.
Revised:  Considerable efforts have been devoted to exploring the convergence of the preconditioned iteration by studying the spectral radius of the preconditioned matrix and this leads to many case-by-case studies depending on the used time-integrator.
Edit intent: meaning-changed