wanyu/IteraTeR_v2 huggingface dataset:
Original:  We show the convergence of the alternating projection algorithm . Experimental results for synthetic data and multi-dimensional images are presented to demonstrate the performance of the proposed NLRT method is better than that of existing NTF methods.
Revised:  We show the convergence of the alternating projection algorithm . Experimental results for synthetic data and multi-dimensional images are presented to demonstrate the performance of NLRT is better than that of existing NTF methods.
Edit intent: clarity
Original:  We show the convergence of the alternating projection algorithm . Experimental results for synthetic data and multi-dimensional images are presented to demonstrate the performance of the proposed NLRT method is better than that of existing NTF methods.
Revised:  We show the convergence of the alternating projection algorithm . Experimental results for synthetic data and multi-dimensional images are presented to demonstrate the performance of the proposed NLRT method is better than state-of-the-art NTF methods.
Edit intent: clarity
Original:  As an example of this reverse scheme, we present a polynomial-time algorithm that properly colors the vertices of a graph with relatively few colors, establishing that bounded twin-width classes are \chi-bounded.
Revised:  As an example , we establish that bounded twin-width classes are \chi-bounded.
Edit intent: coherence
Original: Studies have suggested that there is farming potential in urban residential buildings.
Revised: Studies have suggested that there is farming potential in residential buildings.
Edit intent: clarity
Original:  Using a case study area focused on high-rise buildings in Singapore, this paper examines a novel application of 3D city models to identify suitable farming micro-locations in residential buildings.
Revised:  Using a case study area focused on high-rise buildings in Singapore, this paper examines a novel application of 3D city models to identify suitable farming micro-locations in buildings.
Edit intent: clarity
Original:  Finally, we note that unlike the original sketching approach of Ahn, Guha and McGregor'12, none of the existing spanner constructions yield%DIFDELCMD < {\em %%% simultaneous communication protocols with low per player information .
Revised:  Finally, we %DIFDELCMD < {\em %%% simultaneous communication protocols with low per player information .
Edit intent: coherence
Original:  The agent's motion is modeled by a probabilistic labeled Markov decision process (MDP) . A relaxed product MDP is developed, which allows the agent to revise its motion plan to not strictly follow the desired LTL constraints whenever the task is found to be infeasible.
Revised:  The agent's motion is modeled by a probabilistic labeled Markov decision process (MDP) . A relaxed product MDP is developed, which allows the agent to revise its motion plan whenever the task is found to be infeasible.
Edit intent: coherence
Original:  To evaluate the revised motion plan, a utility function composed of violation and implementation cost is developed, where the violation cost function is designed to quantify the differences between the revised and the desired motion plan , and the implementation cost are designed to bias the selection towards cost-efficient plans.
Revised:  To evaluate the revised motion plan, a utility function composed of violation and implementation cost is developed, where the violation cost , and the implementation cost are designed to bias the selection towards cost-efficient plans.
Edit intent: clarity
Original:  Cost optimization in both prefix and suffix of the agent trajectory is then solved via coupled linear programs . Simulation results are provided to demonstrate its effectiveness .
Revised:  Cost optimization in both prefix and suffix of the agent trajectory . Simulation results are provided to demonstrate its effectiveness .
Edit intent: clarity
Original:  Cost optimization in both prefix and suffix of the agent trajectory is then solved via coupled linear programs . Simulation results are provided to demonstrate its effectiveness .
Revised:  Cost optimization in both prefix and suffix of the agent trajectory is then solved via coupled linear programs . Simulation results are provided to demonstrate the effectiveness of the proposed framework .
Edit intent: clarity
Original: This paper studies optimal probabilistic motion planning of a mobile agent with potentially infeasible task specifications subject to motion and environment uncertainties.
Revised: This paper studies optimal motion planning subject to motion and environment uncertainties.
Edit intent: clarity
Original:  Instead of the traditional Rabin automata,  limit-deterministic B\"uchi automata are applied and a relaxed product MDP between PL-MDP (i.e., probabilistic labeled Markov decision process) and LDBAis developed, which allows the agent to revise its motion plan whenever the task is not fully feasible  .
Revised:  Instead of the traditional Rabin automata, limit-deterministic B\"uchi automata are applied and a relaxed product MDP between PL-MDP and LDBA. The relaxed product MDP allows the agent to revise its motion plan whenever the task is not fully feasible .
Edit intent: coherence
Original:  To the best of our knowledge, it is the first work that bridges the gap between planning revision and optimal control synthesis of both prefix and suffix of the agent trajectory . Simulation results are provided to demonstrate the effectiveness of the proposed framework.
Revised:  To the best of our knowledge, it is the first work that bridges the gap between planning revision and optimal control synthesis of both plan prefix and plan suffix of the agent trajectory . Simulation results are provided to demonstrate the effectiveness of the proposed framework.
Edit intent: fluency
Original:  During this silent phase, and in the following weeks when the hospital system was overburdened, data collection to estimate an epidemic curve was not performed in a way that could provide useful data .
Revised:  During this silent phase, and in the following weeks when the hospital system was overburdened, data collection was not performed in a way that could provide useful data .
Edit intent: clarity
Original:  During this silent phase, and in the following weeks when the hospital system was overburdened, data collection to estimate an epidemic curve was not performed in a way that could provide useful data .
Revised:  During this silent phase, and in the following weeks when the hospital system was overburdened, data collection to estimate an epidemic curve was not performed in an accurate enough way to estimate an epidemic curve .
Edit intent: clarity
Original:  Methods: we collected all cause mortality data stratified by age from the national institute of statistics, together with COVID-related deaths data relesead by other government structures.
Revised:  Methods: we collected all cause mortality data stratified by age from the national institute of statistics, together with COVID-related deaths data released by other government structures.
Edit intent: fluency
Original:  Using a SEIR model together with estimated of the exposure to death time distribution, we fitted the reproduction number in different phases of the spread at regional level.
Revised:  Using a SEIR model together with estimates of the exposure to death time distribution, we fitted the reproduction number in different phases of the spread at regional level.
Edit intent: fluency
Original:  Human programmers routinely tackle the task of writing complex programs by writing sub-programs and then analysing their intermediate results to compose them in appropriate ways.
Revised:  Human programmers routinely tackle the task of writing complex programs by writing sub-programs and then analyzing their intermediate results to compose them in appropriate ways.
Edit intent: fluency
Original:  This is a powerful combination because of several emergent properties : First, in bottom-up search, intermediate programs can be executed, providing semantic information to the neural network.
Revised:  This is a powerful combination because of several emergent properties . First, in bottom-up search, intermediate programs can be executed, providing semantic information to the neural network.
Edit intent: fluency
Original:  The generalization Subset Odd Cycle Transversal requires that S only intersects those odd cycles that include a vertex of a distinguished subset T of the vertex set .
Revised:  The Subset Odd Cycle Transversal requires that S only intersects those odd cycles that include a vertex of a distinguished subset T of the vertex set .
Edit intent: clarity
Original:  The generalization Subset Odd Cycle Transversal requires that S only intersects those odd cycles that include a vertex of a distinguished subset T of the vertex set .
Revised:  The generalization Subset Odd Cycle Transversal problem requires S to intersect only those odd cycles that include a vertex of a distinguished subset T of the vertex set .
Edit intent: clarity
Original:  The generalization Subset Odd Cycle Transversal requires that S only intersects those odd cycles that include a vertex of a distinguished subset T of the vertex set .
Revised:  The generalization Subset Odd Cycle Transversal requires that S only intersects those odd cycles that include a vertex of a distinguished vertex subset T .
Edit intent: clarity
Original:  If we are also given weights for the vertices of the graph, we can ask instead that S has small weight: this is the problem Weighted Subset Odd Cycle Transversal.
Revised:  If we are given weights for the vertices of the graph, we can ask instead that S has small weight: this is the problem Weighted Subset Odd Cycle Transversal.
Edit intent: clarity
Original:  If we are also given weights for the vertices of the graph, we can ask instead that S has small weight: this is the problem Weighted Subset Odd Cycle Transversal.
Revised:  If we are also given weights for the vertices , we ask instead that S has small weight: this is the problem Weighted Subset Odd Cycle Transversal.
Edit intent: clarity
Original:  We prove an almost-complete complexity dichotomy for this problem when the input is restricted to graphs that do not contain a graph ~ H as an induced subgraph.
Revised:  We prove an almost-complete complexity dichotomy for this problem when the input is restricted to graphs that do not contain a graph H as an induced subgraph.
Edit intent: fluency
Original: In this work, we focus on the relaxed physical factorization (RPF) preconditioner for the block linear systems arising from the three-field formulation (displacement/velocity/pressure) of coupled poromechanics.
Revised: The relaxed physical factorization (RPF) preconditioner for the block linear systems arising from the three-field formulation (displacement/velocity/pressure) of coupled poromechanics.
Edit intent: clarity
Original: In this work, we focus on the relaxed physical factorization (RPF) preconditioner for the block linear systems arising from the three-field formulation (displacement/velocity/pressure) of coupled poromechanics.
Revised: In this work, we focus on the relaxed physical factorization (RPF) preconditioner for the block linear systems arising from the three-field displacement-velocity-pressure formulation of coupled poromechanics.
Edit intent: fluency
Original:  Inspired by the relaxed dimensional factorization developed for the Navier-Stokes equations by Benzi et al.
Edit intent: coherence
Original:  Mech. Engrg., 300 (2016), pp. 129--145%DIFDELCMD < ]%%% , the RPF preconditioner was recently advanced by Frigo et al.
Revised:  Mech. Engrg., 300 (2016), pp. 129--145%DIFDELCMD < ]%%% 
Edit intent: coherence
Original:  SIAM J. Sci. Comp., 41 (2019), pp. B694--B720%DIFDELCMD < ] %%% and relies on: (i) combining proper physics-based splittings of the block matrix by field type, and (ii) introducing an optimal relaxation parameter \alpha.
Revised:  %DIFDELCMD < ] %%% and relies on: (i) combining proper physics-based splittings of the block matrix by field type, and (ii) introducing an optimal relaxation parameter \alpha.
Edit intent: coherence
Original:  However, a possible drawback arises from the need of inverting blocks in the form C = ( C + \beta F F^T) for large values of the real coefficient \beta , where C is a regular square matrixand FF^T is a rank-deficient term .
Revised:  However, a possible drawback arises from the need of inverting blocks in the form C = ( C + \beta F F^T) , where C is a regular square matrixand FF^T is a rank-deficient term .
Edit intent: coherence
Original:   In this work, we propose a family of algebraic techniques to stabilize the inexact solve with C , which can also prove useful in other problems  where such an issue might arise, such as augmented Lagrangian preconditioning strategies for Navier-Stokes or incompressible elasticity.
Revised:  In this work, we propose a family of algebraic techniques to stabilize the inexact solve with C . This strategy can prove useful in other problems where such an issue might arise, such as augmented Lagrangian preconditioning strategies for Navier-Stokes or incompressible elasticity.
Edit intent: clarity
Original:   In this work, we propose a family of algebraic techniques to stabilize the inexact solve with C , which can also prove useful in other problems  where such an issue might arise, such as augmented Lagrangian preconditioning strategies for Navier-Stokes or incompressible elasticity.
Revised:  In this work, we propose a family of algebraic techniques to stabilize the inexact solve with C , which can also prove useful in other problems where such an issue might arise, such as augmented Lagrangian preconditioning techniques for Navier-Stokes or incompressible elasticity.
Edit intent: fluency
Original:  Mexico City, the largest city in Mexico, is as well one of the largest cities in the world , with over 9 million inhabitants and concentrating the vast majority of government and business centers.
Revised:  Mexico City, the largest city in Mexico, is also one of the largest cities in the world , with over 9 million inhabitants and concentrating the vast majority of government and business centers.
Edit intent: clarity
Original:  Mexico City, the largest city in Mexico, is as well one of the largest cities in the world , with over 9 million inhabitants and concentrating the vast majority of government and business centers.
Revised:  Mexico City, the largest city in Mexico, is as well one of the largest cities in the world . It has over 9 million inhabitants and concentrating the vast majority of government and business centers.
Edit intent: coherence
Original:  Mexico City, the largest city in Mexico, is as well one of the largest cities in the world , with over 9 million inhabitants and concentrating the vast majority of government and business centers.
Revised:  Mexico City, the largest city in Mexico, is as well one of the largest cities in the world , with over 9 million inhabitants and concentrates the vast majority of government and business centers.
Edit intent: fluency
Original:  Reconstructing the set of physical interactions between its inhabitants could lead to a better understanding of the city's complexity .
Revised:  In this work we describe algorithms that use anonymized location data from mobile devices to construct Mexico City's contact and mobility networks aiming to help the analysis of the city's complexity .
Edit intent: clarity
Original:  In this work, we used anonymized location data from mobile devices (cellphones) collected in the month of February 2020 to reconstruct contact networks for several days, based on physical proximity of these devices .
Revised:  In this work, we used anonymized location data from mobile devices (cellphones) collected in the month of February 2020 and performing a general descriptive analysis on them .
Edit intent: clarity
Original:  We found that contact networks in Mexico City are very sparse, with a heavy tailed degree distribution, characterized by a largest connected component that contains between 10 and 20%DIFDELCMD < \\%%% %DIF < of devices.
Revised:  We found that contact networks in Mexico City are very sparse, characterized by a largest connected component that contains between 10 and 20%DIFDELCMD < \\%%% %DIF < of devices.
Edit intent: clarity
Original:  We found that contact networks in Mexico City are very sparse, with a heavy tailed degree distribution, characterized by a largest connected component that contains between 10 and 20%DIFDELCMD < \\%%% %DIF < of devices.
Revised:  We found that contact networks in Mexico City are very sparse, with a heavy tailed degree distribution, characterized by a largest connected component %DIFDELCMD < \\%%% %DIF < of devices.
Edit intent: clarity
Original:  We present this results along with the release of an anonymized network reconstructed with data from Februrary 18th, 2020, as the first description of a contact network of Mexico City .
Revised:  We present these results along with the release of an anonymized network reconstructed with data from Februrary 18th, 2020, as the first description of a contact network of Mexico City .
Edit intent: fluency
Original: Computational audio analysis has become a central issue in associated areas of research and a variety of related applications arised.
Revised: Recently, a variety of acoustic tasks and related applications arised.
Edit intent: clarity
Original:  However, for many acoustic tasks, the labeled data size may be limited.
Revised:  For many acoustic tasks, the labeled data size may be limited.
Edit intent: coherence
Original:  To handle this problem, We propose an unsupervised pre-training method using Transformer based encoder to learn a general and robust high-level representation for all acoustic tasks.
Revised:  To handle this problem, we propose an unsupervised pre-training method using Transformer based encoder to learn a general and robust high-level representation for all acoustic tasks.
Edit intent: fluency
Original:  Experiments have been conducted on three kinds of acoustic tasks: speech translation, speech emotion recognitionand sound event detection  .
Revised:  Experiments have been conducted on three kinds of acoustic tasks: speech emotion recognition, sound event detection .
Edit intent: clarity
Original:  All the experiments have shown that pre-training using its own training data can significantly make the model converge faster and improve the performance.
Revised:  All the experiments have shown that pre-training using its own training data can significantly improve the performance.
Edit intent: clarity
Original:  The basic IRKAis used to find Reduced Order Models (ROMs) for the stable systems conveniently but it is unsuitable for the unstable systems .
Revised:  The basic IRKAis used to find Reduced Order Models (ROMs) can be found conveniently, but it is unsuitable for the unstable systems .
Edit intent: clarity
Original:  The basic IRKAis used to find Reduced Order Models (ROMs) for the stable systems conveniently but it is unsuitable for the unstable systems .
Revised:  The basic IRKAis used to find Reduced Order Models (ROMs) for the stable systems conveniently but it is unsuitable for the unstable ones .
Edit intent: clarity
Original:  In the proposed technique, we implement the initial feedback  within the construction of the projectors of the IRKA approach.
Revised:  In the proposed technique, the initial feedback within the construction of the projectors of the IRKA approach.
Edit intent: clarity
Original:  In the proposed technique, we implement the initial feedback  within the construction of the projectors of the IRKA approach.
Revised:  In the proposed technique, we implement the initial feedback is implemented within the construction of the projectors of the IRKA approach.
Edit intent: clarity
Original:  The Riccati solution is estimated from the ROM achieved by IRKA and hence the low-rank feedback matrix is attained.
Revised:  The solution of the Riccati equation is estimated from the ROM achieved by IRKA and hence the low-rank feedback matrix is attained.
Edit intent: clarity
Original:  The feedback matrix for the full model  is retrieved from the low-rank feedback matrix by the reverse projecting process .
Revised:  Using the reverse projecting process, for the full model is retrieved from the low-rank feedback matrix by the reverse projecting process .
Edit intent: clarity
Original:  The feedback matrix for the full model  is retrieved from the low-rank feedback matrix by the reverse projecting process .
Revised:  The feedback matrix for the full model is retrieved from the low-rank feedback matrix .
Edit intent: clarity
Original:  Finally, the applicability and efficiency of the proposed method are validated by applying to unstable index-1 descriptor systems.
Revised:  Finally, the applicability and efficiency of the proposed technique it is applied to unstable index-1 descriptor systems.
Edit intent: clarity
Original:  The  simulation is done numerically using MATLABand the achieved results are discussed in both tabular and graphical approaches .
Revised:  The simulation is done by numerical computation using MATLAB, and both the tabular method and graphical method are used as the supporting tools of comparative analysis .
Edit intent: clarity
Original: This letter shows the existence of a proportional fair rate allocation in communication links carrying both time-sensitive (TS) and non-time-sensitive traffic (NTS) . This optimal point results from maximizing a simple throughput-delay trade-off that considers a) the NTS traffic load, and b) the difference between the maximum and the current delay of the TS packets.
Revised: This letter shows the existence of a proportional fair rate allocation in communication links carrying both time-sensitive (TS) and non-time-sensitive traffic (NTS) . This optimal point results from maximizing a simple throughput-delay trade-off that considers a) the NTS traffic load, and the mean delay of the TS packets.
Edit intent: clarity
Original:  Results from this use-case confirm that the throughput-delay trade-off also works when both the packet arrival process and packet service time distributions are general .
Revised:  Results from this use-case confirm that the throughput-delay trade-off also works regardless the distribution of the packet arrival and packet service time distributions are general .
Edit intent: clarity
Original:  Results from this use-case confirm that the throughput-delay trade-off also works when both the packet arrival process and packet service time distributions are general .
Revised:  Results from this use-case confirm that the throughput-delay trade-off also works when both the packet arrival process and packet service times .
Edit intent: clarity
Original: By performing a large number of spatial measurements , high spatial resolution photoacoustic imaging can be achieved without specific prior information.
Revised: Performing a large number of spatial measurements , high spatial resolution photoacoustic imaging can be achieved without specific prior information.
Edit intent: fluency
Original: By performing a large number of spatial measurements , high spatial resolution photoacoustic imaging can be achieved without specific prior information.
Revised: By performing a large number of spatial measurements enables high-resolution photoacoustic imaging without specific prior information.
Edit intent: clarity
Original:  However, the acquisition of spatial measurements is time consuming, costly and technically challenging.
Revised:  However, the acquisition of spatial measurements is time-consuming, costly, and technically challenging.
Edit intent: fluency
Original:  By exploiting non-linear prior information, compressed sensing techniques in combination with sophisticate reconstruction algorithms allow a reduction of number of measurements while maintaining a high spatial resolution.
Revised:  By exploiting nonlinear prior information, compressed sensing techniques in combination with sophisticate reconstruction algorithms allow a reduction of number of measurements while maintaining a high spatial resolution.
Edit intent: fluency