wanyu/IteraTeR_v2 huggingface dataset:
Original:  Existing approaches to detect malicious campaigns make strict assumptions about coordinated behaviours, such as malicious accounts perform synchronized actions or share features assumed to be indicative of coordination.
Revised:  Existing approaches to detect coordinated accounts either make very strict assumptions about coordinated behaviours, such as malicious accounts perform synchronized actions or share features assumed to be indicative of coordination.
Edit intent: clarity
Original:  Others require part of the malicious accounts in the campaign to be revealed in order to detect the rest.
Revised:  Others require part of the malicious accounts in the coordinated group to be revealed in order to detect the rest.
Edit intent: clarity
Original: There is a growing concern and awareness about the right-to-be-forgotten issues among regulators as well as users all over the world .
Revised: Social platforms are heavily used by individuals to share their thoughts and personal information. However, due to regret over time about posting inappropriate social content, embarrassment, or even life or relationship changes, some past posts might also pose serious privacy concerns for them .
Edit intent: coherence
Original:  To cope with these privacy concerns, social platforms offer deletion mechanisms that give the users the opportunity to remove their contents and in some cases the platforms remove them automatically .
Revised:  To cope with these privacy concerns, social platforms offer deletion mechanisms that allow users to remove their contents and in some cases the platforms remove them automatically .
Edit intent: clarity
Original:  To cope with these privacy concerns, social platforms offer deletion mechanisms that give the users the opportunity to remove their contents and in some cases the platforms remove them automatically .
Revised:  To cope with these privacy concerns, social platforms offer deletion mechanisms that give the users the opportunity to remove their contents . Quite naturally, these deletion mechanisms are really useful for removing past posts as and when needed .
Edit intent: coherence
Original:  However, this leaves the users vulnerable to attacks by adversaries who specifically seek the damaging content of the users and exploit the act of deletion as a strong signal for it.
Revised:  However, these same mechanisms also leave the users potentially vulnerable to attacks by adversaries who specifically seek the damaging content of the users and exploit the act of deletion as a strong signal for it.
Edit intent: clarity
Original:  However, this leaves the users vulnerable to attacks by adversaries who specifically seek the damaging content of the users and exploit the act of deletion as a strong signal for it.
Revised:  However, this leaves the users vulnerable to attacks by adversaries who specifically seek the users' damaging content and exploit the act of deletion as a strong signal for it.
Edit intent: clarity
Original:  In this paper, we conduct a user study on 191 participants to study their prior deletion experiences, their expectations of deletion privacy, and how effective do they find the current deletion mechanisms.
Revised:  In this paper, we conduct a user survey-based exploration involving 191 participants to study their prior deletion experiences, their expectations of deletion privacy, and how effective do they find the current deletion mechanisms.
Edit intent: clarity
Original:  In this paper, we conduct a user study on 191 participants to study their prior deletion experiences, their expectations of deletion privacy, and how effective do they find the current deletion mechanisms.
Revised:  In this paper, we conduct a user study on 191 participants to unpack their prior deletion experiences, their expectations of deletion privacy, and how effective do they find the current deletion mechanisms.
Edit intent: clarity
Original:  In this paper, we conduct a user study on 191 participants to study their prior deletion experiences, their expectations of deletion privacy, and how effective do they find the current deletion mechanisms.
Revised:  In this paper, we conduct a user study on 191 participants to study their prior deletion experiences, their expectations of deletion privacy, and how effective they find the current deletion mechanisms.
Edit intent: fluency
Original:  While the participants identified the irrelevancy of the content due to time passing  as the main reason for removing their contents, a majority of the participant believe that deletions indicate that the deleted content includes some damaging information to the owner.
Revised:  While the participants identified the irrelevancy ( due to time passing as the main reason for removing their contents, a majority of the participant believe that deletions indicate that the deleted content includes some damaging information to the owner.
Edit intent: clarity
Original:  While the participants identified the irrelevancy of the content due to time passing  as the main reason for removing their contents, a majority of the participant believe that deletions indicate that the deleted content includes some damaging information to the owner.
Revised:  While the participants identified the irrelevancy of the content due to time passing ) as the main reason for removing their contents, a majority of the participant believe that deletions indicate that the deleted content includes some damaging information to the owner.
Edit intent: fluency
Original:  While the participants identified the irrelevancy of the content due to time passing  as the main reason for removing their contents, a majority of the participant believe that deletions indicate that the deleted content includes some damaging information to the owner.
Revised:  While the participants identified the irrelevancy of the content due to time passing as the main reason for content removal, most of them believed that deletions indicate that the deleted content includes some damaging information to the owner.
Edit intent: clarity
Original:  Importantly, the participants are significantly more concerned about their deletions being noticed by large-scale data collectors (e.g., a third-party data collecting company or the government) than any other individual from their social circle.
Revised:  Importantly, the participants are significantly more concerned about their deletions being noticed by large-scale data collectors (e.g., the government) than any other individual from their social circle.
Edit intent: clarity
Original:  Importantly, the participants are significantly more concerned about their deletions being noticed by large-scale data collectors (e.g., a third-party data collecting company or the government) than any other individual from their social circle.
Revised:  Importantly, the participants are significantly more concerned about their deletions being noticed by large-scale data collectors (e.g., a third-party data collecting company or the government) than individuals from their social circle.
Edit intent: clarity
Original:  Further, a third of the participants think that they can be attacked by these large-scale data collectors.
Edit intent: coherence
Original:  Finally, the participants find the current deletion mechanisms to be inadequate in protecting the privacy of their deletionsand provide guidelines for the future of deletion mechanisms .
Revised:  Finally, the participants felt that popular deletion mechanisms are not very effective in protecting the privacy of their deletionsand provide guidelines for the future of deletion mechanisms .
Edit intent: clarity
Original:  Finally, the participants find the current deletion mechanisms to be inadequate in protecting the privacy of their deletionsand provide guidelines for the future of deletion mechanisms .
Revised:  Finally, the participants find the current deletion mechanisms to be inadequate in protecting the privacy of those deletions .
Edit intent: clarity
Original: Our analysis relies on a close relationship of this problem to some intrinsic properties of random permutations related to the rencontres number (which is the number of n-permutations with a given number of fixed points) .
Revised: Our analysis relies on a close relationship of this problem to some intrinsic properties of random permutations related to the rencontres number .
Edit intent: coherence
Original: All societies , have been much more bipolar over the past few years, particularly after the emergence of online social networks and media.
Revised: All societies have been much more bipolar over the past few years, particularly after the emergence of online social networks and media.
Edit intent: fluency
Original: We present a deep neural network multigrid solver (DNN-MG) that we develop for the instationary Navier-Stokes equations.
Revised: We present the deep neural network multigrid solver (DNN-MG) that we develop for the instationary Navier-Stokes equations.
Edit intent: fluency
Original:  The multigrid method is used in DNN-MG to solve on coarse levels while the neural network corrects interpolated solutions on fine ones, thus avoiding the increasingly expensive computations that would have to be performed on there.
Revised:  DNN-MG to solve on coarse levels while the neural network corrects interpolated solutions on fine ones, thus avoiding the increasingly expensive computations that would have to be performed on there.
Edit intent: clarity
Original:  A reduction in computation time is thereby achieved through DNN-MG's highly compact neural network.
Revised:  A reduction in computation time through DNN-MG's highly compact neural network.
Edit intent: clarity
Original:  Furthermore, the network's locality facilitates generalizability and allows one to use DNN-MG trained on one mesh domain also on an entirely different one .
Revised:  Furthermore, the network's locality facilitates generalizability and allows one to use DNN-MG trained on one mesh domain also on different ones .
Edit intent: clarity
Original:  However, despite the high speed and energy efficiency of neuromorphic computing, algorithms utilizing this hardware in control scenarios are still missing .
Revised:  However, despite the high speed and energy efficiency of neuromorphic computing, algorithms utilizing this hardware in control scenarios are still rare .
Edit intent: clarity
Original:  Another problem is to enable the execution of complex trajectories, requiring the spiking activity to contain sufficient variability, while at the same time, for reliable performance, network dynamics require adequate robustness against noise.
Revised:  Another problem is the execution of complex trajectories, requiring the spiking activity to contain sufficient variability, while at the same time, for reliable performance, network dynamics require adequate robustness against noise.
Edit intent: clarity
Original:  Taken together, our study presents a new algorithm that allows the control of complex robotic movements  using state of the art neuromorphic hardware.
Revised:  Taken together, our study presents a new algorithm that allows the generation of complex robotic movements using state of the art neuromorphic hardware.
Edit intent: clarity
Original:  We showed the images and the correct labelsto 150 online crowd workers and asked them to select the incorrectly predicted labels with or without showing them the machine-generated visual interpretations.
Revised:  We showed the images and the correct labels to 150 online crowd workers and asked them to select the incorrectly predicted labels with or without showing them the machine-generated visual interpretations.
Edit intent: fluency
Original: We answer an open complexity question by Hofman, Lasota, Mayr, Totzke (LMCS 2016) HLMT16 for simulation preorder  of succinct one-counter nets (i.e., one-counter automata with no zero tests where counter increments and decrements are integers written in binary) , by showing that all relations between bisimulation equivalence and simulation preorder are EXPSPACE-hard for these nets .
Revised: We answer an open complexity question by Hofman, Lasota, Mayr, Totzke (LMCS 2016) for simulation preorder of succinct one-counter nets (i.e., one-counter automata with no zero tests where counter increments and decrements are integers written in binary) , by showing that all relations between bisimulation equivalence and simulation preorder are EXPSPACE-hard for these nets .
Edit intent: clarity
Original: We answer an open complexity question by Hofman, Lasota, Mayr, Totzke (LMCS 2016) HLMT16 for simulation preorder  of succinct one-counter nets (i.e., one-counter automata with no zero tests where counter increments and decrements are integers written in binary) , by showing that all relations between bisimulation equivalence and simulation preorder are EXPSPACE-hard for these nets .
Revised: We answer an open complexity question by Hofman, Lasota, Mayr, Totzke (LMCS 2016) HLMT16 for simulation preorder on the class of succinct one-counter nets (i.e., one-counter automata with no zero tests where counter increments and decrements are integers written in binary) , by showing that all relations between bisimulation equivalence and simulation preorder are EXPSPACE-hard for these nets .
Edit intent: clarity
Original:  We describe a reduction from reachability games whose EXPSPACE-completeness in the case of succinct one-counter nets was shown by Hunter  RP 2015  , by using other results.
Revised:  We describe a reduction from reachability games whose EXPSPACE-completeness in the case of succinct one-counter nets was shown by Hunter ( RP 2015 , by using other results.
Edit intent: fluency
Original:  We describe a reduction from reachability games whose EXPSPACE-completeness in the case of succinct one-counter nets was shown by Hunter  RP 2015  , by using other results.
Revised:  We describe a reduction from reachability games whose EXPSPACE-completeness in the case of succinct one-counter nets was shown by Hunter RP 2015 ) , by using other results.
Edit intent: fluency
Original:  We also provide a direct self-contained EXPSPACE-completeness proof for a special case of such reachability games, namely for a modification of countdown games that were shown EXPTIME-complete by Jurdzinski, Sproston, Laroussinie  LMCS 2008  ;
Revised:  We also provide a direct self-contained EXPSPACE-completeness proof for a special case of such reachability games, namely for a modification of countdown games that were shown EXPTIME-complete by Jurdzinski, Sproston, Laroussinie ( LMCS 2008 ;
Edit intent: fluency
Original:  We also provide a direct self-contained EXPSPACE-completeness proof for a special case of such reachability games, namely for a modification of countdown games that were shown EXPTIME-complete by Jurdzinski, Sproston, Laroussinie  LMCS 2008  ;
Revised:  We also provide a direct self-contained EXPSPACE-completeness proof for a special case of such reachability games, namely for a modification of countdown games that were shown EXPTIME-complete by Jurdzinski, Sproston, Laroussinie LMCS 2008 ) ;
Edit intent: fluency
Original:  We also present  a new simplified proof of the belt theorem that gives a simple graphic presentation of simulation preorder on  one-counter nets and leads to a polynomial-space algorithm ;
Revised:  We also present a new simplified proof of the belt theorem that yields a simple graphic presentation of simulation preorder on one-counter nets and leads to a polynomial-space algorithm ;
Edit intent: clarity
Original:  Existing text summarization methods generally focus on a single aspect of text when selecting the sentences, causing  potential loss of essential information.
Revised:  Existing text summarization methods generally focus on a single aspect of text when selecting sentences, causing potential loss of essential information.
Edit intent: clarity
Original:  Existing text summarization methods generally focus on a single aspect of text when selecting the sentences, causing  potential loss of essential information.
Revised:  Existing text summarization methods generally focus on a single aspect of text when selecting the sentences, causing the potential loss of essential information.
Edit intent: fluency
Original:  We propose a domain-specific method that models a document as a multi-layer graph to enable processing multiple features of the text  at the same time.
Revised:  In this study, we propose a domain-specific method that models a document as a multi-layer graph to enable processing multiple features of the text at the same time.
Edit intent: clarity
Original:  We propose a domain-specific method that models a document as a multi-layer graph to enable processing multiple features of the text  at the same time.
Revised:  We propose a domain-specific method that models a document as a multi-layer graph to enable multiple features of the text at the same time.
Edit intent: clarity
Original:  The features we used in this paper are word similarity, semantic similarity, and co-reference similarity that are modeled as three different layers.
Revised:  The features we used in this paper are word similarity, semantic similarity, and co-reference similarity , which are modelled as three different layers.
Edit intent: fluency
Original:  The proposed MultiGBS algorithm employs UMLS and extracts  concepts and relationships with different tools such as SemRep, MetaMap, and OGER.
Revised:  The proposed MultiGBS algorithm employs UMLS and extracts the concepts and relationships with different tools such as SemRep, MetaMap, and OGER.
Edit intent: fluency
Original:  The proposed MultiGBS algorithm employs UMLS and extracts  concepts and relationships with different tools such as SemRep, MetaMap, and OGER.
Revised:  The proposed MultiGBS algorithm employs UMLS and extracts concepts and relationships using different tools such as SemRep, MetaMap, and OGER.
Edit intent: fluency
Original:  Extensive evaluation by ROUGE and BertScore shows increased F-measure values . Compared with leveraging BERT as extractive text summarization, the improvements in F-measure are 0.141 for ROUGE-L, 0.014 for ROUGE-1, 0.018 for ROUGE-2, 0.024 for ROUGE-SU4, and 0.0094 for BertScore .
Revised:  Extensive evaluation by ROUGE and BERTScore shows increased F-measure values . Compared with leveraging BERT as extractive text summarization, the improvements in F-measure are 0.141 for ROUGE-L, 0.014 for ROUGE-1, 0.018 for ROUGE-2, 0.024 for ROUGE-SU4, and 0.0094 for BertScore .
Edit intent: clarity
Original:  Extensive evaluation by ROUGE and BertScore shows increased F-measure values . Compared with leveraging BERT as extractive text summarization, the improvements in F-measure are 0.141 for ROUGE-L, 0.014 for ROUGE-1, 0.018 for ROUGE-2, 0.024 for ROUGE-SU4, and 0.0094 for BertScore .
Revised:  Extensive evaluation by ROUGE and BertScore shows increased F-measure values .
Edit intent: coherence
Original:  In particular, this result disproves a conjecture in [Acharya et al. 2017] that the profile maximum likelihood (PML) plug-in approach is optimal in property estimation for all ranges of \varepsilon, and confirms a conjecture in [Han and Shiragur, 2020 ] that their competitive analysis of the PML is tight.
Revised:  In particular, this result disproves a conjecture in [Acharya et al. 2017] that the profile maximum likelihood (PML) plug-in approach is optimal in property estimation for all ranges of \varepsilon, and confirms a conjecture in [Han and Shiragur, 2021 ] that their competitive analysis of the PML is tight.
Edit intent: fluency
Original: We study the individuality of  human voice with re-spect to a widely used feature representation of speech utterances, namely, the i-vector model.
Revised: We study the individuality of the human voice with re-spect to a widely used feature representation of speech utterances, namely, the i-vector model.
Edit intent: fluency
Original: We study the individuality of  human voice with re-spect to a widely used feature representation of speech utterances, namely, the i-vector model.
Revised: We study the individuality of human voice with respect to a widely used feature representation of speech utterances, namely, the i-vector model.
Edit intent: fluency
Original:  As a first step toward this goal, wecompare and contrast uniqueness measures proposed consideringdifferent biometric modalities.
Revised:  As a first step toward this goal, we compare and contrast uniqueness measures proposed consideringdifferent biometric modalities.
Edit intent: fluency
Original:  As a first step toward this goal, wecompare and contrast uniqueness measures proposed consideringdifferent biometric modalities.
Revised:  As a first step toward this goal, wecompare and contrast uniqueness measures proposed for different biometric modalities.
Edit intent: fluency
Original:  Then, we introduce a more appro-priate uniqueness measure that evaluates the entropy of i-vectorswhile taking into account speaker level variations.
Revised:  Then, we introduce a new uniqueness measure that evaluates the entropy of i-vectorswhile taking into account speaker level variations.
Edit intent: clarity
Original:  Then, we introduce a more appro-priate uniqueness measure that evaluates the entropy of i-vectorswhile taking into account speaker level variations.
Revised:  Then, we introduce a more appro-priate uniqueness measure that evaluates the entropy of i-vectors while taking into account speaker level variations.
Edit intent: fluency
Original:  By using this data, we analyzed how severalfactors , such as the number of speakers, number of samples perspeakers, and different levels of within-speaker variation affectestimates .
Revised:  By using this data, we analyzed how several factors , such as the number of speakers, number of samples perspeakers, and different levels of within-speaker variation affectestimates .
Edit intent: clarity
Original:  By using this data, we analyzed how severalfactors , such as the number of speakers, number of samples perspeakers, and different levels of within-speaker variation affectestimates .
Revised:  By using this data, we analyzed how severalfactors , such as the number of speakers, number of samples per speaker, sample durations, and diversity of utterances affect uniqueness estimates .
Edit intent: clarity
Original:  Most notably, we determined that the discretizationof i-vector elements does not necessarily cause a reduction inspeaker recognition performance.
Revised:  Most notably, we determine that the discretization of i-vectors does not cause a reduction inspeaker recognition performance.
Edit intent: clarity
Original:  Most notably, we determined that the discretizationof i-vector elements does not necessarily cause a reduction inspeaker recognition performance.
Revised:  Most notably, we determined that the discretizationof i-vector elements does not necessarily cause a reduction in speaker recognition performance.
Edit intent: fluency
Original: The ever-increasing computational demand of Deep Learning has propelled research in special-purpose inference accelerators based on emerging non-volatile memory (NVM) technologies.
Revised: The increasing computational demand of Deep Learning has propelled research in special-purpose inference accelerators based on emerging non-volatile memory (NVM) technologies.
Edit intent: clarity
Original:  Such NVM crossbars promise fast and energy-efficient in-situ matrix vector multiplications (MVM) thus alleviating the long-standing von Neuman bottleneck in today's digital hardware.
Revised:  Such NVM crossbars promise fast and energy-efficient in-situ Matrix Vector Multiplication (MVM) thus alleviating the long-standing von Neuman bottleneck in today's digital hardware.
Edit intent: fluency
Original:  However  the analog nature of computing in these NVM crossbars introduces approximations in the MVM operations .
Revised:  However , the analog nature of computing in these NVM crossbars introduces approximations in the MVM operations .
Edit intent: coherence