wanyu/IteraTeR_v2 huggingface dataset:
Original:  We validate the performance of DAR_t through simulations and demonstrate its power in revealing the transmission dynamics of COVID-19  .
Revised:  We validate the performance of DARt and demonstrate its power in revealing the transmission dynamics of COVID-19 .
Edit intent: clarity
Original:  The price of explainability can be thought of as the loss in terms of quality that is unavoidable if we restrict these systems to use explainablemethods.
Revised:  The price of explainability for a clustering task can be defined as the unavoidable loss, in terms of quality that is unavoidable if we restrict these systems to use explainablemethods.
Edit intent: clarity
Original:   We provide upper and lower bounds on this price as well as efficient algorithms to build explainable clustering for the k-means, k-medians, k-center and the maximum-spacing problems in a natural model in which explainability is achieved via decision trees  ]  .
Revised:  We provide upper and lower bounds for a natural model in which explainability is achieved via decision trees ] .
Edit intent: coherence
Original:  This paper introduces a theoretical and algorithmic framework for the fast, parallel solution of the nonlinear equations that arise from IRK methods  applied to nonlinear numerical PDEs, including PDEs with algebraic constraints.
Revised:  This paper introduces a theoretical and algorithmic framework for solving the nonlinear equations that arise from IRK methods applied to nonlinear numerical PDEs, including PDEs with algebraic constraints.
Edit intent: clarity
Original:  Under quite general assumptions on the spatial discretization , it is proven that the preconditioned  operator has a condition number of ~O(1),  with only weak dependence on the number of stages or integration accuracy.
Revised:  Under quite general assumptions , it is proven that the preconditioned operator has a condition number of ~O(1), with only weak dependence on the number of stages or integration accuracy.
Edit intent: clarity
Original:  We have two objectives: (1) to incentivize forecasters to report truthfully , so that forecasts are informative and forecasters need not spend any cognitive effort strategizing about reports, and (2) to award the prize to the most accurate forecaster.
Revised:  We have two objectives: (1) to incentivize forecasters to report truthfully and (2) to award the prize to the most accurate forecaster.
Edit intent: coherence
Original:  Our first mechanism is dominant strategy incentive compatible and guaranteed to select the most accurate forecaster with probability higher than any other forecaster.
Revised:  Our first mechanism is incentive compatible and guaranteed to select the most accurate forecaster with probability higher than any other forecaster.
Edit intent: clarity
Original:  Our second mechanism is incentive compatible when forecasters' beliefs are such that information about one event does not lead to a belief update on the other events, and it selects the best forecaster with probability approaching 1 as the number of events grows.
Revised:  Our second mechanism is incentive compatible when forecasters' beliefs are such that information about one event does not lead to belief updates on other events, and it selects the best forecaster with probability approaching 1 as the number of events grows.
Edit intent: fluency
Original:  This new image is used as prior information during the minimization process through the directional total variation.
Revised:  This new image is used as prior information during a channel-by-channel minimization process through the directional total variation.
Edit intent: clarity
Original:  Our numerical results on simulated and experimental data show significant improvements in terms of image quality and in computational speed.
Revised:  Our numerical results on simulated and experimental data show improvements in terms of image quality and in computational speed.
Edit intent: clarity
Original: A pure excedance in a permutation \pi=\pi_1\pi_2\ldots \pi_n is a position i<\pi_i , 1\leq i\leq n-1, so that there is no j<i such that i\leq \pi_j<\pi_i.
Revised: A pure excedance in a permutation \pi=\pi_1\pi_2\ldots \pi_n is a position i<\pi_i , 1\leq i\leq n-1, so that there is no j<i with i\leq \pi_j<\pi_i.
Edit intent: clarity
Original:  The significance of this result is  a) the finite-element method for computing approximations to solutions of the Helmholtz equation is based on the standard variational formulation, and b) the location of eigenvalues, and especially near-zero ones, plays a key role in understanding how iterative solvers such as the generalised minimum residual method (GMRES) behave when used to solve linear systems, in particular those arising from the finite-element method.
Revised:  Our motivation for proving this result is a) the finite-element method for computing approximations to solutions of the Helmholtz equation is based on the standard variational formulation, and b) the location of eigenvalues, and especially near-zero ones, plays a key role in understanding how iterative solvers such as the generalised minimum residual method (GMRES) behave when used to solve linear systems, in particular those arising from the finite-element method.
Edit intent: clarity
Original:  The significance of this result is  a) the finite-element method for computing approximations to solutions of the Helmholtz equation is based on the standard variational formulation, and b) the location of eigenvalues, and especially near-zero ones, plays a key role in understanding how iterative solvers such as the generalised minimum residual method (GMRES) behave when used to solve linear systems, in particular those arising from the finite-element method.
Revised:  The significance of this result is that a) the finite-element method for computing approximations to solutions of the Helmholtz equation is based on the standard variational formulation, and b) the location of eigenvalues, and especially near-zero ones, plays a key role in understanding how iterative solvers such as the generalised minimum residual method (GMRES) behave when used to solve linear systems, in particular those arising from the finite-element method.
Edit intent: fluency
Original: How do we decide the fair value of individual classifiers in an ensemble model?
Revised: What is the value of an individual model in an ensemble model?
Edit intent: clarity
Original:  The players in ensemble games are pre-trained binary classifiers that collaborate in an ensemble to correctly label points from a dataset.
Revised:  The players in ensemble games areensemble games pre-trained binary classifiers that collaborate in an ensemble to correctly label points from a dataset.
Edit intent: fluency
Original:  We show that the approximate  Shapley value of classifiers in these games is an adequate measure for selecting a subgroup of highly predictive models .
Revised:  We show that the approximate Shapley value of models in these games is an adequate measure for selecting a subgroup of highly predictive models .
Edit intent: clarity
Original:  Experimental results on graph classification tasks establish that Troupe gives precise estimates of the Shapley value in ensemble games.
Revised:  Experimental results on graph classification tasks demonstrate that our algorithm produces high quality estimates of the Shapley value in ensemble games.
Edit intent: clarity
Original: To analyze large sets of grid states, e.g. in time series calculations or parameter studies , large number of power flow calculations have to be performed , as well as evaluating the impact from uncertainties of the renewable energy e. g. wind and PV of power systems with Monte-Carlo simulation.
Revised: To analyze large sets of grid states, e.g. in time series calculations or parameter studies , large number of power flow calculations have to be performed .
Edit intent: coherence
Original:  For the application in real-time grid operation and in cases when computational time is critical, a novel approach on parallelization of Newton-Raphson power flow for many calculations on CPU and with GPU-acceleration is proposed.
Revised:  For the application in real-time grid operation and in cases when computational time is critical, a novel approach on simultaneous parallelization of many Newton-Raphson power flow for many calculations on CPU and with GPU-acceleration is proposed.
Edit intent: clarity
Original:  For the application in real-time grid operation and in cases when computational time is critical, a novel approach on parallelization of Newton-Raphson power flow for many calculations on CPU and with GPU-acceleration is proposed.
Revised:  For the application in real-time grid operation and in cases when computational time is critical, a novel approach on parallelization of Newton-Raphson power flow calculations on CPU and with GPU-acceleration is proposed.
Edit intent: clarity
Original:  The speed-up relies on the optimized algorithm and parallelization strategy, which can reduce the repetitive work and saturate the high hardware performance of modern CPUs and GPUs well.
Revised:  The speed-up relies on the optimized algorithm and parallelization strategy, which can reduce the repetitive work and saturate the high hardware computational capability of modern CPUs and GPUs well.
Edit intent: clarity
Original:  The batched linear solver shows a large performance improvement comparing to the state-of-art linear system solver KLU library and a better saturation of the GPU performance with small problem scale.
Revised:  The batched linear solver shows a large performance improvement comparing to the state-of-the-art linear system solver KLU library and a better saturation of the GPU performance with small problem scale.
Edit intent: fluency
Original: To analyze large sets of grid states, e.g. when evaluating the impact from the uncertainties of the renewable generation with probabilistic monte-carlo simulation or in stationary time series simulation, large number of power flow calculations have to be performed.
Revised: To analyze large sets of grid states, e.g. when evaluating the impact from the uncertainties of the renewable generation with probabilistic Monte Carlo simulation or in stationary time series simulation, large number of power flow calculations have to be performed.
Edit intent: fluency
Original: Given an image of a target person and an image of another person wearing a garment , we automatically generate the target person in the given garment.
Revised: Given a pair of images-target person and garment on another person-we automatically generate the target person in the given garment.
Edit intent: clarity
Original:  BiMMSB allows that row nodes and column nodes of the adjacency matrix can be different and these nodes may have distinct community structure in a directed network.
Revised:  DiMMSB allows that row nodes and column nodes of the adjacency matrix can be different and these nodes may have distinct community structure in a directed network.
Edit intent: fluency
Original:  We show that the approach is asymptotically consistent under BiMMSB . We demonstrate the advantages of BiMMSB with applications to a small-scale simulation study , the directed Political blogs network and the Papers Citations network.
Revised:  We show that DiSP is asymptotically consistent under BiMMSB . We demonstrate the advantages of BiMMSB with applications to a small-scale simulation study , the directed Political blogs network and the Papers Citations network.
Edit intent: clarity
Original:  We show that the approach is asymptotically consistent under BiMMSB . We demonstrate the advantages of BiMMSB with applications to a small-scale simulation study , the directed Political blogs network and the Papers Citations network.
Revised:  We show that the approach is asymptotically consistent under BiMMSB . We demonstrate the advantages of BiMMSB with applications to simulated directed mixed membership network , the directed Political blogs network and the Papers Citations network.
Edit intent: clarity
Original:  We show that the approach is asymptotically consistent under BiMMSB . We demonstrate the advantages of BiMMSB with applications to a small-scale simulation study , the directed Political blogs network and the Papers Citations network.
Revised:  We show that the approach is asymptotically consistent under BiMMSB . We demonstrate the advantages of BiMMSB with applications to a small-scale simulation study , the directed Political blogs network and the Papers Citation network.
Edit intent: fluency
Original:  However, cell division times can present significant correlations , due to physical properties of cells that are passed from mothers to daughters .
Revised:  However, cell division times can be significantly correlated , due to physical properties of cells that are passed from mothers to daughters .
Edit intent: clarity
Original:  However, cell division times can present significant correlations , due to physical properties of cells that are passed from mothers to daughters .
Revised:  However, cell division times can present significant correlations , due to physical properties of cells that are passed through generations .
Edit intent: clarity
Original:  We find that the discrepancy between the growth rate predicted by the Euler-Lotka equation and our generalized version is relatively small, but large enough to be measurable in experiments .
Revised:  We find that the discrepancy between the growth rate predicted by the Euler-Lotka equation and our generalized version is relatively small, but large enough to be measurable by our approach .
Edit intent: clarity
Original: Since the inception of the group testing problem in World War II, the prevailing assumption in the probabilistic variant of the problem has been that individuals in the population are infected by a disease independently.
Revised: Since the inception of the group testing problem in World War II, one of the prevailing assumptions in the probabilistic variant of the problem has been that individuals in the population are infected by a disease independently.
Edit intent: clarity
Original:  We present a method to measure these snapping capability based on the total elastic strain energy density of the framework by using the physical concept of Green-Lagrange strain.
Revised:  We present a method to measure this snapping capability based on the total elastic strain energy density of the framework by using the physical concept of Green-Lagrange strain.
Edit intent: fluency
Original:  As this so-called snappability only depends on the intrinsic framework geometry, it enables a fair comparison of pin-jointed body-bar frameworks, thus it can serve engineers as a criterion within the design process either to avoid snapping phenomena (e.g. truss structures) or to utilize them (e.g. multistable materials) .
Revised:  As this so-called snappability only depends on the intrinsic framework geometry, it enables a fair comparison of pin-jointed body-bar frameworks, thus it can serve engineers as a criterion within the design process of multistable mechanisms .
Edit intent: clarity
Original:  Therefore it is also of use for the kinematics community, which is highly interested in the computation of these singularity-distances for diverse mechanical devices.
Revised:  Therefore it is suited for the computation of these singularity-distances for diverse mechanical devices.
Edit intent: clarity
Original: Multi-task learning (MTL) and the attention technique have been proven to effectively extract robust acoustic features for various speech-related applications in noisy environments.
Revised: Multi-task learning (MTL) and attention mechanism have been proven to effectively extract robust acoustic features for various speech-related applications in noisy environments.
Edit intent: clarity
Original: Multi-task learning (MTL) and the attention technique have been proven to effectively extract robust acoustic features for various speech-related applications in noisy environments.
Revised: Multi-task learning (MTL) and the attention technique have been proven to effectively extract robust acoustic features for various speech-related tasks in noisy environments.
Edit intent: clarity
Original:  In this study, we integrated MTL and the attention-weighting mechanism and propose an attention-based MTL ( ATM0 approach to realize a multi-model learning structure and to promote the speech enhancement (SE) and speaker identification (SI) systems simultaneously.
Revised:  In this study, we propose an attention-based MTL ( ATM0 approach to realize a multi-model learning structure and to promote the speech enhancement (SE) and speaker identification (SI) systems simultaneously.
Edit intent: coherence
Original:  In this study, we integrated MTL and the attention-weighting mechanism and propose an attention-based MTL ( ATM0 approach to realize a multi-model learning structure and to promote the speech enhancement (SE) and speaker identification (SI) systems simultaneously.
Revised:  In this study, we integrated MTL and the attention-weighting mechanism and propose an attention-based MTL ( ATM0 approach to realize a multi-model learning structure that performs speech enhancement (SE) and speaker identification (SI) systems simultaneously.
Edit intent: clarity
Original:  In the proposed system, a long-short-term memory (LSTM) is used to perform SE, while a deep neural network (DNN) model is applied to construct SI and AttNet in ATM . The overall ATM system first extracts the representative features and then enhances the speech spectra in LSTM-SE and classifies speaker identity in DNN-SI.
Revised:  In the proposed system, a long-short-term memory (LSTM) model, and a deep neural network (DNN) model is applied to construct SI and AttNet in ATM . The overall ATM system first extracts the representative features and then enhances the speech spectra in LSTM-SE and classifies speaker identity in DNN-SI.
Edit intent: coherence
Original:  In the proposed system, a long-short-term memory (LSTM) is used to perform SE, while a deep neural network (DNN) model is applied to construct SI and AttNet in ATM . The overall ATM system first extracts the representative features and then enhances the speech spectra in LSTM-SE and classifies speaker identity in DNN-SI.
Revised:  In the proposed system, a long-short-term memory (LSTM) is used to perform SE, while a deep neural network (DNN) model is used to develop the SI and AttNet in ATM . The overall ATM system first extracts the representative features and then enhances the speech spectra in LSTM-SE and classifies speaker identity in DNN-SI.
Edit intent: clarity
Original:  In the proposed system, a long-short-term memory (LSTM) is used to perform SE, while a deep neural network (DNN) model is applied to construct SI and AttNet in ATM . The overall ATM system first extracts the representative features and then enhances the speech spectra in LSTM-SE and classifies speaker identity in DNN-SI.
Revised:  In the proposed system, a long-short-term memory (LSTM) is used to perform SE, while a deep neural network (DNN) model is applied to construct SI and AttNet in ATM . The overall ATM system first extracts the representative features and then enhances the speech signals in LSTM-SE and classifies speaker identity in DNN-SI.
Edit intent: clarity
Original:  In the proposed system, a long-short-term memory (LSTM) is used to perform SE, while a deep neural network (DNN) model is applied to construct SI and AttNet in ATM . The overall ATM system first extracts the representative features and then enhances the speech spectra in LSTM-SE and classifies speaker identity in DNN-SI.
Revised:  In the proposed system, a long-short-term memory (LSTM) is used to perform SE, while a deep neural network (DNN) model is applied to construct SI and AttNet in ATM . The overall ATM system first extracts the representative features and then enhances the speech spectra in LSTM-SE and specifies speaker identity in DNN-SI.
Edit intent: clarity
Original:  We conducted our experiment on Taiwan Mandarin hearing in noise test database .
Revised:  We conducted our experiment on Taiwan Mandarin hearing in noise test sentences .
Edit intent: clarity
Original:  The evaluation results indicate that the proposed ATM system not only increases the quality and intelligibility of noisy speech inputbut also improves the accuracy of the SI system when compared to the conventional MTL approaches .
Revised:  The evaluation results confirmed that the proposed ATM system not only increases the quality and intelligibility of noisy speech inputbut also improves the accuracy of the SI system when compared to the conventional MTL approaches .
Edit intent: clarity
Original:  The evaluation results indicate that the proposed ATM system not only increases the quality and intelligibility of noisy speech inputbut also improves the accuracy of the SI system when compared to the conventional MTL approaches .
Revised:  The evaluation results indicate that the proposed system can effectively enhance speech quality and intelligibility of noisy speech inputbut also improves the accuracy of the SI system when compared to the conventional MTL approaches .
Edit intent: clarity
Original:  The evaluation results indicate that the proposed ATM system not only increases the quality and intelligibility of noisy speech inputbut also improves the accuracy of the SI system when compared to the conventional MTL approaches .
Revised:  The evaluation results indicate that the proposed ATM system not only increases the quality and intelligibility of a given noisy input. Moreover, the accuracy of the SI system when compared to the conventional MTL approaches .
Edit intent: clarity
Original: Edge computing has been an efficient way to provide prompt and near-data computing services for delay-sensitive IoT applications via task offloading.
Revised: Edge computing has been an efficient way to provide prompt and near-data computing services for resource-and-delay sensitive IoT applications via task offloading.
Edit intent: clarity
Original:  To tackle the problemin a distributed and efficient way, we develop TODG, a joint channel allocation and task scheduling algorithm, which can achieve an adjustable trade-off between algorithm complexity and optimality.
Edit intent: coherence
Original:  Further, we perform a comprehensive theoretical analysis on TODG, in terms of the optimality gap,  delay guarantees, and impacts of system parameters.
Revised:  Further, we present a comprehensive analysis for TODG, in terms of the optimality gap, delay guarantees, and impacts of system parameters.
Edit intent: clarity
Original:  Further, we perform a comprehensive theoretical analysis on TODG, in terms of the optimality gap,  delay guarantees, and impacts of system parameters.
Revised:  Further, we perform a comprehensive theoretical analysis on TODG, in terms of the optimality gap, the delay guarantees, and impacts of system parameters.
Edit intent: fluency
Original:  Further, we perform a comprehensive theoretical analysis on TODG, in terms of the optimality gap,  delay guarantees, and impacts of system parameters.
Revised:  Further, we perform a comprehensive theoretical analysis on TODG, in terms of the optimality gap, delay guarantees, and the impact of system parameters.
Edit intent: fluency
Original:  The flux-based VP method modifies the diffusion coefficient of the original elliptic (Poisson) equation and uses a flux-forcing function as a source term in the equation to impose the desired Neumann boundary conditions.
Revised:  The flux-based VP method modifies the diffusion coefficient of the original elliptic (Poisson) equation and uses a flux-forcing function as a source term in the equation to impose the Neumann boundary conditions.
Edit intent: clarity
Original:  Sakurai et al. relied on  analytical construction of flux-forcing functions, which limits the practicality of the approach.
Revised:  Sakurai et al. relied on an analytical construction of flux-forcing functions, which limits the practicality of the approach.
Edit intent: fluency