wanyu/IteraTeR_v2 huggingface dataset:
Original:  This is however at odds with the theoretical support for hindered diffusion among randomly located immobile obstacles, which predicts that true subdiffusion occurs only in the vicinity of the threshold for the percolation of obstacles, and that \alpha takes a%DIFDELCMD < {\it %DIFDELCMD < %%% unique , universal value .
Revised:  This is however at odds with the theoretical support for hindered diffusion among randomly located immobile obstacles, which predicts that true subdiffusion occurs only in the vicinity of the threshold for the percolation of obstacles, and that \alpha takes a%DIFDELCMD < {\it %DIFDELCMD < %%% unique .
Edit intent: clarity
Original:    Here, we present refined simulations of hindered diffusion with biologically realistic parameters and bring forth four main contributions.
Revised:  immobile Here, we present refined simulations of hindered diffusion with biologically realistic parameters and bring forth four main contributions.
Edit intent: fluency
Original:    Here, we present refined simulations of hindered diffusion with biologically realistic parameters and bring forth four main contributions.
Revised:  obstacles. Here, we present refined simulations of hindered diffusion with biologically realistic parameters and bring forth four main contributions.
Edit intent: fluency
Original:  (%DIFDELCMD < {\it %%% i ) We confirm that diffusion hindered by randomly located immobile obstacles does not exhibit variations of \alpha and (%DIFDELCMD < {\it %%% ii ) that the MSD in fact never scales like a power law of time.
Revised:  (%DIFDELCMD < {\it %%% ) We confirm that diffusion hindered by randomly located immobile obstacles does not exhibit variations of \alpha and (%DIFDELCMD < {\it %%% ii ) that the MSD in fact never scales like a power law of time.
Edit intent: fluency
Original:  (%DIFDELCMD < {\it %%% i ) We confirm that diffusion hindered by randomly located immobile obstacles does not exhibit variations of \alpha and (%DIFDELCMD < {\it %%% ii ) that the MSD in fact never scales like a power law of time.
Revised:  (%DIFDELCMD < {\it %%% i %DIFDELCMD < {\it %%% ii ) that the MSD in fact never scales like a power law of time.
Edit intent: coherence
Original:  (%DIFDELCMD < {\it %%% i ) We confirm that diffusion hindered by randomly located immobile obstacles does not exhibit variations of \alpha and (%DIFDELCMD < {\it %%% ii ) that the MSD in fact never scales like a power law of time.
Revised:  (%DIFDELCMD < {\it %%% i ) We confirm that diffusion hindered by randomly located immobile obstacles does not exhibit variations of \alpha and (%DIFDELCMD < {\it %%% ) that the MSD in fact never scales like a power law of time.
Edit intent: clarity
Original:  (%DIFDELCMD < {\it %%% iii ) In contrast to diffusing obstacles, obstacles fluctuating around equilibrium positions preserve and even emphasize anomalous regimes.
Revised:  (%DIFDELCMD < {\it %%% ) In contrast to diffusing obstacles, obstacles fluctuating around equilibrium positions preserve and even emphasize anomalous regimes.
Edit intent: fluency
Original:  (%DIFDELCMD < {\it %%% iv ) Hindered diffusion is not equivalent to anomalous diffusion due to random traps with heavy-tailed trap time distribution.
Revised:  (%DIFDELCMD < {\it %%% ) Hindered diffusion is not equivalent to anomalous diffusion due to random traps with heavy-tailed trap time distribution.
Edit intent: coherence
Original:  The input buffer of each node is modeled as a Geo/G/1 queue, and the packet service time distribution is derived from a one-dimensional Markov chain of 802.11 DCF with the underlying scheduling algorithm.
Revised:  The input buffer of each node is modeled as a Geo/G/1 queue, and the packet service time distribution is derived from Markov state space of 802.11 DCF with the underlying scheduling algorithm.
Edit intent: clarity
Original:  Specifically, we obtain the characteristic equation of network throughput , the stable throughput region, and the bounded delay region .
Revised:  We obtain the characteristic equation of network throughput , the stable throughput region, and the bounded delay region .
Edit intent: coherence
Original:  These actions modify an election's participation structure and aim at either making a favorite candidate win ("constructive control") or prevent a despised candidate from winning ("destructive control").
Edit intent: clarity
Original:  We also study the control complexity of Bucklin voting itself and show that it behaves almost as good (possibly even as good) as fallback voting in terms of control resistance.
Revised:  We also study the control complexity of Bucklin voting and show that it behaves almost as good (possibly even as good) as fallback voting in terms of control resistance.
Edit intent: clarity
Original:  We also study the control complexity of Bucklin voting itself and show that it behaves almost as good (possibly even as good) as fallback voting in terms of control resistance.
Revised:  We also study the control complexity of Bucklin voting itself and show that it performs at least almost as well as fallback voting in terms of control resistance.
Edit intent: clarity
Original:  Here we review an application of category theory to describe structural and resulting functional properties of biological protein materials by developing so-called ologs.
Revised:  Here we describe an application of category theory to describe structural and resulting functional properties of biological protein materials by developing so-called ologs.
Edit intent: clarity
Original:  This key difference ensures that an olog is unambiguous, highly adaptable to evolution and change, and suitable for sharing concepts with other ologs .
Revised:  This key difference ensures that an olog is unambiguous, highly adaptable to evolution and change, and suitable for sharing concepts with other olog .
Edit intent: clarity
Original:  We consider a simple example of an alpha-helical and an amyloid-like protein filament subjected to axial extension and develop an olog representation of their structural and resulting mechanical properties.
Revised:  We consider simple cases of alpha-helical and an amyloid-like protein filament subjected to axial extension and develop an olog representation of their structural and resulting mechanical properties.
Edit intent: clarity
Original:  We consider a simple example of an alpha-helical and an amyloid-like protein filament subjected to axial extension and develop an olog representation of their structural and resulting mechanical properties.
Revised:  We consider a simple example of an alpha-helical and amyloid-like protein filament subjected to axial extension and develop an olog representation of their structural and resulting mechanical properties.
Edit intent: fluency
Original:  We consider a simple example of an alpha-helical and an amyloid-like protein filament subjected to axial extension and develop an olog representation of their structural and resulting mechanical properties.
Revised:  We consider a simple example of an alpha-helical and an amyloid-like protein filaments subjected to axial extension and develop an olog representation of their structural and resulting mechanical properties.
Edit intent: fluency
Original:  The examples reviewed here demonstrate that the intrinsic nature of a complex system, which in particular includes a precise relationship between structure and function at different hierarchical levels, can be effectively represented by an olog.
Revised:  The examples presented here demonstrate that the intrinsic nature of a complex system, which in particular includes a precise relationship between structure and function at different hierarchical levels, can be effectively represented by an olog.
Edit intent: clarity
Original: We consider a square-integrable semimartingale with conditionally independent increments and symmetric jump measure, and show that its discrete realized variance dominates its quadratic variation in increasing convex order.
Revised: We consider a square-integrable semimartingale with conditionally independent increments and symmetric jump measure, then its discrete realized variance dominates its quadratic variation in increasing convex order.
Edit intent: coherence
Original:  The result has immediate applications to the pricing of options on realized variance.
Revised:  The results have immediate applications to the pricing of options on realized variance.
Edit intent: fluency
Original:  Under this definition accessibility is high, in the sense that at least one accessible pathway exists with a substantial probability that approaches unity as the dimensionality of the fitness landscape (set by the number of mutational loci) becomes large.
Revised:  Under this definition accessibility is high, in the sense that at least one accessible pathwayexists with a substantial probability that approaches unity as the dimensionality of the fitness landscape (set by the number of mutational loci) becomes large.
Edit intent: fluency
Original:  We test the model predictions against an empirical 8-locus fitness landscape obtained for the filamentous fungus Aspergillus niger .
Revised:  We test the model predictions against an empirical 8-locus fitness landscape obtained for the filamentous fungus Aspergillus niger .
Edit intent: fluency
Original: In 1997, Z.Zhang and R.W.Yeung gave the first example of a constraint information inequality in four variables that is not "Shannon-type".
Revised: In 1997, Z.Zhang and R.W.Yeung found the first example of a constraint information inequality in four variables that is not "Shannon-type".
Edit intent: clarity
Original:  Later  the same authors and other researchers discovered several unconditional information inequalities that do not follow from Shannon's inequalities for entropy.
Revised:  Later , the same authors and other researchers discovered several unconditional information inequalities that do not follow from Shannon's inequalities for entropy.
Edit intent: fluency
Original:  In this paper we discuss the known methods of proving non Shannon-type conditional inequalities and show that some of them are "essentially" conditional, i.e., they cannot be extended to any unconditional inequality.
Revised:  In this paper we show that some non Shannon-type conditional inequalities and show that some of them are "essentially" conditional, i.e., they cannot be extended to any unconditional inequality.
Edit intent: coherence
Original:  In this paper we discuss the known methods of proving non Shannon-type conditional inequalities and show that some of them are "essentially" conditional, i.e., they cannot be extended to any unconditional inequality.
Revised:  In this paper we discuss the known methods of proving non Shannon-type conditional inequalities are "essentially" conditional, i.e., they cannot be extended to any unconditional inequality.
Edit intent: coherence
Original:  A transaction in online marketplaces is better modeled by the trust game than other social dilemma games, including the symmetric Prisoner's Dilemma .
Revised:  A transaction in online marketplaces is better modeled by the trust game than other social dilemma games, including the donation game and the prisoner's dilemma .
Edit intent: clarity
Original:  We show that the reputation mechanism enables cooperation between unacquainted buyers and sellers under fairly generous conditions, even when such a cooperative equilibrium coexists with the asocial equilibrium in which buyers and sellers defect each other .
Revised:  We show that the reputation mechanism enables cooperation between unacquainted buyers and sellers under fairly generous conditions, even when such a cooperative equilibrium coexists with an asocial equilibrium in which buyers and sellers defect each other .
Edit intent: fluency
Original:  Unfortunately, the use of redundancy introduces storage and communication overheads, which can either reduce the overall  capacity of the system , or increase its costs.
Revised:  Unfortunately, the use of redundancy introduces storage and communication overheads, which can either reduce the overall capacity of the system or increase its costs.
Edit intent: fluency
Original:  To mitigate these storage and communication overheads , different redundancy schemes have been proposed.
Revised:  To mitigate the storage and communication overheads , different redundancy schemes have been proposed.
Edit intent: fluency
Original:  To mitigate these storage and communication overheads , different redundancy schemes have been proposed.
Revised:  To mitigate these storage and communication overhead , different redundancy schemes have been proposed.
Edit intent: fluency
Original:  However, due to the great variety of underlaying storage infrastructures and  different application needs, optimizing these redundancy schemes for each different infrastructure is highly cumbersome.
Revised:  However, due to the great variety of underlaying storage infrastructures and the different application needs, optimizing these redundancy schemes for each different infrastructure is highly cumbersome.
Edit intent: fluency
Original:  However, due to the great variety of underlaying storage infrastructures and  different application needs, optimizing these redundancy schemes for each different infrastructure is highly cumbersome.
Revised:  However, due to the great variety of underlaying storage infrastructures and different application needs, optimizing these redundancy schemes for each storage infrastructure is cumbersome.
Edit intent: clarity
Original:  The lack of rules to determine the optimal redundancy configuration for each storage infrastructure leads developers in the industry to choice simpler redundancy schemes, which are not usually the optimal ones.
Revised:  The lack of rules to determine the optimal level of redundancy for each storage infrastructure leads developers in the industry to choice simpler redundancy schemes, which are not usually the optimal ones.
Edit intent: clarity
Original:  The lack of rules to determine the optimal redundancy configuration for each storage infrastructure leads developers in the industry to choice simpler redundancy schemes, which are not usually the optimal ones.
Revised:  The lack of rules to determine the optimal redundancy configuration for each storage configuration leads developers in the industry to choice simpler redundancy schemes, which are not usually the optimal ones.
Edit intent: clarity
Original:  The lack of rules to determine the optimal redundancy configuration for each storage infrastructure leads developers in the industry to choice simpler redundancy schemes, which are not usually the optimal ones.
Revised:  The lack of rules to determine the optimal redundancy configuration for each storage infrastructure leads developers in industry to often choose simpler redundancy schemes, which are not usually the optimal ones.
Edit intent: clarity
Original:  The lack of rules to determine the optimal redundancy configuration for each storage infrastructure leads developers in the industry to choice simpler redundancy schemes, which are not usually the optimal ones.
Revised:  The lack of rules to determine the optimal redundancy configuration for each storage infrastructure leads developers in the industry to choice simpler redundancy schemes, which are usually not the optimal ones.
Edit intent: fluency
Original:  In this paper we analyze the costs of different redundancy schemes under different storage infrastructures.
Revised:  In this paper we analyze the cost of different redundancy schemes under different storage infrastructures.
Edit intent: fluency
Original:  Through our cost analysis we derive a set of rules to determine which redundancy schemes minimize the storage and the communication costs in each situation .
Revised:  Through our cost analysis we derive a set of rules to determine which redundancy scheme minimizes the storage and the communication costs in each situation .
Edit intent: fluency
Original:  Through our cost analysis we derive a set of rules to determine which redundancy schemes minimize the storage and the communication costs in each situation .
Revised:  Through our cost analysis we derive a set of rules to determine which redundancy schemes minimize the storage and the communication costs for a given system configuration .
Edit intent: clarity
Original:  Additionally, we use experimentation to show that in realistic environments, some theoretically-optimal schemes can lead to unreliable storage systems .
Revised:  Additionally, we use simulation to show that in realistic environments, some theoretically-optimal schemes can lead to unreliable storage systems .
Edit intent: clarity
Original:  Additionally, we use experimentation to show that in realistic environments, some theoretically-optimal schemes can lead to unreliable storage systems .
Revised:  Additionally, we use experimentation to show that theoretically-optimal schemes can lead to unreliable storage systems .
Edit intent: clarity
Original:  Even restricting synthesis to 4-bit reversible functions results in a huge search space (16! ~ 2 ^44 functions).
Revised:  Even restricting synthesis to 4-bit reversible functions results in a huge search space (16! ~ 2 ^{44 functions).
Edit intent: fluency
Original:  Here we analyze the complete publication careers of 300 scientists and find remarkable regularity in the functional form of the rank-citation profile c_{i}(r) for each scientist i =1.. .300.
Revised:  However, little is known about the scientific impact distribution at the scale of an individual scientist. We analyze the aggregate scientific production and impact of individual careers using the rank-citation profile c_{i}(r) for each scientist i =1.. .300.
Edit intent: clarity
Original:  We find that the rank-ordered citation distribution c_{i entire range of ranks r, which allows for the characterization and comparison of c_{i}(r) using a common framework.
Revised:  We find that the rank-ordered citation distribution c_{i entire range of paper rank r, we fit each c_{i}(r) using a common framework.
Edit intent: clarity
Original:  The functional form of the DGBD has two scaling exponents , beta_i and gamma_i, which determine the scaling behavior of c_{i scientists with equivalent Hirsch h-index values may have different c_{i}(r) profiles, our results demonstrate the utility of the beta_i parameter in conjunction with h , in order to quantify a scientist's publication impact.
Revised:  The functional form of the DGBD has two scaling exponents . Since two scientists with equivalent Hirsch h-index values may have different c_{i}(r) profiles, our results demonstrate the utility of the beta_i parameter in conjunction with h , in order to quantify a scientist's publication impact.
Edit intent: clarity
Original:  The functional form of the DGBD has two scaling exponents , beta_i and gamma_i, which determine the scaling behavior of c_{i scientists with equivalent Hirsch h-index values may have different c_{i}(r) profiles, our results demonstrate the utility of the beta_i parameter in conjunction with h , in order to quantify a scientist's publication impact.
Revised:  The functional form of the DGBD has two scaling exponents , beta_i and gamma_i, which determine the scaling behavior of c_{i scientists with equivalent Hirsch h-index can have significantly different c_{i}(r) profiles, our results demonstrate the utility of the beta_i parameter in conjunction with h , in order to quantify a scientist's publication impact.
Edit intent: clarity
Original:  The functional form of the DGBD has two scaling exponents , beta_i and gamma_i, which determine the scaling behavior of c_{i scientists with equivalent Hirsch h-index values may have different c_{i}(r) profiles, our results demonstrate the utility of the beta_i parameter in conjunction with h , in order to quantify a scientist's publication impact.
Revised:  The functional form of the DGBD has two scaling exponents , beta_i and gamma_i, which determine the scaling behavior of c_{i scientists with equivalent Hirsch h-index values may have different c_{i}(r) profiles, our results demonstrate the utility of the \beta_{i parameter in conjunction with h , in order to quantify a scientist's publication impact.
Edit intent: fluency
Original:  The functional form of the DGBD has two scaling exponents , beta_i and gamma_i, which determine the scaling behavior of c_{i scientists with equivalent Hirsch h-index values may have different c_{i}(r) profiles, our results demonstrate the utility of the beta_i parameter in conjunction with h , in order to quantify a scientist's publication impact.
Revised:  The functional form of the DGBD has two scaling exponents , beta_i and gamma_i, which determine the scaling behavior of c_{i scientists with equivalent Hirsch h-index values may have different c_{i}(r) profiles, our results demonstrate the utility of the beta_i parameter in conjunction with h _{i publication impact.
Edit intent: clarity
Original: Rejection sampling is a well-known technique to sample from a target distribution, given the ability to sample from another distribution.
Revised: Rejection sampling is a well-known method to sample from a target distribution, given the ability to sample from another distribution.
Edit intent: clarity
Original: Rejection sampling is a well-known technique to sample from a target distribution, given the ability to sample from another distribution.
Revised: Rejection sampling is a well-known technique to sample from a target distribution, given the ability to sample from a given distribution.
Edit intent: clarity
Original:  We define a quantum analogue of rejection sampling: given a black box producing a coherent superposition of  quantum states with some amplitudes, the problem is to prepare a coherent superposition of the same states  with different target amplitudes.
Revised:  We define a quantum analogue of rejection sampling: given a black box producing a coherent superposition of quantum states with some amplitudes, the problem is to prepare a coherent superposition of the same states , albeit with different target amplitudes.
Edit intent: clarity
Original:  We prove a matching lower bound based on symmetrizing over the automorphism group of the problem and using a hybrid argument.
Revised:  Our proof of a matching lower bound based on symmetrizing over the automorphism group of the problem and using a hybrid argument.
Edit intent: fluency
Original:  As an example, we derive a new quantum algorithm for the hidden shift problem for an arbitrary Boolean function whose running time is obtained by "water-filling" its Fourier spectrum.
Revised:  As an example, we derive a new quantum algorithm for the hidden shift problem of an arbitrary Boolean function whose running time is obtained by "water-filling" its Fourier spectrum.
Edit intent: fluency
Original:  As an example, we derive a new quantum algorithm for the hidden shift problem for an arbitrary Boolean function whose running time is obtained by "water-filling" its Fourier spectrum.
Revised:  As an example, we derive a new quantum algorithm for the hidden shift problem for an arbitrary Boolean function whose running time is obtained by "water-filling" of the Fourier spectrum.
Edit intent: clarity
Original:  We apply our construction to several problems by analyzing its computational efficiency under two special cases of matrix samples ;
Revised:  We apply the proposed algorithm to several problems by analyzing its computational efficiency under two special cases of matrix samples ;
Edit intent: clarity
Original:  We apply our construction to several problems by analyzing its computational efficiency under two special cases of matrix samples ;
Revised:  We apply our construction to several problems by analyzing its computational efficiency under two special cases of matrices ;
Edit intent: clarity
Original:  one in which the samples have a group structure and the other in which they have rank-one outer-product structure.
Revised:  one in which the matrices have a group structure and the other in which they have rank-one outer-product structure.
Edit intent: clarity