wanyu/IteraTeR_v2 huggingface dataset:
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 proposed by modern architectures , together with a novel co-execution method for the efficient utilization of heterogeneous CPU/GPU architectures .
Edit intent: clarity
Original:  The latter is based on a multi-code co-execution approach together with a dynamic load balancing mechanism.
Revised:  The latter is based on a multi-code co-execution approach with a dynamic load balancing mechanism.
Edit intent: coherence
Original:  Assessment of the performance of all the proposed strategies has been carried out on the cutting edge POWER9 architecture  .
Revised:  The assessment of the performance of all the proposed strategies has been carried out on the cutting edge POWER9 architecture .
Edit intent: fluency
Original:  The linear \pi%DIFDELCMD < }%%% -calculus is a typed version of the \pi -calculus where channels must be used exactly once.
Revised:  The linear %DIFDELCMD < }%%% -calculus is a typed version of the \pi -calculus where channels must be used exactly once.
Edit intent: fluency
Original:  The linear \pi%DIFDELCMD < }%%% -calculus is a typed version of the \pi -calculus where channels must be used exactly once.
Revised:  The linear \pi%DIFDELCMD < }%%% \pi -calculus where channels must be used exactly once.
Edit intent: clarity
Original:  The linear \pi%DIFDELCMD < }%%% -calculus is a typed version of the \pi -calculus where channels must be used exactly once.
Revised:  The linear \pi%DIFDELCMD < }%%% -calculus is a typed version of the -calculus where channels must be used exactly once.
Edit intent: fluency
Original:  We present the first full mechanisation in Agda of a \pi%DIFDELCMD < }%%% -calculus with linear, graded and shared types, all under the same unified framework.
Revised:  We present the first full mechanisation in Agda of a %DIFDELCMD < }%%% -calculus with linear, graded and shared types, all under the same unified framework.
Edit intent: fluency
Original:  We generalise the algebras on multiplicities, allowing the developer to choose a mix of linear, graded and shared typing .
Revised:  We generalise the algebras on multiplicities, allowing the developer to choose a mix of linear, graded and shared types allow for more flexible programming .
Edit intent: clarity
Original:  In network analysis, in particular, the exponential of the adjacency matrix associated with a network provides valuable information about connectivity, as well as  the relative importance or centrality of nodes.
Revised:  In network analysis, in particular, the exponential of the adjacency matrix associated with a network provides valuable information about connectivity, as well as about the relative importance or centrality of nodes.
Edit intent: fluency
Original:  The present article addresses the problem of evaluating matrix functions, as well as computing an approximation to the left Perron vector, when only some of its columns and/or some of its rows are known.
Revised:  The present article addresses the problem of evaluating matrix functions, as well as computing an approximation to the left Perron vector, when only some of the columns and/or some of its rows are known.
Edit intent: fluency
Original:  The  C to CHERI compiler, for example, achieves memory safety by following a principle called "pointers as capabilities" (PAC).
Revised:  The existing C to CHERI compiler, for example, achieves memory safety by following a principle called "pointers as capabilities" (PAC).
Edit intent: clarity
Original:  We show that memory safety is only one aspect, and that PAC compilers can provide significant additional security guarantees for partial programs: the compiler can provide  guarantees for a compilation unit, even if that compilation unit is later linked to attacker-controlled machine code.
Revised:  We show that memory safety is only one aspect, and that PAC compilers can provide significant additional security guarantees for partial programs: the compiler can provide security guarantees for a compilation unit, even if that compilation unit is later linked to attacker-controlled machine code.
Edit intent: fluency
Original:  We show that memory safety is only one aspect, and that PAC compilers can provide significant additional security guarantees for partial programs: the compiler can provide  guarantees for a compilation unit, even if that compilation unit is later linked to attacker-controlled machine code.
Revised:  We show that memory safety is only one aspect, and that PAC compilers can provide significant additional security guarantees for partial programs: the compiler can provide guarantees for a compilation unit, even if that compilation unit is later linked to attacker-provided machine code.
Edit intent: clarity
Original:  This paper is the first to study the security of PAC compilers for partial programs formally.
Revised:  As such, this paper is the first to study the security of PAC compilers for partial programs formally.
Edit intent: coherence
Original:  The proof uses a novel proof technique (dubbed TrICL, read trickle), which is of broad interest because it reuses and extends the compiler correctness relation in a natural way, as we demonstrate.
Revised:  The proof uses a novel proof technique (dubbed TrICL, read trickle), which should be of broad interest because it reuses and extends the compiler correctness relation in a natural way, as we demonstrate.
Edit intent: clarity
Original:  The proof uses a novel proof technique (dubbed TrICL, read trickle), which is of broad interest because it reuses and extends the compiler correctness relation in a natural way, as we demonstrate.
Revised:  The proof uses a novel proof technique (dubbed TrICL, read trickle), which is of broad interest because it reuses the whole-program compiler correctness relation in a natural way, as we demonstrate.
Edit intent: clarity
Original: \%auto-ignore In this paper we propose Flowtron: an autoregressive flow-based generative network for text-to-speech synthesis with control over speech variation and style transfer.
Revised:  In this paper we propose Flowtron: an autoregressive flow-based generative network for text-to-speech synthesis with control over speech variation and style transfer.
Edit intent: coherence
Original: The nonlinear optimization problem with linear equality constraints has many applications in engineering fields such as the visual-inertial navigationand localization of an unmanned aerial vehicle maintaining the horizontal flight.
Revised: The nonlinear optimization problem with linear constraints has many applications in engineering fields such as the visual-inertial navigationand localization of an unmanned aerial vehicle maintaining the horizontal flight.
Edit intent: clarity
Original: The nonlinear optimization problem with linear equality constraints has many applications in engineering fields such as the visual-inertial navigationand localization of an unmanned aerial vehicle maintaining the horizontal flight.
Revised: The nonlinear optimization problem with linear equality constraints has many applications in engineering fields such as the visual-inertial navigation and localization of an unmanned aerial vehicle maintaining the horizontal flight.
Edit intent: fluency
Original:  In order to solve this practical problem effectively , this paper constructs a semi-implicit continuation method with the trust-region time-stepping scheme for the linear equality constrained optimization subproblem at every iteration  .
Revised:  In order to solve this practical problem efficiently , this paper constructs a semi-implicit continuation method with the trust-region time-stepping scheme for the linear equality constrained optimization subproblem at every iteration .
Edit intent: clarity
Original:  In order to solve this practical problem effectively , this paper constructs a semi-implicit continuation method with the trust-region time-stepping scheme for the linear equality constrained optimization subproblem at every iteration  .
Revised:  In order to solve this practical problem effectively , this paper constructs a continuation method with the trust-region time-stepping scheme for the linear equality constrained optimization subproblem at every iteration .
Edit intent: clarity
Original:  Numerical results illustrate that the new method works well for this positioning problem with or without the measurement error, and the traditional sequential quadratic programming (SQP ) method (the built-in subroutine fmincon.m of the MATLAB environment) fails to solve this positioning problem with the angular error which results in a nonlinear optimization subproblem with the inconsistent system of constraints .
Revised:  Numerical results show that the new method works well for this positioning problem with or without the measurement error, and the traditional sequential quadratic programming (SQP ) method (the built-in subroutine fmincon.m of the MATLAB environment) fails to solve this positioning problem with the angular error which results in a nonlinear optimization subproblem with the inconsistent system of constraints .
Edit intent: clarity
Original:  Numerical results illustrate that the new method works well for this positioning problem with or without the measurement error, and the traditional sequential quadratic programming (SQP ) method (the built-in subroutine fmincon.m of the MATLAB environment) fails to solve this positioning problem with the angular error which results in a nonlinear optimization subproblem with the inconsistent system of constraints .
Revised:  Numerical results illustrate that the new method works well for this localization problem with or without the measurement error, and the traditional sequential quadratic programming (SQP ) method (the built-in subroutine fmincon.m of the MATLAB environment) fails to solve this positioning problem with the angular error which results in a nonlinear optimization subproblem with the inconsistent system of constraints .
Edit intent: clarity
Original:  In order to solve this practical problem efficiently, this paper constructs a continuation method with the trust-region time-stepping scheme for the linearly equality-constrained optimization problem at every sampling time.
Revised:  In order to solve this practical problem efficiently, this paper constructs a continuation method with the trusty time-stepping scheme for the linearly equality-constrained optimization problem at every sampling time.
Edit intent: clarity
Original:  For the new method solving the linearly constrained optimization problem, it only solves a system of linear equations at every iteration other than the traditional optimization method such as the sequential quadratic programming (SQP) method .
Revised:  At every iteration, the new method solving the linearly constrained optimization problem, it only solves a system of linear equations at every iteration other than the traditional optimization method such as the sequential quadratic programming (SQP) method .
Edit intent: clarity
Original:  For the new method solving the linearly constrained optimization problem, it only solves a system of linear equations at every iteration other than the traditional optimization method such as the sequential quadratic programming (SQP) method .
Revised:  For the new method only solves a system of linear equations at every iteration other than the traditional optimization method such as the sequential quadratic programming (SQP) method .
Edit intent: clarity
Original:  For the new method solving the linearly constrained optimization problem, it only solves a system of linear equations at every iteration other than the traditional optimization method such as the sequential quadratic programming (SQP) method .
Revised:  For the new method solving the linearly constrained optimization problem, it only solves a system of linear equations other than the traditional optimization method such as the sequential quadratic programming (SQP) method .
Edit intent: clarity
Original:  The SQP method needs to solve a quadratic programming subproblem at every iteration, which consumes more time than that of the new method  .
Revised:  The SQP method needs to solve a quadratic programming subproblem . Consequently, the new method .
Edit intent: coherence
Original:  Numerical results show that the new method works well for this localization problem with or without the measurement errors, and its consumed time is about one-fifth of that of the SQP method (the built-in subroutine fmincon.m of the MATLAB2018a environment) or that of the traditional dynamical method (the built-in subroutine ode15s.m of the MATLAB2018a environment).
Revised:  Numerical results show that the new method works well for this problem and its consumed time is about one-fifth of that of the SQP method (the built-in subroutine fmincon.m of the MATLAB2018a environment) or that of the traditional dynamical method (the built-in subroutine ode15s.m of the MATLAB2018a environment).
Edit intent: clarity
Original:  Numerical results show that the new method works well for this localization problem with or without the measurement errors, and its consumed time is about one-fifth of that of the SQP method (the built-in subroutine fmincon.m of the MATLAB2018a environment) or that of the traditional dynamical method (the built-in subroutine ode15s.m of the MATLAB2018a environment).
Revised:  Numerical results show that the new method works well for this localization problem with or without the measurement errors, and its consumed time is about one fifth of that of the SQP method (the built-in subroutine fmincon.m of the MATLAB2018a environment) or that of the traditional dynamical method (the built-in subroutine ode15s.m of the MATLAB2018a environment).
Edit intent: fluency
Original:  Numerical results show that the new method works well for this localization problem with or without the measurement errors, and its consumed time is about one-fifth of that of the SQP method (the built-in subroutine fmincon.m of the MATLAB2018a environment) or that of the traditional dynamical method (the built-in subroutine ode15s.m of the MATLAB2018a environment).
Revised:  Numerical results show that the new method works well for this localization problem with or without the measurement errors, and its consumed time is about one-fifth of that of SQP (the built-in subroutine fmincon.m of the MATLAB2018a environment) or that of the traditional dynamical method (the built-in subroutine ode15s.m of the MATLAB2018a environment).
Edit intent: fluency
Original:  We release tweet IDs from the dataset , hoping it will\\%DIF > ) for teasing  be useful for studying various phenomena related to the ongoing pandemic and accelerating viable solutions to associated problems  .
Revised:  We release tweet IDs from the dataset , hoping it will\\%DIF > ) for teasing be useful for studying various phenomena related to the pandemic and accelerating viable solutions to associated problems .
Edit intent: clarity
Original:  We also develop and release a powerful model (acc=94%DIFDELCMD < \\%%% %DIF < ) for teasing apart messages related to the pandemic from those that are not.
Revised:  We also develop and release %DIFDELCMD < \\%%% %DIF < ) for teasing apart messages related to the pandemic from those that are not.
Edit intent: clarity
Original:  Our data and models can be useful for studying various phenomena related to the pandemic and accelerating viable solutions to associated problems.
Revised:  Our data and models can be useful for studying a wide host of phenomena related to the pandemic and accelerating viable solutions to associated problems.
Edit intent: clarity
Original:  Our data and models are publicly available for research .
Revised:  Our data and models are publicly available .
Edit intent: clarity
Original:  We obtain the explicit optimal hedging strategy  in a recursive representation, without imposing the nondegeneracy condition on the model and square integrability on hedging strategies.
Revised:  We obtain the optimal hedging strategy in a recursive representation, without imposing the nondegeneracy condition on the model and square integrability on hedging strategies.
Edit intent: clarity
Original:  We obtain the explicit optimal hedging strategy  in a recursive representation, without imposing the nondegeneracy condition on the model and square integrability on hedging strategies.
Revised:  We obtain the explicit optimal hedging strategy in a recursive representation, without imposing the non-degeneracy (ND) condition on the model and square integrability on hedging strategies.
Edit intent: clarity
Original: In this paper, we introduce a fully implementable, adaptive Euler-Maruyama scheme for McKean SDEs with non-globally Lipschitz continuous drifts .
Revised: In this paper, we introduce fully implementable, adaptive Euler-Maruyama scheme for McKean SDEs with non-globally Lipschitz continuous drifts .
Edit intent: fluency
Original:  We present several numerical examples centred around a mean-field model for FitzHugh-Nagumo neurons, which illustrate that the standard uniform scheme fails and that the adaptive scheme shows in most cases superior performance compared to tamed approximation schemes.
Revised:  We present several numerical examples centred around a mean-field model for FitzHugh-Nagumo neurons, which illustrate that the standard uniform scheme fails and that the adaptive approach shows in most cases superior performance compared to tamed approximation schemes.
Edit intent: clarity
Original:  In addition, we propose a tamed and an adaptive Milstein scheme for a certain class of McKean SDEs .
Revised:  In addition, we introduce and analyse an adaptive Milstein scheme for a certain class of McKean SDEs .
Edit intent: clarity
Original:  We present several numerical examples centred around a mean-field model for FitzHugh-Nagumo neurons, which illustrate that the standard uniform scheme fails and that the adaptive approach shows in most cases superior performance compared to tamed approximation schemes.
Revised:  Several numerical examples, centred around a mean-field model for FitzHugh-Nagumo neurons, which illustrate that the standard uniform scheme fails and that the adaptive approach shows in most cases superior performance compared to tamed approximation schemes.
Edit intent: clarity
Original:  We present several numerical examples centred around a mean-field model for FitzHugh-Nagumo neurons, which illustrate that the standard uniform scheme fails and that the adaptive approach shows in most cases superior performance compared to tamed approximation schemes.
Revised:  We present several numerical examples centred around a mean-field model for FitzHugh-Nagumo neurons, illustrate that the standard uniform scheme fails and that the adaptive approach shows in most cases superior performance compared to tamed approximation schemes.
Edit intent: coherence
Original:  We present several numerical examples centred around a mean-field model for FitzHugh-Nagumo neurons, which illustrate that the standard uniform scheme fails and that the adaptive approach shows in most cases superior performance compared to tamed approximation schemes.
Revised:  We present several numerical examples centred around a mean-field model for FitzHugh-Nagumo neurons, which illustrate that the standard uniform scheme fails and that the adaptive approach shows in most cases superior performance to tamed approximation schemes.
Edit intent: fluency
Original: In this paper, we introduce fully implementable, adaptive Euler-Maruyama schemes for McKean-Vlasov stochastic differential equations (SDEs) assuming only a standard monotonicity condition on the drift and diffusion coefficients but no global Lipschitz continuity in the state variable for either, while global Lipschitz continuity is required for the measure component only.
Revised: In this paper, we introduce adaptive Euler-Maruyama schemes for McKean-Vlasov stochastic differential equations (SDEs) assuming only a standard monotonicity condition on the drift and diffusion coefficients but no global Lipschitz continuity in the state variable for either, while global Lipschitz continuity is required for the measure component only.
Edit intent: clarity
Original:  In primitive discovery, we focus on learning primitives related to object parts by self-supervision from the order of split input , avoiding extra laborious annotations and alleviating the effect of semantic gaps.
Revised:  In primitive discovery, we focus on learning primitives related to object parts by self-supervision from the order of image splits , avoiding extra laborious annotations and alleviating the effect of semantic gaps.
Edit intent: clarity
Original:  We extend the temporal logic HyperPCTL \HyperPCTL , which has been previously introduced for discrete-time Markov chains, to enable the specification of hyperproperties also for Markov decision processes.
Revised:  We extend the temporal logic \HyperPCTL , which has been previously introduced for discrete-time Markov chains, to enable the specification of hyperproperties also for Markov decision processes.
Edit intent: fluency
Original:  The study focuses on Italy, which experienced significant restrictions imposed by local authorities, but results about Spain, France, Germany, Sweden, and the whole  Europe are also included.
Revised:  The study focuses on Italy, which experienced significant restrictions imposed by local authorities, but results about Spain, France, Germany, Sweden, and the whole of Europe are also included.
Edit intent: fluency
Original:  The analysis of a large set of measurements shows that the impact on the network is significant, especially in terms of increased variability of latency.
Revised:  The analysis of a large set of measurements shows that the impact on the network can be significant, especially in terms of increased variability of latency.
Edit intent: clarity
Original:  The impact is not negligible also for the other countries and for the whole  Europe, but with different levels and distinct patterns.
Revised:  The impact is not negligible also for the other countries and for the whole of Europe, but with different levels and distinct patterns.
Edit intent: fluency
Original:  Our findings are consistent with the idea that the current pandemic might take the greatest toll on the research productivity of  early-career women  .
Revised:  Our findings are consistent with the idea that the research productivity of early-career women .
Edit intent: clarity
Original:  Our findings are consistent with the idea that the current pandemic might take the greatest toll on the research productivity of  early-career women  .
Revised:  Our findings are consistent with the idea that the current pandemic might take the greatest toll on the research productivity of women, especially early-career women .
Edit intent: clarity
Original:  Using mixed-effects regression models, we estimate that women's shares of first authorships, last authorships and general representation per author group are 23\% , 16\% and 16\% lower for COVID-19 papers compared to 2019 papers published in the same journals .
Revised:  Using mixed-effects regression models, we estimated that the proportion of COVID-19 papers with a woman first author was 19\% lower than that for papers published in the same journals .
Edit intent: clarity