wanyu/IteraTeR_v2 huggingface dataset:
Original: In the paper `` Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares '' , TCS Volume 769 (2019), pages 63--74, the LHIT problem is proposed as follows: For a given set of non-intersecting line segments {\cal L} = \{\ell_1, \ell_2, \ldots, \ell_n\} in I\!\!
Revised: In the paper `` Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares " , TCS Volume 769 (2019), pages 63--74, the LHIT problem is proposed as follows: For a given set of non-intersecting line segments {\cal L} = \{\ell_1, \ell_2, \ldots, \ell_n\} in I\!\!
Edit intent: fluency
Original:  A key idea is to directly access the Fourier coefficients of a principal curvature as a function of the arclength through a natural change of variable .
Revised:  A key idea is to directly access the Fourier coefficients of a principal curvature as a function of the arclength through a natural change of variables .
Edit intent: fluency
Original: In the last decades, the frequency of pandemics has been increased due to the growth of urbanization and mobility among countries.
Revised: In the past few decades, the frequency of pandemics has been increased due to the growth of urbanization and mobility among countries.
Edit intent: clarity
Original:  In this paper, we propose a model of disease spreading in a  modular complex network (having communities) and study how the number of bridge nodes n that connect communities affects the disease spreading .
Revised:  In this paper, we propose a model of disease spreading in a modular complex network (having communities) and study how the number of bridge nodes n that connect communities affects disease spread .
Edit intent: coherence
Original:  At the steady state, we find that near the critical point as the number of bridge nodes increases, the disease could reach all the communitiesbut with a small fraction of recovered nodes in each community .
Revised:  We find that near the critical point as the number of bridge nodes increases, the disease could reach all the communitiesbut with a small fraction of recovered nodes in each community .
Edit intent: coherence
Original:  At the steady state, we find that near the critical point as the number of bridge nodes increases, the disease could reach all the communitiesbut with a small fraction of recovered nodes in each community .
Revised:  At the steady state, we find that near the critical point as n increases, the disease could reach all the communitiesbut with a small fraction of recovered nodes in each community .
Edit intent: clarity
Original:  At the steady state, we find that near the critical point as the number of bridge nodes increases, the disease could reach all the communitiesbut with a small fraction of recovered nodes in each community .
Revised:  At the steady state, we find that near the critical point as the number of bridge nodes increases, the disease reaches most of the communities, but each community has only a small fraction of recovered nodes in each community .
Edit intent: clarity
Original:  At the steady state, we find that near the critical point as the number of bridge nodes increases, the disease could reach all the communitiesbut with a small fraction of recovered nodes in each community .
Revised:  At the steady state, we find that near the critical point as the number of bridge nodes increases, the disease could reach all the communitiesbut with a small fraction of recovered nodes .
Edit intent: clarity
Original:  This scenario could make more difficult the decision to launch or not a pandemic alert  .
Revised:  This scenario could make the decision on whether to launch a pandemic alert .
Edit intent: clarity
Original:  This scenario could make more difficult the decision to launch or not a pandemic alert  .
Revised:  This scenario could make more difficult the decision to launch or not a pandemic alert or not more difficult .
Edit intent: clarity
Original:  In this paper, we present two novel methods to find I/O lower bounds for an arbitrary computation graph.
Revised:  However, prior methods for finding I/O lower bounds for an arbitrary computation graph.
Edit intent: clarity
Original:  We further empirically validate our methods on four computation graphs, and find that our methods provide tighter bounds than current empirical methods and behave similarly to previously published I/O bounds.
Revised:  We further empirically validate our bound on four computation graphs, and find that our methods provide tighter bounds than current empirical methods and behave similarly to previously published I/O bounds.
Edit intent: clarity
Original:  We further empirically validate our methods on four computation graphs, and find that our methods provide tighter bounds than current empirical methods and behave similarly to previously published I/O bounds.
Revised:  We further empirically validate our methods on four computation graphs, and find that our method provides tighter bounds than current empirical methods and behave similarly to previously published I/O bounds.
Edit intent: fluency
Original:  We further empirically validate our methods on four computation graphs, and find that our methods provide tighter bounds than current empirical methods and behave similarly to previously published I/O bounds.
Revised:  We further empirically validate our methods on four computation graphs, and find that our methods provide tighter bounds than current empirical methods and behaves similarly to previously published I/O bounds.
Edit intent: fluency
Original: Effective congestion control in a multi-tenant data center is becoming increasingly challenging with rapidly increasing workload demand, ever faster links, small average transfer sizes, extremely bursty traffic, limited switch buffer capacity, and one-way protocols such as RDMA. Existing deployed algorithms, such as  DCQCN, are still far from optimal in many plausible scenarios, particularly for tail latency.
Revised: Effective congestion control for data center networks is becoming increasingly challenging with rapidly increasing workload demand, ever faster links, small average transfer sizes, extremely bursty traffic, limited switch buffer capacity, and one-way protocols such as RDMA. Existing deployed algorithms, such as DCQCN, are still far from optimal in many plausible scenarios, particularly for tail latency.
Edit intent: clarity
Original: Effective congestion control in a multi-tenant data center is becoming increasingly challenging with rapidly increasing workload demand, ever faster links, small average transfer sizes, extremely bursty traffic, limited switch buffer capacity, and one-way protocols such as RDMA. Existing deployed algorithms, such as  DCQCN, are still far from optimal in many plausible scenarios, particularly for tail latency.
Revised: Effective congestion control in a multi-tenant data center is becoming increasingly challenging with rapidly increasing workload demand, ever faster links, small average transfer sizes, extremely bursty traffic, limited switch buffer capacity, and latency-sensitive applications. Widely deployed algorithms, such as DCQCN, are still far from optimal in many plausible scenarios, particularly for tail latency.
Edit intent: clarity
Original:  In this paper, we argue that we have reached the practical limits of end to end congestion control.
Revised:  In this paper, we argue that we have reached the practical limits of end-to-end congestion control.
Edit intent: fluency
Original:  We show that our approach achieves near optimal tail latency behavior even under challenging conditions such as high average link utilization and incast cross traffic.
Revised:  We show that our approach achieves near optimal tail latency behavior even under challenging conditions such as high link utilization and incast cross traffic.
Edit intent: clarity
Original:  We show that our approach achieves near optimal tail latency behavior even under challenging conditions such as high average link utilization and incast cross traffic.
Revised:  We show that our approach achieves near optimal tail latency behavior even under challenging conditions such as high average link utilization and in-cast cross traffic.
Edit intent: fluency
Original:  By contrast with prior hop-by-hop schemes, our main innovation is to show that per-flow flow control can be achieved with limited metadata and packet buffering .
Revised:  By contrast with prior hop-by-hop schemes, we show that per-flow flow control can be achieved with limited metadata and packet buffering .
Edit intent: clarity
Original:  By contrast with prior hop-by-hop schemes, our main innovation is to show that per-flow flow control can be achieved with limited metadata and packet buffering .
Revised:  By contrast with prior hop-by-hop schemes, our main innovation is to show that per-flow flow control requires only limited metadata and packet buffering .
Edit intent: clarity
Original: Effective congestion control for data center networks is becoming increasingly challenging with rapidly increasing workload demand, ever faster links, small average transfer sizes, extremely bursty traffic , limited switch buffer capacity, and latency-sensitive applications .
Revised: Effective congestion control for data center networks is becoming increasingly challenging with a growing amount of latency sensitive traffic, much fatter links, and extremely bursty traffic , limited switch buffer capacity, and latency-sensitive applications .
Edit intent: clarity
Original: Effective congestion control for data center networks is becoming increasingly challenging with rapidly increasing workload demand, ever faster links, small average transfer sizes, extremely bursty traffic , limited switch buffer capacity, and latency-sensitive applications .
Revised: Effective congestion control for data center networks is becoming increasingly challenging with rapidly increasing workload demand, ever faster links, small average transfer sizes, extremely bursty traffic .
Edit intent: coherence
Original:  We show that our approach achieves near optimal  tail latency behavior even under challenging conditions such as high link utilization and in-cast cross traffic.
Revised:  We show that our approach achieves near optimal throughput and tail latency behavior even under challenging conditions such as high link utilization and in-cast cross traffic.
Edit intent: clarity
Original:  We show that our approach achieves near optimal  tail latency behavior even under challenging conditions such as high link utilization and in-cast cross traffic.
Revised:  We show that our approach achieves near optimal tail latency behavior even under challenging conditions such as high network load and incast cross traffic.
Edit intent: clarity
Original:  Specifically, the mainstream algorithms, which have unexceptionally relied on the simplified rotation vector  , are considerably extended by the Taylor series expansion approach using the exact rotation vector and recursive calculation of high-order derivatives.
Revised:  Specifically, the mainstream algorithms, which have relied on the simplified rotation vector , are considerably extended by the Taylor series expansion approach using the exact rotation vector and recursive calculation of high-order derivatives.
Edit intent: clarity
Original:  Specifically, the mainstream algorithms, which have unexceptionally relied on the simplified rotation vector  , are considerably extended by the Taylor series expansion approach using the exact rotation vector and recursive calculation of high-order derivatives.
Revised:  Specifically, the mainstream algorithms, which have unexceptionally relied on the simplified rotation vector without exception , are considerably extended by the Taylor series expansion approach using the exact rotation vector and recursive calculation of high-order derivatives.
Edit intent: clarity
Original:  in the range of higher relative frequency, the group of Quat/Rod/RotFIter algorithms (by the functional iterative integration approach combined with the Chebyshev polynomial) perform the best in both accuracy and robustness to the Runge phenomenon , thanks to the excellent numerical stability and powerful functional representation capability of the Chebyshev polynomial.
Revised:  in the range of higher relative frequency, the group of Quat/Rod/RotFIter algorithms (by the functional iterative integration approach combined with the Chebyshev polynomial) perform the best in both accuracy and robustness , thanks to the excellent numerical stability and powerful functional representation capability of the Chebyshev polynomial.
Edit intent: clarity
Original:  We show that the game is equivalent to the Prisoner's dilemma  which implies that the rational collective decision is the opposite of the socially optimum (e.g., Tragedy of the Commons).
Revised:  We show that the game is equivalent to the Prisoner's dilemma , which implies that the rational collective decision is the opposite of the socially optimum (e.g., Tragedy of the Commons).
Edit intent: fluency
Original:  In the first approach, we implement a social mechanism that enforces players to non-CAV travel and derive a lower bound of players that leads to an equilibrium of non-CAV traveling .
Revised:  In the first approach, we implement a social mechanism that enforces players to non-CAV travel and derive a lower bound of players that leads to an equilibrium of non-CAV travel .
Edit intent: clarity
Original:  We also performed a numerical study for the latter approach demonstrating the effectiveness of our results.
Revised:  We also perform a numerical study for the latter approach demonstrating the effectiveness of our results.
Edit intent: fluency
Original:  To tackle this phenomenon, we present two different approaches, i.e., one with a preference structure and the other with institutional arrangements.
Revised:  To tackle this phenomenon, we present two different solutions to tackle this phenomenon: one with a preference structure and the other with institutional arrangements.
Edit intent: clarity
Original:  In the first approach, we implement a social mechanism that enforces players to non-CAV travel and derive a lower bound of players that leads to an equilibrium of non-CAV travel.
Revised:  In the first approach, we implement a social mechanism that incentivizes players to non-CAV travel and derive a lower bound of players that leads to an equilibrium of non-CAV travel.
Edit intent: clarity
Original:  In the first approach, we implement a social mechanism that enforces players to non-CAV travel and derive a lower bound of players that leads to an equilibrium of non-CAV travel.
Revised:  In the first approach, we implement a social mechanism that enforces players to non-CAV travel and derive a lower bound on the players that ensures an equilibrium of non-CAV travel.
Edit intent: clarity
Original:  We show that as the number of players increases, the incentive ratio of non-CAV travel over CAV-travel tends to zero.
Revised:  We show that as the number of players increases, the incentive ratio of non-CAV travel over CAV travel tends to zero.
Edit intent: clarity
Original:  We also perform a numerical study for the latter approach demonstrating the effectiveness of our results .
Revised:  We also perform a numerical study .
Edit intent: clarity
Original:  In the last example, an IT2FPID is used in a linear time-delay system.
Revised:  In the last example, an IT2FPID is designed and used for controlling a linear time-delay system.
Edit intent: clarity
Original: Prosocial behavior, which means paying a cost for others to receive a benefit, is encountered in the donation game, the prisoner's dilemma, relaxed social dilemmas, and public goods games.
Revised: Prosocial behaviors are encountered in the donation game, the prisoner's dilemma, relaxed social dilemmas, and public goods games.
Edit intent: clarity
Original:  Many studies of prosociality assume that the population structure is either homogeneous, meaning all individuals have the same number of interaction partners, or that the social good is of one particular type.
Revised:  Many studies assume that the population structure is either homogeneous, meaning all individuals have the same number of interaction partners, or that the social good is of one particular type.
Edit intent: clarity
Original:  Many studies of prosociality assume that the population structure is either homogeneous, meaning all individuals have the same number of interaction partners, or that the social good is of one particular type.
Revised:  Many studies of prosociality assume that the population structure is homogeneous, meaning all individuals have the same number of interaction partners, or that the social good is of one particular type.
Edit intent: clarity
Original:  Here, we study general evolutionary dynamics for arbitrary kinds of social goods.
Revised:  Here, we explore general evolutionary dynamics for arbitrary kinds of social goods.
Edit intent: clarity
Original:  We find that heterogeneous population structures, where some individuals have many more interaction partners than others, are extremely conducive for the evolution of prosocial behaviors.
Revised:  We find that heterogeneous networks, wherein some individuals have many more interaction partners than others, are extremely conducive for the evolution of prosocial behaviors.
Edit intent: clarity
Original:  We find that heterogeneous population structures, where some individuals have many more interaction partners than others, are extremely conducive for the evolution of prosocial behaviors.
Revised:  We find that heterogeneous population structures, where some individuals have many more interaction partners than others, can enhance the evolution of prosocial behaviors.
Edit intent: clarity
Original:  Furthermore, prosocial behaviors can evolve that accumulate most of the benefit in a few highly connected nodes while many peripheral nodes receive low or negative payoff.
Revised:  However, they often accumulate most of the benefit in a few highly connected nodes while many peripheral nodes receive low or negative payoff.
Edit intent: coherence
Original:  Furthermore, prosocial behaviors can evolve that accumulate most of the benefit in a few highly connected nodes while many peripheral nodes receive low or negative payoff.
Revised:  Furthermore, prosocial behaviors can evolve that accumulate most of the benefits in the hands of a few highly-connected individuals, while many others receive low or negative payoff.
Edit intent: clarity
Original:  Surprisingly, prosociality can evolve even if the total costs exceed the total benefits.
Revised:  Surprisingly, selection can favor producers of social goods even if the total costs exceed the total benefits.
Edit intent: clarity
Original:  Therefore, the highly heterogeneous interaction structure of human society, which is augmented by the internet, strongly promotes the emergence of prosocial behaviors but also creates the possibility of generating tremendous inequality.
Revised:  In summary, heterogeneous structures have the ability to strongly promote the emergence of prosocial behaviors but also creates the possibility of generating tremendous inequality.
Edit intent: clarity
Original:  Therefore, the highly heterogeneous interaction structure of human society, which is augmented by the internet, strongly promotes the emergence of prosocial behaviors but also creates the possibility of generating tremendous inequality.
Revised:  Therefore, the highly heterogeneous interaction structure of human society, which is augmented by the internet, strongly promotes the emergence of prosocial behaviors , but they also create the possibility of generating tremendous inequality.
Edit intent: clarity
Original:  Therefore, the highly heterogeneous interaction structure of human society, which is augmented by the internet, strongly promotes the emergence of prosocial behaviors but also creates the possibility of generating tremendous inequality.
Revised:  Therefore, the highly heterogeneous interaction structure of human society, which is augmented by the internet, strongly promotes the emergence of prosocial behaviors but also creates the possibility of generating large inequality.
Edit intent: clarity
Original:  We  characterize four classes of instances in which a pure Nash equilibrium (NE) is guaranteed to exist , and show, by means of an example, that none of these characterizations can be relaxed.
Revised:  We characterize four classes of instances in which a pure Nash equilibrium is guaranteed to exist , and show, by means of an example, that none of these characterizations can be relaxed.
Edit intent: clarity
Original:  We then bound the performance of Nash equilibria for each of these classes with respect to the makespan of the schedule and the sum of completion times.
Revised:  We then bound the performance of Nash equilibria with respect to the makespan of the schedule and the sum of completion times.
Edit intent: clarity
Original:  For instance, we prove that it is NP-hard to decide whether a NE exists, and that even for instances with identical machines, for which a NE is guaranteed to exist, it is NP-hard to approximate the best NE within a factor of 2-\frac{1{m}-\epsilon for all \epsilon>0.
Revised:  For instance, we prove that it is NP-hard to decide whether a NE exists, and that even for instances with identical machines, it is NP-hard to approximate the best NE within a factor of 2-\frac{1{m}-\epsilon for all \epsilon>0.
Edit intent: clarity
Original:  Automatic lyrics  transcription in polyphonic music is a challenging task because the singing vocals are corrupted by the background music.
Revised:  Automatic lyrics transcription in polyphonic music are challenging tasks because the singing vocals are corrupted by the background music.
Edit intent: fluency
Original:  For this purpose, we firstly study and compare several automatic speech recognition pipelines for the application of lyrics transcription.
Revised:  We first compare several automatic speech recognition pipelines for the application of lyrics transcription.
Edit intent: coherence
Original:  Later, we present the lyrics  transcription performance of these music-informed acoustic models for the best-performing pipeline, and systematically study the impact of music genre and language model on the performance.
Revised:  We then present the lyrics transcription performance of these music-informed acoustic models for the best-performing pipeline, and systematically study the impact of music genre and language model on the performance.
Edit intent: coherence
Original:  Later, we present the lyrics  transcription performance of these music-informed acoustic models for the best-performing pipeline, and systematically study the impact of music genre and language model on the performance.
Revised:  Later, we present the lyrics transcription performance of music-informed acoustic models for the best-performing pipeline, and systematically study the impact of music genre and language model on the performance.
Edit intent: clarity
Original:  With this genre-based approach, we explicitly model the characteristics of music , instead of trying to remove the background music as noise .
Revised:  With such genre-based approach, we explicitly model the characteristics of music , instead of trying to remove the background music as noise .
Edit intent: clarity
Original:  With this genre-based approach, we explicitly model the characteristics of music , instead of trying to remove the background music as noise .
Revised:  With this genre-based approach, we explicitly model the music without removing it during acoustic modeling .
Edit intent: clarity
Original:  The proposed approach achieves a significant improvement in performance in the lyrics transcription and alignment tasks on several well-known polyphonic test datasets , outperforming all comparable existing systems .
Revised:  The proposed approach outperforms all competing systems in the lyrics alignment and transcription tasks on several well-known polyphonic test datasets , outperforming all comparable existing systems .
Edit intent: clarity