wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our results  show that it is possible to train empirically robust NLP models using a much cheaper adversary.
Revised:  Our results show that it is possible to train robust NLP models using a much cheaper adversary.
Edit intent: clarity
Original:  We demonstrate that vanilla adversarial training with A2T can improve an NLP model's robustness to the attack it was originally trained with and also defend the model against other types of  attacks.
Revised:  We demonstrate that vanilla adversarial training with A2T can improve an NLP model's robustness to the attack it was originally trained with and also defend the model against other types of attacks.
Edit intent: clarity
Original:  Furthermore, we show that A2T can improve NLP models' standard accuracy, cross-domain generalization, and interpretability.
Revised:  Furthermore, we show that A2T can improve NLP models' standard accuracy, cross-domain generalization, and interpretability.
Edit intent: fluency
Original:  Herein, we propose an unsupervised 3D PET image denoising method based on  anatomical information-guided attention mechanism.
Revised:  Herein, we propose an unsupervised 3D PET image denoising method based on an anatomical information-guided attention mechanism.
Edit intent: fluency
Original:  Our proposed magnetic resonance-guided deep decoder (MR-GDD) utilizes the spatial details and semantic features of MR-guidance image more effectively by introducing encoder-decoder and deep decoder subnetworks.
Revised:  The proposed magnetic resonance-guided deep decoder (MR-GDD) utilizes the spatial details and semantic features of MR-guidance image more effectively by introducing encoder-decoder and deep decoder subnetworks.
Edit intent: fluency
Original:   Monte Carlo simulation using the [^{18}F]fluoro-2-deoxy-D-glucose (FDG) shows that the proposed method outperforms other denoising algorithms in terms of the highest peak signal-to-noise ratio and structural similarity ( 28.33\pm  dB/0.886 \pm \pm \pm \pm \pm \pm \pm \pm \pm  ).
Revised:  In a Monte Carlo simulation using the [^{18}F]fluoro-2-deoxy-D-glucose (FDG) shows that the proposed method outperforms other denoising algorithms in terms of the highest peak signal-to-noise ratio and structural similarity ( 28.33\pm dB/0.886 \pm \pm \pm \pm \pm \pm \pm \pm \pm ).
Edit intent: coherence
Original:   Monte Carlo simulation using the [^{18}F]fluoro-2-deoxy-D-glucose (FDG) shows that the proposed method outperforms other denoising algorithms in terms of the highest peak signal-to-noise ratio and structural similarity ( 28.33\pm  dB/0.886 \pm \pm \pm \pm \pm \pm \pm \pm \pm  ).
Revised:  Monte Carlo simulation of [^{18}F]fluoro-2-deoxy-D-glucose (FDG) shows that the proposed method outperforms other denoising algorithms in terms of the highest peak signal-to-noise ratio and structural similarity ( 28.33\pm dB/0.886 \pm \pm \pm \pm \pm \pm \pm \pm \pm ).
Edit intent: clarity
Original:   Monte Carlo simulation using the [^{18}F]fluoro-2-deoxy-D-glucose (FDG) shows that the proposed method outperforms other denoising algorithms in terms of the highest peak signal-to-noise ratio and structural similarity ( 28.33\pm  dB/0.886 \pm \pm \pm \pm \pm \pm \pm \pm \pm  ).
Revised:  Monte Carlo simulation using the [^{18}F]fluoro-2-deoxy-D-glucose (FDG) , the proposed method outperforms other denoising algorithms in terms of the highest peak signal-to-noise ratio and structural similarity ( 28.33\pm dB/0.886 \pm \pm \pm \pm \pm \pm \pm \pm \pm ).
Edit intent: coherence
Original:   Monte Carlo simulation using the [^{18}F]fluoro-2-deoxy-D-glucose (FDG) shows that the proposed method outperforms other denoising algorithms in terms of the highest peak signal-to-noise ratio and structural similarity ( 28.33\pm  dB/0.886 \pm \pm \pm \pm \pm \pm \pm \pm \pm  ).
Revised:  Monte Carlo simulation using the [^{18}F]fluoro-2-deoxy-D-glucose (FDG) shows that the proposed method achieved the highest peak signal-to-noise ratio and structural similarity ( 28.33\pm dB/0.886 \pm \pm \pm \pm \pm \pm \pm \pm \pm ).
Edit intent: clarity
Original:  For preclinical (using [^{18}F]FDG and [^{11}C]raclopride) and clinical (using [^{18}F]florbetapir) studies, the proposed method demonstrates state-of-the-art denoising performance while retaining spatial resolution and quantitative accuracy, despite using only a single architecture for various noisy PET images with 1/10th of the full counts.
Revised:  For preclinical (using [^{18}F]FDG and [^{11}C]raclopride) and clinical (using [^{18}F]florbetapir) studies, the proposed method demonstrates state-of-the-art denoising performance while retaining spatial resolution and quantitative accuracy, despite using a common network architecture for various noisy PET images with 1/10th of the full counts.
Edit intent: clarity
Original:  And a remarkably large proportion of orphan genes likely originatedde novo from non-genic regions.
Revised:  And a remarkably large proportion of orphan genes likely originated from non-genic regions.
Edit intent: clarity
Original:  Our results also demonstrate that intergenic regions are not inactive and silent but are more like dynamic storehouses of potential genes.
Revised:  Our results also demonstrate that intergenic regions are not inactive and silent , non-genic regions are likely to be dynamic storehouses of potential genes.
Edit intent: clarity
Original: Phylostratigraphy suggests that new genes are continually born \textit{de novo from non-genic sequences .
Revised: Phylostratigraphy suggests that new genes are continually born \textit{de novo from non-genic sequences .
Edit intent: fluency
Original:  While recent evidence supports the view that de novo %DIFDELCMD < \denovo %%%  gene birth is frequent and widespread, the mechanisms underlying this process are yet to be discovered.
Revised:  While recent evidence supports the view that %DIFDELCMD < \denovo %%% gene birth is frequent and widespread, the mechanisms underlying this process are yet to be discovered.
Edit intent: clarity
Original:  To demonstrate this possibility, we model this mechanism , within the boundaries set by current knowledge on mutation effects.
Revised:  To demonstrate this possibility, we model this mechanism within the boundaries set by current knowledge on mutation effects.
Edit intent: fluency
Original:  Estimates from this simple analysis are in line with observations of recurrent and extensive gene birth in genomics studies.
Revised:  Estimates from this analysis are in line with observations of recurrent and extensive gene birth in genomics studies.
Edit intent: clarity
Original:  Thus, we propose that  rather than being inactive and silent, non-genic regions are likely to be dynamic storehouses of potential genes.
Revised:  Thus, we propose that , rather than being inactive and silent, non-genic regions are likely to be dynamic storehouses of potential genes.
Edit intent: fluency
Original: Breast cancer is the most prevalent cancer worldwide and  over two million new cases are diagnosed each year.
Revised: Breast cancer is the most prevalent cancer worldwide and over two million new cases now diagnosed each year.
Edit intent: clarity
Original:  As part of the tumour gradingprocess , histopathologists manually count how many cells are dividing , in a biological process called mitosis.
Revised:  As part of diagnostic tumour grading , histopathologists manually count how many cells are dividing , in a biological process called mitosis.
Edit intent: clarity
Original:  methods have been developed to automatically detect mitotic figures , however these methods often perform poorly when applied to data from outside of the original (training)
Revised:  methods have been developed to automate the process , however these methods often perform poorly when applied to data from outside of the original (training)
Edit intent: clarity
Original:  domain, i.e. they do not generalise well to histology images created using varied staining protocolsor digitised using different scanners . Style transfer, a form of domain adaptation, provides the means to transform images from different domains to a shared visual appearance and have been adopted in various applications to mitigate the issue of domain shift.
Revised:  domain, i.e. they do not generalise well to variations in histological background, staining protocols, or scanner types . Style transfer, a form of domain adaptation, provides the means to transform images from different domains to a shared visual appearance and have been adopted in various applications to mitigate the issue of domain shift.
Edit intent: clarity
Original:  By comprehensive data augmentation and adapting existing popular detection architecture, our proposed method has achieved an F1 score of 0.7500 on the preliminary test set in MItosis DOmain Generalization (MIDOG) Challenge at MICCAI2021.
Revised:  By comprehensive data augmentation and adapting existing popular detection architecture, our proposed method has achieved an F1 score of 0.7500 on the preliminary test set in MItosis DOmain Generalization (MIDOG) Challenge at MICCAI 2021.
Edit intent: fluency
Original: In course of the organization of Workshop III entitled "Cited References Analysis Using CRExplorer" at the International Conference of the International Society for Scientometrics and Informetrics (ISSI2021), we have prepared three reference publication year spectroscopy (RPYS) analyzes :
Revised: In course of the organization of Workshop III entitled "Cited References Analysis Using CRExplorer" at the International Conference of the International Society for Scientometrics and Informetrics (ISSI2021), we have prepared three reference publication year spectroscopy (RPYS) analyses :
Edit intent: fluency
Original:  The first RPYS analysis has been presented live at the workshop and the second and third RPYS analyzes have been left to the participants for undertaking after the workshop.
Revised:  The first RPYS analysis has been presented live at the workshop and the second and third RPYS analyses have been left to the participants for undertaking after the workshop.
Edit intent: fluency
Original:  Here, we present our own results for all three RPYS analyzes so that the participants can compare their results with ours or can  additional help from this paper for performing these and other RPYS analyzes on their own.
Revised:  Here, we present our own results for all three RPYS analyses so that the participants can compare their results with ours or can additional help from this paper for performing these and other RPYS analyzes on their own.
Edit intent: fluency
Original:  Here, we present our own results for all three RPYS analyzes so that the participants can compare their results with ours or can  additional help from this paper for performing these and other RPYS analyzes on their own.
Revised:  Here, we present our own results for all three RPYS analyzes so that the participants can compare their results with ours or can get additional help from this paper for performing these and other RPYS analyzes on their own.
Edit intent: clarity
Original:  Here, we present our own results for all three RPYS analyzes so that the participants can compare their results with ours or can  additional help from this paper for performing these and other RPYS analyzes on their own.
Revised:  Here, we present our own results for all three RPYS analyzes so that the participants can compare their results with ours or can additional help from this paper for performing these and other RPYS analyses on their own.
Edit intent: fluency
Original:  The three RPYS analyzes have shown quite different seminal papers with a few overlaps.
Revised:  The three RPYS analyses have shown quite different seminal papers with a few overlaps.
Edit intent: fluency
Original:  Many of the foundational papers in the field of scientometrics (e.g., distributions of publications and citations ) , citation network and co-citation analyzes , and citation analysis with the aim of impact measurement and research evaluation  were retrieved as seminal papers of the papers published in Journal of Informetrics.
Revised:  Many of the foundational papers in the field of scientometrics (e.g., distributions of publications and citations , citation network and co-citation analyzes , and citation analysis with the aim of impact measurement and research evaluation were retrieved as seminal papers of the papers published in Journal of Informetrics.
Edit intent: fluency
Original:  Many of the foundational papers in the field of scientometrics (e.g., distributions of publications and citations ) , citation network and co-citation analyzes , and citation analysis with the aim of impact measurement and research evaluation  were retrieved as seminal papers of the papers published in Journal of Informetrics.
Revised:  Many of the foundational papers in the field of scientometrics (e.g., distributions of publications and citations ) , citation network and co-citation analyses , and citation analysis with the aim of impact measurement and research evaluation were retrieved as seminal papers of the papers published in Journal of Informetrics.
Edit intent: fluency
Original:  Many of the foundational papers in the field of scientometrics (e.g., distributions of publications and citations ) , citation network and co-citation analyzes , and citation analysis with the aim of impact measurement and research evaluation  were retrieved as seminal papers of the papers published in Journal of Informetrics.
Revised:  Many of the foundational papers in the field of scientometrics (e.g., distributions of publications and citations ) , citation network and co-citation analyzes , and citation analysis with the aim of impact measurement and research evaluation ) were retrieved as seminal papers of the papers published in Journal of Informetrics.
Edit intent: fluency
Original:  The RPYS analysis of the paper set published by Ludo Waltman mainly retrieved papers about network analyzes , citation relations, and citation impact measurement.
Revised:  The RPYS analysis of the paper set published by Ludo Waltman mainly retrieved papers about network analyses , citation relations, and citation impact measurement.
Edit intent: fluency
Original:  We provide evidence that the soft regularization in PINNs, which involves  differential operators, can introduce a number of subtle problems, including making the problem  ill-conditioned.
Revised:  We provide evidence that the soft regularization in PINNs, which involves differential operators, can introduce a number of subtle problems, including making the problem more ill-conditioned.
Edit intent: clarity
Original:  At the same time, we reveal that attackers are a small step removed from bringing about significantly higher amplification factors (14x).
Revised:  At the same time, we reveal that attackers are a small step away from bringing about significantly higher amplification factors (14x).
Edit intent: clarity
Original:  Finally, our results reveal that operators of various .gov names adhere to a DNSSEC key rollover scheme , which exacerbates amplification potential , and which we can verifiably connect  to misuses and attacker decision-making.
Revised:  Finally, our results reveal that operators of various .gov names do not adhere to DNSSEC key rollover scheme , which exacerbates amplification potential , and which we can verifiably connect to misuses and attacker decision-making.
Edit intent: clarity
Original:  Finally, our results reveal that operators of various .gov names adhere to a DNSSEC key rollover scheme , which exacerbates amplification potential , and which we can verifiably connect  to misuses and attacker decision-making.
Revised:  Finally, our results reveal that operators of various .gov names adhere to a DNSSEC key rollover best practices , which exacerbates amplification potential , and which we can verifiably connect to misuses and attacker decision-making.
Edit intent: clarity
Original:  Finally, our results reveal that operators of various .gov names adhere to a DNSSEC key rollover scheme , which exacerbates amplification potential , and which we can verifiably connect  to misuses and attacker decision-making.
Revised:  Finally, our results reveal that operators of various .gov names adhere to a DNSSEC key rollover scheme , which exacerbates amplification potential . We can verifiably connect to misuses and attacker decision-making.
Edit intent: coherence
Original:  Finally, our results reveal that operators of various .gov names adhere to a DNSSEC key rollover scheme , which exacerbates amplification potential , and which we can verifiably connect  to misuses and attacker decision-making.
Revised:  Finally, our results reveal that operators of various .gov names adhere to a DNSSEC key rollover scheme , which exacerbates amplification potential , and which we can verifiably connect this operational behavior to misuses and attacker decision-making.
Edit intent: clarity
Original:  Our model with the proposed training scheme shows good performance on MIDOG Preliminary Test-Set containing scanners never seen before.
Revised:  Our model with the proposed training scheme shows positive performance on MIDOG Preliminary Test-Set containing scanners never seen before.
Edit intent: clarity
Original:  Given a geometric representation of a unit disk graph, our PTAS's that find (1+\epsilon)-approximate solutions to the Minimum Dominating Set (MDS) and the Minimum Connected Dominating Set (MCDS) of the input graph  in time n^{O(1/\epsilon)}.
Revised:  Given a geometric representation of a unit disk graph, our PTAS's that find (1+\epsilon)-approximate solutions to the Minimum Dominating Set (MDS) and the Minimum Connected Dominating Set (MCDS) of the input graph run in time n^{O(1/\epsilon)}.
Edit intent: clarity
Original:  This can be compared to the best known n^{O(1/\epsilon \log {1/\epsilon})}-time PTAS by Nieberg and Hurink  [WAOA'05] for MDS that only uses graph structures and an n^{O(1/\epsilon^2)}-time PTAS for MCDS by Zhang, Gao, Wu, and Du  [J Glob Optim'09].
Revised:  This can be compared to the best known n^{O(1/\epsilon \log {1/\epsilon})}-time PTAS by Nieberg and Hurink ~ [WAOA'05] for MDS that only uses graph structures and an n^{O(1/\epsilon^2)}-time PTAS for MCDS by Zhang, Gao, Wu, and Du [J Glob Optim'09].
Edit intent: fluency
Original:  This can be compared to the best known n^{O(1/\epsilon \log {1/\epsilon})}-time PTAS by Nieberg and Hurink  [WAOA'05] for MDS that only uses graph structures and an n^{O(1/\epsilon^2)}-time PTAS for MCDS by Zhang, Gao, Wu, and Du  [J Glob Optim'09].
Revised:  This can be compared to the best known n^{O(1/\epsilon \log {1/\epsilon})}-time PTAS by Nieberg and Hurink [WAOA'05] for MDS that only uses graph structures and an n^{O(1/\epsilon^2)}-time PTAS for MCDS by Zhang, Gao, Wu, and Du ~ [J Glob Optim'09].
Edit intent: fluency
Original:  To mitigate this issue, the scientific community is working on the development of unsupervised anomaly detection (UAD) systems that learn from a training set containing only normal ( i.e., healthy) images , where abnormal samples (i. e., unhealthy) are detected and segmented based on how much they deviate from the learned distribution of normal samples.
Revised:  To mitigate this issue, the scientific community is working on the development of unsupervised anomaly detection (UAD) that requires only normal ( i.e., healthy) images , where abnormal samples (i. e., unhealthy) are detected and segmented based on how much they deviate from the learned distribution of normal samples.
Edit intent: clarity
Original:  To address this challenge, we propose a novel self-supervised UAD pre-training algorithm, named Multi-centred Strong Augmentation via Contrastive Learning (MSACL).
Revised:  To address this challenge, we propose a new self-supervised UAD pre-training algorithm, named Multi-centred Strong Augmentation via Contrastive Learning (MSACL).
Edit intent: clarity
Original:  To address this challenge, we propose a novel self-supervised UAD pre-training algorithm, named Multi-centred Strong Augmentation via Contrastive Learning (MSACL).
Revised:  To address this challenge, we propose a novel self-supervised pre-training algorithm, named Multi-centred Strong Augmentation via Contrastive Learning (MSACL).
Edit intent: clarity
Original:  The growing number of new HPC systems coming online are being furnished with various hardware components, engineered by competing industry entities, each having their own architectures and platforms to be supported.
Edit intent: coherence
Original:  While the increasing availability of these resources is in many cases pivotal to successful science, even the largest collaborations lack the computational expertise required for maximal exploitation of current hardware capabilities.
Revised:  While the increasing availability of HPC resources is in many cases pivotal to successful science, even the largest collaborations lack the computational expertise required for maximal exploitation of current hardware capabilities.
Edit intent: clarity
Original:  The need to maintain multiple platform-specific codebases further complicates matters, potentially adding a constraint on the number of machines that can be utilized.
Revised:  The need to maintain multiple platform-specific codebases further complicates matters, potentially adding constraints on machines that can be utilized.
Edit intent: clarity
Original:  Fortunately, numerous programming models are under development that aim to facilitate software solutions for heterogeneous computing  .
Revised:  Fortunately, numerous programming models are under development that aim to facilitate portable codes for heterogeneous computing .
Edit intent: clarity
Original:  On the one hand, it is conceivable that knowledge from one task could be useful for solving a related task .
Revised:  While conceivable that knowledge from one task could be useful for solving a related task .
Edit intent: clarity
Original:  On the other hand, it is also recognized that if not executed properly, transfer learning algorithms can in fact impair the learning performance instead of improving it - commonly known as negative transfer.
Revised:  On the other hand, it is also recognized that if not executed properly, transfer learning algorithms can impair the learning performance instead of improving it - commonly known as negative transfer.
Edit intent: coherence
Original:  On the other hand, it is also recognized that if not executed properly, transfer learning algorithms can in fact impair the learning performance instead of improving it - commonly known as negative transfer.
Revised:  On the other hand, it is also recognized that if not executed properly, transfer learning algorithms can in fact impair the learning performance instead of improving it -- commonly known as negative transfer.
Edit intent: fluency
Original:  The obtained bounds give valuable insights on the effect of prior knowledge for transfer learning in our formulation .
Revised:  The obtained bounds give valuable insights into the effect of prior knowledge for transfer learning in our formulation .
Edit intent: fluency
Original:  Lastly, we devise two (online) transfer learning algorithms that are amenable to practical implementations . Specifically, one algorithm does not require the parametric assumption , thus extending our results to more general models .
Revised:  Lastly, we devise two (online) transfer learning algorithms that are amenable to practical implementations , one of which does not require the parametric assumption , thus extending our results to more general models .
Edit intent: clarity
Original:  Lastly, we devise two (online) transfer learning algorithms that are amenable to practical implementations . Specifically, one algorithm does not require the parametric assumption , thus extending our results to more general models .
Revised:  Lastly, we devise two (online) transfer learning algorithms that are amenable to practical implementations . Specifically, one algorithm does not require the parametric assumption .
Edit intent: clarity