wanyu/IteraTeR_v2 huggingface dataset:
Original: Numerical experiments suggest that our solver is more efficient than the state-of-the-art when a highly accurate solution is required .
Revised: Numerical experiments suggest that our solver is more accurate than the state-of-the-art when a highly accurate solution is required .
Edit intent: clarity
Original: In this paper we study the approximation properties of the spectral conservative method for the elastic and inelastic Boltzmann problem introduced by the authors in \mbox{ GT09 .
Revised: In this paper we study the approximation properties of the conservative spectral method for the elastic and inelastic Boltzmann problem introduced by the authors in \mbox{ GT09 .
Edit intent: fluency
Original:  We present an analysis on the accuracy and consistency of the method, for both elastic and inelastic collisions, and a discussion of the L^{1,2 theory for the scheme in the elastic case which includes the estimation of the negative mass generated by the scheme.
Revised:  We present an analysis on the accuracy and consistency of the method, for both elastic and inelastic collisions, and a discussion of the L^{1,2 theory for the scheme in the elastic case which includes the estimation of the negative mass created by the scheme.
Edit intent: clarity
Original:  The Lagrangian optimization correction algorithm is not only crucial for the error estimates and the convergence to the equilibrium Maxwellian, but also it is absolutely necessary for the moments conservation for systems of kinetic equations in mixtures and chemical reactions.
Revised:  The Lagrangian optimization correction algorithm is not only crucial for the error estimates and the convergence to the equilibrium Maxwellian, but also it is necessary for the moments conservation for systems of kinetic equations in mixtures and chemical reactions.
Edit intent: coherence
Original:  The Lagrangian optimization correction algorithm is not only crucial for the error estimates and the convergence to the equilibrium Maxwellian, but also it is absolutely necessary for the moments conservation for systems of kinetic equations in mixtures and chemical reactions.
Revised:  The Lagrangian optimization correction algorithm is not only crucial for the error estimates and the convergence to the equilibrium Maxwellian, but also it is absolutely necessary for the moment conservation for systems of kinetic equations in mixtures and chemical reactions.
Edit intent: fluency
Original: In this manuscript we develop error estimates for the semi-discrete approximation properties of the conservative spectral method for the  elastic and inelastic Boltzmann problem introduced by the authors in 47 .
Revised: We develop error estimates for the semi-discrete approximation properties of the conservative spectral method for the elastic and inelastic Boltzmann problem introduced by the authors in 47 .
Edit intent: clarity
Original: In this manuscript we develop error estimates for the semi-discrete approximation properties of the conservative spectral method for the  elastic and inelastic Boltzmann problem introduced by the authors in 47 .
Revised: In this manuscript we develop error estimates for the semi-discrete conservative spectral method for the elastic and inelastic Boltzmann problem introduced by the authors in 47 .
Edit intent: clarity
Original: In this manuscript we develop error estimates for the semi-discrete approximation properties of the conservative spectral method for the  elastic and inelastic Boltzmann problem introduced by the authors in 47 .
Revised: In this manuscript we develop error estimates for the semi-discrete approximation properties of the conservative spectral method for the approximation of the elastic and inelastic Boltzmann problem introduced by the authors in 47 .
Edit intent: clarity
Original:  We present an analysis on the accuracy and consistency of the method, for both elastic and inelastic collisions, and a discussion of the L1-L2 theory for the scheme in the elastic case which includes the estimation of the negative mass created by the scheme .
Revised:  We present an analysis on the accuracy and consistency of the method, for both elastic and inelastic collisions, and a discussion of the L1-L2 theory for the scheme .
Edit intent: coherence
Original:  The results of this work answer a long standing open problem posed by Cercignani , Illner and Pulvirenti in 31%DIFDELCMD < ]%%% , Chapter 12, about finding error estimates for a Boltzmann scheme as well as to show that the semi-discrete numerical solution converges to the equilibrium Maxwellian distribution  .
Revised:  The results of this work answer a long standing open problem posed by Cercignani 31%DIFDELCMD < ]%%% , Chapter 12, about finding error estimates for a Boltzmann scheme as well as to show that the semi-discrete numerical solution converges to the equilibrium Maxwellian distribution .
Edit intent: coherence
Original:  The results of this work answer a long standing open problem posed by Cercignani , Illner and Pulvirenti in 31%DIFDELCMD < ]%%% , Chapter 12, about finding error estimates for a Boltzmann scheme as well as to show that the semi-discrete numerical solution converges to the equilibrium Maxwellian distribution  .
Revised:  The results of this work answer a long standing open problem posed by Cercignani , Illner and Pulvirenti in %DIFDELCMD < ]%%% , Chapter 12, about finding error estimates for a Boltzmann scheme as well as to show that the semi-discrete numerical solution converges to the equilibrium Maxwellian distribution .
Edit intent: coherence
Original:  The results of this work answer a long standing open problem posed by Cercignani , Illner and Pulvirenti in 31%DIFDELCMD < ]%%% , Chapter 12, about finding error estimates for a Boltzmann scheme as well as to show that the semi-discrete numerical solution converges to the equilibrium Maxwellian distribution  .
Revised:  The results of this work answer a long standing open problem posed by Cercignani , Illner and Pulvirenti in 31%DIFDELCMD < ]%%% , Chapter 12, about finding error estimates for a numerical scheme associated to the Boltzmann equation, as well as to show that the semi-discrete numerical solution converges to the equilibrium Maxwellian distribution .
Edit intent: clarity
Original:  The results of this work answer a long standing open problem posed by Cercignani , Illner and Pulvirenti in 31%DIFDELCMD < ]%%% , Chapter 12, about finding error estimates for a Boltzmann scheme as well as to show that the semi-discrete numerical solution converges to the equilibrium Maxwellian distribution  .
Revised:  The results of this work answer a long standing open problem posed by Cercignani , Illner and Pulvirenti in 31%DIFDELCMD < ]%%% , Chapter 12, about finding error estimates for a Boltzmann scheme as well as showing the semi-discrete numerical solution converges to the equilibrium Maxwellian distribution .
Edit intent: fluency
Original: We introduce and analyze coupled, multi-strain SIS, SIR and SIRS epidemic models designed to simulate the emergence and dissemination of  drug-resistant  pathogen strains.
Revised: We introduce and analyze coupled, multi-strain SIS, SIR and SIRS epidemic models designed to simulate the emergence and dissemination of drug-resistant ) pathogen strains.
Edit intent: fluency
Original:  We also derive explicit expressions for the basic reproduction numbers of each strain and discuss how their relative and absolute magnitudes govern the existence and stability of the asymptotic states of each system.
Revised:  We also derive explicit expressions for the basic reproduction number of each strain and discuss how their relative and absolute magnitudes govern the existence and stability of the asymptotic states of each system.
Edit intent: fluency
Original:  Finally, we also demonstrate that the fittest strain is not necessarily the most prevalent such that a less-fit, drug-resistant descendant strain can "replace" its fitter, more susceptible ancestor .
Revised:  Finally, we also demonstrate that the strain with the greatest reproductive capacity is not necessarily the most prevalent such that a less-fit, drug-resistant descendant strain can "replace" its fitter, more susceptible ancestor .
Edit intent: clarity
Original:  Finally, we also demonstrate that the fittest strain is not necessarily the most prevalent such that a less-fit, drug-resistant descendant strain can "replace" its fitter, more susceptible ancestor .
Revised:  Finally, we also demonstrate that the fittest strain is not necessarily the most prevalent . Finally, we briefly discuss the implications of our results for public health policy and planning .
Edit intent: clarity
Original: In this paper, we present a complete system for on-device passive monitoring, collection, and analysis of fine-grained , large-scale packet measurements from mobile devices.
Revised: In this paper, we present a complete system for on-device passive monitoring, collection, and analysis of fine grained , large-scale packet measurements from mobile devices.
Edit intent: fluency
Original:  First, we describe the design and implementation of AntMonitor as a user-space mobile app based on a VPN-service but only on the device (without the need to route through a remote VPN server) and using only the minimum resources required.
Revised:  First, we describe the design and implementation of AntMonitor as a userspace mobile app based on a VPN-service but only on the device (without the need to route through a remote VPN server) and using only the minimum resources required.
Edit intent: fluency
Original:  We evaluate our prototype and show that it significantly outperforms prior state-of-the-art approaches: it achieves throughput of over 90 Mbps downlink and 65 Mbps uplink, which is 2x and 8x faster than mobile-only baselines and is 94\% of the throughput without VPN, while using 2--12x less energy.
Revised:  We evaluate our prototype and show that it significantly outperforms prior state-of-the-art approaches: it achieves throughput of over 90 Mbps downlink and 65 Mbps uplink, which is 2x and 8x faster than mobile-only baselines and is 94\% of the throughput without VPN, while using 2-12x less energy.
Edit intent: fluency
Original:  These approaches maximize particular objective functions with respect to the model parameters.
Revised:  These approaches maximise particular objective functions with respect to the model parameters.
Edit intent: fluency
Original:  We characterize the performance of an arbitrary objective function and calculate the objective function which optimally reconstructs the model parameters.
Revised:  We characterise the performance of an arbitrary objective function and calculate the objective function which optimally reconstructs the model parameters.
Edit intent: fluency
Original:  Conceptually, the problem we propose generalizes the unconstrained integer quadratic program and the minimum cost lifted multicut problem, both of which are NP-hard.
Revised:  Conceptually, the problem we state generalizes the unconstrained integer quadratic program and the minimum cost lifted multicut problem, both of which are NP-hard.
Edit intent: clarity
Original:  To demonstrate the effectiveness of this algorithm in solving computer vision tasks, we report running times and competitive solutions for two above-mentioned applications.
Revised:  To demonstrate their effectiveness in tackling computer vision tasks, we report running times and competitive solutions for two above-mentioned applications.
Edit intent: clarity
Original: We introduce a new class of forward performance processes that are  predictable with regards to an underlying filtration and are updated in discrete time .
Revised: We introduce a new class of forward performance processes that are predictable with regards to an underlying filtration and are updated at discrete times .
Edit intent: fluency
Original:  Such performance criteria may accommodate short-term predictability of asset returns, sequential learning and other dynamically unfolding factors affecting optimal portfolio choice.
Revised:  Such performance criteria accommodate short-term predictability of asset returns, sequential learning and other dynamically unfolding factors affecting optimal portfolio choice.
Edit intent: clarity
Original:  We show that the key step  is to solve a single-period inverse {\it  investment problem, which we study in detail.
Revised:  We show that the key step is to solve a single-period inverse {\it inverse investment problem, which we study in detail.
Edit intent: fluency
Original:  In particular, We reduce this inverse problem to an iterative (i.e. single variable ) functional equation and establish conditions for  existence and uniqueness of  solutions in the class of inverse marginal functions .
Revised:  In particular, We reduce this inverse problem to solving a single variable functional equation, and establish conditions for existence and uniqueness of solutions in the class of inverse marginal functions .
Edit intent: clarity
Original:  In particular, We reduce this inverse problem to an iterative (i.e. single variable ) functional equation and establish conditions for  existence and uniqueness of  solutions in the class of inverse marginal functions .
Revised:  In particular, We reduce this inverse problem to an iterative (i.e. single variable ) functional equation and establish conditions for the existence and uniqueness of solutions in the class of inverse marginal functions .
Edit intent: fluency
Original:  In particular, We reduce this inverse problem to an iterative (i.e. single variable ) functional equation and establish conditions for  existence and uniqueness of  solutions in the class of inverse marginal functions .
Revised:  In particular, We reduce this inverse problem to an iterative (i.e. single variable ) functional equation and establish conditions for existence and uniqueness of its solutions in the class of inverse marginal functions .
Edit intent: clarity
Original: We introduce a new class of forward performance processes that are endogenous and predictable with regards to an underlying market information set , and are updated at discrete times.
Revised: We introduce a new class of forward performance processes that are endogenous and predictable with regards to an underlying market information set and, furthermore, are updated at discrete times.
Edit intent: coherence
Original:  Such performance criteria accommodate short-term predictability of asset returns, sequential learning and other dynamically unfolding factors affecting optimal portfolio choice.
Edit intent: coherence
Original:  We show that the key step in the construction of the associated predictable forward performance process is to solve a single-period %DIFDELCMD < {\it %DIFDELCMD < %%% inverse investment problem, namely, to determine, period-by-period and conditionally on the current market information, the end-time utility function from a given initial-time value function.
Revised:  We show that the key step in the construction of the associated predictable forward performance process is to solve a single-period %DIFDELCMD < {\it %DIFDELCMD < %%% inverse investment problem, namely, to determine, period-by-period and conditionally on the current market information, the end-time utility function from a given initial-time value function.
Edit intent: fluency
Original:  We reduce this inverse problem to solving a single variable functional equation , and establish conditions for the existence and uniqueness of its solutions in the class of inverse marginal functions.
Revised:  We reduce this inverse problem to solving a functional equation and establish conditions for the existence and uniqueness of its solutions in the class of inverse marginal functions.
Edit intent: clarity
Original: In this paper, we combine query result diversity with query relaxation to balance the result number and result quality  . Relaxation guarantees the number of the que-ry results, returning more relevance elements to the query if the results are too few, while the diversity tries to reduce the similarity among the returned results.
Revised: In this paper, we combine query result diversity with query relaxation to balance the result number and result quality , we combine query result diversity with query relaxation . Relaxation guarantees the number of the que-ry results, returning more relevance elements to the query if the results are too few, while the diversity tries to reduce the similarity among the returned results.
Edit intent: fluency
Original: In this paper, we combine query result diversity with query relaxation to balance the result number and result quality  . Relaxation guarantees the number of the que-ry results, returning more relevance elements to the query if the results are too few, while the diversity tries to reduce the similarity among the returned results.
Revised: In this paper, we combine query result diversity with query relaxation to balance the result number and result quality . Relaxation guarantees the number of the query results, returning more relevance elements to the query if the results are too few, while the diversity tries to reduce the similarity among the returned results.
Edit intent: fluency
Original: In this paper, we combine query result diversity with query relaxation to balance the result number and result quality  . Relaxation guarantees the number of the que-ry results, returning more relevance elements to the query if the results are too few, while the diversity tries to reduce the similarity among the returned results.
Revised: In this paper, we combine query result diversity with query relaxation to balance the result number and result quality . Relaxation guarantees the number of the que-ry results, returning more relevant elements to the query if the results are too few, while the diversity tries to reduce the similarity among the returned results.
Edit intent: fluency
Original:  By making a trade-off of similarity and diversity, we improve  user experience.
Revised:  By making a trade-off of similarity and diversity, we improve the user experience.
Edit intent: fluency
Original:  To achieve this goal, we design the goal function combining similarity and diversity.
Revised:  To achieve this goal, we define a novel goal function combining similarity and diversity.
Edit intent: clarity
Original:  Among them, algorithms gen-Greedy and genCluster perform relaxation first and select part of the candidates to diversify.
Revised:  Among them, algorithms genGreedy and genCluster perform relaxation first and select part of the candidates to diversify.
Edit intent: fluency
Original:  Moreover, we present algorithm CB2S that splits the datasets into smaller pieces using the cluster algorithm of k-means and process queries in several small sets to retrieve more diverse results.
Revised:  Moreover, we present algorithm CB2S splits the dataset into smaller pieces using the cluster algorithm of k-means and process queries in several small sets to retrieve more diverse results.
Edit intent: coherence
Original:  Moreover, we present algorithm CB2S that splits the datasets into smaller pieces using the cluster algorithm of k-means and process queries in several small sets to retrieve more diverse results.
Revised:  Moreover, we present algorithm CB2S that splits the datasets into smaller pieces using the clustering algorithm of k-means and process queries in several small sets to retrieve more diverse results.
Edit intent: clarity
Original:  Moreover, we present algorithm CB2S that splits the datasets into smaller pieces using the cluster algorithm of k-means and process queries in several small sets to retrieve more diverse results.
Revised:  Moreover, we present algorithm CB2S that splits the datasets into smaller pieces using the cluster algorithm of k-means and processes queries in several small sets to retrieve more diverse results.
Edit intent: fluency
Original:  The balance of similarity and diversity is decided through setting a threshold, which has a default value and can be adjusted according to users' preference.
Revised:  The balance of similarity and diversity is determined through setting a threshold, which has a default value and can be adjusted according to users' preference.
Edit intent: clarity
Original:  The performance and efficiency of our system are demonstrated through extensive experiments based on various da-tasets .
Revised:  The performance and efficiency of our system are demonstrated through extensive experiments based on various datasets .
Edit intent: fluency
Original:  However, since mmWave signals are very susceptible to blockage, channel quality on any one mmWave link can be extremely intermittent.
Revised:  However, since mmWave signals are highly susceptible to blockage, channel quality on any one mmWave link can be extremely intermittent.
Edit intent: coherence
Original:  Based on this approach, this paper provides the first comprehensive  evaluation of handover mechanisms in mmWave cellular systems.
Revised:  This paper provides the first comprehensive evaluation of handover mechanisms in mmWave cellular systems.
Edit intent: clarity
Original:  The simulation framework includes detailed measurement-based channel models to realistically capture spatial dynamics of blocking events, as well as the full details of MAC, RLC and end-to-end transport protocols.
Revised:  The simulation framework includes detailed measurement-based channel models to realistically capture spatial dynamics of blocking events, as well as the full details of MAC, RLC and transport protocols.
Edit intent: clarity
Original:  The study reveals significant benefits of the proposed method under several metrics , compared to conventional handover mechanisms .
Revised:  Compared to conventional handover mechanisms, the study reveals significant benefits of the proposed method under several metrics , compared to conventional handover mechanisms .
Edit intent: fluency
Original:  The study reveals significant benefits of the proposed method under several metrics , compared to conventional handover mechanisms .
Revised:  The study reveals significant benefits of the proposed method under several metrics .
Edit intent: clarity
Original:  This suggests that functional heterogeneity may be a dominating factor behind the lack of reproducibility of FC changes in different rs-fMRI studies of PD.
Revised:  This suggests that functional heterogeneity may be a dominating factor behind the lack of reproducibility of FC alterations in different rs-fMRI studies of PD.
Edit intent: clarity
Original:  We acquired resting-state fMRI scans for 43 subjects (27 patients and 16 normal controls, with 2 replicate scans per subject ) and compared the observed FC changes with those obtained in two independent datasets, one made available by the PPMI consortium (91 patients, 18 controls) and a second one by the group of Tao Wu (20 patients, 20 controls) .
Revised:  We acquired resting-state fMRI scans for 43 subjects (27 patients , 16 normal controls, with 2 replicate scans per subject ) and compared the observed FC changes with those obtained in two independent datasets, one made available by the PPMI consortium (91 patients, 18 controls) and a second one by the group of Tao Wu (20 patients, 20 controls) .
Edit intent: coherence
Original:  We acquired resting-state fMRI scans for 43 subjects (27 patients and 16 normal controls, with 2 replicate scans per subject ) and compared the observed FC changes with those obtained in two independent datasets, one made available by the PPMI consortium (91 patients, 18 controls) and a second one by the group of Tao Wu (20 patients, 20 controls) .
Revised:  We acquired resting-state fMRI scans for 43 subjects (27 patients and 16 controls ) and compared the observed FC changes with those obtained in two independent datasets, one made available by the PPMI consortium (91 patients, 18 controls) and a second one by the group of Tao Wu (20 patients, 20 controls) .
Edit intent: clarity