wanyu/IteraTeR_v2 huggingface dataset:
Original:  Finally, it is shown that intra-cluster frequency reuse is favorable in moderately-loaded cells with generous triggering of a joint-transmission , while intra-cluster coordinated scheduling may be better in lightly-loaded cells with conservative triggering of a joint transmission .
Revised:  Finally, it is shown that intra-cluster frequency reuse is favorable in moderately-loaded cells with generous triggering of a joint-transmission , while intra-cluster coordinated scheduling may be better in lightly-loaded cells with conservative cooperation activation .
Edit intent: clarity
Original:  For pilot-based channel estimation, the averaged spectral efficiency saturates at cluster sizes of around 7 BSs for typical values, irrespective of backhaul quality.
Revised:  For pilot-based channel estimation, the average spectral efficiency saturates at cluster sizes of around 7 BSs for typical values, irrespective of backhaul quality.
Edit intent: fluency
Original:  For a single user , it is well known that caching the most popular files is optimal in this setting.
Revised:  For a single cache , it is well known that caching the most popular files is optimal in this setting.
Edit intent: clarity
Original:  For a single user , it is well known that caching the most popular files is optimal in this setting.
Revised:  For a single user , it is well known that storing the most popular files is optimal in this setting.
Edit intent: clarity
Original:  However, perhaps surprisingly, we show here that this is no longer the case for multiple users .
Revised:  However, we show here that this is no longer the case for multiple users .
Edit intent: coherence
Original:  Knowing the popularity distribution of the files in the database , the goal is to optimally populate the caches such as to minimize the expected load of the shared link.
Revised:  Knowing the popularity distribution of the files , the goal is to optimally populate the caches such as to minimize the expected load of the shared link.
Edit intent: clarity
Original: Any positive word comprised of random sequence of tokens form a finite alphabet can be reduce (without change of length) using an appropriate size Braid group relationships.
Revised: Any positive word comprised of random sequence of tokens form a finite alphabet can be reduced (without change of length) using an appropriate size Braid group relationships.
Edit intent: fluency
Original:  Surprisinly the Braid relations dramatically reduce the Kolmogorov Complexity of the original random word and do so in distinct bands of (rate of change) values with gaps in between.
Revised:  Surprisingly the Braid relations dramatically reduce the Kolmogorov Complexity of the original random word and do so in distinct bands of (rate of change) values with gaps in between.
Edit intent: fluency
Original:  We predict the existence of a parameter range where valley or plateau crossing by the metapopulation is as fast as that of the fastest deme, and we verify this prediction using stochastic simulations.
Revised:  We predict the existence of a parameter range where valley or plateau crossing by the metapopulation is as fast as that of its fastest deme. We verify our analytical predictions through stochastic simulations.
Edit intent: clarity
Original:  Finally, we extend our work to the case of a large population connected by migration to one or several smaller islands  .
Revised:  Finally, we extend our work to the case of a population connected by migration to one or several smaller islands .
Edit intent: clarity
Original:  In particular, setting the number of max-pooling layers to the log of the size of the objects we wish to recognize is practical . Extending the MNIST dataset by translations, and using dropout, our sparse CNN gets a test error of 0.36 \%.
Revised:  In particular, setting the number of max-pooling . Extending the MNIST dataset by translations, and using dropout, our sparse CNN gets a test error of 0.36 \%.
Edit intent: clarity
Original:  In particular, setting the number of max-pooling layers to the log of the size of the objects we wish to recognize is practical . Extending the MNIST dataset by translations, and using dropout, our sparse CNN gets a test error of 0.36 \%.
Revised:  In particular, setting the number of max-pooling layers to the log of the size of the objects we wish to recognize is practical . Extending the MNIST dataset by translations, our sparse CNN gets a test error of 0.36 \%.
Edit intent: coherence
Original: We present an algorithm to automatically derive a shape grammar for a given facade layout .
Revised: In this paper, we address the following research problem: How can we generate a meaningful split grammar that explains a given facade layout .
Edit intent: coherence
Original:  In particular, the total enzymatic capacity for cellular metabolism is limited by a number of factors such as cytosolic space, energy expenditure , or nitrogen availability .
Revised:  In particular, the total enzymatic capacity for cellular metabolism is limited by a number of factors such as cytosolic space, energy expenditure for amino-acid synthesis, or micro-nutrients .
Edit intent: clarity
Original:  While extensive work has been done to study constrained optimization problems based  on stoichiometric information, mathematical results that characterize the optimal flux in kinetic metabolic networks are still scarce.
Revised:  While extensive work has been done to study constrained optimization problems based only on stoichiometric information, mathematical results that characterize the optimal flux in kinetic metabolic networks are still scarce.
Edit intent: clarity
Original:  We give a rigorous proof for the fact that a solution of the non-linear optimization problem is necessarily an elementary flux mode .
Revised:  We give a rigorous proof for the fact that optimal solutions of the non-linear optimization problem is necessarily an elementary flux mode .
Edit intent: clarity
Original:  We give a rigorous proof for the fact that a solution of the non-linear optimization problem is necessarily an elementary flux mode .
Revised:  We give a rigorous proof for the fact that a solution of the non-linear optimization problem are elementary flux modes .
Edit intent: clarity
Original:  This finding has significant consequences for our understanding of metabolic switches as well as for the  computation of optimal fluxes in kinetic metabolic networks.
Revised:  This finding has significant consequences for our understanding of optimality in metabolic networks as well as for the computation of optimal fluxes in kinetic metabolic networks.
Edit intent: clarity
Original:  This finding has significant consequences for our understanding of metabolic switches as well as for the  computation of optimal fluxes in kinetic metabolic networks.
Revised:  This finding has significant consequences for our understanding of metabolic switches as well as for the computation of optimal flux distributions in kinetic metabolic networks.
Edit intent: clarity
Original:  Yet we for a Borda-voting case  show that such clashes raise the complexity unless NP = coNP.
Revised:  Yet for a Borda-voting case show that such clashes raise the complexity unless NP = coNP.
Edit intent: clarity
Original:  Yet we for a Borda-voting case  show that such clashes raise the complexity unless NP = coNP.
Revised:  Yet we for a Borda-voting case we show that such clashes raise the complexity unless NP = coNP.
Edit intent: fluency
Original:  However, there are currently four different approaches to applying METE to predict the SAR and it is unclear which approach should be used due to a lack of empirical comparison . Specifically, METE can be applied recursively or a non-recursively and can use either a theoretical or observed species-abundance distribution (SAD).
Revised:  However, there are currently four different approaches to applying METE to predict the SAR and it is unclear which approach should be used due to a lack of empirical evaluation . Specifically, METE can be applied recursively or a non-recursively and can use either a theoretical or observed species-abundance distribution (SAD).
Edit intent: clarity
Original:  In general, METE accurately downscaled the SAR (R^2> 0.94), but the recursive approach consistently under-predicted richness, and METE's accuracy did not depend strongly on using the observed or predicted SAD.
Revised:  In general, METE accurately downscaled the SAR (R^2> 0.94), but the recursive approach consistently under-predicted richness, and METEs accuracy did not depend strongly on using the observed or predicted SAD.
Edit intent: clarity
Original: Light sheet fluorescence microscopy is able to image large specimen with high resolution by imaging the samples from multiple angles.
Revised: Light sheet fluorescence microscopy is able to image large specimen with high resolution by imaging the sam- ples from multiple angles.
Edit intent: fluency
Original:  Here we present a  derivation of multi-view Bayesian deconvolution that drastically improves the convergence time and provide a GPU implementation that optimizes runtime performance .
Revised:  Here we present a derivation of multi-view Bayesian deconvolution that drastically improves the convergence time and provide a fast implementation utilizing graphics hardware .
Edit intent: clarity
Original:  We conducted a strong test of METE, where four of its major predictions were evaluated simultaneously using data from 60 globally distributed  communities including over 300,000 individuals and nearly 2000 species.
Revised:  We evaluated four major predictions of METE simultaneously at an unprecedented scale using data from 60 globally distributed communities including over 300,000 individuals and nearly 2000 species.
Edit intent: clarity
Original:  While METE successfully captured 96\% and 93 \% of the variation in the species abundance distribution and the individual size distribution, it performed poorly when characterizing the size-density relationship and the intraspecific distribution of individual body size.
Revised:  METE successfully captured 96\% and 93 \% of the variation in the species abundance distribution and the individual size distribution, it performed poorly when characterizing the size-density relationship and the intraspecific distribution of individual body size.
Edit intent: coherence
Original:  While METE successfully captured 96\% and 93 \% of the variation in the species abundance distribution and the individual size distribution, it performed poorly when characterizing the size-density relationship and the intraspecific distribution of individual body size.
Revised:  While METE successfully captured 96\% and 93 \% of the variation in the species abundance distribution and the individual size distribution, but performed poorly when characterizing the size-density relationship and the intraspecific distribution of individual body size.
Edit intent: coherence
Original:  While METE successfully captured 96\% and 93 \% of the variation in the species abundance distribution and the individual size distribution, it performed poorly when characterizing the size-density relationship and the intraspecific distribution of individual body size.
Revised:  While METE successfully captured 96\% and 93 \% of the variation in the species abundance distribution and the individual size distribution, it performed poorly when characterizing the size-density relationship and intraspecific distribution of individual body size.
Edit intent: fluency
Original:  While METE successfully captured 96\% and 93 \% of the variation in the species abundance distribution and the individual size distribution, it performed poorly when characterizing the size-density relationship and the intraspecific distribution of individual body size.
Revised:  While METE successfully captured 96\% and 93 \% of the variation in the species abundance distribution and the individual size distribution, it performed poorly when characterizing the size-density relationship and the intraspecific distribution of individual size.
Edit intent: clarity
Original:  Specifically, METE predicts a negative correlation between individual energy use and species abundance, which is weak in natural communities.
Revised:  Specifically, METE predicted a negative correlation between individual energy use and species abundance, which is weak in natural communities.
Edit intent: fluency
Original:  By evaluating multiple predictions with large quantities of data, our study not only identifies a mismatch between abundance and body size in METE, but also serves as a general example on the importance of conducting strong tests of ecological theories.
Revised:  By evaluating multiple predictions with large quantities of data, our study not only identifies a mismatch between abundance and body size in METE, but also demonstrates the importance of conducting strong tests of ecological theories.
Edit intent: clarity
Original:  Here we return to the question of genetic variability in salamanders , and report on the relationship between evolutionary rates and genome sizes in five different salamander families.
Revised:  Here we return to the question of genetic variability in salamanders and report on the relationship between evolutionary rates and genome sizes in five different salamander families.
Edit intent: fluency
Original:  After accounting for evolutionary duration, we conclude that speciation events in salamanders are associated with contractions in genome size and concomitant increases in mutation and diversification rates .
Revised:  After accounting for evolutionary duration, we conclude that more recently evolved species have correspondingly smaller genomes compared to older taxa and concomitantly higher rates of mutation and evolution .
Edit intent: clarity
Original:  It is proven that the  multi-agent system achieves exponential state agreement if and only if the time-varying communication topology is uniformly jointly quasi-strongly connected.
Revised:  It is proven that the multi-agent system achieves exponential state agreement if and only if the time-varying interaction graph is uniformly jointly quasi-strongly connected.
Edit intent: clarity
Original:  Cooperative--antagonistic multi-agent networks are also considered.
Revised:  Cooperative--antagonistic multi-agent systems are also considered.
Edit intent: clarity
Original:  For these systems, the (cooperative--antagonistic) relation matrix has a negative element for arcs corresponding to antagonistic interactions.
Revised:  For these systems, the relation has a negative element for arcs corresponding to antagonistic interactions.
Edit intent: clarity
Original:  For these systems, the (cooperative--antagonistic) relation matrix has a negative element for arcs corresponding to antagonistic interactions.
Revised:  For these systems, the (cooperative--antagonistic) relation matrix has a negative sign for arcs corresponding to antagonistic interactions.
Edit intent: clarity
Original:  Instead it is shown that asymptotic absolute state agreement is achieved if the time-varying communication topology is uniformly jointly strongly connected.
Revised:  Instead it is shown that asymptotic absolute state agreement is achieved if the time-varying interaction graph is uniformly jointly strongly connected.
Edit intent: clarity
Original:  It is supposed to counter risk hiding and transfer in the tails.
Revised:  It is supposed to counter voluntary and involuntary risk hiding- and risk transfer - in the tails.
Edit intent: clarity
Original:  In contrast to the one-locus theory, where the fraction of disadvantageous mutationsdecreases exponentially fast with increasing population size, we find that in the multilocus model, it decreases to zero exponentially for very large populations but approaches a constant for smaller populationslogarithmically.
Revised:  In contrast to the one-locus theory, where the fraction of deleterious mutations. We also find that for small and very large populations but approaches a constant for smaller populationslogarithmically.
Edit intent: clarity
Original: We study the stationary state of a population evolving under the action of random genetic drift, selection and recombination in which both deleterious and reverse beneficial mutations can occur .
Revised: Adaptation of asexual populations is driven by beneficial mutations and therefore, its dynamics depend on the distribution of beneficial fitness effects. This distribution, when the fitnesses are uncorrelated, can only be of three types. We numercially study the adaptation dynamics when the fitness of the beneficial mutations belongs to one of the three distributions to identify the quantities that show qualitatively different trends in each .
Edit intent: clarity
Original: Recent experiments imaging fluid flow around swimming microorganisms have revealed complex time-dependent velocity fields that differ qualitatively from the stresslet flow commonly employed in theory .
Revised: Recent experiments imaging fluid flow around swimming microorganisms have revealed complex time-dependent velocity fields that differ qualitatively from the stresslet flow commonly employed in theoretical descriptions of active matter .
Edit intent: clarity
Original:  This expansion, whose first term is stresslet flow , must include  third-rank polar and axial tensors to minimally capture crucial features of the  oscillatory flow around translating Chlamydomonas Guasto et al., Phys.
Revised:  This expansion, whose first term is the stresslet , must include third-rank polar and axial tensors to minimally capture crucial features of the oscillatory flow around translating Chlamydomonas Guasto et al., Phys.
Edit intent: clarity
Original:  This expansion, whose first term is stresslet flow , must include  third-rank polar and axial tensors to minimally capture crucial features of the  oscillatory flow around translating Chlamydomonas Guasto et al., Phys.
Revised:  This expansion, whose first term is stresslet flow , must include third-rank polar and axial tensors to minimally capture crucial features of the active oscillatory flow around translating Chlamydomonas Guasto et al., Phys.
Edit intent: clarity
Original: Most genome assemblers provide a point estimatesof the true genome sequences, chosen from among many alternative hypotheses that are supported by the data.
Revised: Most genome assemblers construct point estimates, choosing a genome sequence from among many alternative hypotheses that are supported by the data.
Edit intent: clarity
Original:  We present a Markov Chain Monte Carlo approach to sequence assembly that instead generates a distribution of assembly hypotheses with quantified probabilities.
Revised:  We present a Markov Chain Monte Carlo approach to sequence assembly that instead generates distributions of assembly hypotheses with quantified probabilities.
Edit intent: fluency
Original:  We implement this approach in a prototype assembler and illustrate its application to the genome of the bacteriophage%DIFDELCMD < \PhiX174%%%  .
Revised:  We implement this approach in a prototype assembler and illustrate its application to the %DIFDELCMD < \PhiX174%%% .
Edit intent: clarity
Original:  Thapper and Zivny FOCS'12%DIFDELCMD < ] %%% described when a certain linear programming relaxation solves instances of the problem, Kolmogorov ICALP'13%DIFDELCMD < ] %%% simplified this description for finite-valued languages , Huber, Krokhin and Powell SODA'13%DIFDELCMD < ] %%% classified all finite-valued languages on three-element domains , and Thapper and Zivny [STOC'13] found a complete classification of the complexity for finite-valued languages on arbitrary finite domains.
Revised:  Thapper and Zivny %DIFDELCMD < ] %%% described when a certain linear programming relaxation solves instances of the problem, Kolmogorov ICALP'13%DIFDELCMD < ] %%% simplified this description for finite-valued languages , Huber, Krokhin and Powell SODA'13%DIFDELCMD < ] %%% classified all finite-valued languages on three-element domains , and Thapper and Zivny [STOC'13] found a complete classification of the complexity for finite-valued languages on arbitrary finite domains.
Edit intent: clarity
Original:  Thapper and Zivny FOCS'12%DIFDELCMD < ] %%% described when a certain linear programming relaxation solves instances of the problem, Kolmogorov ICALP'13%DIFDELCMD < ] %%% simplified this description for finite-valued languages , Huber, Krokhin and Powell SODA'13%DIFDELCMD < ] %%% classified all finite-valued languages on three-element domains , and Thapper and Zivny [STOC'13] found a complete classification of the complexity for finite-valued languages on arbitrary finite domains.
Revised:  Thapper and Zivny FOCS'12%DIFDELCMD < ] %%% ICALP'13%DIFDELCMD < ] %%% simplified this description for finite-valued languages , Huber, Krokhin and Powell SODA'13%DIFDELCMD < ] %%% classified all finite-valued languages on three-element domains , and Thapper and Zivny [STOC'13] found a complete classification of the complexity for finite-valued languages on arbitrary finite domains.
Edit intent: coherence
Original:  Thapper and Zivny FOCS'12%DIFDELCMD < ] %%% described when a certain linear programming relaxation solves instances of the problem, Kolmogorov ICALP'13%DIFDELCMD < ] %%% simplified this description for finite-valued languages , Huber, Krokhin and Powell SODA'13%DIFDELCMD < ] %%% classified all finite-valued languages on three-element domains , and Thapper and Zivny [STOC'13] found a complete classification of the complexity for finite-valued languages on arbitrary finite domains.
Revised:  Thapper and Zivny FOCS'12%DIFDELCMD < ] %%% described when a certain linear programming relaxation solves instances of the problem, Kolmogorov %DIFDELCMD < ] %%% simplified this description for finite-valued languages , Huber, Krokhin and Powell SODA'13%DIFDELCMD < ] %%% classified all finite-valued languages on three-element domains , and Thapper and Zivny [STOC'13] found a complete classification of the complexity for finite-valued languages on arbitrary finite domains.
Edit intent: clarity
Original:  Thapper and Zivny FOCS'12%DIFDELCMD < ] %%% described when a certain linear programming relaxation solves instances of the problem, Kolmogorov ICALP'13%DIFDELCMD < ] %%% simplified this description for finite-valued languages , Huber, Krokhin and Powell SODA'13%DIFDELCMD < ] %%% classified all finite-valued languages on three-element domains , and Thapper and Zivny [STOC'13] found a complete classification of the complexity for finite-valued languages on arbitrary finite domains.
Revised:  Thapper and Zivny FOCS'12%DIFDELCMD < ] %%% described when a certain linear programming relaxation solves instances of the problem, Kolmogorov ICALP'13%DIFDELCMD < ] %%% . A complete classification for the complexity of finite-valued languages , Huber, Krokhin and Powell SODA'13%DIFDELCMD < ] %%% classified all finite-valued languages on three-element domains , and Thapper and Zivny [STOC'13] found a complete classification of the complexity for finite-valued languages on arbitrary finite domains.
Edit intent: coherence
Original:  Thapper and Zivny FOCS'12%DIFDELCMD < ] %%% described when a certain linear programming relaxation solves instances of the problem, Kolmogorov ICALP'13%DIFDELCMD < ] %%% simplified this description for finite-valued languages , Huber, Krokhin and Powell SODA'13%DIFDELCMD < ] %%% classified all finite-valued languages on three-element domains , and Thapper and Zivny [STOC'13] found a complete classification of the complexity for finite-valued languages on arbitrary finite domains.
Revised:  Thapper and Zivny FOCS'12%DIFDELCMD < ] %%% described when a certain linear programming relaxation solves instances of the problem, Kolmogorov ICALP'13%DIFDELCMD < ] %%% simplified this description for finite-valued languages SODA'13%DIFDELCMD < ] %%% classified all finite-valued languages on three-element domains , and Thapper and Zivny [STOC'13] found a complete classification of the complexity for finite-valued languages on arbitrary finite domains.
Edit intent: coherence