wanyu/IteraTeR_v2 huggingface dataset:
Original:  To assess  our evaluation method 's validity , we compared the Mean Opinion Scores (MOS), calculate using ratings collected with our implementation, and the MOS values from a standard laboratory experiment conducted according to the ITU-T Rec , P.835.
Revised:  To assess our evaluation method 's validity , we compared the Mean Opinion Scores (MOS), calculate using ratings collected with our implementation, and the MOS values from a standard laboratory experiment conducted according to the ITU-T Rec P.835.
Edit intent: fluency
Original:  Results of a round-robin test  showed that our implementation is  a highly reproducible evaluation method (PCC= 1.00 ).
Revised:  Results of a round-robin test showed that our implementation is also a highly reproducible evaluation method (PCC= 1.00 ).
Edit intent: clarity
Original:  We evaluate the quality of our room impulse responses on the real-world LibriSpeech test set created using real impulse responses from BUT ReverbDB and AIR datasets.
Revised:  We evaluate the quality of our room impulse responses on the real-world LibriSpeech test set created using real-world RIRs from BUT ReverbDB and AIR datasets.
Edit intent: clarity
Original:  Furthermore, [  we combine our synthetic data with synthetic impulse responses generated using acoustic simulators, and this combination can reduce the word error rate by up to 14.3\% in far-field speech recognition benchmarks.
Revised:  Furthermore, and AIR[ we combine our synthetic data with synthetic impulse responses generated using acoustic simulators, and this combination can reduce the word error rate by up to 14.3\% in far-field speech recognition benchmarks.
Edit intent: fluency
Original:  In particular, we augment the far-field speech training set by convolving our synthesized RIRs with  clean LibriSpeech dataset 1 . We evaluate the quality of our synthetic RIRs on the real-world LibriSpeech test set created using real-world RIRs from BUT ReverbDB 2%DIFDELCMD < ] %%% and AIR 3 datasets.
Revised:  In particular, we augment the far-field speech training set by convolving our synthesized RIRs with a clean LibriSpeech dataset 1 . We evaluate the quality of our synthetic RIRs on the real-world LibriSpeech test set created using real-world RIRs from BUT ReverbDB 2%DIFDELCMD < ] %%% and AIR 3 datasets.
Edit intent: fluency
Original:  In particular, we augment the far-field speech training set by convolving our synthesized RIRs with  clean LibriSpeech dataset 1 . We evaluate the quality of our synthetic RIRs on the real-world LibriSpeech test set created using real-world RIRs from BUT ReverbDB 2%DIFDELCMD < ] %%% and AIR 3 datasets.
Revised:  In particular, we augment the far-field speech training set by convolving our synthesized RIRs with clean LibriSpeech dataset . We evaluate the quality of our synthetic RIRs on the real-world LibriSpeech test set created using real-world RIRs from BUT ReverbDB 2%DIFDELCMD < ] %%% and AIR 3 datasets.
Edit intent: coherence
Original:  In particular, we augment the far-field speech training set by convolving our synthesized RIRs with  clean LibriSpeech dataset 1 . We evaluate the quality of our synthetic RIRs on the real-world LibriSpeech test set created using real-world RIRs from BUT ReverbDB 2%DIFDELCMD < ] %%% and AIR 3 datasets.
Revised:  In particular, we augment the far-field speech training set by convolving our synthesized RIRs with clean LibriSpeech dataset 1 . We evaluate the quality of our synthetic RIRs on the real-world LibriSpeech test set created using real-world RIRs from BUT ReverbDB %DIFDELCMD < ] %%% and AIR 3 datasets.
Edit intent: coherence
Original:  In particular, we augment the far-field speech training set by convolving our synthesized RIRs with  clean LibriSpeech dataset 1 . We evaluate the quality of our synthetic RIRs on the real-world LibriSpeech test set created using real-world RIRs from BUT ReverbDB 2%DIFDELCMD < ] %%% and AIR 3 datasets.
Revised:  In particular, we augment the far-field speech training set by convolving our synthesized RIRs with clean LibriSpeech dataset 1 . We evaluate the quality of our synthetic RIRs on the real-world LibriSpeech test set created using real-world RIRs from BUT ReverbDB 2%DIFDELCMD < ] %%% 3 datasets.
Edit intent: coherence
Original:  Our IR-GAN reports up to  8.95\% lower error rate than Geometric Acoustic Simulator (GAS) in far-field speech recognition benchmarks.
Revised:  Our IR-GAN reports up to an 8.95\% lower error rate than Geometric Acoustic Simulator (GAS) in far-field speech recognition benchmarks.
Edit intent: fluency
Original:  Its widespread usage has made it one of the most popular media for information propagation among  masses during any socially engaging event.
Revised:  Its widespread usage has made it one of the most popular media for information propagation among the masses during any socially engaging event.
Edit intent: fluency
Original:  We present several complementing insights into the investigative and sensational news stories from the same period.
Revised:  We present several complementary insights into the investigative and sensational news stories from the same period.
Edit intent: fluency
Original:  It is encouraging to see that, with barely a few training samples, POPNet has achieved superior performance on encrypted network traffic classification among the state-of-the-arts , and its performance is immune to the deduction of training samples .
Revised:  It is encouraging to see that, with barely a few training samples, POPNet has achieved superior performance on encrypted network traffic classification among the state-of-the-arts .
Edit intent: coherence
Original:  ]  Detecting and intercepting malicious requests are one of the most widely used ways against attacks in the network security.
Revised:  22] Detecting and intercepting malicious requests are one of the most widely used ways against attacks in the network security.
Edit intent: fluency
Original:  The results of RNN-IDS 22%DIFDELCMD < ] %%% in Table 1.
Revised:  The results of RNN-IDS %DIFDELCMD < ] %%% in Table 1.
Edit intent: clarity
Original:  As there are multiple types of ``networks'' utilized in this paper, we also give a careful introduction to both reaction networks and neural networks, in order to disambiguate the overlapping vocabulary in the two settings and to clearly highlight the role of each network's properties.
Revised:  As there are multiple types of "networks" utilized in this paper, we also give a careful introduction to both reaction networks and neural networks, in order to disambiguate the overlapping vocabulary in the two settings and to clearly highlight the role of each network's properties.
Edit intent: fluency
Original:  Finally, neural saliency analyses demonstrate a high correlation between the proposed QCNN features, class activation maps, and the input Mel-spectrogram .
Revised:  Neural saliency analyses demonstrate a high correlation between the proposed QCNN features, class activation maps, and the input Mel-spectrogram .
Edit intent: coherence
Original:  Finally, neural saliency analyses demonstrate a high correlation between the proposed QCNN features, class activation maps, and the input Mel-spectrogram .
Revised:  Finally, neural saliency analyses demonstrate a correlation between the proposed QCNN features, class activation maps, and the input Mel-spectrogram .
Edit intent: clarity
Original:  It is unique in its 1) focus on user generated content, 2) language and 3)  multi-modality  .
Revised:  It is unique in its 1) focus on user generated content, 2) language and 3) accommodation of multi-modality .
Edit intent: clarity
Original:  However, the most surprising result is obtained by a second order analysis for \mu=2: the threshold in creases with increasing proximity to the optimum.
Revised:  However, the most surprising result is obtained by a second order analysis for \mu=2: the threshold creases with increasing proximity to the optimum.
Edit intent: clarity
Original:  However, the most surprising result is obtained by a second order analysis for \mu=2: the threshold in creases with increasing proximity to the optimum.
Revised:  However, the most surprising result is obtained by a second order analysis for \mu=2: the threshold in INcreases with increasing proximity to the optimum.
Edit intent: fluency
Original:  In particular, the hardest region for optimization is not around the optimum.
Revised:  In particular, the hardest region for optimization is NOT around the optimum.
Edit intent: fluency
Original:   More recently, a direct method of the time-frequency approach, called signal separation operation (SSO), was introduced for multicomponent signal separation.
Revised:  More recently, a direct method of the time-frequency approach, called signal separation operation (SSO), was introduced for multi-component signal separation.
Edit intent: clarity
Original:  In this paper we propose a direct method of signal separation based on the adaptive continuous wavelet transform (CWT) .
Revised:  In the present paper, we propose a direct method of signal separation based on the adaptive continuous wavelet transform (CWT) .
Edit intent: fluency
Original:  We notice that the challenge baseline system generates fake X-vectors which are very similar to each other, significantly more so than those extracted from organic speakers.
Revised:  We observe that the challenge baseline system generates fake X-vectors which are very similar to each other, significantly more so than those extracted from organic speakers.
Edit intent: coherence
Original:  This difference arises from averaging many X-vectors from a pool of speakers in the anonymization processs , causing a loss of information.
Revised:  This difference arises from averaging many X-vectors from a pool of speakers in the anonymization process , causing a loss of information.
Edit intent: fluency
Original:  Our approach leads to an increase in EER of up to 16.8 \\%DIF < in males and 8.4\\% in females in scenarios where enrollment and trial %DIF > in males and 11.1\\% in females in scenarios where enrollment and  utterances are anonymized versus the baseline solution, demonstrating the diversity of our generated voices.
Revised:  Our approach leads to an increase in EER of up to 16.8 \\%DIF < in males and 8.4\\% in females in scenarios where enrollment and trial %DIF > in males and 11.1\\% in females in scenarios where enrollment and trial utterances are anonymized versus the baseline solution, demonstrating the diversity of our generated voices.
Edit intent: fluency
Original:  In addition, class weighting is used to compensate for some reasonable chord labels that are rarely seen in the training set.
Revised:  In addition, the class weights are used to compensate for some reasonable chord labels that are rarely seen in the training set.
Edit intent: clarity
Original:  Then obviously the estimate \|Ax\|\leq\|A\|\|x\| holds for the euclidian norm of Ax.
Revised:  Then obviously the estimate \|Ax\|\leq\|A\|\|x\| holds for the euclidean norm of Ax.
Edit intent: clarity
Original:  We have found that the knowledge levels of participants on quantum computing have increased for all levels of education (high school, B.Sc., M.Sc., Ph.D.) , regardless of department or gender.
Revised:  We have found that the knowledge levels of participants on quantum computing have increased for all levels of education , regardless of department or gender.
Edit intent: coherence
Original:  Following this , a shift in educational mindset considering teaching quantum computing as a generalized probability theory rather than a field emanating from physics is beginning to emerge.
Revised:  The purpose of this study is to demonstrate that a shift in educational mindset considering teaching quantum computing as a generalized probability theory rather than a field emanating from physics is beginning to emerge.
Edit intent: clarity
Original:  Following this , a shift in educational mindset considering teaching quantum computing as a generalized probability theory rather than a field emanating from physics is beginning to emerge.
Revised:  Following this , a shift in educational mindset which considers quantum computing as a generalized probability theory rather than a field emanating from physics is beginning to emerge.
Edit intent: clarity
Original:  To this end, in this study we have assessed the effectiveness of a three-day hands-on introduction to quantum programming workshop called QBronze, organized and administered by QWorld initiative, covering the Bronze material formulated according to this mindset.
Revised:  To this end, in this study we have assessed the effectiveness of a three-day hands-on introduction to quantum programming workshop called QBronze, organized and administered by QWorld initiative, covering an educational material formulated according to this mindset.
Edit intent: clarity
Original:  We have found that the knowledge levels of  participants on quantum computing have increased for all levels of education, regardless of department or gender.
Revised:  We have found that the knowledge levels of the participants on quantum computing have increased for all levels of education, regardless of department or gender.
Edit intent: fluency
Original:  Therefore, we argue that hands-on programming tasks based training workshops focusing on quantum computing as a generalized probability theory is an effective way to introduce quantum computing to a wider audience .
Revised:  Therefore, we argue that hands-on programming based approach focusing on quantum computing as a generalized probability theory is an effective way to introduce quantum computing to a wider audience .
Edit intent: clarity
Original:  Its shortcoming, however, is signal distortion (computation error) when channel gains  are different, which cannot be well solved by transmission power control alone in times of deep fading.
Revised:  Its shortcoming, however, is signal distortion when channel gains are different, which cannot be well solved by transmission power control alone in times of deep fading.
Edit intent: coherence
Original:  To address this issue, in this paper, we propose a multi-slot over-the-air computation (MS-AirComp) method for the sum estimation in fading channels.
Revised:  To address this issue, in this paper, we propose a multi-slot over-the-air computation (MS-AirComp) framework for the sum estimation in fading channels.
Edit intent: clarity
Original:  Analysis and simulations confirm that the proposed method effectively reduces the computation errormeanwhile controlling transmission power , compared with state-of-the-art methods.
Revised:  Analysis and simulations confirm that the proposed method can effectively reduce computation error , compared with state-of-the-art methods.
Edit intent: clarity
Original:  Despite of the fact that a first order interface boundary conditions is used, the splitting double sweep method demonstrates good stability properties with respect to the number of subdomains and the frequency even for heterogeneous media.
Revised:  Despite of the fact that first order interface boundary conditions is used, the splitting double sweep method demonstrates good stability properties with respect to the number of subdomains and the frequency even for heterogeneous media.
Edit intent: fluency
Original:  Despite of the fact that a first order interface boundary conditions is used, the splitting double sweep method demonstrates good stability properties with respect to the number of subdomains and the frequency even for heterogeneous media.
Revised:  Despite of the fact that a first order interface boundary conditions are used, the splitting double sweep method demonstrates good stability properties with respect to the number of subdomains and the frequency even for heterogeneous media.
Edit intent: fluency
Original:  Convergence is improved when compared to the double sweep method for all of our test cases: waveguide, open cavity and wedge problems.
Revised:  In this context, convergence is improved when compared to the double sweep method for all of our test cases: waveguide, open cavity and wedge problems.
Edit intent: clarity
Original:  Quantum superpositions of graphs crucially require node names for their correct alignment, as we demonstrate through a non-signalling argument.
Revised:  We argue that, crucially, quantum superpositions of graphs crucially require node names for their correct alignment, as we demonstrate through a non-signalling argument.
Edit intent: clarity
Original:  Quantum superpositions of graphs crucially require node names for their correct alignment, as we demonstrate through a non-signalling argument.
Revised:  Quantum superpositions of graphs require node names for their correct alignment, as we demonstrate through a non-signalling argument.
Edit intent: clarity
Original:  Quantum superpositions of graphs crucially require node names for their correct alignment, as we demonstrate through a non-signalling argument.
Revised:  Quantum superpositions of graphs crucially require node names for their correct alignment, which we demonstrate through a non-signalling argument.
Edit intent: fluency
Original:  Quantum superpositions of graphs crucially require node names for their correct alignment, as we demonstrate through a non-signalling argument.
Revised:  Quantum superpositions of graphs crucially require node names for their correct alignment, as we demonstrate through a no-signalling argument.
Edit intent: fluency
Original:  We  show how to impose renaming invariance at the level of graphs and their quantum superpositions .
Revised:  We show how to impose renaming invariance at the level of quantum superpositions of graphs .
Edit intent: clarity
Original: Log-based cyber threat hunting has emerged as an important solution to counter sophisticated cyber attacks.
Revised: Log-based cyber threat hunting has emerged as an important solution to counter sophisticated attacks.
Edit intent: fluency
Original:  However, existing approaches require non-trivial efforts of manual query construction and have overlooked the rich external knowledge about threat behaviors provided by open-source Cyber Threat Intelligence (OSCTI).
Revised:  However, existing approaches require non-trivial efforts of manual query construction and have overlooked the rich external threat knowledge provided by open-source Cyber Threat Intelligence (OSCTI).
Edit intent: clarity
Original:  To bridge the gap, we propose EffHunter , a system that facilitates cyber threat hunting in computer systems using OSCTI.
Revised:  To bridge the gap, we propose EffHunter , a system that facilitates threat hunting in computer systems using OSCTI.
Edit intent: clarity
Original:  Built upon mature system auditing frameworks, EffHunter provides (1)
Revised:  Built upon system auditing frameworks, EffHunter provides (1)
Edit intent: clarity
Original:  We show that these vulnerabilities are amplified by abusive behaviors associated with so-called ''follow trains'' on Twitter, in which long lists of like-minded accounts are mentioned for others to follow.
Revised:  We show that these vulnerabilities are amplified by abusive behaviors associated with so-called "follow trains" on Twitter, in which long lists of like-minded accounts are mentioned for others to follow.
Edit intent: fluency
Original:  This leads to the formation of highly dense and hierarchical echo chambers.
Edit intent: coherence
Original:  These accounts engage in various suspicious behaviors , including some that violate platform policies: we find evidence of  inauthentic automated accounts , artificial inflation of friends and followers, and abnormal content deletion .
Revised:  These accounts engage in various suspicious behaviors , including some that violate platform policies: we find evidence of activity by inauthentic automated accounts , artificial inflation of friends and followers, and abnormal content deletion .
Edit intent: clarity
Original:  These accounts engage in various suspicious behaviors , including some that violate platform policies: we find evidence of  inauthentic automated accounts , artificial inflation of friends and followers, and abnormal content deletion .
Revised:  These accounts engage in various suspicious behaviors , including some that violate platform policies: we find evidence of inauthentic automated accounts and abnormal content deletion .
Edit intent: coherence
Original:  The development of efficient optimization methods for two-player min-max games is an active area of research with a timely impact on adversarial formulations including generative adversarial networks (GANs) . Existing methods for this type of problem typically employ intuitive, carefully hand-designed mechanisms for controlling the problematic rotational dynamics commonly encountered during optimization .
Revised:  The development of efficient optimization methods for two-player min-max games. A central obstacle in the optimization of such games is the rotational dynamics that hinder their convergence . Existing methods for this type of problem typically employ intuitive, carefully hand-designed mechanisms for controlling the problematic rotational dynamics commonly encountered during optimization .
Edit intent: clarity
Original:  The development of efficient optimization methods for two-player min-max games is an active area of research with a timely impact on adversarial formulations including generative adversarial networks (GANs) . Existing methods for this type of problem typically employ intuitive, carefully hand-designed mechanisms for controlling the problematic rotational dynamics commonly encountered during optimization .
Revised:  The development of efficient optimization methods for two-player min-max games is an active area of research with a timely impact on adversarial formulations including generative adversarial networks (GANs) . Existing methods typically employ intuitive, carefully hand-designed mechanisms for controlling the problematic rotational dynamics commonly encountered during optimization .
Edit intent: clarity
Original:  The development of efficient optimization methods for two-player min-max games is an active area of research with a timely impact on adversarial formulations including generative adversarial networks (GANs) . Existing methods for this type of problem typically employ intuitive, carefully hand-designed mechanisms for controlling the problematic rotational dynamics commonly encountered during optimization .
Revised:  The development of efficient optimization methods for two-player min-max games is an active area of research with a timely impact on adversarial formulations including generative adversarial networks (GANs) . Existing methods for this type of problem typically employ intuitive, carefully hand-designed mechanisms for controlling such rotations .
Edit intent: clarity
Original:  In this work , we take a novel approach to address this issue by casting min-max optimization as a physical system.
Revised:  In this paper , we take a novel approach to address this issue by casting min-max optimization as a physical system.
Edit intent: clarity
Original:  We propose LEAD (Least-Action Dynamics), a second-order optimizer that uses the principle of least-action from physics to discover an efficient optimizer for min-max games.
Revised:  We leverage tools from physics to introduce LEAD (Least-Action Dynamics), a second-order optimizer that uses the principle of least-action from physics to discover an efficient optimizer for min-max games.
Edit intent: clarity
Original:  We propose LEAD (Least-Action Dynamics), a second-order optimizer that uses the principle of least-action from physics to discover an efficient optimizer for min-max games.
Revised:  We propose LEAD (Least-Action Dynamics), a second-order optimizer for min-max games.
Edit intent: coherence
Original:  Finally, we empirically test our method on synthetic problems and GANs to demonstrate improvements over baseline methods.
Revised:  Finally, we empirically evaluate our method on synthetic problems and GANs to demonstrate improvements over baseline methods.
Edit intent: clarity