wanyu/IteraTeR_v2 huggingface dataset:
Original:  Let P_i be the set of feature points in%DIFDELCMD < {\cal %%% P _i. Here we mainly focus on the two discrete versions when points in%DIFDELCMD < {\cal %%% C could be selected with or without replacement from P_i's. (We will briefly discuss the continuous case, i. e., points in%DIFDELCMD < {\cal %DIFDELCMD < %%% C are arbitrary, which turns out to be closely related to the 3-dimensional geometric assignment problem).
Revised:  Let P_i be the set of feature points in%DIFDELCMD < {\cal %%% P _i. Here we mainly focus on the two discrete versions %DIFDELCMD < {\cal %%% C could be selected with or without replacement from P_i's. (We will briefly discuss the continuous case, i. e., points in%DIFDELCMD < {\cal %DIFDELCMD < %%% C are arbitrary, which turns out to be closely related to the 3-dimensional geometric assignment problem).
Edit intent: clarity
Original:  Let P_i be the set of feature points in%DIFDELCMD < {\cal %%% P _i. Here we mainly focus on the two discrete versions when points in%DIFDELCMD < {\cal %%% C could be selected with or without replacement from P_i's. (We will briefly discuss the continuous case, i. e., points in%DIFDELCMD < {\cal %DIFDELCMD < %%% C are arbitrary, which turns out to be closely related to the 3-dimensional geometric assignment problem).
Revised:  Let P_i be the set of feature points in%DIFDELCMD < {\cal %%% P _i. Here we mainly focus on the two discrete versions when points in%DIFDELCMD < {\cal %%% could be selected with or without replacement from P_i's. (We will briefly discuss the continuous case, i. e., points in%DIFDELCMD < {\cal %DIFDELCMD < %%% C are arbitrary, which turns out to be closely related to the 3-dimensional geometric assignment problem).
Edit intent: fluency
Original:  Let P_i be the set of feature points in%DIFDELCMD < {\cal %%% P _i. Here we mainly focus on the two discrete versions when points in%DIFDELCMD < {\cal %%% C could be selected with or without replacement from P_i's. (We will briefly discuss the continuous case, i. e., points in%DIFDELCMD < {\cal %DIFDELCMD < %%% C are arbitrary, which turns out to be closely related to the 3-dimensional geometric assignment problem).
Revised:  Let P_i be the set of feature points in%DIFDELCMD < {\cal %%% P _i. Here we mainly focus on the two discrete versions when points in%DIFDELCMD < {\cal %%% C %DIFDELCMD < {\cal %DIFDELCMD < %%% C are arbitrary, which turns out to be closely related to the 3-dimensional geometric assignment problem).
Edit intent: coherence
Original:  Let P_i be the set of feature points in%DIFDELCMD < {\cal %%% P _i. Here we mainly focus on the two discrete versions when points in%DIFDELCMD < {\cal %%% C could be selected with or without replacement from P_i's. (We will briefly discuss the continuous case, i. e., points in%DIFDELCMD < {\cal %DIFDELCMD < %%% C are arbitrary, which turns out to be closely related to the 3-dimensional geometric assignment problem).
Revised:  Let P_i be the set of feature points in%DIFDELCMD < {\cal %%% P _i. Here we mainly focus on the two discrete versions when points in%DIFDELCMD < {\cal %%% C could be selected with or without replacement from P_i's. (We will briefly discuss the continuous case, i. e., points in%DIFDELCMD < {\cal %DIFDELCMD < %%% are arbitrary, which turns out to be closely related to the 3-dimensional geometric assignment problem).
Edit intent: fluency
Original:  Our first contribution is an operational semantics , and a formal definition of constant-time programs in this extended setting.
Revised:  We present an operational semantics , and a formal definition of constant-time programs in this extended setting.
Edit intent: clarity
Original:  Our first contribution is an operational semantics , and a formal definition of constant-time programs in this extended setting.
Revised:  Our first contribution is an operational semantics and a formal definition of constant-time programs in this extended setting.
Edit intent: fluency
Original:  Our semantics eschews formalization of micro-architectural features (that are instead assumed under adversary control), and yields a notion of constant-time that retains the elegance and tractability of the usual notion.
Revised:  Our semantics eschews formalization of microarchitectural features (that are instead assumed under adversary control), and yields a notion of constant-time that retains the elegance and tractability of the usual notion.
Edit intent: fluency
Original:  Our second contribution is a static analysis tool, Pitchfork, which detects violations of our extended constant-time property (for a subset of the semantics presented in this paper) .
Revised:  Second, by implementing a static analysis tool, Pitchfork, which detects violations of our extended constant-time property (for a subset of the semantics presented in this paper) .
Edit intent: clarity
Original:  We demonstrate the relevance of our semantics in two ways: First, by contrasting existing Spectre-like attacks with our definition of constant-time and by exhibiting a new, confirmed class of Spectre attacks based on alias prediction .
Revised:  We demonstrate the relevance of our semantics in two ways: First, by contrasting existing Spectre-like attacks with our definition of constant-time .
Edit intent: coherence
Original:  Finally, we describe a game between competing market makers for the option and construct an equilibrium in which the option is traded at the utility indifference price.
Edit intent: coherence
Original:  Finally some suggestions for future work , such as robust FVA, are discussed.
Revised:  Finally some suggestions for future work are discussed.
Edit intent: clarity
Original: This paper introduces an accurate edge-based smoothed finite element method (ES-FEM) for electromagnetic analysis for both two-dimensional cylindrical and three dimensional cartesian systems, which shows much better performance in terms of accuracy and numerical stability for mesh distortion compared with the traditional FEM.
Revised: This paper introduces an accurate edge-based smoothed finite element method (ES-FEM) for electromagnetic analysis for both two dimensional cylindrical and three dimensional cartesian systems, which shows much better performance in terms of accuracy and numerical stability for mesh distortion compared with the traditional FEM.
Edit intent: fluency
Original:   Numerical results show that the ES-FEM can obtain much more accurate results than the traditional FEM and is independent of distortion of background meshes, which shows great potential to solve practical electromagnetic problems .
Revised:  Numerical results show that the ES-FEM can obtain much more accurate results and is almost independent of mesh distortion .
Edit intent: clarity
Original:  The size of the local neighborhood around the failed robot and the desired coverage over the region are two settings that can be manipulated to achieve a user-specified balance.
Revised:  The size of the local neighborhood around the failed robot and the desired coverage over the region are two objectives that can be manipulated to achieve a user-specified balance.
Edit intent: clarity
Original:  We find that only 4 of the countries have positive long run discount rates while the other ten countries have negative rates.
Revised:  We find that only 4 of the countries have positive long-run discount rates while the other ten countries have negative rates.
Edit intent: fluency
Original: We propose a new variational model for nonlinear image fusion.
Revised: We propose a new variational model for non-linear image fusion.
Edit intent: fluency
Original:  Our approach incorporates the osmosis model proposed in Vogel et al. (2013) and Weickert et al. (2013) as an energy term in a variational model.
Revised:  Our approach is based on the use of an osmosis energy term related to the one studied in Vogel et al. (2013) and Weickert et al. (2013) as an energy term in a variational model.
Edit intent: clarity
Original:  We develop a primal-dual algorithm for solving this new image fusion model and we apply the resulting minimisation scheme to multi-modal image fusion for face fusion, colour transfer and some cultural heritage conservation challenges.
Revised:  We develop a primal-dual algorithm and we apply the resulting minimisation scheme to multi-modal image fusion for face fusion, colour transfer and some cultural heritage conservation challenges.
Edit intent: clarity
Original:  We develop a primal-dual algorithm for solving this new image fusion model and we apply the resulting minimisation scheme to multi-modal image fusion for face fusion, colour transfer and some cultural heritage conservation challenges.
Revised:  We develop a primal-dual algorithm for solving this new image fusion model and we apply the resulting minimization scheme to solve multi-modal image fusion for face fusion, colour transfer and some cultural heritage conservation challenges.
Edit intent: fluency
Original:  We develop a primal-dual algorithm for solving this new image fusion model and we apply the resulting minimisation scheme to multi-modal image fusion for face fusion, colour transfer and some cultural heritage conservation challenges.
Revised:  We develop a primal-dual algorithm for solving this new image fusion model and we apply the resulting minimisation scheme to multi-modal face fusion, colour transfer and some cultural heritage conservation challenges.
Edit intent: coherence
Original:  We develop a primal-dual algorithm for solving this new image fusion model and we apply the resulting minimisation scheme to multi-modal image fusion for face fusion, colour transfer and some cultural heritage conservation challenges.
Revised:  We develop a primal-dual algorithm for solving this new image fusion model and we apply the resulting minimisation scheme to multi-modal image fusion for face fusion, color transfer and cultural heritage conservation challenges.
Edit intent: coherence
Original:  Visual comparison to state-of-the-art proves the quality and flexibility of our method.
Revised:  Visual comparison to state-of-the-art approaches prove the out-performance and the flexibility of our method.
Edit intent: clarity
Original: We study the problem of probabilistic query evaluation (PQE) over probabilistic graphs, namely, tuple-independent probabilistic databases (TIDs) on signatures of arity two.
Revised: We study the problem of probabilistic query evaluation on probabilistic graphs, namely, tuple-independent probabilistic databases (TIDs) on signatures of arity two.
Edit intent: clarity
Original: We study the problem of probabilistic query evaluation (PQE) over probabilistic graphs, namely, tuple-independent probabilistic databases (TIDs) on signatures of arity two.
Revised: We study the problem of probabilistic query evaluation (PQE) over probabilistic graphs, namely, tuple-independent probabilistic databases on signatures of arity two.
Edit intent: clarity
Original:  Our focus is the class of queries that is closed under homomorphisms, or equivalently, the infinite unions of conjunctive queries , denoted UCQ^\infty .
Revised:  Our focus is the class of queries that is closed under homomorphisms, or equivalently, the infinite unions of conjunctive queries .
Edit intent: clarity
Original:  Our main result states that all unbounded queries in UCQ^\infty are #P-hard for PQE .
Revised:  Our main result states that all unbounded queries in UCQ^\infty are #P-hard for probabilistic query evaluation .
Edit intent: clarity
Original:  Our result is shown by reducing from counting the valuations of positive partitioned 2-DNF formulae (#PP2DNF) for some queries, or from the source-to-target reliability problem in an undirected graph (#U-ST-CON) for other queries, depending on properties of minimal models. 
Revised:  Our result is shown by reducing from counting the valuations of positive partitioned 2-DNF formulae for some queries, or from the source-to-target reliability problem in an undirected graph (#U-ST-CON) for other queries, depending on properties of minimal models. 
Edit intent: clarity
Original:  Our result is shown by reducing from counting the valuations of positive partitioned 2-DNF formulae (#PP2DNF) for some queries, or from the source-to-target reliability problem in an undirected graph (#U-ST-CON) for other queries, depending on properties of minimal models. 
Revised:  Our result is shown by reducing from counting the valuations of positive partitioned 2-DNF formulae (#PP2DNF) for some queries, or from the source-to-target reliability problem in an undirected graph for other queries, depending on properties of minimal models. 
Edit intent: clarity
Original: We study the problem of probabilistic query evaluation on probabilistic graphs, namely, tuple-independent probabilistic databases on signatures of arity two.
Revised: We study the problem of query evaluation on probabilistic graphs, namely, tuple-independent probabilistic databases on signatures of arity two.
Edit intent: clarity
Original: We study the problem of probabilistic query evaluation on probabilistic graphs, namely, tuple-independent probabilistic databases on signatures of arity two.
Revised: We study the problem of probabilistic query evaluation on probabilistic graphs, namely, tuple-independent probabilistic databases over signatures of arity two.
Edit intent: fluency
Original:  Our focus is the class of queries that is closed under homomorphisms, or  equivalently, the infinite unions of conjunctive queries.
Revised:  We focus on the class of queries that is closed under homomorphisms, or equivalently, the infinite unions of conjunctive queries.
Edit intent: fluency
Original:  Our focus is the class of queries that is closed under homomorphisms, or  equivalently, the infinite unions of conjunctive queries.
Revised:  Our focus is the class of queries closed under homomorphisms, or equivalently, the infinite unions of conjunctive queries.
Edit intent: clarity
Original:  Our focus is the class of queries that is closed under homomorphisms, or  equivalently, the infinite unions of conjunctive queries.
Revised:  Our focus is the class of queries that is closed under homomorphisms, or , equivalently, the infinite unions of conjunctive queries.
Edit intent: fluency
Original:  Our main result states that  all unbounded queries from this class are #P-hard for probabilistic query evaluation .
Revised:  Our main result states that all unbounded queries from this class .
Edit intent: clarity
Original:  This dichotomy covers in particular all fragments of infinite unions of conjunctive queries  such as negation-free (disjunctive) Datalog, regular path queries, and a large class of ontology-mediated queries on arity-two signatures.
Revised:  This dichotomy covers in particular all fragments of infinite unions of conjunctive queries over arity-two signatures, such as negation-free (disjunctive) Datalog, regular path queries, and a large class of ontology-mediated queries on arity-two signatures.
Edit intent: fluency
Original:  Our result is shown by reducing from  counting the valuations of positive partitioned 2-DNF formulae for some queries , or from the source-to-target reliability problem in an undirected graph for other queries , depending on properties of minimal models .
Revised:  Our result is shown by reducing from the problem of counting the valuations of positive partitioned 2-DNF formulae for some queries , or from the source-to-target reliability problem in an undirected graph for other queries , depending on properties of minimal models .
Edit intent: clarity
Original:  Our result is shown by reducing from  counting the valuations of positive partitioned 2-DNF formulae for some queries , or from the source-to-target reliability problem in an undirected graph for other queries , depending on properties of minimal models .
Revised:  Our result is shown by reducing from counting the valuations of positive partitioned 2-DNF formulae , or from the source-to-target reliability problem in an undirected graph for other queries , depending on properties of minimal models .
Edit intent: clarity
Original:  Our result is shown by reducing from  counting the valuations of positive partitioned 2-DNF formulae for some queries , or from the source-to-target reliability problem in an undirected graph for other queries , depending on properties of minimal models .
Revised:  Our result is shown by reducing from counting the valuations of positive partitioned 2-DNF formulae for some queries , or from the source-to-target reliability problem in an undirected graph , depending on properties of minimal models .
Edit intent: clarity
Original:  Given the size of the crypto market , we believe that there is still great opportunity to research this novel topic.
Revised:  Given the 250 billion market cap for cryptocurrencies, there is compelling need to investigate this topic.
Edit intent: coherence
Original:  In this paper, we present facets of the token engineering process for a real life 80 person Swiss blockchain startup, Insolar.
Revised:  In this paper, we present facets of the token engineering process for a real-life 80-person Swiss blockchain startup, Insolar.
Edit intent: fluency
Original:  We show how Insolar used systems modeling and simulation combined with cryptocurrency expertise to design a mechanism to incentivize enterprises and individual users , and in particular through the use of subsidy pools, application developers, to help adoption of their new MainNet public blockchain network.
Revised:  We show how Insolar used systems modeling and simulation combined with cryptocurrency expertise to design a mechanism to incentivize enterprises and individual users to use their new MainNet public blockchain network.
Edit intent: coherence
Original:  For a startup like Insolar , their success will hinge upon how well their model incentivizes various stakeholders to participate on their MainNet network versus that of numerous alternatives  .
Revised:  For a startup like Insolar whose success hinge upon how well their model incentivizes various stakeholders to participate on their MainNet network versus that of numerous alternatives .
Edit intent: clarity
Original:  Our result thus demonstrates that even a minimal level of collaboration among the different agents enables a significant reduction in per-agent regret.
Edit intent: coherence
Original: Unlike in statistical compression, where Shannon's entropy is a definitive lower bound, no such a clear measure exists for the compressibility of repetitive sequences other than the uncomputable Kolmogorov's complexity .
Revised: Unlike in statistical compression, where Shannon's entropy is a definitive lower bound, no such clear measure exists for the compressibility of repetitive sequences other than the uncomputable Kolmogorov's complexity .
Edit intent: fluency
Original: Unlike in statistical compression, where Shannon's entropy is a definitive lower bound, no such a clear measure exists for the compressibility of repetitive sequences other than the uncomputable Kolmogorov's complexity .
Revised: Unlike in statistical compression, where Shannon's entropy is a definitive lower bound, no such a clear measure exists for the compressibility of repetitive sequences .
Edit intent: clarity
Original:  Since statistical entropy does not capture repetitiveness, ad-hoc measures like the size z of the Lempel-Ziv parse are frequently used to estimate it . Recently, a more principled measure, the size \gamma of the smallest %DIFDELCMD < {\em %%% attractor of a string S%DIFDELCMD < [%%% 1..n , was introduced.
Revised:  Since statistical entropy does not capture repetitiveness, ad-hoc measures like the size z of the Lempel--Ziv parse are frequently used to estimate it . Recently, a more principled measure, the size \gamma of the smallest %DIFDELCMD < {\em %%% attractor of a string S%DIFDELCMD < [%%% 1..n , was introduced.
Edit intent: fluency
Original:  Since statistical entropy does not capture repetitiveness, ad-hoc measures like the size z of the Lempel-Ziv parse are frequently used to estimate it . Recently, a more principled measure, the size \gamma of the smallest %DIFDELCMD < {\em %%% attractor of a string S%DIFDELCMD < [%%% 1..n , was introduced.
Revised:  Since statistical entropy does not capture repetitiveness, ad-hoc measures like the size z of the Lempel-Ziv parse are frequently used to estimate repetitiveness . Recently, a more principled measure, the size \gamma of the smallest %DIFDELCMD < {\em %%% attractor of a string S%DIFDELCMD < [%%% 1..n , was introduced.
Edit intent: clarity
Original:  Since statistical entropy does not capture repetitiveness, ad-hoc measures like the size z of the Lempel-Ziv parse are frequently used to estimate it . Recently, a more principled measure, the size \gamma of the smallest %DIFDELCMD < {\em %%% attractor of a string S%DIFDELCMD < [%%% 1..n , was introduced.
Revised:  Since statistical entropy does not capture repetitiveness, ad-hoc measures like the size z of the Lempel-Ziv parse are frequently used to estimate it . Recently, a more principled measure, the size \gamma of the smallest %DIFDELCMD < {\em %%% of a string S%DIFDELCMD < [%%% 1..n , was introduced.
Edit intent: clarity
Original:  Since statistical entropy does not capture repetitiveness, ad-hoc measures like the size z of the Lempel-Ziv parse are frequently used to estimate it . Recently, a more principled measure, the size \gamma of the smallest %DIFDELCMD < {\em %%% attractor of a string S%DIFDELCMD < [%%% 1..n , was introduced.
Revised:  Since statistical entropy does not capture repetitiveness, ad-hoc measures like the size z of the Lempel-Ziv parse are frequently used to estimate it . Recently, a more principled measure, the size \gamma of the smallest %DIFDELCMD < {\em %%% attractor %DIFDELCMD < [%%% 1..n , was introduced.
Edit intent: clarity
Original:  Since statistical entropy does not capture repetitiveness, ad-hoc measures like the size z of the Lempel-Ziv parse are frequently used to estimate it . Recently, a more principled measure, the size \gamma of the smallest %DIFDELCMD < {\em %%% attractor of a string S%DIFDELCMD < [%%% 1..n , was introduced.
Revised:  Since statistical entropy does not capture repetitiveness, ad-hoc measures like the size z of the Lempel-Ziv parse are frequently used to estimate it . Recently, a more principled measure, the size \gamma of the smallest %DIFDELCMD < {\em %%% attractor of a string S%DIFDELCMD < [%%% 1..nattractor , was introduced.
Edit intent: clarity
Original:  Measure \gamma lower bounds all the previous relevant ones (e.g., z), yet S can be represented and  indexed within space O(\gamma\log (n/\gamma)){\gamma})} , which also upper bounds most measures.
Revised:  The measure \gamma lower bounds all the previous relevant ones (e.g., z), yet S can be represented and indexed within space O(\gamma\log (n/\gamma)){\gamma})} , which also upper bounds most measures.
Edit intent: clarity
Original:  In this paper  we study a smaller measure, \delta \le \gamma, which can be computed in linear time.
Revised:  In this paper , we study a smaller measure, \delta \le \gamma, which can be computed in linear time.
Edit intent: fluency
Original:  We show that \delta captures better the concept of compressibility in repetitive strings: We prove that, for some string families, it holds\ge  \gamma = \Omega(\delta \log n{\delta}} ).
Revised:  We show that \delta better captures the compressibility of repetitive strings. For every length n and every value \delta\ge \gamma = \Omega(\delta \log n{\delta}} ).
Edit intent: clarity
Original:  Still, we can build a representation of S of size O(\delta\log (n/\delta) ), which{\delta}) space that } supports direct access to any  S[i] in time O(\log (n/\delta) ){\delta}) } and finds the occ occurrences of any pattern P[1..m] in time O(m\log n + occ\log^\epsilon n) for any constant \epsilon>0.
Revised:  Still, we show a representation of S of size O(\delta\log (n/\delta) ), which{\delta}) space that } supports direct access to any S[i] in time O(\log (n/\delta) ){\delta}) } and finds the occ occurrences of any pattern P[1..m] in time O(m\log n + occ\log^\epsilon n) for any constant \epsilon>0.
Edit intent: clarity