wanyu/IteraTeR_v2 huggingface dataset:
Original:  In particular, we consider contrasts between two common stochastic seeding strategies and analyze nonparametric estimators adapted from policy evaluation or importance sampling.
Revised:  In particular, we consider contrasts between stochastic seeding strategies and analyze nonparametric estimators adapted from policy evaluation or importance sampling.
Edit intent: clarity
Original:  In particular, we consider contrasts between two common stochastic seeding strategies and analyze nonparametric estimators adapted from policy evaluation or importance sampling.
Revised:  In particular, we consider contrasts between two common stochastic seeding strategies and analyze nonparametric estimators adapted from policy evaluation and importance sampling.
Edit intent: fluency
Original:  Using simulations on real networks , we show that the proposed estimators and designs can dramatically increase precision while yielding valid inference.
Revised:  We use simulations on real networks , we show that the proposed estimators and designs can dramatically increase precision while yielding valid inference.
Edit intent: coherence
Original:  Using simulations on real networks , we show that the proposed estimators and designs can dramatically increase precision while yielding valid inference.
Revised:  Using simulations on real networks to show that the proposed estimators and designs can dramatically increase precision while yielding valid inference.
Edit intent: clarity
Original:  We  apply our proposed estimators to a field experiment that randomly assigned households to an intensive marketing intervention and a field experiment that randomly assigned students to an anti-bullying intervention.
Revised:  We then apply our proposed estimators to a field experiment that randomly assigned households to an intensive marketing intervention and a field experiment that randomly assigned students to an anti-bullying intervention.
Edit intent: coherence
Original:  We  apply our proposed estimators to a field experiment that randomly assigned households to an intensive marketing intervention and a field experiment that randomly assigned students to an anti-bullying intervention.
Revised:  We apply our proposed estimators to two field experiments, one that assigned households to an intensive marketing intervention and a field experiment that randomly assigned students to an anti-bullying intervention.
Edit intent: clarity
Original:  We  apply our proposed estimators to a field experiment that randomly assigned households to an intensive marketing intervention and a field experiment that randomly assigned students to an anti-bullying intervention.
Revised:  We apply our proposed estimators to a field experiment that randomly assigned households to an intensive marketing intervention and one that assigned students to an anti-bullying intervention.
Edit intent: clarity
Original:  We use simulations on real networks to show that the proposed estimators and designs can dramatically increase precision while yielding valid inference.
Revised:  We use simulations on real networks to show that the proposed estimators and designs can increase precision while yielding valid inference.
Edit intent: clarity
Original: The fifth-generation (5G) communication systems will enable enhanced mobile broadband, ultra-reliable low-latency , and massive connectivity services.
Revised: The fifth-generation (5G) communication systems will enable enhanced mobile broadband, ultra-reliable low latency , and massive connectivity services.
Edit intent: fluency
Original:  The broadband and low-latency services are indispensable to public-safety (PS) communication during natural or man-made disasters.
Revised:  The broadband and low-latency services are indispensable to public safety (PS) communication during natural or man-made disasters.
Edit intent: fluency
Original:  The existing systems have limited capacity, and hence their evolution is desired.
Edit intent: coherence
Original:  Recently, the third generation partnership project long term evolution ( 3GPP-LTE ) has emerged as a promising candidate to enable broadband PS communications.
Revised:  Recently, the third generation partnership project long term evolution ( 3GPPLTE ) has emerged as a promising candidate to enable broadband PS communications.
Edit intent: clarity
Original:  In this article,  we present six major PS-LTE enabling services and the current status of PS-LTE in 3GPP releases , and discuss the spectrum bands allocated for PS-LTE in major countries by international telecommunication union (ITU).
Revised:  In this article, first we present six major PS-LTE enabling services and the current status of PS-LTE in 3GPP releases , and discuss the spectrum bands allocated for PS-LTE in major countries by international telecommunication union (ITU).
Edit intent: coherence
Original:  In this article,  we present six major PS-LTE enabling services and the current status of PS-LTE in 3GPP releases , and discuss the spectrum bands allocated for PS-LTE in major countries by international telecommunication union (ITU).
Revised:  In this article, we present six major PS-LTE enabling services and the current status of PS-LTE in 3GPP releases . Then, we discuss the spectrum bands allocated for PS-LTE in major countries by international telecommunication union (ITU).
Edit intent: coherence
Original:  Finally, we propose a disaster-resilient three-layered architecture for PS-LTE (DR-PSLTE).
Revised:  Finally, we propose a disaster resilient three-layered architecture for PS-LTE (DR-PSLTE).
Edit intent: fluency
Original:  The proposed architecture is flexible and combines the benefits of SDNs and edge computing to efficiently meet  delay requirements of various PS-LTE services.
Revised:  The proposed architecture is flexible and combines the benefits of SDNs and edge computing to efficiently meet the delay requirements of various PS-LTE services.
Edit intent: fluency
Original:  Simulation results verified that with DR-PSLTE architecture, delay is reduced by 20\% as compared with the conventional centralized computing architecture.
Revised:  Simulation results verified that under the proposed DR-PSLTE architecture, delay is reduced by 20\% as compared with the conventional centralized computing architecture.
Edit intent: clarity
Original:  For certain applications,  as those described in this paper, it is desirable to obtain {\it sparse} dual solutions, i.e., those with support size (almost) independent of the number of primal constraints.
Revised:  For certain applications, such as those described in this paper, it is desirable to obtain {\it sparse} dual solutions, i.e., those with support size (almost) independent of the number of primal constraints.
Edit intent: fluency
Original:  For certain applications,  as those described in this paper, it is desirable to obtain {\it sparse} dual solutions, i.e., those with support size (almost) independent of the number of primal constraints.
Revised:  For certain applications, as those described in this paper, it may be desirable to obtain {\it sparse} dual solutions, i.e., those with support size (almost) independent of the number of primal constraints.
Edit intent: coherence
Original:  In this paper, we give such an algorithm , which is an extension of a {\it logarithmic-potential} based algorithm of Grigoriadis, Khachiyan, Porkolab and Villavicencio (SIAM Journal of Optimization 41 (2001)) for packing/covering linear programs.
Revised:  In this paper, we give an algorithm that finds such solutions , which is an extension of a {\it logarithmic-potential} based algorithm of Grigoriadis, Khachiyan, Porkolab and Villavicencio (SIAM Journal of Optimization 41 (2001)) for packing/covering linear programs.
Edit intent: clarity
Original:  As an application, we describe a simple algorithm to triangulate a special class of 3d non-convex polyhedra  .
Revised:  As an application, we described a simple algorithm to triangulate a special class of 3d non-convex polyhedra .
Edit intent: fluency
Original: Many meta-languages have been proposed for writing rule-based operational semantics, in order to provide general interpreters and analysis tools.
Revised: The development of mechanised language specification based on structured operational semantics, in order to provide general interpreters and analysis tools.
Edit intent: clarity
Original:  We provide four generic interpretations of our skeletal semantics to yield : a simple well-formedness interpretation;
Revised:  We explore four generic interpretations of our skeletal semantics to yield : a simple well-formedness interpretation;
Edit intent: clarity
Original:  We provide four generic interpretations of our skeletal semantics to yield : a simple well-formedness interpretation;
Revised:  We provide four generic interpretations : a simple well-formedness interpretation;
Edit intent: clarity
Original: In this paper, we consider the problem of pursuit-evasion using multiple Autonomous Underwater Vehicles (AUVs) in a 3D water volume, with and without simple obstacles . Pursuit-evasion is a well studied topic in robotics, but the results are mostly set in 2D environments, using unlimited line of sight sensing.
Revised: In this paper, we consider the problem of pursuit-evasion using multiple Autonomous Underwater Vehicles (AUVs) in a 3D water volume, with and without simple obstacles . Pursuit-evasion is a well studied topic in robotics, but the results are mostly set in 2D environments, using unlimited line-of-sight sensing.
Edit intent: fluency
Original:  We propose an algorithm for range limited sensing in 3D environments that captures a finite speed evader based on one single previous observation of its location.
Revised:  We propose an algorithm for range-limited sensing in 3D environments that captures a finite speed evader based on one single previous observation of its location.
Edit intent: fluency
Original:  We propose an algorithm for range limited sensing in 3D environments that captures a finite speed evader based on one single previous observation of its location.
Revised:  We propose an algorithm for range limited sensing in 3D environments that captures a finite-speed evader based on one single previous observation of its location.
Edit intent: fluency
Original:  We propose an algorithm for range limited sensing in 3D environments that captures a finite speed evader based on one single previous observation of its location.
Revised:  We propose an algorithm for range limited sensing in 3D environments that captures a finite speed evader based on a single previous observation of its location.
Edit intent: fluency
Original:  The cageis then shrunk until every part of that volume is sensed, thereby capturing the evader.
Revised:  The cageis then shrunk until every part of the volume containing the evader is sensed, thereby capturing the evader.
Edit intent: clarity
Original:  The cageis then shrunk until every part of that volume is sensed, thereby capturing the evader.
Revised:  The cageis then shrunk until every part of that volume is sensed, capturing the evader.
Edit intent: clarity
Original:  We propose an algorithm for range-limited sensing in 3D environments that captures a finite-speed evader based on a single previous observation of its location.
Revised:  We propose an algorithm for range-limited sensing in 3D environments captures a finite-speed evader based on a single previous observation of its location.
Edit intent: fluency
Original:  In order to learn semantically discriminative features, we propose to map images onto class centroids whose pair-wise dot products correspond to a measure of semantic similarity between classes.
Revised:  In order to learn semantically discriminative features, we propose to map images onto class embeddings whose pair-wise dot products correspond to a measure of semantic similarity between classes.
Edit intent: clarity
Original:  Such an embedding would not only improve image retrieval results, but could also facilitate integrating semantics for other tasks, e.g., novelty detection or few-shot learning.
Revised:  Such an embedding does not only improve image retrieval results, but could also facilitate integrating semantics for other tasks, e.g., novelty detection or few-shot learning.
Edit intent: clarity
Original:  We identify potential complications for future research that integrates deep learning with query optimization and describe three novel deep learning based approaches that can lead the way to end-to-end learning-based query optimizers.
Revised:  We identify potential complications for future research that integrates deep learning with query optimization , and we describe three novel deep learning based approaches that can lead the way to end-to-end learning-based query optimizers.
Edit intent: coherence
Original:  We show that any non-zero correlation that is due to cell-size regulation can induce long-term oscillations in the population growth rate.
Revised:  We show that any non-zero correlation that is due to cell-size regulation , no matter how small, induces long-term oscillations in the population growth rate.
Edit intent: clarity
Original:  The relaxation time scale of the population to its steady state is determined from the distribution of single-cell growth rates independent of the details of the division process .
Revised:  We discover that the relaxation time scale of the population to its steady state is determined from the distribution of single-cell growth rates independent of the details of the division process .
Edit intent: coherence
Original:  The relaxation time scale of the population to its steady state is determined from the distribution of single-cell growth rates independent of the details of the division process .
Revised:  The relaxation time scale of the population to its steady state is determined by the distribution of single-cell growth rates independent of the details of the division process .
Edit intent: clarity
Original:  The relaxation time scale of the population to its steady state is determined from the distribution of single-cell growth rates independent of the details of the division process .
Revised:  The relaxation time scale of the population to its steady state is determined from the distribution of single-cell growth rates and is surprisingly independent of details of the division process .
Edit intent: coherence
Original:  This paper, follows up Y. Dagan, Y. Filmus, H. Hatami, and Y. Li, Trading information complexity for error, Theory of Computing 14(2018) , no. 6, 1-73%DIFDELCMD < ]%%% , studies the dependency of information complexity on error allowed to compute a function.
Revised:  This paper, follows up %DIFDELCMD < ]%%% , studies the dependency of information complexity on error allowed to compute a function.
Edit intent: coherence
Original:  This paper, follows up Y. Dagan, Y. Filmus, H. Hatami, and Y. Li, Trading information complexity for error, Theory of Computing 14(2018) , no. 6, 1-73%DIFDELCMD < ]%%% , studies the dependency of information complexity on error allowed to compute a function.
Revised:  This paper, follows up Y. Dagan, Y. Filmus, H. Hatami, and Y. Li, Trading information complexity for error, Theory of Computing 14(2018) , no. 6, 1-73%DIFDELCMD < ]%%% Two problems are studied in this paper. (1) How much external or internal information cost is required to compute a function.
Edit intent: coherence
Original:  Moitra, An information complexity approach to extended formulations, STOC, ACM, 2013%DIFDELCMD < ]%%% . For external information complexity, we show to compute any function with small error \epsilon>0 , one can save external information cost , against computing the function without zero, at least \Omega(\epsilon ) and at most O( h(\epsilon) ) where h(\cdot) is the binary entropy function.
Revised:  Moitra, An information complexity approach to extended formulations, STOC, ACM, 2013%DIFDELCMD < ]%%% . For external information complexity, we show to compute any function with small error \epsilon>0 comparing to the case when no error is allowed? It is shown that information cost of order at least \epsilon and at most O( h(\epsilon) ) where h(\cdot) is the binary entropy function.
Edit intent: coherence
Original:  Moitra, An information complexity approach to extended formulations, STOC, ACM, 2013%DIFDELCMD < ]%%% . For external information complexity, we show to compute any function with small error \epsilon>0 , one can save external information cost , against computing the function without zero, at least \Omega(\epsilon ) and at most O( h(\epsilon) ) where h(\cdot) is the binary entropy function.
Revised:  Moitra, An information complexity approach to extended formulations, STOC, ACM, 2013%DIFDELCMD < ]%%% . For external information complexity, we show to compute any function with small error \epsilon>0 , one can save external information cost , against computing the function without zero, at least \Omega(\epsilon ) and at most h(\epsilon) ) where h(\cdot) is the binary entropy function.
Edit intent: coherence
Original:  However, when we consider prior-free external information complexity over only product distributions, the lower bound can be improved to \Omega (h( \epsilon)) , with a simpler proof than the one in Y. Dagan,Y.
Revised:  However, when we consider prior-free external information complexity over only product distributions, the lower bound can be improved to \Omega (h( Y. Dagan,Y.
Edit intent: clarity
Original:  Additionally, they propose a correlation immunization method that minimizes the pricing and hedging error that results when the correlation between the risky asset's price and volatility is nonzero.
Revised:  Additionally, they propose a correlation immunization strategy that minimizes the pricing and hedging error that results when the correlation between the risky asset's price and volatility is nonzero.
Edit intent: clarity
Original: FanFiction .net provides an informal learning space for young writers through distributed mentoring, networked giving and receiving of feedback.
Revised: Fanfiction .net provides an informal learning space for young writers through distributed mentoring, networked giving and receiving of feedback.
Edit intent: fluency
Original:  Let \delta>0, P be  a polygonal curve  with n vertices in \mathbb{R^d, and D(\cdot,\cdot) be a distance measure.
Revised:  Let \delta>0, P be a polygonal curve P with n vertices in \mathbb{R^d, and D(\cdot,\cdot) be a distance measure.
Edit intent: fluency
Original:  Let \delta>0, P be  a polygonal curve  with n vertices in \mathbb{R^d, and D(\cdot,\cdot) be a distance measure.
Revised:  Let \delta>0, P be a polygonal curve with n vertices ^d, and D(\cdot,\cdot) be a distance measure.
Edit intent: clarity
Original:  However, polynomial-time fixed-parameter exact computation, and also deterministic and randomized approximations are exhibited.
Revised:  However, polynomial-time deterministic and randomized approximations are exhibited.
Edit intent: clarity
Original:  We identify a key combinatorial parameter of the graph m(G), which is the minimal number of corrupted agents needed to prevent the central agency from identifying a single corrupt node.
Revised:  We identify a key combinatorial parameter of the graph m(G), which is the minimal number of corrupted agents needed to prevent the central agency from identifying a single truthful node.
Edit intent: clarity
Original:  In contrast to most prior approaches to graph representation learning , DGI does not rely on random walks , and is readily applicable to both transductive and inductive learning setups.
Revised:  In contrast to most prior approaches to graph representation learning , DGI does not rely on random walk objectives , and is readily applicable to both transductive and inductive learning setups.
Edit intent: clarity
Original:  The question of the relationship between rank and functional rank is one of the main open problem we raise as it may reveal new avenues for constructing new LCCs (perhaps even matching the KT bound).
Revised:  The question of the relationship between rank and functional rank is one of the main questions we raise as it may reveal new avenues for constructing new LCCs (perhaps even matching the KT bound).
Edit intent: clarity
Original:  As a modest first step, we develop an entropy relaxation of functional rank and use it to demonstrate a small constant gap between the two notions.
Revised:  As a first step, we develop an entropy relaxation of functional rank and use it to demonstrate a small constant gap between the two notions.
Edit intent: clarity
Original:  As a modest first step, we develop an entropy relaxation of functional rank and use it to demonstrate a small constant gap between the two notions.
Revised:  As a modest first step, we develop an entropy relaxation of functional rank to create a small constant gap between the two notions.
Edit intent: clarity
Original: Medical knowledge graph is the core component for   various medical applications such as automatic diagnosis and question-answering.
Revised: Knowledge Graph (KG) contains entities and the relations between entities. Due to its representation ability, KG has been successfully applied to support many medical/healthcare tasks. However, in the medical domain, knowledge holds under certain conditions. For example, symptom various medical applications such as automatic diagnosis and question-answering.
Edit intent: coherence
Original:  In the light of this challenge , we propose a new truth discovery method to explore medical-related texts and infer trustworthiness degrees of knowledge triples associating with different conditions.
Revised:  In the light of these challenges , we propose a new truth discovery method to explore medical-related texts and infer trustworthiness degrees of knowledge triples associating with different conditions.
Edit intent: fluency
Original:  Therefore , some major design principles need to be revisited in NR-U to address coexistence .
Revised:  Therefore , some major design principles need to be revisited to address coexistence .
Edit intent: clarity
Original: In a world where ideas are free to flow uncontrolled between people , we often find ourselves relying on others' information without the possibility to establish whether those opinions are accurate.
Revised: In a world where ideas are free to flow uncontrolled between people , we often find ourselves relying on others' information without an objective standard to judge whether those opinions are accurate.
Edit intent: clarity
Original:  The present study tests a "confidence hypothesis " of advice perception, namely the hypothesis that internal metacognitive processes like decision confidence play an important functional role in the perception and use of social information - such as peers' advice - and can be used, computationally, to estimate advisors' trustworthiness and advice reliability.
Revised:  The present study tests a "confidence hypothesis " of advice perception, which holds that internal metacognitive processes like decision confidence play an important functional role in the perception and use of social information - such as peers' advice - and can be used, computationally, to estimate advisors' trustworthiness and advice reliability.
Edit intent: clarity
Original:  The present study tests a "confidence hypothesis " of advice perception, namely the hypothesis that internal metacognitive processes like decision confidence play an important functional role in the perception and use of social information - such as peers' advice - and can be used, computationally, to estimate advisors' trustworthiness and advice reliability.
Revised:  The present study tests a "confidence hypothesis " of advice perception, namely the hypothesis that internal metacognitive evaluations of decision confidence play an important functional role in the perception and use of social information - such as peers' advice - and can be used, computationally, to estimate advisors' trustworthiness and advice reliability.
Edit intent: clarity