wanyu/IteraTeR_v2 huggingface dataset:
Original:  For the special case of deterministic scheduling (i.e.  \Delta=0), our bound matches the tight performance ratio %DIFDELCMD < \tfrac %%% 1 2 (1+ \sqrt 2 ) of this algorithm (WSPT rule)  by Kawaguchi and Kyan from 1986.
Revised:  For the special case of deterministic scheduling (i.e. , \Delta=0), our bound matches the tight performance ratio %DIFDELCMD < \tfrac %%% 1 2 (1+ \sqrt 2 ) of this algorithm (WSPT rule) by Kawaguchi and Kyan from 1986.
Edit intent: fluency
Original:  For the special case of deterministic scheduling (i.e.  \Delta=0), our bound matches the tight performance ratio %DIFDELCMD < \tfrac %%% 1 2 (1+ \sqrt 2 ) of this algorithm (WSPT rule)  by Kawaguchi and Kyan from 1986.
Revised:  For the special case of deterministic scheduling (i.e. \Delta=0), our bound matches the tight performance ratio %DIFDELCMD < \tfrac %%% 1 2 (1+ \sqrt 2 ) of this algorithm (WSPT rule) , derived by Kawaguchi and Kyan from 1986.
Edit intent: clarity
Original:  It has been shown that block-based kernels are helpful to achieve high performance, but also that they are difficult to use in practice because of the important zero padding they imply .
Revised:  Although it has been shown that block-based kernels are helpful to achieve high performance, but also that they are difficult to use in practice because of the important zero padding they imply .
Edit intent: coherence
Original:  It has been shown that block-based kernels are helpful to achieve high performance, but also that they are difficult to use in practice because of the important zero padding they imply .
Revised:  It has been shown that block-based kernels help to achieve high performance, but also that they are difficult to use in practice because of the important zero padding they imply .
Edit intent: clarity
Original:  It has been shown that block-based kernels are helpful to achieve high performance, but also that they are difficult to use in practice because of the important zero padding they imply .
Revised:  It has been shown that block-based kernels are helpful to achieve high performance, they are difficult to use in practice because of the important zero padding they imply .
Edit intent: coherence
Original:  It has been shown that block-based kernels are helpful to achieve high performance, but also that they are difficult to use in practice because of the important zero padding they imply .
Revised:  It has been shown that block-based kernels are helpful to achieve high performance, but also that they are difficult to use in practice because of the zero padding they imply .
Edit intent: clarity
Original:  It has been shown that block-based kernels are helpful to achieve high performance, but also that they are difficult to use in practice because of the important zero padding they imply .
Revised:  It has been shown that block-based kernels are helpful to achieve high performance, but also that they are difficult to use in practice because of the important zero padding they require .
Edit intent: clarity
Original:  Considering that the optimal blocking size depends on the matrix, we also provide a method to predict the best kernel to be used utilizing a simple interpolation of the results from the previous executions.
Revised:  Considering that the optimal blocking size depends on the matrix, we also provide a method to predict the best kernel to be used utilizing a simple interpolation of results from previous executions.
Edit intent: fluency
Original:  We compare the performance of our approach against the Intel MKL CSR kernel and the CSR5 open-source package on a set of standard benchmark matrices.
Revised:  We compare the performance of our approach to that of the Intel MKL CSR kernel and the CSR5 open-source package on a set of standard benchmark matrices.
Edit intent: clarity
Original:  We show that we can achieve significant improvements in many cases, both for sequential and for parallel execution .
Revised:  We show that we can achieve significant improvements in many cases, both for sequential and for parallel executions .
Edit intent: fluency
Original: Most indirect hexahedral meshing methods rely on 10 patterns of subdivision of the hexahedron into tetrahedra .
Revised: This article answers an important theoretical question: How many different subdivisions of the hexahedron into tetrahedra .
Edit intent: clarity
Original:  It is well known that a cube has five subdivisions into 6 tetrahedra and one subdivision into 5 tetrahedra.
Revised:  It is well known that the cube has five subdivisions into 6 tetrahedra and one subdivision into 5 tetrahedra.
Edit intent: fluency
Original:  However, all hexahedra are not cubes and moving  vertex positions increases the number of subdivisions.
Revised:  However, all hexahedra are not cubes and moving the vertex positions increases the number of subdivisions.
Edit intent: coherence
Original:  We exhibit the tetrahedral meshes for these geometries and show in particular triangulations of the hexahedron with 14 tetrahedra .
Revised:  We exhibit the tetrahedral meshes for these configurations and show in particular triangulations of the hexahedron with 14 tetrahedra .
Edit intent: clarity
Original:  Some numerical experiments are given to illustrate the application of the proposed methods to large-scale problems .
Revised:  Some numerical experiments are given to illustrate the application of the proposed methods to large-scale problems 
Edit intent: fluency
Original:  Amongst others, the duration, type and structure of connections  play a crucial role in how diseases invade and spread through populations .
Revised:  Amongst others, the duration, type and structure of connections play a crucial role in how diseases invade and spread .
Edit intent: clarity
Original:  The static network layer affords tunable clustering and describes an individual's permanent community or household structure.
Revised:  The static network layer affords tunable clustering and describes an individual's permanent community structure.
Edit intent: clarity
Original:  The dynamic network layer imposes edge rewiring at a constant rate, and describes an individual's transient connections made with individuals in the wider population  .
Revised:  The dynamic network layer describes the transient connections an individual makes with members of the wider population .
Edit intent: clarity
Original:  The dynamic network layer imposes edge rewiring at a constant rate, and describes an individual's transient connections made with individuals in the wider population  .
Revised:  The dynamic network layer imposes edge rewiring at a constant rate, and describes an individual's transient connections made with individuals in the wider population by imposing constant edge rewiring .
Edit intent: clarity
Original:  We follow the edge-based compartmental modelling approach to derive model equations describing the time evolution of a susceptible - infected - recovered (SIR) epidemic process spreading through a multiplex network of individuals , and we derive the basic reproduction number, measuring the expected number of new infectious cases caused by a single infectious individual in an otherwise susceptible population.
Revised:  We follow the edge-based compartmental modelling approach to derive equations describing the time evolution of a susceptible - infected - recovered (SIR) epidemic process spreading through a multiplex network of individuals , and we derive the basic reproduction number, measuring the expected number of new infectious cases caused by a single infectious individual in an otherwise susceptible population.
Edit intent: clarity
Original:  We follow the edge-based compartmental modelling approach to derive model equations describing the time evolution of a susceptible - infected - recovered (SIR) epidemic process spreading through a multiplex network of individuals , and we derive the basic reproduction number, measuring the expected number of new infectious cases caused by a single infectious individual in an otherwise susceptible population.
Revised:  We follow the edge-based compartmental modelling approach to derive model equations describing the evolution of a susceptible - infected - recovered (SIR) epidemic process spreading through a multiplex network of individuals , and we derive the basic reproduction number, measuring the expected number of new infectious cases caused by a single infectious individual in an otherwise susceptible population.
Edit intent: clarity
Original:  We follow the edge-based compartmental modelling approach to derive model equations describing the time evolution of a susceptible - infected - recovered (SIR) epidemic process spreading through a multiplex network of individuals , and we derive the basic reproduction number, measuring the expected number of new infectious cases caused by a single infectious individual in an otherwise susceptible population.
Revised:  We follow the edge-based compartmental modelling approach to derive model equations describing the time evolution of a susceptible - infected - recovered (SIR) epidemic spreading through this multiplex network of individuals , and we derive the basic reproduction number, measuring the expected number of new infectious cases caused by a single infectious individual in an otherwise susceptible population.
Edit intent: clarity
Original:  We follow the edge-based compartmental modelling approach to derive model equations describing the time evolution of a susceptible - infected - recovered (SIR) epidemic process spreading through a multiplex network of individuals , and we derive the basic reproduction number, measuring the expected number of new infectious cases caused by a single infectious individual in an otherwise susceptible population.
Revised:  We follow the edge-based compartmental modelling approach to derive model equations describing the time evolution of a susceptible - infected - recovered (SIR) epidemic process spreading through a multiplex network of individuals . We derive the basic reproduction number, measuring the expected number of new infectious cases caused by a single infectious individual in an otherwise susceptible population.
Edit intent: coherence
Original: The completely positive operators, which can be viewed as a generalization of the nonnegative matrices, are maps between spaces of linear operators arising in the study of C*-algebras .
Revised: The completely positive maps, a generalization of the nonnegative matrices, are maps between spaces of linear operators arising in the study of C*-algebras .
Edit intent: clarity
Original: The completely positive operators, which can be viewed as a generalization of the nonnegative matrices, are maps between spaces of linear operators arising in the study of C*-algebras .
Revised: The completely positive operators, which can be viewed as a generalization of the nonnegative matrices, are a well-studied class of maps from n\times n matrices to m\times m matrices .
Edit intent: clarity
Original: Catastrophic forgetting occurs when a neural network loses the information learned with the first task , after training on a second task .
Revised: Catastrophic forgetting occurs when a neural network loses the information learned with the first task , after training on subsequent tasks .
Edit intent: clarity
Original:  This problem remains a hurdle for general artificial intelligence systems with sequential learning capabilities.
Revised:  This problem remains a hurdle for artificial intelligence systems with sequential learning capabilities.
Edit intent: clarity
Original:  In this paper, we propose a task-based hard attention mechanism that preserves previous tasks' information without substantially affecting the current task's learning.
Revised:  In this paper, we propose a task-based hard attention mechanism that preserves previous tasks' information without affecting the current task's learning.
Edit intent: clarity
Original:  An attention mask is learned concurrently to every task  through stochastic gradient descent, and previous masks are exploited to constrain such learning.
Revised:  An attention mask is learned concurrently to every task , through stochastic gradient descent, and previous masks are exploited to constrain such learning.
Edit intent: fluency
Original:  An attention mask is learned concurrently to every task  through stochastic gradient descent, and previous masks are exploited to constrain such learning.
Revised:  An attention mask is learned concurrently to every task through stochastic gradient descent, and previous masks are exploited to condition such learning.
Edit intent: clarity
Original:  We also show that it is robust to different hyperparameter choices  and that it offers a number of monitoring capabilities.
Revised:  We also show that it is robust to different hyperparameter choices , and that it offers a number of monitoring capabilities.
Edit intent: fluency
Original:  The approach features the possibility to control both the stability and compactness of the learned knowledge, which we believe makes it also attractive for online learning and network compression applications.
Revised:  The approach features the possibility to control both the stability and compactness of the learned knowledge, which we believe makes it also attractive for online learning or network compression applications.
Edit intent: fluency
Original:  We investigated the relationship between aerobic fitness and tip-of-the-tongue states.
Revised:  In a cross-sectional sample, we investigated the relationship between aerobic fitness and tip-of-the-tongue states.
Edit intent: clarity
Original:  We found that healthy older adults indeed experience more tip-of-the-tongue states , and that when they do they have access to less information about the word's sound structure, compared to young controls .
Revised:  We found that healthy older adults indeed experience more tip-of-the-tongue states than young adults .
Edit intent: clarity
Original:  Importantly, higher aerobic fitness levels decrease the probability of experiencing tip-of-the-tongue states in healthy older adults , over and above the effect of age.
Revised:  Importantly, higher aerobic fitness levels decrease the probability of experiencing tip-of-the-tongue states in healthy older adults , over and above effects of age.
Edit intent: fluency
Original: To choose a  multi-winner rule, i.e., a voting rule that selects a subset of k alternatives based on preferences of a certain population , is a hard and ambiguous task.
Revised: To choose a suitable multi-winner rule, i.e., a voting rule that selects a subset of k alternatives based on preferences of a certain population , is a hard and ambiguous task.
Edit intent: clarity
Original: To choose a  multi-winner rule, i.e., a voting rule that selects a subset of k alternatives based on preferences of a certain population , is a hard and ambiguous task.
Revised: To choose a multi-winner rule, i.e., a voting rule for selecting a subset of k alternatives based on preferences of a certain population , is a hard and ambiguous task.
Edit intent: clarity
Original: To choose a  multi-winner rule, i.e., a voting rule that selects a subset of k alternatives based on preferences of a certain population , is a hard and ambiguous task.
Revised: To choose a multi-winner rule, i.e., a voting rule that selects a subset of k alternatives based on a collection of preferences , is a hard and ambiguous task.
Edit intent: clarity
Original:  Depending on the context, it varies widely what constitutes  an "optimal" committee .
Revised:  Depending on the context, it varies widely what constitutes the choice of an "optimal" committee .
Edit intent: clarity
Original:  In this paper, we offer a new perspective to measure the quality of committees and---consequently---multi-winner rules.
Revised:  In this paper, we offer a new perspective to measure the quality of such subsets and---consequently---multi-winner rules.
Edit intent: clarity
Original:  We provide a quantitative analysis using methods from the theory of approximation algorithms and estimate how well multi-winner rules approximate two extreme objectives: diversity as captured by the (Approval) Chamberlin--Courant rule (CC) and individual excellence as captured by Approval Voting (AV) . With both theoretical and experimental methods we establish a classification of multi-winner rules in terms of their quantitative alignment with these two opposing objectives.
Revised:  We provide a quantitative analysis using methods from the theory of approximation algorithms and estimate how well multi-winner rules approximate two extreme objectives: diversity as captured by the (Approval) Chamberlin--Courant rule and individual excellence as captured by Approval Voting (AV) . With both theoretical and experimental methods we establish a classification of multi-winner rules in terms of their quantitative alignment with these two opposing objectives.
Edit intent: clarity
Original:  We provide a quantitative analysis using methods from the theory of approximation algorithms and estimate how well multi-winner rules approximate two extreme objectives: diversity as captured by the (Approval) Chamberlin--Courant rule (CC) and individual excellence as captured by Approval Voting (AV) . With both theoretical and experimental methods we establish a classification of multi-winner rules in terms of their quantitative alignment with these two opposing objectives.
Revised:  We provide a quantitative analysis using methods from the theory of approximation algorithms and estimate how well multi-winner rules approximate two extreme objectives: diversity as captured by the (Approval) Chamberlin--Courant rule (CC) and individual excellence as captured by Multi-winner Approval Voting . With both theoretical and experimental methods we establish a classification of multi-winner rules in terms of their quantitative alignment with these two opposing objectives.
Edit intent: clarity
Original:  We provide a quantitative analysis using methods from the theory of approximation algorithms and estimate how well multi-winner rules approximate two extreme objectives: diversity as captured by the (Approval) Chamberlin--Courant rule (CC) and individual excellence as captured by Approval Voting (AV) . With both theoretical and experimental methods we establish a classification of multi-winner rules in terms of their quantitative alignment with these two opposing objectives.
Revised:  We provide a quantitative analysis using methods from the theory of approximation algorithms and estimate how well multi-winner rules approximate two extreme objectives: diversity as captured by the (Approval) Chamberlin--Courant rule (CC) and individual excellence as captured by Approval Voting (AV) . With both theoretical and experimental methods we classify multi-winner rules in terms of their quantitative alignment with these two opposing objectives.
Edit intent: coherence
Original: To choose a suitable multi-winner rule, i.e., a voting rule for selecting a subset of k alternatives based on a collection of preferences, is a hard and ambiguous task.
Revised: To choose a suitable multi-winner voting rule is a hard and ambiguous task.
Edit intent: coherence
Original:  Depending on the context, it varies widely what constitutes the choice of an "optimal" subset  .
Revised:  Depending on the context, it varies widely what constitutes the choice of an "optimal" subset of alternatives .
Edit intent: clarity
Original:  In this paper, we offer a new perspective to measure the quality of such subsets and---consequently---multi-winner rules.
Revised:  In this paper, we offer a new perspective on measuring the quality of such subsets and---consequently---multi-winner rules.
Edit intent: fluency
Original:  In this paper, we offer a new perspective to measure the quality of such subsets and---consequently---multi-winner rules.
Revised:  In this paper, we offer a new perspective to measure the quality of such subsets and---consequently---of multi-winner rules.
Edit intent: fluency
Original:  We provide a quantitative analysis using methods from the theory of approximation algorithms and estimate how well multi-winner rules approximate two extreme objectives: diversity as captured by the (Approval ) Chamberlin--Courant rule and individual excellence as captured by Multi-winner Approval Voting.
Revised:  We provide a quantitative analysis using methods from the theory of approximation algorithms and estimate how well multi-winner rules approximate two extreme objectives: diversity as captured by the (Approval ) Chamberlin--Courant rule and a utilitarian criterion defined via Multi-winner Approval Voting.
Edit intent: clarity
Original: To choose a suitable multi-winner voting rule is a hard and ambiguous task.
Revised: To choose a suitable multiwinner voting rule is a hard and ambiguous task.
Edit intent: fluency
Original:  Depending on the context, it varies widely what constitutes the choice of an "optimal" subset of alternatives.
Revised:  Depending on the context, it varies widely what constitutes the choice of an ``optimal'' subset of alternatives.
Edit intent: fluency
Original:  We provide a quantitative analysis  using methods from the theory of approximation algorithms and estimate how well multi-winner rules approximate two extreme objectives: a representation criterion defined via the Approval Chamberlin--Courant rule and a utilitarian criterion defined via Multi-winner Approval Voting.
Revised:  We provide a quantitative analysis of multiwinner voting rules using methods from the theory of approximation algorithms and estimate how well multi-winner rules approximate two extreme objectives: a representation criterion defined via the Approval Chamberlin--Courant rule and a utilitarian criterion defined via Multi-winner Approval Voting.
Edit intent: fluency
Original:  We provide a quantitative analysis  using methods from the theory of approximation algorithms and estimate how well multi-winner rules approximate two extreme objectives: a representation criterion defined via the Approval Chamberlin--Courant rule and a utilitarian criterion defined via Multi-winner Approval Voting.
Revised:  We provide a quantitative analysis using methods from the theory of approximation algorithms---we estimate how well multi-winner rules approximate two extreme objectives: a representation criterion defined via the Approval Chamberlin--Courant rule and a utilitarian criterion defined via Multi-winner Approval Voting.
Edit intent: coherence
Original:  We provide a quantitative analysis  using methods from the theory of approximation algorithms and estimate how well multi-winner rules approximate two extreme objectives: a representation criterion defined via the Approval Chamberlin--Courant rule and a utilitarian criterion defined via Multi-winner Approval Voting.
Revised:  We provide a quantitative analysis using methods from the theory of approximation algorithms and estimate how well multiwinner rules approximate two extreme objectives: a representation criterion defined via the Approval Chamberlin--Courant rule and a utilitarian criterion defined via Multi-winner Approval Voting.
Edit intent: fluency
Original:  We provide a quantitative analysis  using methods from the theory of approximation algorithms and estimate how well multi-winner rules approximate two extreme objectives: a representation criterion defined via the Approval Chamberlin--Courant rule and a utilitarian criterion defined via Multi-winner Approval Voting.
Revised:  We provide a quantitative analysis using methods from the theory of approximation algorithms and estimate how well multi-winner rules approximate two extreme objectives: a representation criterion defined via the Approval Chamberlin--Courant rule and a utilitarian criterion defined via Multiwinner Approval Voting.
Edit intent: fluency
Original:  With both theoretical and experimental methods we classify multi-winner rules in terms of their quantitative alignment with these two opposing objectives.
Revised:  With both theoretical and experimental methods , we classify multiwinner rules in terms of their quantitative alignment with these two opposing objectives.
Edit intent: fluency