wanyu/IteraTeR_v2 huggingface dataset:
Original:  removes N_A particles from both \{ %DIFDELCMD < \bx%%%  _i\}_{i=1}^P and \{ %DIFDELCMD < \by%%%  _i\}_{i=1}^M simultaneously, yielding another empirical signed measure \nu such that \int f %DIFDELCMD < \D %%%  \nu approximates to \int f %DIFDELCMD < \D %%%  \mu within an acceptable accuracy for suitable test functions f. 62G09 Such annihilation of particles carrying opposite importance weights has been extensively utilized for alleviating the numerical sign problem in particle simulations.
Revised:  removes N_A particles from both \{ %DIFDELCMD < \bx%%% _i\}_{i=1}^P and \{ %DIFDELCMD < \by%%% _i\}_{i=1}^M simultaneously, yielding another empirical signed measure \nu such that \int f %DIFDELCMD < \D %%% d \nu approximates to \int f %DIFDELCMD < \D %%% \mu within an acceptable accuracy for suitable test functions f. 62G09 Such annihilation of particles carrying opposite importance weights has been extensively utilized for alleviating the numerical sign problem in particle simulations.
Edit intent: clarity
Original:  We validate the method using three disparate datasets, showing state-of-the-art performance in white matter lesion segmentation while simultaneously segmenting dozens of other brain structures.
Revised:  We validate the method using three disparate datasets, showing robust performance in white matter lesion segmentation while simultaneously segmenting dozens of other brain structures.
Edit intent: clarity
Original:  This often requires reusing and integrating heterogeneous information.
Revised:  This often requires aggregating, reusing, and integrating heterogeneous information.
Edit intent: clarity
Original:  Supplementary spreadsheets to journal articles are a key data source.
Revised:  Supplementary spreadsheets to articles are a key data source.
Edit intent: clarity
Original:  However, spreadsheets are often difficult to reanalyze because they capture data ad hoc without schemas that outline the objects, relationships, and attributes that they represent.
Revised:  However, spreadsheets are often difficult to reanalyze because they capture data ad hoc without schemas that define the objects, relationships, and attributes that they represent.
Edit intent: clarity
Original:  We show that novel splitting methods are able to substantially improve the accuracy and efficiency of DPD simulations in a wide range of the friction coefficients, particularly in the extremely large friction limit that corresponds to a fluid-like Schmidt number, a key issue in DPD.
Revised:  We propose a new splitting method that is able to substantially improve the accuracy and efficiency of DPD simulations in a wide range of the friction coefficients, particularly in the extremely large friction limit that corresponds to a fluid-like Schmidt number, a key issue in DPD.
Edit intent: clarity
Original:  Various numerical experiments  are performed to demonstrate the superiority of the newly proposed methods over popular alternative schemes in the literature.
Revised:  Various numerical experiments are performed to demonstrate the superiority of the newly proposed method over popular alternative schemes in the literature.
Edit intent: fluency
Original:  Then  realistic attacks are presented by considering channel effects from the adversary to each receiver.
Revised:  Then , realistic attacks are presented by considering channel effects from the adversary to each receiver.
Edit intent: fluency
Original:  The major vulnerability of modulation classifiers to over-the-air adversarial attacks is shown by accounting for different levels of information available about channel, transmitter input, and  classifier model.
Revised:  The major vulnerability of modulation classifiers to over-the-air adversarial attacks is shown by accounting for different levels of information available about the channel, the transmitter input, and classifier model.
Edit intent: fluency
Original:  The major vulnerability of modulation classifiers to over-the-air adversarial attacks is shown by accounting for different levels of information available about channel, transmitter input, and  classifier model.
Revised:  The major vulnerability of modulation classifiers to over-the-air adversarial attacks is shown by accounting for different levels of information available about channel, transmitter input, and the classifier model.
Edit intent: fluency
Original:  Finally, a certified defense based on randomized smoothing that augments training data with noise is introduced to make  modulation classifier robust to adversarial perturbations.
Revised:  Finally, a certified defense based on randomized smoothing that augments training data with noise is introduced to make the modulation classifier robust to adversarial perturbations.
Edit intent: fluency
Original:  We conclude that the two notions of significance described by being a featured review article and being highly cited are substantially distinct.
Revised:  We conclude that the two notions of significance described by being a featured review article and being highly cited are distinct.
Edit intent: clarity
Original:  In another direction, we consider how hiring patterns of subfields and mathematicians' interest in subfields may be assessed in terms of the subfields of featured review and highly cited articles  .
Revised:  In another direction, we consider how hiring patterns of subfields and mathematicians' interest in subfields reflect subfields of featured review and highly cited articles .
Edit intent: clarity
Original:  In another direction, we consider how hiring patterns of subfields and mathematicians' interest in subfields may be assessed in terms of the subfields of featured review and highly cited articles  .
Revised:  In another direction, we consider how hiring patterns of subfields and mathematicians' interest in subfields may be assessed in terms of the subfields of featured review or highly cited articles .
Edit intent: fluency
Original:  We also show, under basic assumptions, that interpreting lambda abstractions via a monoidal closed structure (a popular method for linear type systems) necessarily leads to degenerate and inadequate models for call-by-value affine type systems , so we avoid doing this in our categorical treatment, where a solution to this problem is clearly identified .
Revised:  We also show, under basic assumptions, that interpreting lambda abstractions via a monoidal closed structure (a popular method for linear type systems) necessarily leads to degenerate and inadequate models for call-by-value affine type systems , so we avoid doing this in our categorical treatment, a solution to this problem is clearly identified .
Edit intent: coherence
Original:  We also show, under basic assumptions, that interpreting lambda abstractions via a monoidal closed structure (a popular method for linear type systems) necessarily leads to degenerate and inadequate models for call-by-value affine type systems , so we avoid doing this in our categorical treatment, where a solution to this problem is clearly identified .
Revised:  We also show, under basic assumptions, that interpreting lambda abstractions via a monoidal closed structure (a popular method for linear type systems) necessarily leads to degenerate and inadequate models for call-by-value affine type systems , so we avoid doing this in our categorical treatment, where a solution to this problem is clearly presented .
Edit intent: clarity
Original:  On discretizations ranging from 3\cdot 10^{4} to 4.8\cdot10^{5} elements, the 2D version, named top99neo , shows speedups from 2.55 to 5.5 times compared to the well--knowntop88 code \mbox{ andreassen-etal_11a .
Revised:  On discretizations ranging from 3\cdot 10^{4} to 4.8\cdot10^{5} elements, the 2D version, named top99neo , shows speedups from 2.55 to 5.5 times compared to the well--knowntop88 code \mbox{ andreassen-etal_11a .
Edit intent: fluency
Original:  On discretizations ranging from 3\cdot 10^{4} to 4.8\cdot10^{5} elements, the 2D version, named top99neo , shows speedups from 2.55 to 5.5 times compared to the well--knowntop88 code \mbox{ andreassen-etal_11a .
Revised:  On discretizations ranging from 3\cdot 10^{4} to 4.8\cdot10^{5} elements, the 2D version, named top99neo , shows speedups from 2.55 to 5.5 times compared to the top88 code \mbox{ andreassen-etal_11a .
Edit intent: clarity
Original:  The 3D version, named top3D125 , is the most compact and efficient Matlab implementation for 3D TO to date, showing a speedup of 1.9 times compared to the code of \mbox{ amir-etal_14a , on a discretization with 2.2\cdot10^{5} elements.
Revised:  The 3D version, named top3D125 , is the most compact and efficient Matlab implementation for 3D TO to date, showing a speedup of 1.9 times compared to the code of \mbox{ amir-etal_14a , on a discretization with 2.2\cdot10^{5} elements.
Edit intent: fluency
Original:  To solve Delay-Aware Markov Games, we apply centralized training and decentralized execution that allows agents to use extra information to ease the non-stationary issue of the multi-agent systems during training, without the need of a centralized controller during execution.
Revised:  To solve Delay-Aware Markov Games, we apply centralized training and decentralized execution that allows agents to use extra information to ease the non-stationarity issue of the multi-agent systems during training, without the need of a centralized controller during execution.
Edit intent: fluency
Original:  Due to the random generation of the status updates at the end node side, the monitor only grasps a partial knowledge of the arrivals of status updates .
Revised:  Due to the random generation of the status updates at the end node side, the monitor only grasps a partial knowledge of the status update arrivals .
Edit intent: clarity
Original:  To resolve this problem, we formulate it as a partially observable Markov decision process (POMDP), and develop a dynamic programming (DP) algorithm to obtain the optimal multiuser scheduling policy.
Revised:  To solve this problem, we formulate it as a partially observable Markov decision process (POMDP), and develop a dynamic programming (DP) algorithm to obtain the optimal multiuser scheduling policy.
Edit intent: clarity
Original:  To resolve this problem, we formulate it as a partially observable Markov decision process (POMDP), and develop a dynamic programming (DP) algorithm to obtain the optimal multiuser scheduling policy.
Revised:  To resolve this problem, we formulate it as a partially observable Markov decision process (POMDP), and develop a dynamic programming (DP) algorithm to obtain the optimal scheduling policy.
Edit intent: clarity
Original:  By noting that the DP algorithm is only computationally tractable for small-scale network setups , we further design a low-complexity myopic policy , which only optimizes the one-step expected reward.
Revised:  By noting that the optimal policy is computationally prohibitive , we further design a low-complexity myopic policy , which only optimizes the one-step expected reward.
Edit intent: clarity
Original:  By noting that the DP algorithm is only computationally tractable for small-scale network setups , we further design a low-complexity myopic policy , which only optimizes the one-step expected reward.
Revised:  By noting that the DP algorithm is only computationally tractable for small-scale network setups , we further design a low-complexity myopic policy that only minimizes the one-step expected reward.
Edit intent: clarity
Original:  Simulation results show that the performance of the proposed myopic policy is very close to that under the DP algorithm and better than the state-of-the-art benchmarking scheme .
Revised:  Simulation results show that the performance of the myopic policy can approach that of the optimal policy, and is better than that of the baseline policy .
Edit intent: clarity
Original: In this study, we reported our exploration of Text-To-Speech without Text (TTS without T) in the ZeroSpeech Challenge 2020, in which participants proposed an end-to-end, unsupervised system that learned speech recognition and TTS together.
Revised: In this study, we reported our exploration of Text-To-Speech without Text (TTS without T) in the Zero Resource Speech Challenge 2020, in which participants proposed an end-to-end, unsupervised system that learned speech recognition and TTS together.
Edit intent: fluency
Original: Mean aortic pressure  is a major determinant of perfusion in all organ systems.
Revised: Mean aortic pressure is a major determinant of perfusion in all organs systems.
Edit intent: fluency
Original:  In this study, we provided a benchmark study of different deep sequence learning models on pump performance data obtained in patients who underwent high-risk percutaneous intervention with transvalvular micro-axial heart pump support.
Edit intent: coherence
Original:  The experiments show promising results with the Legendre Memory Unit architecture achieving the best performance with an overall RMSE of 1.837 mmHg.
Revised:  The experiments show that recurrent neural networks with Legendre Memory Unit architecture achieving the best performance with an overall RMSE of 1.837 mmHg.
Edit intent: clarity
Original:  The experiments show promising results with the Legendre Memory Unit architecture achieving the best performance with an overall RMSE of 1.837 mmHg.
Revised:  The experiments show promising results with the Legendre Memory Unit achieve the best performance with an overall RMSE of 1.837 mmHg.
Edit intent: clarity
Original: COVID-19 infodemic has been spreading faster than the pandemic itself with misinformation riding upon the infodemic wave being a major threat to people's health and governance systems.
Revised: COVID-19 infodemic has been spreading faster than the pandemic itself . The misinformation riding upon the infodemic wave being a major threat to people's health and governance systems.
Edit intent: coherence
Original: COVID-19 infodemic has been spreading faster than the pandemic itself with misinformation riding upon the infodemic wave being a major threat to people's health and governance systems.
Revised: COVID-19 infodemic has been spreading faster than the pandemic itself with misinformation riding upon the infodemic wave poses a major threat to people's health and governance systems.
Edit intent: clarity
Original:  The structure of the signed graphs in the polynomial cases is interesting, suggesting they may constitute a nice class of signed graphs analogous to the so-called bi-arc graphs (which characterized the polynomial cases of list homomorphisms to unsigned graphs).
Revised:  The structure of the signed graphs in the polynomial cases is interesting, suggesting they may constitute a nice class of signed graphs analogous to the so-called bi-arc graphs (which characterize the polynomial cases of list homomorphisms to unsigned graphs).
Edit intent: fluency
Original:  By focusing on self-financing portfolios, this result clarifies links between previous results in the literature and makes the respective concepts more realistic.
Edit intent: coherence
Original:  In the first stage, the target voice is separated from background noises with help from the corresponding visual information of lip movements, making the model understands clearly.
Revised:  In the first stage, the target voice is separated from background noises with help from the corresponding visual information of lip movements, making the model 'listen' clearly.
Edit intent: clarity
Original:  Recent evidence shows that a range of biological molecules, including ribozymes and enzymes with rotating or ratcheting subunits, undergo repetitive conformation state changes driven by thermal agitation and energy exchanges, in turn governing catalysis of reactions fundamental to metabolism and cellular replication.
Revised:  Recent evidence shows that a range of biological molecules, including ribozymes and enzymes with rotating or ratcheting subunits, undergo repetitive conformation state changes driven by thermal agitation and energy exchanges, in turn governing catalysis of reactions fundamental to metabolism and replication.
Edit intent: clarity
Original:  These molecules exhibit disparate structures, but share the principle of repetitive unidirectional conformation changes , driven by thermodynamic gradients, that produce directional motion.
Revised:  These molecules exhibit disparate structures, but share the principle of repetitive unidirectional conformation changes driven by thermodynamic gradients, that produce directional motion.
Edit intent: fluency
Original:  These molecules exhibit disparate structures, but share the principle of repetitive unidirectional conformation changes , driven by thermodynamic gradients, that produce directional motion.
Revised:  These molecules exhibit disparate structures, but share the principle of repetitive unidirectional conformation changes , driven by thermodynamic gradients, producing directional motion.
Edit intent: coherence
Original:  The principle of conversion of thermal agitation into directed motion is independent of any specific chemical environment or any particular molecular structure;
Revised:  The principle of conversion of thermal agitation into directed motion is independent of any specific chemical environment or molecular structure;
Edit intent: clarity
Original:   The principle of conversion of thermal agitation into directed motion is independent of any specific chemical environment or molecular structure;
Revised:  The principle of self-regulating networks of heat engines is independent of any specific chemical environment or molecular structure;
Edit intent: clarity
Original:  Our results enable us to not only give first indications but also to suggest gaps in the current scientific coverage of the topic .
Revised:  Our results enable us to suggest gaps in the current scientific coverage of the topic .
Edit intent: coherence
Original:  Moreover, we propose actions for authorities to counter misinformation and hints for social media users on how to help stop the spread of misinformation.
Revised:  Moreover, we propose actions for authorities and social media users on how to help stop the spread of misinformation.
Edit intent: clarity
Original:  Moreover, we propose actions for authorities to counter misinformation and hints for social media users on how to help stop the spread of misinformation.
Revised:  Moreover, we propose actions for authorities to counter misinformation and hints for social media users to counter misinformation.
Edit intent: clarity
Original: In 2020, we will celebrate that many of the basic ideas behind the deep learning revolution were published three decades ago within fewer than 12 months in our "Annus Mirabilis" or "Miraculous Year" 1990-1991 at TU Munich.
Revised: In 2020-2021, we are celebrating that many of the basic ideas behind the deep learning revolution were published three decades ago within fewer than 12 months in our "Annus Mirabilis" or "Miraculous Year" 1990-1991 at TU Munich.
Edit intent: clarity
Original:  This yields a provably complete additive algorithm for the inverse design of the full space of quad origami patterns  .
Revised:  This yields a provably complete additive algorithm for the inverse design of the complete space of developable quad origami patterns .
Edit intent: clarity
Original:  Overall our strategy of replacing a global optimization problem with a local additive algorithm might be more broadly useful in a range of computational fabrication strategies and their physical realizations .
Revised:  Overall , our simple shift in perspective from a global search to a local rule has the potential to transform origami-based meta-structure design .
Edit intent: clarity
Original:  Most existing NAS approaches require one complete search for each deployment specification of hardware or objective.
Revised:  Existing NAS approaches require one complete search for each deployment specification of hardware or objective.
Edit intent: fluency
Original:  NAT is designed to efficiently generate task-specific custom models that are competitive even under multiple conflicting objectives.
Revised:  NAT is designed to efficiently generate task-specific custom models that are competitive under multiple conflicting objectives.
Edit intent: clarity
Original:  Overall,  experimental evaluation indicates that  across diverse image classification tasks and computational objectives, NAT is an appreciably more effective alternative to  fine-tuning based transfer learning . Code is available at URL
Revised:  Overall, the experimental evaluation indicates that across diverse image classification tasks and computational objectives, NAT is an appreciably more effective alternative to fine-tuning based transfer learning . Code is available at URL
Edit intent: fluency
Original:  Overall,  experimental evaluation indicates that  across diverse image classification tasks and computational objectives, NAT is an appreciably more effective alternative to  fine-tuning based transfer learning . Code is available at URL
Revised:  Overall, experimental evaluation indicates that , across diverse image classification tasks and computational objectives, NAT is an appreciably more effective alternative to fine-tuning based transfer learning . Code is available at URL
Edit intent: fluency
Original:  Consequently , significant research efforts on the computational and algorithmic aspects are required to unlock the computing power of leading-edge  pre-Exascale systems  .
Revised:  Consequently , significant research efforts are required to unlock the computing power of leading-edge pre-Exascale systems .
Edit intent: clarity
Original:  In this paper, we explain the approach implemented into a CFD simulation code , Alya, to achieve these physical, numerical and computational We present a global parallelization strategy to fully exploit the different levels of parallelism proposed by modern architectures , together with a novel co-execution model for the concurrent exploitation of both the CPUand GPU , targeting the maximum efficiency at the node level .
Revised:  In this paper, we present the approach implemented into a CFD simulation code , Alya, to achieve these physical, numerical and computational We present a global parallelization strategy to fully exploit the different levels of parallelism proposed by modern architectures , together with a novel co-execution model for the concurrent exploitation of both the CPUand GPU , targeting the maximum efficiency at the node level .
Edit intent: clarity
Original:  In this paper, we explain the approach implemented into a CFD simulation code , Alya, to achieve these physical, numerical and computational We present a global parallelization strategy to fully exploit the different levels of parallelism proposed by modern architectures , together with a novel co-execution model for the concurrent exploitation of both the CPUand GPU , targeting the maximum efficiency at the node level .
Revised:  In this paper, we explain the approach implemented in the computational mechanics code Alya. We describe in detail the parallelization strategy implemented to fully exploit the different levels of parallelism proposed by modern architectures , together with a novel co-execution model for the concurrent exploitation of both the CPUand GPU , targeting the maximum efficiency at the node level .
Edit intent: clarity
Original:  In this paper, we explain the approach implemented into a CFD simulation code , Alya, to achieve these physical, numerical and computational We present a global parallelization strategy to fully exploit the different levels of parallelism proposed by modern architectures , together with a novel co-execution model for the concurrent exploitation of both the CPUand GPU , targeting the maximum efficiency at the node level .
Revised:  In this paper, we explain the approach implemented into a CFD simulation code , Alya, to achieve these physical, numerical and computational We present a global parallelization strategy to fully exploit the different levels of parallelism , together with a novel co-execution model for the concurrent exploitation of both the CPUand GPU , targeting the maximum efficiency at the node level .
Edit intent: clarity