wanyu/IteraTeR_v2 huggingface dataset:
Original:  In thispaper , we proposed new principles for AVC and introduced anew framework to set sight on the themes of videosto facili-tate AVC learning.
Revised:  In this paper , we proposed new principles for AVC and introduced anew framework to set sight on the themes of videosto facili-tate AVC learning.
Edit intent: fluency
Original:  In thispaper , we proposed new principles for AVC and introduced anew framework to set sight on the themes of videosto facili-tate AVC learning.
Revised:  In thispaper , we proposed new principles for AVC and introduced a new framework to set sight on the themes of videosto facili-tate AVC learning.
Edit intent: fluency
Original:  In thispaper , we proposed new principles for AVC and introduced anew framework to set sight on the themes of videosto facili-tate AVC learning.
Revised:  In thispaper , we proposed new principles for AVC and introduced anew framework to set sight of videos' themes to facilitate AVC learning.
Edit intent: fluency
Original:  We also released the KWAI-AD-AudViscorpus which contained 85432 short advertisement videos (around 913 hours) made by users.
Revised:  We also released the KWAI-AD-AudVis corpus which contained 85432 short advertisement videos (around 913 hours) made by users.
Edit intent: fluency
Original:  We evaluated our pro-posed approach on this corpus  and it was able to outperformthe baseline by 23.15\% absolute differenc
Revised:  We evaluated our proposed approach on this corpus and it was able to outperformthe baseline by 23.15\% absolute differenc
Edit intent: fluency
Original:  We evaluated our pro-posed approach on this corpus  and it was able to outperformthe baseline by 23.15\% absolute differenc
Revised:  We evaluated our pro-posed approach on this corpus , and it was able to outperformthe baseline by 23.15\% absolute differenc
Edit intent: fluency
Original:  We evaluated our pro-posed approach on this corpus  and it was able to outperformthe baseline by 23.15\% absolute differenc
Revised:  We evaluated our pro-posed approach on this corpus and it was able to outperform the baseline by 23.15\% absolute differenc
Edit intent: fluency
Original:  We evaluated our pro-posed approach on this corpus  and it was able to outperformthe baseline by 23.15\% absolute differenc
Revised:  We evaluated our pro-posed approach on this corpus and it was able to outperformthe baseline by 23.15\% absolute difference.
Edit intent: fluency
Original:  An optimal allocation strategy, especially in countries with access inequities and a temporal separation of hot-spots  might be an effective way of halting the disease spread.
Revised:  An optimal allocation strategy, especially in countries with access inequities and temporal separation of hot-spots might be an effective way of halting the disease spread.
Edit intent: fluency
Original:  An optimal allocation strategy, especially in countries with access inequities and a temporal separation of hot-spots  might be an effective way of halting the disease spread.
Revised:  An optimal allocation strategy, especially in countries with access inequities and a temporal separation of hot-spots , might be an effective way of halting the disease spread.
Edit intent: fluency
Original:  We also propose novel evaluation strategies including a standard compartmental model based projections and a causality preserving evaluation of our model.
Revised:  We also propose novel evaluation strategies including standard compartmental model-based projections and a causality preserving evaluation of our model.
Edit intent: fluency
Original:  Finally, we contribute a new Open-AI environment meant for the vaccine distribution scenario , and open-source VacSIM for wide testing and applications across the globe.
Revised:  Finally, we contribute a new Open-AI environment meant for the vaccine distribution scenario and open-source VacSIM for wide testing and applications across the globe.
Edit intent: fluency
Original:  Finally, we contribute a new Open-AI environment meant for the vaccine distribution scenario , and open-source VacSIM for wide testing and applications across the globe.
Revised:  Finally, we contribute a new Open-AI environment meant for the vaccine distribution scenario , and open-source VacSIM for wide testing and applications across the URL
Edit intent: clarity
Original:  We evaluate this framework against a naive allocation approach of distributing vaccine proportional to the incidence of COVID-19 cases in five different States across India and demonstrate up to 9039 additional lives potentially saved and a significant increase in the efficacy of limiting the spread over a period of 45 days through the VacSIM approach.
Revised:  We evaluate this framework against a naive allocation approach of distributing vaccine proportional to the incidence of COVID-19 cases in five different States across India and demonstrate up to 9039 potential infections prevented and a significant increase in the efficacy of limiting the spread over a period of 45 days through the VacSIM approach.
Edit intent: clarity
Original:   We also propose novel evaluation strategies including standard compartmental model-based projections and a causality preserving evaluation of our model.
Revised:  We also propose novel evaluation strategies including standard compartmental model-based projections and a causality-preserving evaluation of our model.
Edit intent: fluency
Original:  Finally, we contribute a new Open-AI environment meant for the vaccine distribution scenario and open-source VacSIM for wide testing and applications across the  URL
Revised:  Finally, we contribute a new Open-AI environment meant for the vaccine distribution scenario and open-source VacSIM for wide testing and applications across the globe. URL
Edit intent: clarity
Original:  This paper reveals the secrets of session-level user search behaviors by conducting a comprehensive investigation over massive real-world SPARQL query logs.
Revised:  This paper reveals secrets of session-level user search behaviors by conducting a comprehensive investigation over massive real-world SPARQL query logs.
Edit intent: fluency
Original: We study the problem of finding the k most similar trajectories in a graph to a given query trajectory.
Revised: We study the problem of finding the k most similar trajectories to a given query trajectory.
Edit intent: clarity
Original:  Our work was inspired by the work of Grossi et al.
Revised:  Our work is inspired by the work of Grossi et al.
Edit intent: fluency
Original:  [6] that considered trajectories as walks in a graph in which each visited vertex is accompanied by a time-interval.
Revised:  [6] that considers trajectories as walks in a graph in which each visited vertex is accompanied by a time-interval.
Edit intent: fluency
Original:  [6] that considered trajectories as walks in a graph in which each visited vertex is accompanied by a time-interval.
Revised:  [6] that considered trajectories as walks in a graph . Each visited vertex is accompanied by a time-interval.
Edit intent: clarity
Original:  Grossi et al. define a similarity function which is able to capture both temporal and spatial aspects.
Revised:  Grossi et al. define a similarity function that captures temporal and spatial aspects.
Edit intent: clarity
Original:  We modify this similarity function in order to derive a  spatio-temporal distance function for which we can show that a specific type of triangle inequality is satisfied.
Revised:  We improve this similarity function in order to derive a spatio-temporal distance function for which we can show that a specific type of triangle inequality is satisfied.
Edit intent: clarity
Original:  We modify this similarity function in order to derive a  spatio-temporal distance function for which we can show that a specific type of triangle inequality is satisfied.
Revised:  We modify this similarity function to derive a spatio-temporal distance function for which we can show that a specific type of triangle inequality is satisfied.
Edit intent: coherence
Original:  \% This distance function builds the basis for our index structure which is able to quickly answer queries for the top-k most similar trajectories.
Revised:  This distance function builds the basis for our index structure which is able to quickly answer queries for the top-k most similar trajectories.
Edit intent: coherence
Original:  \% This distance function builds the basis for our index structure which is able to quickly answer queries for the top-k most similar trajectories.
Revised:  \% This distance function is the basis for our index structure which is able to quickly answer queries for the top-k most similar trajectories.
Edit intent: clarity
Original:  Our evaluation on real-world and synthetic data sets shows that our new approaches outperform the baselines with respect to indexing time , query time , and quality of results.
Revised:  Our evaluation on real-world and synthetic data sets shows that our algorithms outperform the baselines with respect to indexing time , query time , and quality of results.
Edit intent: clarity
Original:  We leverage prior Affective Computing and Psychology research in negotiations to guide various key principles that define the behavior and personality of our agent . Pilot has been selected as one of the finalists for presentation at IJCAI .
Revised:  We leverage prior Affective Computing and Psychology research in negotiations to guide various key principles that define the behavior and personality of our agent .
Edit intent: clarity
Original: Markov Decision Processes (MDPs) are known to be sensitive to parameter specification.
Revised: Markov decision processes (MDPs) are known to be sensitive to parameter specification.
Edit intent: fluency
Original:  Distributionally robust MDPs alleviate this issue by allowing for ambiguity sets which give a set of possible distributions over parameter sets.
Revised:  Distributionally robust MDPs alleviate this issue by allowing for ambiguity sets which give a set of possible distributions over parameter sets.
Edit intent: fluency
Original:  We propose a first-order methods framework for solving Distributionally robust MDPs  , and instantiate it for several types of Wasserstein ambiguity sets.
Revised:  We propose a framework for solving Distributionally robust MDPs , and instantiate it for several types of Wasserstein ambiguity sets.
Edit intent: clarity
Original:  By developing efficient proximal updates, our algorithms achieve a convergence rate of O ( \left( NA^{2.
Revised:  By developing efficient proximal updates, our algorithms achieve a convergence rate of O \left( NA^{2.
Edit intent: fluency
Original: 5}S^{3.5}\log(S)\log(\epsilon^{-1})\epsilon^{-1.5} ) \right) for the number of kernels N in the support of the nominal distribution, states S, and actions A ( this rate varies slightly based on the Wasserstein setup ) . Our dependence on N,A and S is significantly better than existing methods ;
Revised: 5}S^{3.5}\log(S)\log(\epsilon^{-1})\epsilon^{-1.5} \right) for the number of kernels N in the support of the nominal distribution, states S, and actions A ( this rate varies slightly based on the Wasserstein setup ) . Our dependence on N,A and S is significantly better than existing methods ;
Edit intent: fluency
Original: 5}S^{3.5}\log(S)\log(\epsilon^{-1})\epsilon^{-1.5} ) \right) for the number of kernels N in the support of the nominal distribution, states S, and actions A ( this rate varies slightly based on the Wasserstein setup ) . Our dependence on N,A and S is significantly better than existing methods ;
Revised: 5}S^{3.5}\log(S)\log(\epsilon^{-1})\epsilon^{-1.5} ) \right) for the number of kernels N in the support of the nominal distribution, states S, and actions A ; this rate varies slightly based on the Wasserstein setup ) . Our dependence on N,A and S is significantly better than existing methods ;
Edit intent: fluency
Original: 5}S^{3.5}\log(S)\log(\epsilon^{-1})\epsilon^{-1.5} ) \right) for the number of kernels N in the support of the nominal distribution, states S, and actions A ( this rate varies slightly based on the Wasserstein setup ) . Our dependence on N,A and S is significantly better than existing methods ;
Revised: 5}S^{3.5}\log(S)\log(\epsilon^{-1})\epsilon^{-1.5} ) \right) for the number of kernels N in the support of the nominal distribution, states S, and actions A ( this rate varies slightly based on the Wasserstein setup . Our dependence on N,A and S is significantly better than existing methods ;
Edit intent: fluency
Original:  compared to Value Iteration, it is better by a factor of O(N\left( ^{ 2.5 }A S)S^{4.5}\log^{2}(\epsilon^{-1}) }\right) .
Revised:  compared to Value Iteration, it is better by a factor of O(N\left(N ^{ 2.5 }A S)S^{4.5}\log^{2}(\epsilon^{-1}) }\right) .
Edit intent: fluency
Original:  Numerical experiments on random instances and instances inspired from a machine replacement example show that our algorithm is significantly more scalable than state-of-the-art approaches  .
Revised:  Numerical experiments show that our algorithm is significantly more scalable than state-of-the-art approaches .
Edit intent: clarity
Original:  The vast majority of existing MaaSparadigms are articulated based on the traditional segmentation of travel modes, e.g. private vehicle, public transportation (bus, metro, light rail) and shared mobility (car/bike/ride-sharing, ride-sourcing).
Revised:  The vast majority of studies on Mobility as a Service (MaaS) systems, mobility resource pricing is based on segmented travel modes, e.g. private vehicle, public transportation (bus, metro, light rail) and shared mobility (car/bike/ride-sharing, ride-sourcing).
Edit intent: clarity
Original:  The vast majority of existing MaaSparadigms are articulated based on the traditional segmentation of travel modes, e.g. private vehicle, public transportation (bus, metro, light rail) and shared mobility (car/bike/ride-sharing, ride-sourcing).
Revised:  The vast majority of existing MaaSparadigms are articulated based on the traditional segmentation of travel modes, e.g. private vehicle, public transit and shared mobility (car/bike/ride-sharing, ride-sourcing).
Edit intent: coherence
Original:  We introduce an online auction framework where travelers have the possibility to bid for continuous mobility resources based on their requirements and willingness to pay .
Revised:  We introduce an online auction framework where travelers have the possibility to bid for continuous mobility resources based on their willingness to pay .
Edit intent: clarity
Original:  We propose two MaaS mechanisms , Pay-as-You-Go (PAYG) and Pay-as-a-Package (PAAP), which allow travelers to either pay for the immediate use of mobility services or to subscribe to mobility service packages for a more protracted usage.
Revised:  We propose two MaaS mechanisms , Pay-as-You-Go (PAYG) and Pay-as-a-Package (PAAP), which allow travelers to either pay for the immediate use of mobility service (pay-as-you-go), or to subscribe to mobility service packages for a more protracted usage.
Edit intent: clarity
Original:  We show that the proposed PAYG and PAAP mechanisms are incentive-compatible, develop efficient online primal-dual algorithms to implement the proposed MaaS mechanisms and derive theoretical bounds on the worst-case performance of these algorithms.
Revised:  We show that the proposed MaaS mechanisms are incentive-compatible, develop efficient online primal-dual algorithms to implement the proposed MaaS mechanisms and derive theoretical bounds on the worst-case performance of these algorithms.
Edit intent: clarity
Original:  Numerical results on extensive problem instances generated from realistic mobility data  highlight the benefits of the proposed MaaS mechanisms , and quantify the trade-offs among the proposed approaches.
Revised:  Numerical results on extensive problem instances generated from realistic mobility data , which highlight the benefits of the proposed MaaS mechanisms , and quantify the trade-offs among the proposed approaches.
Edit intent: coherence
Original: Biological neural networks operate with extraordinary energy efficiency, owing to properties such as spike-based communication and synaptic plasticity driven by local activity.
Revised: Biological neurons and their in-silico emulations for neuromorphic artificial intelligence (AI) use extraordinarily energy-efficient mechanisms, such as spike-based communication and synaptic plasticity driven by local activity.
Edit intent: clarity
Original:  However, it is unclear whether these mechanisms only trade off performance for efficiency or rather they are partly responsible for the superiority of biological intelligence.
Revised:  However, it is unclear whether these neuronal mechanisms only offer efficiency or also underlie the superiority of biological intelligence.
Edit intent: clarity
Original:  Moreover, this expands the goal of exploiting biological neuro-synaptic properties for AI ,  from mere efficiency , to computational supremacy altogether.
Revised:  Moreover, this expands the goal of exploiting biological neuro-synaptic properties for AI , from mere efficiency to computational supremacy altogether.
Edit intent: fluency
Original: This study investigates the efficiency and effectiveness of  area-based tradable credit scheme (TCS) based on the trip-based Macroscopic Fundamental Diagram model for the morning commute problem.
Revised: This study investigates the efficiency and effectiveness of an area-based tradable credit scheme (TCS) based on the trip-based Macroscopic Fundamental Diagram model for the morning commute problem.
Edit intent: fluency
Original: This study investigates the efficiency and effectiveness of  area-based tradable credit scheme (TCS) based on the trip-based Macroscopic Fundamental Diagram model for the morning commute problem.
Revised: This study investigates the efficiency and effectiveness of area-based tradable credit scheme (TCS) using the trip-based Macroscopic Fundamental Diagram model for the morning commute problem.
Edit intent: fluency
Original:  In the proposed tradable credit scheme , the regulator distributes initial credits to all travelers and designs a time-varying and trip length specific credit tariff.
Revised:  In the proposed TCS , the regulator distributes initial credits to all travelers and designs a time-varying and trip length specific credit tariff.
Edit intent: clarity
Original:  Credits are traded between travelers and the regulator  , and the credit price is determined by the demand and supply of credits.
Revised:  Credits are traded between travelers and the regulator via a credit market , and the credit price is determined by the demand and supply of credits.
Edit intent: clarity
Original:  The TCS is incorporated into a day-to-day modelling framework to examine the travelers' learning process and the evolution of network and credit market properties .
Revised:  The TCS is incorporated into a day-to-day modelling framework to examine the travelers' learning process , the evolution of network and credit market properties .
Edit intent: fluency
Original:  The TCS is incorporated into a day-to-day modelling framework to examine the travelers' learning process and the evolution of network and credit market properties .
Revised:  The TCS is incorporated into a day-to-day modelling framework to examine the travelers' learning process and the evolution of network , and the properties of the credit market .
Edit intent: clarity
Original:  The existence of the equilibrium solution and the uniqueness of the credit price at  equilibrium state are established analytically.
Revised:  The existence of an equilibrium solution and the uniqueness of the credit price at equilibrium state are established analytically.
Edit intent: fluency
Original:  The existence of the equilibrium solution and the uniqueness of the credit price at  equilibrium state are established analytically.
Revised:  The existence of the equilibrium solution and the uniqueness of the credit price at the equilibrium state are established analytically.
Edit intent: fluency
Original:  Furthermore, a open-source simulation framework is developed to showcase the analytical properties of the proposed TCS and compare it with alternative control strategies in terms of mobility, network  and social welfare performance . Bayesian optimization is then adopted to optimize the credit toll scheme.
Revised:  Furthermore, an open-source simulation framework is developed to showcase the analytical properties of the proposed TCS and compare it with alternative control strategies in terms of mobility, network and social welfare performance . Bayesian optimization is then adopted to optimize the credit toll scheme.
Edit intent: fluency
Original:  Furthermore, a open-source simulation framework is developed to showcase the analytical properties of the proposed TCS and compare it with alternative control strategies in terms of mobility, network  and social welfare performance . Bayesian optimization is then adopted to optimize the credit toll scheme.
Revised:  Furthermore, a open-source simulation framework is developed to validate the analytical properties of the proposed TCS and compare it with alternative control strategies in terms of mobility, network and social welfare performance . Bayesian optimization is then adopted to optimize the credit toll scheme.
Edit intent: clarity
Original:  Furthermore, a open-source simulation framework is developed to showcase the analytical properties of the proposed TCS and compare it with alternative control strategies in terms of mobility, network  and social welfare performance . Bayesian optimization is then adopted to optimize the credit toll scheme.
Revised:  Furthermore, a open-source simulation framework is developed to showcase the analytical properties of the proposed TCS and compare it with alternative control strategies in terms of mobility, network performance, and social welfare performance . Bayesian optimization is then adopted to optimize the credit toll scheme.
Edit intent: fluency
Original:  Furthermore, a open-source simulation framework is developed to showcase the analytical properties of the proposed TCS and compare it with alternative control strategies in terms of mobility, network  and social welfare performance . Bayesian optimization is then adopted to optimize the credit toll scheme.
Revised:  Furthermore, a open-source simulation framework is developed to showcase the analytical properties of the proposed TCS and compare it with alternative control strategies in terms of mobility, network and social welfare . Bayesian optimization is then adopted to optimize the credit toll scheme.
Edit intent: clarity
Original:  The numerical results demonstrate that the proposed TCS outperforms the no-control case and matches the performance of the time-of-day pricing strategy, while maintaining its revenue-neutral nature.
Revised:  The numerical results demonstrate that the proposed TCS outperforms the no-control case and matches the performance of the time-of-day pricing strategy, while maintaining revenue-neutral nature.
Edit intent: clarity
Original:  SC has  serious drawbacks that are the significant increase in the computational complexity derived from the eigendecomposition and the memory space complexities to store the similarity matrix.
Revised:  SC has the serious drawbacks that are the significant increase in the computational complexity derived from the eigendecomposition and the memory space complexities to store the similarity matrix.
Edit intent: fluency
Original:  SC has  serious drawbacks that are the significant increase in the computational complexity derived from the eigendecomposition and the memory space complexities to store the similarity matrix.
Revised:  SC has serious drawbacks that are the significant increases in the time complexity derived from the eigendecomposition and the memory space complexities to store the similarity matrix.
Edit intent: clarity