wanyu/IteraTeR_v2 huggingface dataset:
Original:  For example, when trying to understand human movement in a city  , a hypothesis assuming tourists to be more likely to move towards points of interests than locals, can be shown to be more plausible with observed data than a hypothesis assuming the opposite.
Revised:  For example, when trying to understand human movement in a city , a hypothesis assuming tourists to be more likely to move towards points of interests than locals, can be shown to be more plausible than a hypothesis assuming the opposite.
Edit intent: clarity
Original:  Our approach incorporates these beliefs as Bayesian priors in a generative mixed transition Markov chain model, and compares their plausibility utilizing Bayes factors.
Revised:  Our approach incorporates such hypotheses as Bayesian priors in a generative mixed transition Markov chain model, and compares their plausibility utilizing Bayes factors.
Edit intent: clarity
Original: Motivated by the desire to verify the correctness of algorithms for arrhythmia discrimination used in cardiac medical devices , we present a general wavelet-based characterization of peaks (local maxima and minima) that occur in cardiac electrograms, along with two peak-detection algorithms based on this characterization.
Revised: Motivated by the problem of verifying the correctness of algorithms for arrhythmia discrimination used in cardiac medical devices , we present a general wavelet-based characterization of peaks (local maxima and minima) that occur in cardiac electrograms, along with two peak-detection algorithms based on this characterization.
Edit intent: clarity
Original: Motivated by the desire to verify the correctness of algorithms for arrhythmia discrimination used in cardiac medical devices , we present a general wavelet-based characterization of peaks (local maxima and minima) that occur in cardiac electrograms, along with two peak-detection algorithms based on this characterization.
Revised: Motivated by the desire to verify the correctness of arrhythmia-detection algorithms , we present a general wavelet-based characterization of peaks (local maxima and minima) that occur in cardiac electrograms, along with two peak-detection algorithms based on this characterization.
Edit intent: clarity
Original:  We then study the accuracy and sensitivity of the resulting QRE-based PD algorithms on real patient data, and show that the wavelet-based peakWPM algorithm outperforms the other two PD algorithms, yielding results that are on par with those provided by a cardiologist.
Revised:  We then study the accuracy and sensitivity of the resulting QRE-based PD algorithms on real patient data, on which they yield results on par with those provided by a cardiologist.
Edit intent: clarity
Original:  We propose an alternative viewpoint based on unrolled iterative estimation---a group of successive layers iteratively refine their estimates of the same features instead of computing an entirely new representation.
Revised:  We propose an alternative viewpoint based on unrolled iterative estimation -- a group of successive layers iteratively refine their estimates of the same features instead of computing an entirely new representation.
Edit intent: fluency
Original:  We make several key modifications to the standard GAN algorithm to preserve annotations, avoid artifacts  and stabilize training: (i) a 'self-regularization' term, (ii) a local adversarial loss, and (iii) updating the discriminator using a history of refined images.
Revised:  We make several key modifications to the standard GAN algorithm to preserve annotations, avoid artifacts , and stabilize training: (i) a 'self-regularization' term, (ii) a local adversarial loss, and (iii) updating the discriminator using a history of refined images.
Edit intent: fluency
Original: As more scholarly content is being born digital or digitized , digital libraries are becoming increasingly vital to researchers leveraging scholarly big data for scientific discovery.
Revised: As more scholarly content is born digital or digitized , digital libraries are becoming increasingly vital to researchers leveraging scholarly big data for scientific discovery.
Edit intent: fluency
Original: As more scholarly content is being born digital or digitized , digital libraries are becoming increasingly vital to researchers leveraging scholarly big data for scientific discovery.
Revised: As more scholarly content is being born digital or converted to a digital format , digital libraries are becoming increasingly vital to researchers leveraging scholarly big data for scientific discovery.
Edit intent: clarity
Original: As more scholarly content is being born digital or digitized , digital libraries are becoming increasingly vital to researchers leveraging scholarly big data for scientific discovery.
Revised: As more scholarly content is being born digital or digitized , digital libraries are becoming increasingly vital to researchers seeking to leverage scholarly big data for scientific discovery.
Edit intent: clarity
Original:  Given the abundance of scholarly products-especially in environments created by the advent of social networking services-little is known about international scholarly information needs, information-seeking behavior, or information use.
Revised:  Although scholarly products are available in abundance-especially in environments created by the advent of social networking services-little is known about international scholarly information needs, information-seeking behavior, or information use.
Edit intent: clarity
Original:  This paper aims to address these gaps by conducting an in-depth analysis of researchers in the United States and Qatar;
Revised:  The purpose of this paper is to address these gaps by conducting an in-depth analysis of researchers in the United States and Qatar;
Edit intent: clarity
Original:  This paper aims to address these gaps by conducting an in-depth analysis of researchers in the United States and Qatar;
Revised:  This paper aims to address these gaps via an in-depth analysis of researchers in the United States and Qatar;
Edit intent: clarity
Original:  The analysis reveals that the use of academic social networks has remarkable effects on various scholarly activities.
Revised:  The analysis reveals that the use of academic social networks has notable effects on various scholarly activities.
Edit intent: clarity
Original:  The researchers who participated in the present study represent a range of disciplinary and cultural backgrounds .
Revised:  Although the researchers who participated in the present study represent a range of disciplinary and cultural backgrounds .
Edit intent: clarity
Original:  Furthermore, many mutations will be pleiotropic, affecting multiple phases simultaneously.
Edit intent: coherence
Original:  Here we use a simple model of microbial growth to quantify how these multiple phases contribute to selection.
Revised:  Here we use a model of microbial growth to quantify how these multiple phases contribute to selection.
Edit intent: clarity
Original:  Despite its simplicity, the model predicts nontrivial population dynamics when mutations induce tradeoffs between phases . Multiple strains can coexist over long times due to frequency-dependent selection, and strains can engage in rock-paper-scissors interactions due to non-transitive selection.
Revised:  The model predicts nontrivial population dynamics when mutations induce tradeoffs between phases . Multiple strains can coexist over long times due to frequency-dependent selection, and strains can engage in rock-paper-scissors interactions due to non-transitive selection.
Edit intent: coherence
Original:  Despite its simplicity, the model predicts nontrivial population dynamics when mutations induce tradeoffs between phases . Multiple strains can coexist over long times due to frequency-dependent selection, and strains can engage in rock-paper-scissors interactions due to non-transitive selection.
Revised:  Despite its simplicity, the model predicts nontrivial population dynamics when there are tradeoffs between phases . Multiple strains can coexist over long times due to frequency-dependent selection, and strains can engage in rock-paper-scissors interactions due to non-transitive selection.
Edit intent: clarity
Original:  Despite its simplicity, the model predicts nontrivial population dynamics when mutations induce tradeoffs between phases . Multiple strains can coexist over long times due to frequency-dependent selection, and strains can engage in rock-paper-scissors interactions due to non-transitive selection.
Revised:  Despite its simplicity, the model predicts nontrivial population dynamics when mutations induce tradeoffs between phases : multiple strains can coexist over long times due to frequency-dependent selection, and strains can engage in rock-paper-scissors interactions due to non-transitive selection.
Edit intent: fluency
Original: Mutations in a microbial population can improve the frequency of a genotype not only by increasing its exponential growth rate, but also by decreasing the lag time or adjusting the yield (resource efficiency).
Revised: Mutations in a microbial population can increase the frequency of a genotype not only by increasing its exponential growth rate, but also by decreasing the lag time or adjusting the yield (resource efficiency).
Edit intent: clarity
Original: Mutations in a microbial population can improve the frequency of a genotype not only by increasing its exponential growth rate, but also by decreasing the lag time or adjusting the yield (resource efficiency).
Revised: Mutations in a microbial population can improve the frequency of a genotype not only by increasing its exponential growth rate, but also by decreasing its lag time or adjusting the yield (resource efficiency).
Edit intent: fluency
Original:  The model predicts nontrivial population dynamics when there are tradeoffs between phases: multiple strains can coexist over long times due to frequency-dependent selection, and strains can engage in rock-paper-scissors interactions due to non-transitive selection.
Revised:  The model predicts rich population dynamics when there are tradeoffs between phases: multiple strains can coexist over long times due to frequency-dependent selection, and strains can engage in rock-paper-scissors interactions due to non-transitive selection.
Edit intent: clarity
Original: The paper proposes an analysis of liquid democracy (or  delegable proxy voting) from the perspective of binary aggregation and of binary diffusion models.
Revised: The paper proposes an analysis of liquid democracy (or , delegable proxy voting) from the perspective of binary aggregation and of binary diffusion models.
Edit intent: fluency
Original:  We show how proxy voting can be embedded into the framework of binary aggregation with abstentions, allowing known results about the latter to apply to the former.
Revised:  We show how liquid democracy on binary issues can be embedded into the framework of binary aggregation with abstentions, allowing known results about the latter to apply to the former.
Edit intent: clarity
Original:  We show how proxy voting can be embedded into the framework of binary aggregation with abstentions, allowing known results about the latter to apply to the former.
Revised:  We show how proxy voting can be embedded into the framework of binary aggregation with abstentions, enabling the transfer of known results about the latter to apply to the former.
Edit intent: clarity
Original:  We then turn to an analysis of Boolean DeGroot processes, a special case of the DeGroot stochastic model of opinion diffusion , where each agent holds binary opinions and has a unique influencer .
Revised:  We then turn to an analysis of Boolean DeGroot processes, a special case of the DeGroot stochastic model of opinion diffusion .
Edit intent: clarity
Original:  Our analysis also leads to recommendations on how to modify the system to make it better behaved with respect to the handling of delegation cycles and of inconsistent majorities.
Revised:  Our analysis suggests recommendations on how to modify the system to make it better behaved with respect to the handling of delegation cycles and of inconsistent majorities.
Edit intent: clarity
Original:  Our analysis also leads to recommendations on how to modify the system to make it better behaved with respect to the handling of delegation cycles and of inconsistent majorities.
Revised:  Our analysis also leads to recommendations on how the system may be modified to make it better behaved with respect to the handling of delegation cycles and of inconsistent majorities.
Edit intent: clarity
Original:  Our analysis also leads to recommendations on how to modify the system to make it better behaved with respect to the handling of delegation cycles and of inconsistent majorities.
Revised:  Our analysis also leads to recommendations on how to modify the system to make it more resilient with respect to the handling of delegation cycles and of inconsistent majorities.
Edit intent: clarity
Original: We introduce a tensor-based algebraic clustering method to extract sparse, low-dimensional structure from multidimensional arrays of experimental data.
Revised: We introduce a tensor-based clustering method to extract sparse, low-dimensional structure from multidimensional arrays of experimental data.
Edit intent: clarity
Original:  Specifically, this framework is designed to enable detection of clusters of data in the presence of structural requirements which we encode as algebraic constraints in a linear program.
Revised:  This framework is designed to enable detection of clusters of data in the presence of structural requirements which we encode as algebraic constraints in a linear program.
Edit intent: coherence
Original:  By imposing appropriate structural constraints and respecting the multi-indexed structure of the data, our clustering analysis can be optimized for biological interpretation and therapeutic understanding.
Revised:  By imposing appropriate structural constraints and respecting the multi-indexed structure of the data, the analysis of clusters can be optimized for biological interpretation and therapeutic understanding.
Edit intent: clarity
Original: A researcher may publish tens or hundreds of papers , yet these contributions to the literature are not uniformly distributed over a career.
Revised: A scientist may publish tens or hundreds of papers , yet these contributions to the literature are not uniformly distributed over a career.
Edit intent: clarity
Original:  Past analyses of the trajectories of faculty productivity suggest an intuitive and canonical pattern: after being hired, productivity tends to rise rapidly to an early peak and then gradually declines.
Revised:  Past analyses of the trajectories of faculty productivity suggest an intuitive and universal pattern: productivity tends to rise rapidly to an early peak and then gradually declines.
Edit intent: clarity
Original:  Here, we test the universality of this conventional narrative by analyzing the structures of individual faculty productivity time series, constructed from over 200,000 publications  matched with hiring data for 2453 tenure-track faculty in all 205 Ph.D-granting computer science departments in the U.S. and Canada.
Revised:  Here, we test the universality of this conventional narrative by analyzing the structures of individual faculty productivity time series, constructed from over 200,000 publications and matched with hiring data for 2453 tenure-track faculty in all 205 Ph.D-granting computer science departments in the U.S. and Canada.
Edit intent: coherence
Original:  We show that the conventional narrative  describes only one third of faculty, regardless of department prestige  , and the remaining two thirds of faculty exhibit a rich diversity of productivity patterns.
Revised:  We show that the conventional narrative confidently describes only one third of faculty, regardless of department prestige , and the remaining two thirds of faculty exhibit a rich diversity of productivity patterns.
Edit intent: clarity
Original:  To explain this diversity, we introduce a simple model of productivity trajectories, and explore which factors correlate with its parameters , showing that both individual productivity and the  transition from first- to last-author publications correlate with departmental prestige .
Revised:  To explain this diversity, we introduce a simple model of productivity trajectories, and explore which factors correlate with its parameters , showing that both individual productivity and the timing of the transition from first- to last-author publications correlate with departmental prestige .
Edit intent: clarity
Original:  The mixed domination number of a graph G, denoted by \gamma_m(G), is the minimum cardinality of mixed dominating sets of G and any mixed dominating set with  cardinality of \gamma_m(G) is called a minimum mixed dominating set.
Revised:  The mixed domination number of a graph G, denoted by \gamma_m(G), is the minimum cardinality of mixed dominating sets of G . Any mixed dominating set with cardinality of \gamma_m(G) is called a minimum mixed dominating set.
Edit intent: coherence
Original:  The mixed domination number of a graph G, denoted by \gamma_m(G), is the minimum cardinality of mixed dominating sets of G and any mixed dominating set with  cardinality of \gamma_m(G) is called a minimum mixed dominating set.
Revised:  The mixed domination number of a graph G, denoted by \gamma_m(G), is the minimum cardinality of mixed dominating sets of G and any mixed dominating set with the cardinality of \gamma_m(G) is called a minimum mixed dominating set.
Edit intent: fluency
Original:  The mixed domination  problem is to find a minimum mixed dominating set for  graph G and is known to be an NP-complete problem.
Revised:  The mixed domination problem is to find a minimum mixed dominating set for a graph G and is known to be an NP-complete problem.
Edit intent: fluency
Original:  Our new technique of assigning power  to edges and vertices, and charging vertices for edges combined with with dynamic programming leads to a fixed-parameter algorithm of time O(3^{ tw ^{2}}\times tw ^2 \times |V|) , which proves our next result, which is the mixed domination problem is fixed-parameter tractable with respect to tree-width  \times |V|) time} .
Revised:  Our new technique of assigning power values to edges and vertices, and charging vertices for edges combined with with dynamic programming leads to a fixed-parameter algorithm of time O(3^{ tw ^{2}}\times tw ^2 \times |V|) , which proves our next result, which is the mixed domination problem is fixed-parameter tractable with respect to tree-width \times |V|) time} .
Edit intent: clarity
Original:  Our new technique of assigning power  to edges and vertices, and charging vertices for edges combined with with dynamic programming leads to a fixed-parameter algorithm of time O(3^{ tw ^{2}}\times tw ^2 \times |V|) , which proves our next result, which is the mixed domination problem is fixed-parameter tractable with respect to tree-width  \times |V|) time} .
Revised:  Our new technique of assigning power to edges and vertices, and combining with dynamic programming, leads to a fixed-parameter algorithm of time O(3^{ tw ^{2}}\times tw ^2 \times |V|) , which proves our next result, which is the mixed domination problem is fixed-parameter tractable with respect to tree-width \times |V|) time} .
Edit intent: clarity
Original:  Our new technique of assigning power  to edges and vertices, and charging vertices for edges combined with with dynamic programming leads to a fixed-parameter algorithm of time O(3^{ tw ^{2}}\times tw ^2 \times |V|) , which proves our next result, which is the mixed domination problem is fixed-parameter tractable with respect to tree-width  \times |V|) time} .
Revised:  Our new technique of assigning power to edges and vertices, and charging vertices for edges combined with with dynamic programming leads to a fixed-parameter algorithm of time O(3^{ tw ^{2}}\times tw ^2 \times |V|) . This shows that MDS is fixed-parameter tractable with respect to tree-width \times |V|) time} .
Edit intent: clarity
Original:  In this paper, we present a novel approach to find all of the mixed dominating sets, called the AMDS problem, of a graph with bounded tree-width \text{tw .
Revised:  In this paper, we present a novel approach to find all of the mixed dominating sets, called the AMDS problem, of a graph with bounded tree-width tw .
Edit intent: coherence
Original:  Our new technique of assigning power values to edges and vertices, and combining with dynamic programming, leads to a fixed-parameter algorithm of time O(3^{ \text{tw ^{2}}\times \text{tw ^2 \times |V|).
Revised:  Our new technique of assigning power values to edges and vertices, and combining with dynamic programming, leads to a fixed-parameter algorithm of time O(3^{ tw ^{2}}\times \text{tw ^2 \times |V|).
Edit intent: fluency
Original:  Our new technique of assigning power values to edges and vertices, and combining with dynamic programming, leads to a fixed-parameter algorithm of time O(3^{ \text{tw ^{2}}\times \text{tw ^2 \times |V|).
Revised:  Our new technique of assigning power values to edges and vertices, and combining with dynamic programming, leads to a fixed-parameter algorithm of time O(3^{ \text{tw ^{2}}\times tw ^2 \times |V|).
Edit intent: fluency
Original:  This implies that, if we were to do hardened flip-flop designs to eliminate the flips due to register strikes  , in such designs, out of the remaining flips which are going to be due to 'gate strikes' , a large fraction will be multiple flips.
Revised:  This implies that, in principle, we can eliminate the flips due to register strikes , in such designs, out of the remaining flips which are going to be due to 'gate strikes' , a large fraction will be multiple flips.
Edit intent: clarity
Original:  This implies that, if we were to do hardened flip-flop designs to eliminate the flips due to register strikes  , in such designs, out of the remaining flips which are going to be due to 'gate strikes' , a large fraction will be multiple flips.
Revised:  This implies that, if we were to do hardened flip-flop designs to eliminate the flips due to register strikes using hardened flip-flop designs. However , in such designs, out of the remaining flips which are going to be due to 'gate strikes' , a large fraction will be multiple flips.
Edit intent: coherence
Original:  This implies that, if we were to do hardened flip-flop designs to eliminate the flips due to register strikes  , in such designs, out of the remaining flips which are going to be due to 'gate strikes' , a large fraction will be multiple flips.
Revised:  This implies that, if we were to do hardened flip-flop designs to eliminate the flips due to register strikes , in such designs, out of the remaining flips which will be due to 'gate strikes' , a large fraction will be multiple flips.
Edit intent: clarity
Original:  This implies that, if we were to do hardened flip-flop designs to eliminate the flips due to register strikes  , in such designs, out of the remaining flips which are going to be due to 'gate strikes' , a large fraction will be multiple flips.
Revised:  This implies that, if we were to do hardened flip-flop designs to eliminate the flips due to register strikes , in such designs, out of the remaining flips which are going to be due to gate strikes , a large fraction will be multiple flips.
Edit intent: fluency
Original:  When block-separable constraints are also present, randomized FW has been shown to further reduce complexity by updating only a fraction of coordinate blocks per iteration.
Revised:  When block-separable constraints are present, randomized FW has been shown to further reduce complexity by updating only a fraction of coordinate blocks per iteration.
Edit intent: clarity