wanyu/IteraTeR_v2 huggingface dataset:
Original:  We present the solution of such a hypergame for synthesizing stealthy deceptive strategies that exploit adversary's misperception . Specifically, deceptive sure winning and deceptive almost-sure winning strategies are developed by reducing the hypergame to a two-player game and one-player stochastic game with reachability objectives.
Revised:  Based on this model, we present the solution of such a hypergame for synthesizing stealthy deceptive strategies that exploit adversary's misperception . Specifically, deceptive sure winning and deceptive almost-sure winning strategies are developed by reducing the hypergame to a two-player game and one-player stochastic game with reachability objectives.
Edit intent: clarity
Original:  We present the solution of such a hypergame for synthesizing stealthy deceptive strategies that exploit adversary's misperception . Specifically, deceptive sure winning and deceptive almost-sure winning strategies are developed by reducing the hypergame to a two-player game and one-player stochastic game with reachability objectives.
Revised:  We present the solution of such a hypergame and use the solution to synthesize stealthy deceptive strategies that exploit adversary's misperception . Specifically, deceptive sure winning and deceptive almost-sure winning strategies are developed by reducing the hypergame to a two-player game and one-player stochastic game with reachability objectives.
Edit intent: clarity
Original:  We present the solution of such a hypergame for synthesizing stealthy deceptive strategies that exploit adversary's misperception . Specifically, deceptive sure winning and deceptive almost-sure winning strategies are developed by reducing the hypergame to a two-player game and one-player stochastic game with reachability objectives.
Revised:  We present the solution of such a hypergame for synthesizing stealthy deceptive strategies . Specifically, deceptive sure winning and deceptive almost-sure winning strategies are developed by reducing the hypergame to a two-player game and one-player stochastic game with reachability objectives.
Edit intent: clarity
Original:  Finally, an illustrative example is introduced to demonstrate the correctness of theory and proposed algorithms .
Revised:  A running example is introduced to demonstrate the correctness of theory and proposed algorithms .
Edit intent: clarity
Original:  Finally, an illustrative example is introduced to demonstrate the correctness of theory and proposed algorithms .
Revised:  Finally, an illustrative example is introduced to demonstrate the game model and the solution concept used for strategy synthesis .
Edit intent: clarity
Original:  However, using the least-squares norm in the misfit function often leads to cycle-skipping artifacts, increased nonlinearity of the optimization problem and local minima .
Revised:  However, using the least-squares norm in the misfit function often leads to the local minimum solution of the optimization problem and local minima .
Edit intent: clarity
Original:  Several methods that apply optimal transport distances to mitigate this problem have been proposed recently.
Revised:  Several methods that apply optimal transport distances to mitigate the cycle-skipping artifact have been proposed recently.
Edit intent: clarity
Original:  The optimal transport distance is  to compare two positive signals with equal mass .
Revised:  The optimal transport distance is designed to compare two positive signals with equal mass .
Edit intent: clarity
Original:  To overcome the mass equality limit, we introduce an unbalanced optimal transport (UOT) distance with Kullback-Leibler divergence to balance the mass difference.
Revised:  To overcome the mass equality limit, we introduce an unbalanced optimal transport (UOT) distance with KullbackLeibler divergence to balance the mass difference.
Edit intent: fluency
Original:   An entropy regularization and a scaling algorithm is used to compute the distance and its gradient efficiently.
Revised:  An entropy regularization approach and scaling algorithms are used to compute the distance and its gradient efficiently.
Edit intent: clarity
Original:   An entropy regularization and a scaling algorithm is used to compute the distance and its gradient efficiently.
Revised:  An entropy regularization and a scaling algorithm is used to compute the distance and the gradient efficiently.
Edit intent: clarity
Original:  Two strategies of normalization methods which transform the seismic signals into non-negative functions are compared . Numerical examples in one and two dimension are solved to demonstrate the efficiency and effectiveness of the new method.
Revised:  Two strategies of normalization methods that transform the seismic signals into non-negative functions are compared . Numerical examples in one and two dimension are solved to demonstrate the efficiency and effectiveness of the new method.
Edit intent: fluency
Original:  Two strategies of normalization methods which transform the seismic signals into non-negative functions are compared . Numerical examples in one and two dimension are solved to demonstrate the efficiency and effectiveness of the new method.
Revised:  Two strategies of normalization methods which transform the seismic signals into non-negative functions are provided . Numerical examples in one and two dimension are solved to demonstrate the efficiency and effectiveness of the new method.
Edit intent: clarity
Original:  Two strategies of normalization methods which transform the seismic signals into non-negative functions are compared . Numerical examples in one and two dimension are solved to demonstrate the efficiency and effectiveness of the new method.
Revised:  Two strategies of normalization methods which transform the seismic signals into non-negative functions are compared . Numerical examples are provided to demonstrate the efficiency and effectiveness of the new method.
Edit intent: clarity
Original:  We then simulate the spread of the epidemic , and the impact of different social distancing strategies using a probabilistic framework that models hospital occupancy.
Revised:  We then simulate the spread of the epidemic as well as the impact of different social distancing strategies using a probabilistic framework that models hospital occupancy.
Edit intent: clarity
Original:  How can this variability be percolated in the projections for the pandemics so as to provide a more accurate uncertainty quantification ?
Revised:  How can this variability be percolated into epidemic models, and how can its impact on uncertainty quantification and predictive scenarios be better quantified ?
Edit intent: clarity
Original:  Rather, we focus solely on discussing the importance of the impact of R's heterogeneity on uncertainty quantification for the current COVID-19 pandemic .
Revised:  Rather, we focus solely on discussing the importance of the impact of R's heterogeneity on uncertainty quantification for the current COVID-19 data .
Edit intent: clarity
Original:  Group decision making, successful marketing  and constructing networks (in which consensus can be reached or prevented) are a few examples of existing or potential applications.
Revised:  Group decision making, successful marketing , and constructing networks (in which consensus can be reached or prevented) are a few examples of existing or potential applications.
Edit intent: fluency
Original:  The invention of the Internet has made the opinion fusion faster, unilateral, and at a whole different scale.
Revised:  The invention of the Internet has made the opinion fusion faster, unilateral, and on a whole different scale.
Edit intent: fluency
Original:  In this paper, we summarize these ground-breaking ideas and their fascinating extensions , and introduce newly developed concepts.
Revised:  In this paper, we summarize these ground-breaking ideas and their fascinating extensions and introduce newly developed concepts.
Edit intent: fluency
Original:  In this paper, we summarize these ground-breaking ideas and their fascinating extensions , and introduce newly developed concepts.
Revised:  In this paper, we summarize these ground-breaking ideas and their fascinating extensions , and introduce newly surfaced concepts.
Edit intent: clarity
Original:  To this end, we show that freely adding counits to the semi-Frobenius algebra of a discrete inverse category is the same as computing the ``environment structure'' of the classical structures of the base discrete inverse category.
Revised:  To this end, we show that freely adding counits to the semi-Frobenius algebra of a discrete inverse category is the same as computing the "environment structure" of the classical structures of the base discrete inverse category.
Edit intent: fluency
Original:  To prove completeness, we freely add units and counits to the category TOF generated by the Toffoli gate and ancillary bits, showing that this yields the strictification of spans of powers of the twoelement set ;
Revised:  To prove completeness, we freely add a unit and counit to the category TOF generated by the Toffoli gate and ancillary bits, showing that this yields the strictification of spans of powers of the twoelement set ;
Edit intent: fluency
Original:  To this end, we show that freely adding counits to the semi-Frobenius algebra of a discrete inverse category is the same as computing the "environment structure" of the classical structures of the base discrete inverse category .
Revised:  To this end, we show that freely adding counits to the semi-Frobenius algebras of a discrete inverse category is the same as computing the "environment structure" of the classical structures of the base discrete inverse category .
Edit intent: fluency
Original:  By glueing together the free counit completion and the free unit completion, this yields qubit multirelations .
Revised:  By glueing together the free counit completion and the free unit completion, this yields "qubit multirelations" .
Edit intent: fluency
Original:  To this end, we show that freely adding counits to the semi-Frobenius algebras of a discrete inverse category is the same as constructing the cartesian completion.
Revised:  To this end, we show that freely adding counits to the semi-Frobenius algebras of a discrete inverse category is the same as constructing the Cartesian completion.
Edit intent: fluency
Original:  By glueing together the free counit completion and the free unit completion, this yields "qubit multirelations ".
Revised:  By glueing together the free counit completion and the free unit completion, this yields "qubit multirelations ."
Edit intent: fluency
Original:  We then introduce two optimization problems that naturally arises in our setting.
Revised:  We then introduce two optimization problems that naturally arise in our setting.
Edit intent: fluency
Original:  First is the view ordering problem to determine the order of views that leads to minimum differences across consecutive views.
Revised:  First is the collection ordering problem to determine the order of views that leads to minimum differences across consecutive views.
Edit intent: clarity
Original:  Graphsurge is implemented on top of the Timely and Differential Dataflow systems.
Edit intent: coherence
Original:  We present extensive experiments to demonstrate the benefits of running computations differentially for view collections and our view ordering and collection splitting optimizations.
Revised:  We present extensive experiments to demonstrate the benefits of running computations differentially for view collections and our collection ordering and splitting optimizations.
Edit intent: fluency
Original:  Most deep learning  , as well as generic machine learning , frameworks share a de facto standard of multidimensional array operations, underneath fancier infrastructure such as automatic differentiation.
Revised:  Most deep learning frameworks , as well as generic machine learning , frameworks share a de facto standard of multidimensional array operations, underneath fancier infrastructure such as automatic differentiation.
Edit intent: clarity
Original:  Most deep learning  , as well as generic machine learning , frameworks share a de facto standard of multidimensional array operations, underneath fancier infrastructure such as automatic differentiation.
Revised:  Most deep learning , as well as generic machine learning ones, share a de facto standard of multidimensional array operations, underneath fancier infrastructure such as automatic differentiation.
Edit intent: clarity
Original:   As both databases and machine learning involve transformation of datasets, we hope this work can inspire furthur works utilizing the large body of existing wisdom, algorithms and technologies in the database field in the development of machine learning methods , rather than merely integerating machine learning into databases.
Revised:  As both databases and machine learning involve transformation of datasets, we hope this work can inspire further works utilizing the large body of existing wisdom, algorithms and technologies in the database field in the development of machine learning methods , rather than merely integerating machine learning into databases.
Edit intent: fluency
Original:   As both databases and machine learning involve transformation of datasets, we hope this work can inspire furthur works utilizing the large body of existing wisdom, algorithms and technologies in the database field in the development of machine learning methods , rather than merely integerating machine learning into databases.
Revised:  As both databases and machine learning involve transformation of datasets, we hope this work can inspire furthur works utilizing the large body of existing wisdom, algorithms and technologies in the database field to advance the state of the art in machine learning , rather than merely integerating machine learning into databases.
Edit intent: clarity
Original:  However, the notion of ``enough searchers'' is poorly understood.
Revised:  However, the notion of "enough searchers" is poorly understood.
Edit intent: fluency
Original:  Although the platform is known for having users  dancing, lip-syncing and showing off their talents, there is an increase in videos designed to express political opinions.
Revised:  Although the platform is known for having users posting videos of themselves dancing, lip-syncing and showing off their talents, there is an increase in videos designed to express political opinions.
Edit intent: clarity
Original:  In this study , we perform the first evaluation of political communication on this platform .
Revised:  In this study , we perform the first evaluation of political communication on TikTok .
Edit intent: clarity
Original:  We collect a set of US  Republican and Democratic partisan videos and investigate how users communicate with each other  .
Revised:  We collect a set of US Republican and Democratic videos to investigate how users communicate with each other .
Edit intent: clarity
Original:  We collect a set of US  Republican and Democratic partisan videos and investigate how users communicate with each other  .
Revised:  We collect a set of US Republican and Democratic partisan videos and investigate how users communicated with each other .
Edit intent: fluency
Original:  We show that political communication takes place in the form of communication trees since users generate branches of responses on existing content.
Revised:  We show that political communication takes place in the form of communication trees since users generate branches of responses to existing content.
Edit intent: fluency
Original:  We also find that Republican users generate more political content , and their videos receive more reactions.
Revised:  However, Republican users generated more political content , and their videos receive more reactions.
Edit intent: coherence
Original:  We also find that Republican users generate more political content , and their videos receive more reactions.
Revised:  We also find that Republican users generate more political content and their videos receive more reactions.
Edit intent: fluency
Original: We present three-dimensional simulations of the dynamics of a drop pair in an applied uniform DC electric field .
Revised: We study the pairwise interactions of drops in an applied uniform DC electric field .
Edit intent: clarity
Original: In this paper, we study the problem of efficiently constructing source-wise round-trip spanners in weighted directed graphs.
Revised: In this paper, we study the problem of fast constructions of source-wise round-trip spanners in weighted directed graphs.
Edit intent: clarity
Original:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt} , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Revised:  with n vertices and m edges , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt} , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Edit intent: clarity
Original:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt} , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Revised:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and an integer k>1 , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt} , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Edit intent: clarity
Original:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt} , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Revised:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm that in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt} , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Edit intent: fluency
Original:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt} , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Revised:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) constructs an S-sourcewise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt} , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Edit intent: coherence
Original:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt} , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Revised:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt} , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Edit intent: fluency
Original:  (where \omega \in [2,2.373) and 2.373 is the matrix multiplication exponent) to nearly linear O(ms^{1/k}\log^5n), while still keeping a spanner stretch O(k \log n) and size O(ns^{1/k\log^2n), asymptotically similar to their stretch 2k+\epsilon and size O((k^2/\epsilon)ns^{1/k}\log(nw)), respectively}  }\hspace{0pt} can be adapted to the source-wise setting} .
Revised:  (where \omega \in [2,2.373) and 2.373 is the matrix multiplication exponent) to nearly linear O(ms^{1/k}\log^5n), at the expense of paying an extra O( \log n) and size O(ns^{1/k\log^2n), asymptotically similar to their stretch 2k+\epsilon and size O((k^2/\epsilon)ns^{1/k}\log(nw)), respectively} }\hspace{0pt} can be adapted to the source-wise setting} .
Edit intent: clarity
Original:  (where \omega \in [2,2.373) and 2.373 is the matrix multiplication exponent) to nearly linear O(ms^{1/k}\log^5n), while still keeping a spanner stretch O(k \log n) and size O(ns^{1/k\log^2n), asymptotically similar to their stretch 2k+\epsilon and size O((k^2/\epsilon)ns^{1/k}\log(nw)), respectively}  }\hspace{0pt} can be adapted to the source-wise setting} .
Revised:  (where \omega \in [2,2.373) and 2.373 is the matrix multiplication exponent) to nearly linear O(ms^{1/k}\log^5n), while still keeping a spanner stretch O(k \log n) \log^2n), asymptotically similar to their stretch 2k+\epsilon and size O((k^2/\epsilon)ns^{1/k}\log(nw)), respectively} }\hspace{0pt} can be adapted to the source-wise setting} .
Edit intent: fluency
Original: We argue that proven exponential upper bounds on runtimes, an established area in classic algorithms, are interesting also in evolutionary computation and we prove several such results.
Revised: We argue that proven exponential upper bounds on runtimes, an established area in classic algorithms, are interesting also in heuristic search and we prove several such results.
Edit intent: clarity
Original:  a posteriori error estimation theory for project-based ROMs, which informs ROM construction procedure to meet the accuracy conditions.
Revised:  a posteriori error estimation theory for projection-based ROMs, which informs ROM construction procedure to meet the accuracy conditions.
Edit intent: fluency
Original: In this survey we review several dynamic epistemic logics with modalities representing quantification over information change.
Revised: In this survey we review dynamic epistemic logics with modalities representing quantification over information change.
Edit intent: clarity
Original: In this survey we review several dynamic epistemic logics with modalities representing quantification over information change.
Revised: In this survey we review several dynamic epistemic logics with modalities for quantification over information change.
Edit intent: clarity