wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Furthermore, whether consumer control improves consumer surplus depends on both the technology of disclosure and the competitivenessof the marketplace. In a competitive market, simple disclosure technologies such as "track / do-not-track" suffice for guaranteeing gains in consumer welfare. However, in a monopolistic market, welfare gains require richer forms of disclosure technology whereby consumers can decide how much information they would like to convey .
Revised:  Furthermore, whether consumer control improves welfare depends on the disclosure technology and market competitiveness. Simple disclosure technologies suffice in competitive markets. When facing a monopolist, a consumer needs partial disclosure possibilities to obtain any welfare gains .
Edit intent: clarity
Original:  This paper presents techniques for analyzing the download time of systematic availability codes considering the Fork-Join scheme for data access. Specifically, we consider the setup in which requests arrive for downloading individual data objects, and each request is replicated (forked) to the systematic server containing the object and all of its recovery groups.
Revised:  This paper presents techniques for analyzing the download time of systematic availability codes . These codes provide access to hot data through the systematic server containing the object and multiple recovery groups. When a request for an object is received, it can be replicated (forked) to the systematic server containing the object and all of its recovery groups.
Edit intent: clarity
Original:  For low-traffic regime , when there is at most one request in the system, we compute the download time in closed-form and compare it across systems with availability, maximum distance separable (MDS), and replication codes .
Revised:  We first consider the low-traffic regime , when there is at most one request in the system, we compute the download time in closed-form and compare it across systems with availability, maximum distance separable (MDS), and replication codes .
Edit intent: clarity
Original:  For low-traffic regime , when there is at most one request in the system, we compute the download time in closed-form and compare it across systems with availability, maximum distance separable (MDS), and replication codes .
Revised:  For low-traffic regime and present the close-form expression for the download time in closed-form and compare it across systems with availability, maximum distance separable (MDS), and replication codes .
Edit intent: clarity
Original:  For low-traffic regime , when there is at most one request in the system, we compute the download time in closed-form and compare it across systems with availability, maximum distance separable (MDS), and replication codes .
Revised:  For low-traffic regime , when there is at most one request in the system, we compute the download time . By comparison across systems with availability, maximum distance separable (MDS), and replication codes .
Edit intent: coherence
Original:  For low-traffic regime , when there is at most one request in the system, we compute the download time in closed-form and compare it across systems with availability, maximum distance separable (MDS), and replication codes . We demonstrate that availability codes can reduce download time in some settings , but are not always optimal.
Revised:  For low-traffic regime , when there is at most one request in the system, we compute the download time in closed-form and compare it across systems with availability, maximum distance separable (MDS), and replication codes , we demonstrate that availability codes can reduce download time in some settings , but are not always optimal.
Edit intent: fluency
Original:  When the low-traffic assumption does not hold, system consists of multiple inter-dependent Fork-Join queues, which makes exact analysis intractable due to state space explosion. Here , we present upper and lower bounds on the download time, and an M/G/1 queue approximation for several special cases of interest.
Revised:  When the low-traffic assumption does not hold, system consists of multiple inter-dependent Fork-Join queues, which makes exact analysis intractable . Accordingly , we present upper and lower bounds on the download time, and an M/G/1 queue approximation for several special cases of interest.
Edit intent: coherence
Original: Community detection is a fundamental problem in social network analysis consisting , roughly speaking, in dividing social actors ( modelled as nodes in a social graph) with certain social connections ( modelled as edges in the social graph) into densely knitted and highly related groups with each group well separated from the others.
Revised: Community detection is a fundamental problem in social network analysis consisting in unsupervised dividing social actors ( modelled as nodes in a social graph) with certain social connections ( modelled as edges in the social graph) into densely knitted and highly related groups with each group well separated from the others.
Edit intent: meaning-changed
Original: Community detection is a fundamental problem in social network analysis consisting , roughly speaking, in dividing social actors ( modelled as nodes in a social graph) with certain social connections ( modelled as edges in the social graph) into densely knitted and highly related groups with each group well separated from the others.
Revised: Community detection is a fundamental problem in social network analysis consisting , roughly speaking, in dividing social actors ( nodes in a social graph) with certain social connections ( modelled as edges in the social graph) into densely knitted and highly related groups with each group well separated from the others.
Edit intent: fluency
Original: Community detection is a fundamental problem in social network analysis consisting , roughly speaking, in dividing social actors ( modelled as nodes in a social graph) with certain social connections ( modelled as edges in the social graph) into densely knitted and highly related groups with each group well separated from the others.
Revised: Community detection is a fundamental problem in social network analysis consisting , roughly speaking, in dividing social actors ( modelled as nodes in a social graph) with certain social connections ( edges in a social graph) into densely knitted and highly related groups with each group well separated from the others.
Edit intent: fluency
Original:  Classical approaches for community detection usually deal only with the structure of the network and ignore features of the nodes , although major real-world  networks provide additional actors' information such as age, gender, interests, etc. , traditionally called node attributes.
Revised:  Classical approaches for community detection usually deal only with network structure and ignore features of the nodes , although major real-world networks provide additional actors' information such as age, gender, interests, etc. , traditionally called node attributes.
Edit intent: fluency
Original:  Classical approaches for community detection usually deal only with the structure of the network and ignore features of the nodes , although major real-world  networks provide additional actors' information such as age, gender, interests, etc. , traditionally called node attributes.
Revised:  Classical approaches for community detection usually deal only with the structure of the network and ignore features of its nodes (called node attributes), although many real-world networks provide additional actors' information such as age, gender, interests, etc. , traditionally called node attributes.
Edit intent: clarity
Original:  Classical approaches for community detection usually deal only with the structure of the network and ignore features of the nodes , although major real-world  networks provide additional actors' information such as age, gender, interests, etc. , traditionally called node attributes.
Revised:  Classical approaches for community detection usually deal only with the structure of the network and ignore features of the nodes , although major real-world social networks provide additional actors' information such as age, gender, interests, etc. , traditionally called node attributes.
Edit intent: clarity
Original:  Classical approaches for community detection usually deal only with the structure of the network and ignore features of the nodes , although major real-world  networks provide additional actors' information such as age, gender, interests, etc. , traditionally called node attributes. It is known that the attributes may clarify and enrich the knowledge about the actors and give sense to the detected communities.
Revised:  Classical approaches for community detection usually deal only with the structure of the network and ignore features of the nodes , although major real-world networks provide additional actors' information such as interests. It is believed that the attributes may clarify and enrich the knowledge about the actors and give sense to the detected communities.
Edit intent: clarity
Original:  This has led to a relatively novel direction in community detection --- constructing algorithms that use both the structure and the attributes of the network (modelled already via a node-attributed graph) to yield more informative and qualitative results.
Revised:  This belief has motivated the progress in developing community detection methods that use both the structure and the attributes of the network (modelled already via a node-attributed graph) to yield more informative and qualitative results.
Edit intent: clarity
Original:  This has led to a relatively novel direction in community detection --- constructing algorithms that use both the structure and the attributes of the network (modelled already via a node-attributed graph) to yield more informative and qualitative results.
Revised:  This has led to a relatively novel direction in community detection --- constructing algorithms that use both the structure and the attributes of network (i.e. deal with a node-attributed graph) to yield more informative and qualitative results.
Edit intent: clarity
Original:  We not only group and analyse the corresponding methods but also focus on practical aspects, including the information which methods outperform others and which datasets and quality measures are used for evaluation .
Revised:  We not only group and analyse the corresponding methods but also focus on practical aspects, including the information which methods outperform others and which datasets and quality measures are used for their evaluation. Basing on the information collected, we make conclusions on the current state of the field and disclose several problems that seem important to be resolved in future .
Edit intent: meaning-changed
Original:   Tagging, or using gates, has been used to enable translation models to distinguish between synthetic and natural data. This improves standard back-translation and also enables the use of iterative back-translation on language pairs that underperformed using standard back-translation.
Revised:  Tagging, or using gates, has been used to enable translation models to distinguish between synthetic and authentic data, improving standard back-translation and also enables the use of iterative back-translation on language pairs that underperformed using standard back-translation.
Edit intent: clarity
Original:  The approach - tag-less back-translation - trains the model on the synthetic data and finetunes it on the natural data. Preliminary experiments have shown the approach to continuously outperform the tagging approach on low resource English-Vietnamese neural machine translation .
Revised:  The approach - tag-less back-translation - trains the model on the synthetic data and finetunes it on the authentic data. Experiments have shown the approach to continuously outperform the tagging approach on low resource English-Vietnamese neural machine translation .
Edit intent: clarity
Original:  While the need for tagging (noising) the dataset has been removed, the approach outperformed the tagged back-translation approach by an average of 0.4 BLEU  .
Revised:  While the need for tagging (noising) the dataset has been removed, the approach outperformed the tagged back-translation approach by an average of 0.4 BLEU . The approach reached the best scores in less training time than the standard and tagged back-translation approaches .
Edit intent: meaning-changed
Original: The effects of positive and negative hydrationof counterions (Na^{+ and Cs^{+} ) incorporated into the hydration shell of the DNA double helix have been studied using molecular dynamics approach .
Revised: The DNA double helix is a polyanionic macromolecule that in water solutions is neutralized by metal ions (counterions). The property of the counterions to stabilize the water network (positive hydration) or to make it friable (negative hydration) is important in terms of the physical mechanisms of stabilization of the DNA double helix. In the present research, the effects of positive hydration of Na^{+ and Cs^{+} ) incorporated into the hydration shell of the DNA double helix have been studied using molecular dynamics approach .
Edit intent: meaning-changed
Original: The effects of positive and negative hydrationof counterions (Na^{+ and Cs^{+} ) incorporated into the hydration shell of the DNA double helix have been studied using molecular dynamics approach .
Revised: The effects of positive and negative hydrationof counterions (Na^{+ and Cs^{+} counterions, incorporated into the hydration shell of the DNA double helix have been studied using molecular dynamics approach .
Edit intent: fluency
Original:  The longest residence times have been observed for water molecules near the counterionsthat are localized in the minor groove of the double helix : about 30 ps in the case of Na^{+ K^{+} and Cs^{+} counterions.
Revised:  The longest average residence time has been observed for water molecules near the counterionsthat are localized in the minor groove of the double helix : about 30 ps in the case of Na^{+ K^{+} and Cs^{+} counterions.
Edit intent: meaning-changed
Original:  The longest residence times have been observed for water molecules near the counterionsthat are localized in the minor groove of the double helix : about 30 ps in the case of Na^{+ K^{+} and Cs^{+} counterions.
Revised:  The longest residence times have been observed for water molecules contacting with the counterions, localized in the minor groove of the double helix : about 30 ps in the case of Na^{+ K^{+} and Cs^{+} counterions.
Edit intent: clarity
Original:  The longest residence times have been observed for water molecules near the counterionsthat are localized in the minor groove of the double helix : about 30 ps in the case of Na^{+ K^{+} and Cs^{+} counterions.
Revised:  The longest residence times have been observed for water molecules near the counterionsthat are localized in the minor groove of the double helix (about 50 ps for Na^{+ K^{+} and Cs^{+} counterions.
Edit intent: meaning-changed
Original:  The longest residence times have been observed for water molecules near the counterionsthat are localized in the minor groove of the double helix : about 30 ps in the case of Na^{+ K^{+} and Cs^{+} counterions. In the major groove and outside the double helix it is essentially lower. The counterions constrain water molecules too strong, and as the result the effect of negative hydration for K^{+} and Cs^{+} counterions was not observed in the simulations.
Revised:  The longest residence times have been observed for water molecules near the counterionsthat are localized in the minor groove of the double helix : about 30 ps in the case of Na^{+ K^{+} and Cs^{+} ). The estimated potentials of mean force for the hydration shells of the counterions show that the water molecules are constrained too strong, and as the result the effect of negative hydration for K^{+} and Cs^{+} counterions was not observed in the simulations.
Edit intent: meaning-changed
Original:  The counterions constrain water molecules too strong, and as the result the effect of negative hydration for K^{+} and Cs^{+} counterions was not observed in the simulations.
Revised:  The counterions constrain water molecules too strong, and as the result the effect of negative hydration for K^{+} and Cs^{+} counterions has not been observed in the simulations.
Edit intent: fluency
Original:   The paper shows that the degradation of the efficiency of the parallelized sequential system is a natural consequence of the  computing paradigm, rather than an engineering imperfectness.
Revised:  Introducing temporal behavior into computer science also explains why only the extreme scale computing enabled us to reveal the experienced limitations. The paper shows that the degradation of the efficiency of the parallelized sequential system is a natural consequence of the computing paradigm, rather than an engineering imperfectness.
Edit intent: meaning-changed
Original:  The workload is greatly responsible for wasting the energy as well as limiting the size and the type of tasks the supercomputers can run . Case studies provide insight how the different contributions compete for dominating the resulting payload performance of the computing system, and how enhancing the technology made the computing+communication the dominating contribution in defining the efficiency of supercomputers.
Revised:  The workload , that supercomputers run, is much responsible for wasting the energy as well as limiting the size and the type of tasks the supercomputers can run . Case studies provide insight how the different contributions compete for dominating the resulting payload performance of the computing system, and how enhancing the technology made the computing+communication the dominating contribution in defining the efficiency of supercomputers.
Edit intent: clarity
Original:  The workload is greatly responsible for wasting the energy as well as limiting the size and the type of tasks the supercomputers can run . Case studies provide insight how the different contributions compete for dominating the resulting payload performance of the computing system, and how enhancing the technology made the computing+communication the dominating contribution in defining the efficiency of supercomputers.
Revised:  The workload is greatly responsible for wasting energy, as well as limiting the size and the type of tasks the supercomputers can run . Case studies provide insight how the different contributions compete for dominating the resulting payload performance of the computing system, and how enhancing the technology made the computing+communication the dominating contribution in defining the efficiency of supercomputers.
Edit intent: fluency
Original:  The workload is greatly responsible for wasting the energy as well as limiting the size and the type of tasks the supercomputers can run . Case studies provide insight how the different contributions compete for dominating the resulting payload performance of the computing system, and how enhancing the technology made the computing+communication the dominating contribution in defining the efficiency of supercomputers.
Revised:  The workload is greatly responsible for wasting the energy as well as limiting the size and type of tasks the supercomputers can run . Case studies provide insight how the different contributions compete for dominating the resulting payload performance of the computing system, and how enhancing the technology made the computing+communication the dominating contribution in defining the efficiency of supercomputers.
Edit intent: fluency
Original:  The workload is greatly responsible for wasting the energy as well as limiting the size and the type of tasks the supercomputers can run . Case studies provide insight how the different contributions compete for dominating the resulting payload performance of the computing system, and how enhancing the technology made the computing+communication the dominating contribution in defining the efficiency of supercomputers.
Revised:  The workload is greatly responsible for wasting the energy as well as limiting the size and the type of tasks . Case studies provide insight how the different contributions compete for dominating the resulting payload performance of the computing system, and how enhancing the technology made the computing+communication the dominating contribution in defining the efficiency of supercomputers.
Edit intent: clarity
Original:  The workload is greatly responsible for wasting the energy as well as limiting the size and the type of tasks the supercomputers can run . Case studies provide insight how the different contributions compete for dominating the resulting payload performance of the computing system, and how enhancing the technology made the computing+communication the dominating contribution in defining the efficiency of supercomputers.
Revised:  The workload is greatly responsible for wasting the energy as well as limiting the size and the type of tasks the supercomputers can run . Case studies provide insight , how different contributions compete for dominating the resulting payload performance of the computing system, and how enhancing the technology made the computing+communication the dominating contribution in defining the efficiency of supercomputers.
Edit intent: fluency
Original:  The workload is greatly responsible for wasting the energy as well as limiting the size and the type of tasks the supercomputers can run . Case studies provide insight how the different contributions compete for dominating the resulting payload performance of the computing system, and how enhancing the technology made the computing+communication the dominating contribution in defining the efficiency of supercomputers.
Revised:  The workload is greatly responsible for wasting the energy as well as limiting the size and the type of tasks the supercomputers can run . Case studies provide insight how the different contributions compete for dominating the resulting payload performance of a computing system, and how enhancing the technology made the computing+communication the dominating contribution in defining the efficiency of supercomputers.
Edit intent: fluency
Original:  The workload is greatly responsible for wasting the energy as well as limiting the size and the type of tasks the supercomputers can run . Case studies provide insight how the different contributions compete for dominating the resulting payload performance of the computing system, and how enhancing the technology made the computing+communication the dominating contribution in defining the efficiency of supercomputers.
Revised:  The workload is greatly responsible for wasting the energy as well as limiting the size and the type of tasks the supercomputers can run . Case studies provide insight how the different contributions compete for dominating the resulting payload performance of the computing system, and how enhancing the interconnection technology made computing+communication the dominating contribution in defining the efficiency of supercomputers.
Edit intent: clarity
Original:  The workload is greatly responsible for wasting the energy as well as limiting the size and the type of tasks the supercomputers can run . Case studies provide insight how the different contributions compete for dominating the resulting payload performance of the computing system, and how enhancing the technology made the computing+communication the dominating contribution in defining the efficiency of supercomputers.
Revised:  The workload is greatly responsible for wasting the energy as well as limiting the size and the type of tasks the supercomputers can run . Case studies provide insight how the different contributions compete for dominating the resulting payload performance of the computing system, and how enhancing the technology made the computing+communication to dominate in defining the efficiency of supercomputers.
Edit intent: clarity