wanyu/IteraTeR_full_sent huggingface dataset:
Original: Network scientists  proposed that infectious diseases  may be effectively halted by targeting interventions at a minority of highly connected individuals , or hubs . Can this strategy be effective in combating a disease transmitted through physical proximity such as SARS-CoV-2  ? Effectiveness critically depends on high between-person variability in the number of close-range contacts.
Revised: Network scientists proposed that infectious diseases may be effectively halted by targeting interventions at a minority of highly connected individuals , or hubs . Can this strategy be effective in combating a virus partly transmitted in close-range contact, as many believe SARS-CoV-2 ? Effectiveness critically depends on high between-person variability in the number of close-range contacts.
Edit intent: meaning-changed
Original: Network scientists  proposed that infectious diseases  may be effectively halted by targeting interventions at a minority of highly connected individuals , or hubs . Can this strategy be effective in combating a disease transmitted through physical proximity such as SARS-CoV-2  ? Effectiveness critically depends on high between-person variability in the number of close-range contacts.
Revised: Network scientists proposed that infectious diseases may be effectively halted by targeting interventions at a minority of highly connected individuals , or hubs . Can this strategy be effective in combating a disease transmitted through physical proximity such as SARS-CoV-2 to be ? Effectiveness critically depends on high between-person variability in the number of close-range contacts.
Edit intent: clarity
Original:  model , where populations differ by their degree of compliance with social distancing policies . Considering the data of the propagation of SARS-CoV-2 in Brazil , where there is a significant stake of the population making their living in the informal economy and thus prone to not follow self-isolation , we assert that if the confinement measures are lifted too soon, namely as much as one week of consecutive declining numbers of new cases, it is very likely the appearance of a second peak  .
Revised:  model . As a novelty, we consider populations that differ in their degree of compliance with social distancing policies . Considering the data of the propagation of SARS-CoV-2 in Brazil , where there is a significant stake of the population making their living in the informal economy and thus prone to not follow self-isolation , we assert that if the confinement measures are lifted too soon, namely as much as one week of consecutive declining numbers of new cases, it is very likely the appearance of a second peak .
Edit intent: coherence
Original:  model , where populations differ by their degree of compliance with social distancing policies . Considering the data of the propagation of SARS-CoV-2 in Brazil , where there is a significant stake of the population making their living in the informal economy and thus prone to not follow self-isolation , we assert that if the confinement measures are lifted too soon, namely as much as one week of consecutive declining numbers of new cases, it is very likely the appearance of a second peak  .
Revised:  model , where populations differ by their degree of compliance with social distancing policies following socioeconomic attributes that are observed in emerging and developing countries. Considering epidemiological parameters estimated from data of the propagation of SARS-CoV-2 in Brazil , where there is a significant stake of the population making their living in the informal economy and thus prone to not follow self-isolation , we assert that if the confinement measures are lifted too soon, namely as much as one week of consecutive declining numbers of new cases, it is very likely the appearance of a second peak .
Edit intent: meaning-changed
Original:  model , where populations differ by their degree of compliance with social distancing policies . Considering the data of the propagation of SARS-CoV-2 in Brazil , where there is a significant stake of the population making their living in the informal economy and thus prone to not follow self-isolation , we assert that if the confinement measures are lifted too soon, namely as much as one week of consecutive declining numbers of new cases, it is very likely the appearance of a second peak  .
Revised:  model , where populations differ by their degree of compliance with social distancing policies . Considering the data of the propagation of SARS-CoV-2 in Brazil -- where there is a significant stake of the population making their living in the informal economy and thus prone to not follow self-isolation , we assert that if the confinement measures are lifted too soon, namely as much as one week of consecutive declining numbers of new cases, it is very likely the appearance of a second peak .
Edit intent: fluency
Original:  model , where populations differ by their degree of compliance with social distancing policies . Considering the data of the propagation of SARS-CoV-2 in Brazil , where there is a significant stake of the population making their living in the informal economy and thus prone to not follow self-isolation , we assert that if the confinement measures are lifted too soon, namely as much as one week of consecutive declining numbers of new cases, it is very likely the appearance of a second peak  .
Revised:  model , where populations differ by their degree of compliance with social distancing policies . Considering the data of the propagation of SARS-CoV-2 in Brazil , where there is a significant stake of the population making their living in the informal economy and thus prone to not follow self-isolation -- we assert that if the confinement measures are lifted too soon, namely as much as one week of consecutive declining numbers of new cases, it is very likely the appearance of a second peak .
Edit intent: fluency
Original:  model , where populations differ by their degree of compliance with social distancing policies . Considering the data of the propagation of SARS-CoV-2 in Brazil , where there is a significant stake of the population making their living in the informal economy and thus prone to not follow self-isolation , we assert that if the confinement measures are lifted too soon, namely as much as one week of consecutive declining numbers of new cases, it is very likely the appearance of a second peak  .
Revised:  model , where populations differ by their degree of compliance with social distancing policies . Considering the data of the propagation of SARS-CoV-2 in Brazil , where there is a significant stake of the population making their living in the informal economy and thus prone to not follow self-isolation , we assert that if the confinement measures are lifted too soon, namely as much as one week of consecutive declining numbers of new cases, it is very likely the appearance of a second peak . Our approach should be valid for any country where the number of people involved in the informal economy is a large proportion of the total labor force. In summary, our results point out the crucial relevance of target policies for supporting people in the informal economy to properly comply with preventive measures during the pandemic .
Edit intent: meaning-changed
Original:  To assist in diagnosing measles, we create a dataset of more than 1300 images of  skin conditions and utilized deep convolutional neural network to distinguish measles rash from a variety of other skin conditions.
Revised:  To assist in diagnosing measles, we created a dataset of more than 1300 images of skin conditions and utilized deep convolutional neural network to distinguish measles rash from a variety of other skin conditions.
Edit intent: fluency
Original:  To assist in diagnosing measles, we create a dataset of more than 1300 images of  skin conditions and utilized deep convolutional neural network to distinguish measles rash from a variety of other skin conditions.
Revised:  To assist in diagnosing measles, we create a dataset of more than 1300 images of a variety of skin conditions and utilized deep convolutional neural network to distinguish measles rash from a variety of other skin conditions.
Edit intent: fluency
Original:  To assist in diagnosing measles, we create a dataset of more than 1300 images of  skin conditions and utilized deep convolutional neural network to distinguish measles rash from a variety of other skin conditions.
Revised:  To assist in diagnosing measles, we create a dataset of more than 1300 images of skin conditions and utilized deep convolutional neural network to distinguish measles rash from other skin conditions.
Edit intent: clarity
Original:  On our curated image dataset, our model reaches a classification accuracy 94 \%, a sensitivity 74 \%, and specificity 97\%. This measles rash image detection could facilitate an accurate and early detection  to help contain measles outbreaks.
Revised:  On our curated image dataset, our model reaches a classification accuracy 94 \%, a sensitivity 74 \%, and specificity 97.1\%. Our model can potentially be used to facilitate an accurate and early detection to help contain measles outbreaks.
Edit intent: meaning-changed
Original:  To assist in diagnosing measles, we created a dataset of more than 1300 images of a variety of skin conditions and utilized deep convolutional neural network to distinguish measles rash from other skin conditions  .
Revised:  To assist in diagnosing measles, we collected more than 1300 images of a variety of skin conditions and utilized deep convolutional neural network to distinguish measles rash from other skin conditions .
Edit intent: clarity
Original:  To assist in diagnosing measles, we created a dataset of more than 1300 images of a variety of skin conditions and utilized deep convolutional neural network to distinguish measles rash from other skin conditions  .
Revised:  To assist in diagnosing measles, we created a dataset of more than 1300 images of a variety of skin conditions , with which we employed residual deep convolutional neural network to distinguish measles rash from other skin conditions .
Edit intent: meaning-changed
Original:  To assist in diagnosing measles, we created a dataset of more than 1300 images of a variety of skin conditions and utilized deep convolutional neural network to distinguish measles rash from other skin conditions  .
Revised:  To assist in diagnosing measles, we created a dataset of more than 1300 images of a variety of skin conditions and utilized deep convolutional neural network to distinguish measles rash from other skin conditions , in an aim to create a phone application in the future .
Edit intent: meaning-changed
Original:  On our curated image dataset, our model reaches a classification accuracy  95.2\%, a sensitivity 81.7\%, and specificity  97.1\% . Our model can potentially be used to facilitate an accurate and early detection of measles to help contain measles outbreaks.
Revised:  On our image dataset, our model reaches a classification accuracy 95.2\%, a sensitivity 81.7\%, and specificity 97.1\% . Our model can potentially be used to facilitate an accurate and early detection of measles to help contain measles outbreaks.
Edit intent: clarity
Original:  On our curated image dataset, our model reaches a classification accuracy  95.2\%, a sensitivity 81.7\%, and specificity  97.1\% . Our model can potentially be used to facilitate an accurate and early detection of measles to help contain measles outbreaks.
Revised:  On our curated image dataset, our model reaches a classification accuracy of 95.2\%, a sensitivity 81.7\%, and specificity 97.1\% . Our model can potentially be used to facilitate an accurate and early detection of measles to help contain measles outbreaks.
Edit intent: fluency
Original:  On our curated image dataset, our model reaches a classification accuracy  95.2\%, a sensitivity 81.7\%, and specificity  97.1\% . Our model can potentially be used to facilitate an accurate and early detection of measles to help contain measles outbreaks.
Revised:  On our curated image dataset, our model reaches a classification accuracy 95.2\%, sensitivity of 81.7\%, and specificity 97.1\% . Our model can potentially be used to facilitate an accurate and early detection of measles to help contain measles outbreaks.
Edit intent: clarity
Original:  On our curated image dataset, our model reaches a classification accuracy  95.2\%, a sensitivity 81.7\%, and specificity  97.1\% . Our model can potentially be used to facilitate an accurate and early detection of measles to help contain measles outbreaks.
Revised:  On our curated image dataset, our model reaches a classification accuracy 95.2\%, a sensitivity 81.7\%, and specificity of 97.1\% . Our model can potentially be used to facilitate an accurate and early detection of measles to help contain measles outbreaks.
Edit intent: clarity
Original:  On our curated image dataset, our model reaches a classification accuracy  95.2\%, a sensitivity 81.7\%, and specificity  97.1\% . Our model can potentially be used to facilitate an accurate and early detection of measles to help contain measles outbreaks.
Revised:  On our curated image dataset, our model reaches a classification accuracy 95.2\%, a sensitivity 81.7\%, and specificity 97.1\% , indicating the model is effective in facilitating an accurate detection of measles to help contain measles outbreaks.
Edit intent: clarity
Original: In this work, we exploit the power of unambiguity for the complementation problem of B\"uchi automata by utilizing reduced run directed acyclic graphs (DAGs) over infinite words, in which each vertex has at most one predecessor.
Revised: In this work, we exploit the power of unambiguity for the complementation problem of B\"uchi automata by utilizing reduced run directed acyclic graphs (DAGs) over infinite words, in which each vertex has at most one predecessor.
Edit intent: fluency
Original:  Given a   B\"uchi  automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Revised:  We then show how to use this type of reduced run DAGs as a B\"uchi automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Edit intent: meaning-changed
Original:  Given a   B\"uchi  automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Revised:  Given aunified tool B\"uchi automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Edit intent: meaning-changed
Original:  Given a   B\"uchi  automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Revised:  Given a to optimize B\"uchi automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Edit intent: meaning-changed
Original:  Given a   B\"uchi  automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Revised:  Given a both B\"uchi automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Edit intent: clarity
Original:  Given a   B\"uchi  automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Revised:  Given a rank-based and slice-based complementation constructions for B\"uchi automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Edit intent: coherence
Original:  Given a   B\"uchi  automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Revised:  Given a B\"uchi automata with a finite degree of ambiguity. As a result, given a B\"uchi automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Edit intent: coherence
Original:  Given a   B\"uchi  automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Revised:  Given a B\"uchi automaton with n states and a finite degree of ambiguity, the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Edit intent: coherence
Original:  Given a   B\"uchi  automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Revised:  Given a B\"uchi automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical rank-based and slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Edit intent: fluency
Original:  Given a   B\"uchi  automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Revised:  Given a B\"uchi automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Edit intent: fluency
Original:  Given a   B\"uchi  automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Revised:  Given a B\"uchi automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Edit intent: fluency
Original:  Given a   B\"uchi  automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Revised:  Given a B\"uchi automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Edit intent: fluency
Original:  Given a   B\"uchi  automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from \mathcal{O ((3n)^n) , based on reduced run DAGs.
Revised:  Given a B\"uchi automaton with n states and a finite degree of ambiguity, we show that the number of states in the complementary B\"uchi automaton constructed by the classical Rank-based and Slice-based complementation constructions can be improved, respectively, to 2^{ \mathcal{O (n)} from 2^{ \mathcal{O (n\log n)} and to \mathcal{O (4^n) from O ((3n)^n) , based on reduced run DAGs.
Edit intent: fluency