wanyu/IteraTeR_v2 huggingface dataset:
Original:  Previously, the best deterministic algorithm for this problem is by Harris \mbox{ \cite{Harris19 }\hspace{0pt} that runs }  ]  in \tilde{O}((\log^6 n)/ \epsilon^4) rounds in the%DIFDELCMD < \local %%% \tilde{O} model.
Revised:  Previously, the best deterministic algorithm for this problem is by Harris \mbox{ \cite{Harris19 }\hspace{0pt} that runs } ] run in \tilde{O}((\log^6 n)/ \epsilon^4) rounds in the%DIFDELCMD < \local %%% \tilde{O} model.
Edit intent: clarity
Original:  Previously, the best deterministic algorithm for this problem is by Harris \mbox{ \cite{Harris19 }\hspace{0pt} that runs }  ]  in \tilde{O}((\log^6 n)/ \epsilon^4) rounds in the%DIFDELCMD < \local %%% \tilde{O} model.
Revised:  Previously, the best deterministic algorithm for this problem is by Harris \mbox{ \cite{Harris19 }\hspace{0pt} that runs } ] in \tilde{O}((\log^6 n)/ \epsilon^4) rounds %DIFDELCMD < \local %%% \tilde{O} model.
Edit intent: fluency
Original:  Previously, the best deterministic algorithm for this problem is by Harris \mbox{ \cite{Harris19 }\hspace{0pt} that runs }  ]  in \tilde{O}((\log^6 n)/ \epsilon^4) rounds in the%DIFDELCMD < \local %%% \tilde{O} model.
Revised:  Previously, the best deterministic algorithm for this problem is by Harris \mbox{ \cite{Harris19 }\hspace{0pt} that runs } ] in \tilde{O}((\log^6 n)/ \epsilon^4) rounds in the%DIFDELCMD < \local %%% and\tilde{O} model.
Edit intent: coherence
Original:  However, the design and development of an efficient parallel algorithm for the transport criticality calculations is a challenging task especially when the number of processor cores is large and the unstructured mesh is adopted since both the compute time and the memory usage need to be taken into consideration  .
Revised:  However, the design and development of efficient parallel algorithms for the transport criticality calculations is a challenging task especially when the number of processor cores is large and the unstructured mesh is adopted since both the compute time and the memory usage need to be taken into consideration .
Edit intent: fluency
Original:  However, the design and development of an efficient parallel algorithm for the transport criticality calculations is a challenging task especially when the number of processor cores is large and the unstructured mesh is adopted since both the compute time and the memory usage need to be taken into consideration  .
Revised:  However, the design and development of an efficient parallel algorithm for the transport criticality calculations is challenging especially when the number of processor cores is large and the unstructured mesh is adopted since both the compute time and the memory usage need to be taken into consideration .
Edit intent: clarity
Original:  However, the design and development of an efficient parallel algorithm for the transport criticality calculations is a challenging task especially when the number of processor cores is large and the unstructured mesh is adopted since both the compute time and the memory usage need to be taken into consideration  .
Revised:  However, the design and development of an efficient parallel algorithm for the transport criticality calculations is a challenging task especially when the number of processor cores is large and an unstructured mesh is adopted since both the compute time and the memory usage need to be taken into consideration .
Edit intent: fluency
Original:  However, the design and development of an efficient parallel algorithm for the transport criticality calculations is a challenging task especially when the number of processor cores is large and the unstructured mesh is adopted since both the compute time and the memory usage need to be taken into consideration  .
Revised:  However, the design and development of an efficient parallel algorithm for the transport criticality calculations is a challenging task especially when the number of processor cores is large and the unstructured mesh is adopted . In particular, both the compute time and the memory usage need to be taken into consideration .
Edit intent: coherence
Original:  However, the design and development of an efficient parallel algorithm for the transport criticality calculations is a challenging task especially when the number of processor cores is large and the unstructured mesh is adopted since both the compute time and the memory usage need to be taken into consideration  .
Revised:  However, the design and development of an efficient parallel algorithm for the transport criticality calculations is a challenging task especially when the number of processor cores is large and the unstructured mesh is adopted since both the compute time and memory usage have to be carefully taken into consideration .
Edit intent: clarity
Original:  In this paper, we study a monolithic multilevel Schwarz preconditioner for the transport criticality calculations using the nonlinear diffusion acceleration (NDA) .
Revised:  In this paper, we study a monolithic multilevel Schwarz preconditioner for the transport criticality calculations based on a nonlinear diffusion acceleration (NDA) .
Edit intent: fluency
Original:  The proposed monolithic multilevel method is capable of efficiently handling the linear systems of equations for both the transport system and the diffusion system.
Revised:  The proposed monolithic multilevel method is capable of efficiently handling the systems of linear equations for both the transport system and the diffusion system.
Edit intent: fluency
Original:  In the multilevel method, the construction of coarse spaces is nontrivial and expensive .
Revised:  However, in the multilevel method, the construction of coarse spaces is nontrivial and expensive .
Edit intent: coherence
Original:  In the multilevel method, the construction of coarse spaces is nontrivial and expensive .
Revised:  In the multilevel method, algebraically constructing coarse spaces is nontrivial and expensive .
Edit intent: clarity
Original:  We propose a subspace-based coarsening algorithm to resolve this issue by exploring the matrix structures of the transport equations and the nonlinear diffusion equations.
Revised:  We propose a subspace-based coarsening algorithm to address such a challenge by exploring the matrix structures of the transport equations and the nonlinear diffusion equations.
Edit intent: clarity
Original: In the last few years, Header Bidding (HB) has gained popularity among web publishers and is challenging the status quo in the ad ecosystem.
Revised: In recent years, Header Bidding (HB) has gained popularity among web publishers and is challenging the status quo in the ad ecosystem.
Edit intent: clarity
Original: In the last few years, Header Bidding (HB) has gained popularity among web publishers and is challenging the status quo in the ad ecosystem.
Revised: In the last few years, Header Bidding (HB) has gained popularity among web publishers , challenging the status quo in the ad ecosystem.
Edit intent: coherence
Original:  Contrary to the traditional waterfall standard, HB aims to give back control of the ad inventoryto publishers , increase transparency, fairness and competition among advertisers, thus, resulting in higher ad-slot prices.
Revised:  Contrary to the traditional waterfall standard, HB aims to give back to publishers control of their ad inventory , increase transparency, fairness and competition among advertisers, thus, resulting in higher ad-slot prices.
Edit intent: clarity
Original:  Contrary to the traditional waterfall standard, HB aims to give back control of the ad inventoryto publishers , increase transparency, fairness and competition among advertisers, thus, resulting in higher ad-slot prices.
Revised:  Contrary to the traditional waterfall standard, HB aims to give back control of the ad inventoryto publishers , increase transparency, fairness and competition among advertisers, resulting in higher ad-slot prices.
Edit intent: coherence
Original:  Our results show that: (i) 14.28\% of the top Alexa websites utilize HB. (ii) Publishers tend to collaborate mostly with a relatively low number of demand partners, which are already big players in waterfall standard, (iii) HB latency can be significantly higher than waterfall, with up to 3x latency in the median cases .
Revised:  We find that: (i) 14.28\% of the top Alexa websites utilize HB. (ii) Publishers tend to collaborate mostly with a relatively low number of demand partners, which are already big players in waterfall standard, (iii) HB latency can be significantly higher than waterfall, with up to 3x latency in the median cases .
Edit intent: coherence
Original:  Our results show that: (i) 14.28\% of the top Alexa websites utilize HB. (ii) Publishers tend to collaborate mostly with a relatively low number of demand partners, which are already big players in waterfall standard, (iii) HB latency can be significantly higher than waterfall, with up to 3x latency in the median cases .
Revised:  Our results show that: (i) 14.28\% of top websites utilize HB. (ii) Publishers tend to collaborate mostly with a relatively low number of demand partners, which are already big players in waterfall standard, (iii) HB latency can be significantly higher than waterfall, with up to 3x latency in the median cases .
Edit intent: clarity
Original:  Our results show that: (i) 14.28\% of the top Alexa websites utilize HB. (ii) Publishers tend to collaborate mostly with a relatively low number of demand partners, which are already big players in waterfall standard, (iii) HB latency can be significantly higher than waterfall, with up to 3x latency in the median cases .
Revised:  Our results show that: (i) 14.28\% of the top Alexa websites utilize HB. (ii) Publishers prefer to collaborate with a few Demand Partners who also dominate the waterfall market. (iii) HB latency can be significantly higher than waterfall, with up to 3x latency in the median cases .
Edit intent: clarity
Original:  Our results show that: (i) 14.28\% of the top Alexa websites utilize HB. (ii) Publishers tend to collaborate mostly with a relatively low number of demand partners, which are already big players in waterfall standard, (iii) HB latency can be significantly higher than waterfall, with up to 3x latency in the median cases .
Revised:  Our results show that: (i) 14.28\% of the top Alexa websites utilize HB. (ii) Publishers tend to collaborate mostly with a relatively low number of demand partners, which are already big players in waterfall standard, (iii) HB latency can be significantly higher ( up to 3x latency in the median cases .
Edit intent: clarity
Original:  Our results show that: (i) 14.28\% of the top Alexa websites utilize HB. (ii) Publishers tend to collaborate mostly with a relatively low number of demand partners, which are already big players in waterfall standard, (iii) HB latency can be significantly higher than waterfall, with up to 3x latency in the median cases .
Revised:  Our results show that: (i) 14.28\% of the top Alexa websites utilize HB. (ii) Publishers tend to collaborate mostly with a relatively low number of demand partners, which are already big players in waterfall standard, (iii) HB latency can be significantly higher than waterfall, with up to 3x in median case) than waterfall .
Edit intent: coherence
Original:  As this new technology approaches widespread deployment, both industry and government are making provisions for teleoperations systems  in which remote human agents provide assistance to driverless vehicles.
Revised:  As this new technology approaches widespread deployment, both industry and government are making provisions for teleoperations systems , in which remote human agents provide assistance to driverless vehicles.
Edit intent: fluency
Original:  By establishing a novel connection between queueing models and storage processes, we determine the probability of the system exceeding its service capacity.
Revised:  By establishing a novel connection between queues with large batch arrivals and storage processes, we determine the probability of the system exceeding its service capacity.
Edit intent: clarity
Original:  We argue that sequential selection together with a reservoir of diversity acting as a `memory' allows cumulative growth and improvement of the Gaian system over time.
Revised:  This idea, which combines sequential selection together with a reservoir of diversity acting as a `memory' allows cumulative growth and improvement of the Gaian system over time.
Edit intent: clarity
Original:  We argue that sequential selection together with a reservoir of diversity acting as a `memory' allows cumulative growth and improvement of the Gaian system over time.
Revised:  We argue that sequential selection together with a reservoir of diversity that acts as a `memory' allows cumulative growth and improvement of the Gaian system over time.
Edit intent: clarity
Original:  We argue that sequential selection together with a reservoir of diversity acting as a `memory' allows cumulative growth and improvement of the Gaian system over time.
Revised:  We argue that sequential selection together with a reservoir of diversity acting as a `memory' , implies a tendency towards growth and increasing resilience of the Gaian system over time.
Edit intent: clarity
Original:  We discuss three ways diversity reservoirs are realised in practice : the microbial seed bank, climate refugia and lateral gene transfer and finally we simulate the effect of changing the reservoir size .
Revised:  We then discuss how diversity reservoirs could be realised in practice : the microbial seed bank, climate refugia and lateral gene transfer and finally we simulate the effect of changing the reservoir size .
Edit intent: clarity
Original:  We discuss three ways diversity reservoirs are realised in practice : the microbial seed bank, climate refugia and lateral gene transfer and finally we simulate the effect of changing the reservoir size .
Revised:  We discuss three ways diversity reservoirs are realised in practice via the microbial seed bank, climate refugia and lateral gene transfer and finally we simulate the effect of changing the reservoir size .
Edit intent: clarity
Original: The Gaia hypothesis discusses how life interacts with the environment to create generally favourable conditions for itself .
Revised: The Gaia hypothesis considers the life-environment coupled system as a single entity that acts to regulate and maintain habitable conditions on Earth .
Edit intent: clarity
Original:  This idea, which combines sequential selection together with a reservoir of diversity that acts as a ` memory', implies a tendency towards growth and increasing resilience of the Gaian system over time.
Revised:  This idea, which combines sequential selection together with a reservoir of diversity that acts as a ' memory', implies a tendency towards growth and increasing resilience of the Gaian system over time.
Edit intent: fluency
Original: The paper discusses the efficiency of the classical BiCGStab method and several  its modifications for solving systems with multiple right-hand side vectors.
Revised: The paper discusses the efficiency of the classical BiCGStab method and several of its modifications for solving systems with multiple right-hand side vectors.
Edit intent: fluency
Original:  Additionally, a synchronous periodic communication strategy is also derived through analyzing the passivity degradation over sampling of the distributed dynamic at each node .
Revised:  Additionally, a synchronous periodic communication strategy is also derived using the passivity degradation over sampling of the distributed dynamic at each node .
Edit intent: clarity
Original: We propose a continuous-time algorithm for solving a resource allocation problem cooperatively and distributedly over a uniformly jointly strongly connected graph.
Revised: This work is concerned with the problem of distributed resource allocation in continuous-time algorithm for solving a resource allocation problem cooperatively and distributedly over a uniformly jointly strongly connected graph.
Edit intent: clarity
Original:  Yet, even though tasks in these domains typically involve distinct objects, most state-of-the-art methods do not explicitly capture the compositional nature of visual scenes.
Revised:  Yet, even though tasks in these domains typically involve distinct objects, most state-of-the-art generative models do not explicitly capture the compositional nature of visual scenes.
Edit intent: clarity
Original:  Two  exceptions, MONet and IODINE, decompose scenes into objects in an unsupervised fashion via a set of latent variables .
Revised:  Two recent exceptions, MONet and IODINE, decompose scenes into objects in an unsupervised fashion via a set of latent variables .
Edit intent: clarity
Original:  Two  exceptions, MONet and IODINE, decompose scenes into objects in an unsupervised fashion via a set of latent variables .
Revised:  Two exceptions, MONet and IODINE, decompose scenes into objects in an unsupervised fashion .
Edit intent: clarity
Original:  Hence, neither of them allows for principled sampling of coherent scenes.
Revised:  Hence, neither of them allows for principled sampling of novel scenes.
Edit intent: clarity
Original:  Here we present GENESIS, the first object-centric generative model of  visual scenes capable of both decomposing and generating complete scenes by explicitly capturing relationships between scene components.
Revised:  Here we present GENESIS, the first object-centric generative model of visual scenes capable of both decomposing and generating scenes by capturing relationships between scene components.
Edit intent: clarity
Original:  We train GENESIS on two publicly available datasets and probe the information in the latent representations through a set of classification tasks, outperforming several baselines .
Revised:  We train GENESIS on several publicly available datasets and probe the information in the latent representations through a set of classification tasks, outperforming several baselines .
Edit intent: clarity
Original:  Far less research has examined how governments might stimulate private sector cooperation to prevent market failures or to enhance innovation.
Revised:  Far less research has examined how governments might accelerate private sector cooperation to prevent market failures or to enhance innovation.
Edit intent: clarity
Original:  The theoretical contribution of this research is to suggest that government programs might catalyze cooperative activity by stimulating the preferential attachment mechanism inherent in social networks.
Revised:  The theoretical contribution of this research is to suggest that government programs might catalyze cooperative activity by accelerating the preferential attachment mechanism inherent in social networks.
Edit intent: clarity
Original:  We analyze the long-term effects of a government program on the strategic alliance network of 451 organizations in the high-tech semiconductor industry between 1987 and 1999, using recently developed stochastic network analysis methods for longitudinal social networks.
Revised:  We analyze the long-term effects of a government program on the strategic alliance network of 451 organizations in the high-tech semiconductor industry between 1987 and 1999, using stochastic network analysis methods for longitudinal social networks.
Edit intent: clarity
Original:  Using the number of dengue reported cases and climate data from 2007-2017, we fitted a prediction model applying a Generalized Additive Model (GAM) and Random Forest (RF) approach, which allowed us to retrospectively predict dengue occurrence in five climatological diverse municipalities around the country.
Revised:  Using the number of dengue reported cases and climate data from 2007-2017, we fitted a prediction model applying a Generalized Additive Model (GAM) and Random Forest (RF) approach, which allowed us to retrospectively predict the relative risk of dengue in five climatological diverse municipalities around the country.
Edit intent: clarity
Original:  Consequently, we obtain complexity results for several variants of partially ordered automata and  problems of inclusion, equivalence, and \mbox{(k-) .
Revised:  Consequently, we obtain complexity results for several variants of partially ordered automata and for the problems of inclusion, equivalence, and \mbox{(k-) .
Edit intent: fluency
Original:  The expressive power of partially ordered automata is closely related to the expressivity of fragments of first-order logic on words or, equivalently, to the language classes of the levels of the Straubing-Th\'{e hierarchy.
Revised:  The expressive power of partially ordered automata is closely related to the expressivity of fragments of first-order logic on words or, equivalently, to the language classes of the levels of the Straubing-Th\'erien hierarchy.
Edit intent: fluency
Original:  Several fragments (levels) have been intensively investigated and possess several names.
Revised:  Several fragments (levels) have been intensively investigated under various names.
Edit intent: clarity
Original:  For instance, the fragment of first-order formulae with a single existential block of quantifiers in the prenex normal form is known as piecewise testable languages or J-trivial languages.
Revised:  For instance, the fragment of first-order formulae with a single existential block of quantifiers in prenex normal form is known as piecewise testable languages or J-trivial languages.
Edit intent: fluency
Original:  We provide the whole complexity picture for considered partially ordered automata and for the problems of inclusion, equivalence, and (k-)piecewise testability  .
Revised:  We provide a comprehensive picture of the complexities of the problems of inclusion, equivalence, and (k-)piecewise testability .
Edit intent: clarity
Original:  We consider modelssuch as the classic Independent Cascade (IC) model of Kempe, Kleinberg, and Tardos \mbox{ KKT:KDD20030pt where influence is defined to be the expectation over }%DIFDELCMD < {\em %DIFDELCMD < %%% simulations (random sets of live edges) of the size of the reachability set of the seed nodes.
Revised:  We consider modelssuch as the classic Independent Cascade (IC) model of Kempe, Kleinberg, and Tardos \mbox{ KKT:KDD20030pt where influence is defined to be the expectation over }%DIFDELCMD < {\em %DIFDELCMD < %%% (random sets of live edges) of the size of the reachability set of the seed nodes.
Edit intent: fluency
Original:  A fundamental question is to bound the IM%DIFDELCMD < {\em %%% sample complexity : The number of simulations needed to determine an approximate maximizer .
Revised:  A fundamental question is to bound the IM%DIFDELCMD < {\em %%% : The number of simulations needed to determine an approximate maximizer .
Edit intent: clarity
Original:  A fundamental question is to bound the IM%DIFDELCMD < {\em %%% sample complexity : The number of simulations needed to determine an approximate maximizer .
Revised:  A fundamental question is to bound the IM%DIFDELCMD < {\em %%% sample complexity simulations. We study the IM sample complexity: the number of simulations needed to determine an approximate maximizer .
Edit intent: coherence
Original:  An upper bound of O( s n \epsilon^{-2} \ln n{\delta})  , where n is the number of nodes in the network and 1-\delta the desired confidence applies to all models.
Revised:  An upper bound of O( s \tau \epsilon^{-2} \ln n{\delta}) , where n is the number of nodes in the network and 1-\delta the desired confidence applies to all models.
Edit intent: clarity
Original:  We also design an efficient greedy algorithm that computes a (1-1/e-\epsilon)-approximate maximizer from simulation averages.
Revised:  We also design an efficient greedy design that computes an (1-1/e-\epsilon)-approximate maximizer from simulation averages.
Edit intent: clarity