wanyu/IteraTeR_v2 huggingface dataset:
Original:  We argue that the proposed scheme enables fair and robust cell selection , in addition to efficient and periodical tracking of the user , in the presence of the channel variability expected at mmWaves  .
Revised:  We argue that the proposed scheme enables fair and robust cell selection , in addition to efficient and periodical tracking of the user , in the presence of the channel dynamics expected at mmWaves .
Edit intent: clarity
Original:  Specifically, we formulate the subchannel allocation as a many-to-many matching problem with externalities, and develop an iterative usersubchannel swap algorithm.
Revised:  Specifically, we formulate the subchannel allocation as a many-to-many matching problem with externalities, and develop an iterative user-subchannel swap algorithm.
Edit intent: fluency
Original:  Analytical and simulation results show that the proposed D2D-U scheme can significantly improve the network capacity .
Revised:  Analytical and simulation results show that the proposed D2D-U scheme can significantly improve the system sum-rate .
Edit intent: clarity
Original: An algorithmic summary and comparison of the methodological and numerical properties of competing parametric model reduction techniques is presented for a planar nonlinear thermal conduction problem .
Revised: A novel algorithmic discussion of the methodological and numerical properties of competing parametric model reduction techniques is presented for a planar nonlinear thermal conduction problem .
Edit intent: clarity
Original: An algorithmic summary and comparison of the methodological and numerical properties of competing parametric model reduction techniques is presented for a planar nonlinear thermal conduction problem .
Revised: An algorithmic summary and comparison of the methodological and numerical differences of competing parametric model reduction techniques is presented for a planar nonlinear thermal conduction problem .
Edit intent: clarity
Original: An algorithmic summary and comparison of the methodological and numerical properties of competing parametric model reduction techniques is presented for a planar nonlinear thermal conduction problem .
Revised: An algorithmic summary and comparison of the methodological and numerical properties of competing parametric model reduction techniques for nonlinear problems are presented .
Edit intent: clarity
Original:  First, the Galerkin reduced basis (RB) formulation is presented which fails at providing significant gains with respect to the computational efficiency for the nonlinear problem . Renown methods for the reduction of the computing time of nonlinear reduced order models are the Hyper-Reduction and the (Discrete) Empirical Interpolation Method (EIM, DEIM).
Revised:  First, the Galerkin reduced basis (RB) formulation is presented which fails at providing significant gains with respect to the computational efficiency for nonlinear problems . Renown methods for the reduction of the computing time of nonlinear reduced order models are the Hyper-Reduction and the (Discrete) Empirical Interpolation Method (EIM, DEIM).
Edit intent: fluency
Original: Understanding the evolutionary relationship between species is of fundamental importance to the biological sciences.
Revised: Understanding the evolutionary relationship among species is of fundamental importance to the biological sciences.
Edit intent: fluency
Original:  It is known that the most general Markov models of nucleotide substitution can also not identify the location of the root nor be fitted to multiple sequence alignments with less than three sequences.
Revised:  It is known that the most general Markov models of nucleotide substitution can also not identify the location of the root or be fitted to multiple sequence alignments with less than three sequences.
Edit intent: fluency
Original: This is an extended abstract that presents the concepts of ' nominal intervals' and 'full generification' , as well as makes some suggestions that are likely to help in building GNOOP as an accurate mathematical model of generic nominally-typed OOP.
Revised: This is an extended abstract that presents the concepts of ` nominal intervals' and 'full generification' , as well as makes some suggestions that are likely to help in building GNOOP as an accurate mathematical model of generic nominally-typed OOP.
Edit intent: fluency
Original: This is an extended abstract that presents the concepts of ' nominal intervals' and 'full generification' , as well as makes some suggestions that are likely to help in building GNOOP as an accurate mathematical model of generic nominally-typed OOP.
Revised: This is an extended abstract that presents the concepts of ' nominal intervals' and `full generication' that are likely to help in building GNOOP as an accurate mathematical model of generic nominally-typed OOP.
Edit intent: clarity
Original:  The  presented concepts and suggestions are particularly geared towards enabling GNOOP to offer a precise and simple view of so-far-hard-to-analyze features of generic OOP such as variance annotations (e.g., Java wildcards ) and erased generics (e.g., Java  erasure).
Revised:  The presented concepts and suggestions are particularly geared towards enabling GNOOP to offer a precise and simple view of so-far-hard-to-analyze features of generic OOP such as variance annotations (e.g., Java wildcards ) and erased generics (e.g., Java type erasure).
Edit intent: clarity
Original: Given a directed graph, it is known that the problem of finnding a set of vertex-disjoint cycles with the maximum total number of vertices (MAX SIZE EXCHANGE) can be solved in polynomial time.
Revised: Given a directed graph, it is known that the problem of finding a set of vertex-disjoint cycles with the maximum total number of vertices (MAX SIZE EXCHANGE) can be solved in polynomial time.
Edit intent: fluency
Original: Given a directed graph, it is known that the problem of finding a set of vertex-disjoint cycles with the maximum total number of vertices ( MAX SIZE EXCHANGE ) can be solved in polynomial time.
Revised: Given a directed graph, it is known that the problem of finding a set of vertex-disjoint cycles with the maximum total number of vertices ( MAX-SIZE-EXCHANGE ) can be solved in polynomial time.
Edit intent: fluency
Original:  We show that the problem of determining whether there exists a tropical set of vertex-disjoint cycles in a digraph ( TROPICAL EXCHANGE ) is NP-complete . Likewise, the problem of determining whether there exists a tropical set of vertex-disjoint cycles where the set of cycles contains the maximum total number of vertices (TROPMAX-EXCHANGE) is NP-complete  .
Revised:  We show that the problem of determining whether there exists a tropical set of vertex-disjoint cycles in a digraph ( TROPICAL-EXCHANGE ) is NP-complete . Likewise, the problem of determining whether there exists a tropical set of vertex-disjoint cycles where the set of cycles contains the maximum total number of vertices (TROPMAX-EXCHANGE) is NP-complete .
Edit intent: fluency
Original:  We show that the problem of determining whether there exists a tropical set of vertex-disjoint cycles in a digraph ( TROPICAL EXCHANGE ) is NP-complete . Likewise, the problem of determining whether there exists a tropical set of vertex-disjoint cycles where the set of cycles contains the maximum total number of vertices (TROPMAX-EXCHANGE) is NP-complete  .
Revised:  We show that the problem of determining whether there exists a tropical set of vertex-disjoint cycles in a digraph ( TROPICAL EXCHANGE ) is NP-complete . Likewise, the problem of determining whether there exists a tropical set of vertex-disjoint cycles where the set of cycles contains the maximum number of vertices (TROPMAX-EXCHANGE) is NP-complete .
Edit intent: clarity
Original:  We reduce the satisfiability problem in conjunctive normal form (CNFSAT) to these two problems in order to demonstrate that they are NP-complete.
Edit intent: coherence
Original:  Finally, we show that the problem of finding a set of vertex-disjoint cycles that has as many colors as any other set of disjoint-cycles and as many vertices as any set with the same number of colors (MAXTROP-EXCHANGE) is NP-hard.
Revised:  Finally, we show that the problem of finding a set of vertex-disjoint cycles that has as many colors as any other set of disjoint-cycles and as many vertices as possible. We show that this problem is NP-hard.
Edit intent: clarity
Original:  The main result is a simple divide-and-conquer scheme that makes sequential algorithms more cache efficient and leads to a parallel algorithm running in expected time O %DIFDELCMD < \left(%%%  n/p+\log p %DIFDELCMD < \right) %%%  on p processors .
Revised:  The main result is a simple divide-and-conquer scheme that makes sequential algorithms more cache efficient and leads to a parallel algorithm running in expected time O %DIFDELCMD < \left(%%% ( n/p+\log p %DIFDELCMD < \right) %%% on p processors .
Edit intent: fluency
Original:  The main result is a simple divide-and-conquer scheme that makes sequential algorithms more cache efficient and leads to a parallel algorithm running in expected time O %DIFDELCMD < \left(%%%  n/p+\log p %DIFDELCMD < \right) %%%  on p processors .
Revised:  The main result is a simple divide-and-conquer scheme that makes sequential algorithms more cache efficient and leads to a parallel algorithm running in expected time O %DIFDELCMD < \left(%%% n/p+\log p %DIFDELCMD < \right) %%% ) on p processors .
Edit intent: fluency
Original:  We also discuss modifications needed for load balancing , reservoir sampling , online sampling, sampling with replacement, Bernoulli sampling, and vectorization on SIMD units or GPUs.
Revised:  We also discuss modifications needed for load balancing , online sampling, sampling with replacement, Bernoulli sampling, and vectorization on SIMD units or GPUs.
Edit intent: clarity
Original: T-junctions support merging or spreading out feature lines.
Edit intent: coherence
Original:  The construction is based on varying the parameterization and therefore does not require the non-local coordination of knot intervals . Conversely, a simple example shows that some T-junctions do not admit C 1 hierarchical splines and T-splines in particular.
Revised:  The construction is based on varying the parameterization and therefore does not require the non-local coordination of knot intervals . Conversely, a simple example shows that some T-junctions where T-splines in particular.
Edit intent: clarity
Original:  Culturing epithelial monolayers on a substrate is an in vitro configuration suitable to quantitatively characterize such tissue migration by measuring cell velocity, density and cell-substrate interaction force.
Revised:  Culturing epithelial monolayers on a substrate enables to quantify such tissue migration by measuring cell velocity, density and cell-substrate interaction force.
Edit intent: clarity
Original:  Inhibiting cell division, we limit cell density increase and favor steady cell migration, while by using long narrow stripswe stabilise the migrating front shape, so that we observe migration over a day or more.
Revised:  Inhibiting cell division, we limit density increase and favor steady cell migration, while by using long narrow stripswe stabilise the migrating front shape, so that we observe migration over a day or more.
Edit intent: fluency
Original:  Inhibiting cell division, we limit cell density increase and favor steady cell migration, while by using long narrow stripswe stabilise the migrating front shape, so that we observe migration over a day or more.
Revised:  Inhibiting cell division, we limit cell density increase and favor steady migration; by using long narrow stripswe stabilise the migrating front shape, so that we observe migration over a day or more.
Edit intent: coherence
Original:  At least\simmicrometer  ten periods of  propagating velocity waves \simmillimeter are detected with a high signal-to-noise ratio , enabling for their quantitative spatio-temporal analysis.
Revised:  At least\simmicrometer ten periods of propagating velocity waves \simmillimeter, are detected with a high signal-to-noise ratio , enabling for their quantitative spatio-temporal analysis.
Edit intent: fluency
Original:  At least\simmicrometer  ten periods of  propagating velocity waves \simmillimeter are detected with a high signal-to-noise ratio , enabling for their quantitative spatio-temporal analysis.
Revised:  At least\simmicrometer ten periods of propagating velocity waves \simmillimeter are detected with a signal-to-noise ratio , enabling for their quantitative spatio-temporal analysis.
Edit intent: clarity
Original:  At least\simmicrometer  ten periods of  propagating velocity waves \simmillimeter are detected with a high signal-to-noise ratio , enabling for their quantitative spatio-temporal analysis.
Revised:  At least\simmicrometer ten periods of propagating velocity waves \simmillimeter are detected with a high signal-to-noise ratio enabling for quantitative spatio-temporal analysis.
Edit intent: clarity
Original:  The wave phase celerity is of order of ten\simten micrometers per minute , i.e. ten times the monolayer migration velocity;
Revised:  The wave phase celerity is of order of ten\simten micrometers per minute ) is ten times the monolayer migration velocity;
Edit intent: coherence
Original:  We propose an experiment-inspired bottom-up biochemical model of these waves , where motility forces in the bulk of the monolayer are oriented by a dynamic pulling on cell-cell junctions.
Edit intent: coherence
Original:  We find that parameters values close to the instability limit where waves appear yield predictions of wave characteristics close to experimentally observed values.
Revised:  We find that parameter values close to the instability limit where waves appear yield predictions of wave characteristics close to experimentally observed values.
Edit intent: fluency
Original: Collective cell migration contributes to morphogenesis , wound healing or tumor metastasis.
Revised: Collective cell migration contributes to morphogenesis , wound healing and tumor metastasis.
Edit intent: fluency
Original:  Over ten periods of backwards propagating velocity waves, with wavelength%DIFDELCMD < \simmillimeter%%% , are detected with a signal-to-noise ratio enabling for quantitative spatio-temporal analysis.
Revised:  %DIFDELCMD < \simmillimeter%%% , are detected with a signal-to-noise ratio enabling for quantitative spatio-temporal analysis.
Edit intent: coherence
Original:  When we inhibit the formation of lamellipodia , cell velocity drops while waves either disappear , or have a smaller amplitude and slower period.
Revised:  When we inhibit the formation of lamellipodia , cell velocity drops while waves either disappear or have a smaller amplitude and slower period.
Edit intent: fluency
Original: Although a number of studies on natural and laboratory populations have shown that a population initially well-adapted to its environment can evolve rapidly when conditions suddenly change, the dynamics of rapid adaptation are not well understood.
Revised: Although a number of studies have shown that natural and laboratory populations have shown that a population initially well-adapted to its environment can evolve rapidly when conditions suddenly change, the dynamics of rapid adaptation are not well understood.
Edit intent: clarity
Original: Although a number of studies on natural and laboratory populations have shown that a population initially well-adapted to its environment can evolve rapidly when conditions suddenly change, the dynamics of rapid adaptation are not well understood.
Revised: Although a number of studies on natural and laboratory populations initially well-adapted to its environment can evolve rapidly when conditions suddenly change, the dynamics of rapid adaptation are not well understood.
Edit intent: clarity
Original: Although a number of studies on natural and laboratory populations have shown that a population initially well-adapted to its environment can evolve rapidly when conditions suddenly change, the dynamics of rapid adaptation are not well understood.
Revised: Although a number of studies on natural and laboratory populations have shown that a population initially well-adapted to their environment can evolve rapidly when conditions suddenly change, the dynamics of rapid adaptation are not well understood.
Edit intent: fluency
Original:  In contrast, selective sweeps, i.e., dramatic changes in the allele frequency may occur at major loci provided the shift of the optimum is sufficiently large . Explicit analytical expressions for the time scales over which the mean deviation in the phenotypic trait becomes negligible are provided . Applications of our theoretical results to the relationship between QTL and selective sweep mapping and to tests of fast polygenic adaptation are discussed.
Revised:  In contrast, selective sweeps, i.e., dramatic changes in the allele frequency may occur provided the size of the effect is sufficiently large . Explicit analytical expressions for the time scales over which the mean deviation in the phenotypic trait becomes negligible are provided . Applications of our theoretical results to the relationship between QTL and selective sweep mapping and to tests of fast polygenic adaptation are discussed.
Edit intent: clarity
Original:  In contrast, selective sweeps, i.e., dramatic changes in the allele frequency may occur at major loci provided the shift of the optimum is sufficiently large . Explicit analytical expressions for the time scales over which the mean deviation in the phenotypic trait becomes negligible are provided . Applications of our theoretical results to the relationship between QTL and selective sweep mapping and to tests of fast polygenic adaptation are discussed.
Revised:  In contrast, selective sweeps, i.e., dramatic changes in the allele frequency may occur at major loci provided the shift of the optimum is sufficiently large . Applications of our theoretical results to the relationship between QTL and selective sweep mapping and to tests of fast polygenic adaptation are discussed.
Edit intent: clarity
Original:  This problem is encountered in a wide array of applications - from biological networks to social networks to ontologies - where multiple networked data sources need to be integrated.
Revised:  This problem is encountered in a wide array of applications-from biological networks to social networks to ontologies - where multiple networked data sources need to be integrated.
Edit intent: fluency
Original:  This problem is encountered in a wide array of applications - from biological networks to social networks to ontologies - where multiple networked data sources need to be integrated.
Revised:  This problem is encountered in a wide array of applications - from biological networks to social networks to ontologies-where multiple networked data sources need to be integrated.
Edit intent: fluency
Original:  Our method identifies the most informative nodes to query based on the top-k matchings of a bipartite graph .
Revised:  Our methods identify the most informative nodes to query based on the top-k matchings of a bipartite graph .
Edit intent: fluency
Original:  We compare the proposed approach to several commonly-used query strategies and perform experiments on both synthetic and real-world datasets.
Revised:  We compare the proposed approaches to several commonly-used query strategies and perform experiments on both synthetic and real-world datasets.
Edit intent: fluency
Original:  This can make a tactic hard to understand and hence difficult to to debug and maintain for experts and non experts alike: one often has to tear apart complex combinations of lower level tactics manually in order to analyse a failure in the overall strategy.
Revised:  This can make a tactic hard to understand and hence difficult to to debug and maintain for experts and non-experts alike: one often has to tear apart complex combinations of lower level tactics manually in order to analyse a failure in the overall strategy.
Edit intent: fluency
Original:  for example, these pairs might be obtained through a now-standard diversity-vs-multiplexing trade-off characterization.
Revised:  for example, these pairs might be obtained through a now-standard diversity-vs-multiplexing tradeoff characterization.
Edit intent: fluency
Original:  The SMDP problem formulation allows us to choose from these pairs an optimal selection, which is expressed by a decision rule as a function of the number of awaiting packets in the source  finite queue, channel state, size of the packet to be transmitted.
Revised:  The SMDP problem formulation allows us to choose from these pairs an optimal selection, which is expressed by a decision rule as a function of the number of awaiting packets in the source 's finite queue, channel state, size of the packet to be transmitted.
Edit intent: fluency
Original:  Numerical results validate this finding, as well as depict muti-threshold policies for time varying channels such as the Gilbert-Elliot channel
Revised:  Numerical results validate this finding, as well as depict muti-threshold policies for time varying channels such as the Gilber-Elliott channel.
Edit intent: fluency
Original: When watching  a natural scene on a computer screen, observers initially move their eyes towards the center of the image - an experimental finding termed central fixation bias (CFB) .
Revised: When watching the image of a natural scene on a computer screen, observers initially move their eyes towards the center of the image - an experimental finding termed central fixation bias (CFB) .
Edit intent: clarity
Original: When watching  a natural scene on a computer screen, observers initially move their eyes towards the center of the image - an experimental finding termed central fixation bias (CFB) .
Revised: When watching a natural scene on a computer screen, observers initially move their eyes towards the center of the image --- a reliable experimental finding termed central fixation bias (CFB) .
Edit intent: clarity
Original: When watching  a natural scene on a computer screen, observers initially move their eyes towards the center of the image - an experimental finding termed central fixation bias (CFB) .
Revised: When watching a natural scene on a computer screen, observers initially move their eyes towards the center of the image - an experimental finding termed central fixation bias .
Edit intent: clarity
Original:  This systematic tendency in eye guidance  masks attentional selection driven by image properties or top-down cognitive processes.
Revised:  This systematic tendency in eye guidance likely masks attentional selection driven by image properties or top-down cognitive processes.
Edit intent: clarity
Original:  This systematic tendency in eye guidance  masks attentional selection driven by image properties or top-down cognitive processes.
Revised:  This systematic tendency in eye guidance masks attentional selection driven by image properties and top-down cognitive processes.
Edit intent: fluency
Original:  Here we show that the CFB can be reduced by delaying the initial saccade relative to image onset.
Revised:  Here we show that the central fixation bias can be reduced by delaying the initial saccade relative to image onset.
Edit intent: clarity
Original:  In two scene-viewing experiments , we manipulated observers' initial gaze positions and delayed their first saccades by a specific time interval after onset of the image.
Revised:  In two scene-viewing experiments we manipulated observers' initial gaze positions and delayed their first saccades by a specific time interval after onset of the image.
Edit intent: fluency
Original:  In two scene-viewing experiments , we manipulated observers' initial gaze positions and delayed their first saccades by a specific time interval after onset of the image.
Revised:  In two scene-viewing experiments , we manipulated observers' initial gaze position and delayed their first saccades by a specific time interval after onset of the image.
Edit intent: fluency