wanyu/IteraTeR_v2 huggingface dataset:
Original: We consider a general heterogeneous network in which, besides a general propagation effects (shadowing and-or fading), individual base stations may use different emitted powers and be subject to different parameters of the Hata-like propagation loss model (path-loss exponent and constant) , e.g. due todifferent antenna heights.
Revised: We consider a general heterogeneous network in which, besides a general propagation effects (shadowing and-or fading), individual base stations may use different emitted powers and be subject to different parameters of the Hata-like propagation loss model (path-loss exponent and constant) due to, for example, varying antenna heights.
Edit intent: coherence
Original:  We assume also that the stations may have various and different engineering parameters , e.g. of link layer performance (SINR threshold, etc).
Revised:  We assume also that the stations may have varying parameters of, for example, the link layer performance (SINR threshold, etc).
Edit intent: clarity
Original:  Studying a propagation processes of signals received by the typical user from all antennas marked by the corresponding antenna parameters  we show that , seemingly different , heterogeneous networks based on Poisson point processes of BS, may be equivalent from the point of view a typical user characteristics.
Revised:  By studying the propagation processes of signals received by the typical user from all antennas marked by the corresponding antenna parameters we show that , seemingly different , heterogeneous networks based on Poisson point processes of BS, may be equivalent from the point of view a typical user characteristics.
Edit intent: clarity
Original:  Studying a propagation processes of signals received by the typical user from all antennas marked by the corresponding antenna parameters  we show that , seemingly different , heterogeneous networks based on Poisson point processes of BS, may be equivalent from the point of view a typical user characteristics.
Revised:  Studying a propagation processes of signals received by the typical user from all antennas marked by the corresponding antenna parameters , we show that , seemingly different , heterogeneous networks based on Poisson point processes of BS, may be equivalent from the point of view a typical user characteristics.
Edit intent: fluency
Original:  Studying a propagation processes of signals received by the typical user from all antennas marked by the corresponding antenna parameters  we show that , seemingly different , heterogeneous networks based on Poisson point processes of BS, may be equivalent from the point of view a typical user characteristics.
Revised:  Studying a propagation processes of signals received by the typical user from all antennas marked by the corresponding antenna parameters we show that seemingly different heterogeneous networks based on Poisson point processes of BS, may be equivalent from the point of view a typical user characteristics.
Edit intent: fluency
Original:  Studying a propagation processes of signals received by the typical user from all antennas marked by the corresponding antenna parameters  we show that , seemingly different , heterogeneous networks based on Poisson point processes of BS, may be equivalent from the point of view a typical user characteristics.
Revised:  Studying a propagation processes of signals received by the typical user from all antennas marked by the corresponding antenna parameters we show that , seemingly different , heterogeneous networks based on Poisson point processes can be equivalent from the point of view a typical user characteristics.
Edit intent: clarity
Original:  Furthermore, they all can be replaced with a model where all the previously variable propagation parameters (including path-loss exponent ) are set to constants while the only trade-off being the introduction of an isotropic base station density.
Revised:  Furthermore, they all can be replaced with a model where all the previously varying propagation parameters (including path-loss exponent ) are set to constants while the only trade-off being the introduction of an isotropic base station density.
Edit intent: clarity
Original:  Furthermore, they all can be replaced with a model where all the previously variable propagation parameters (including path-loss exponent ) are set to constants while the only trade-off being the introduction of an isotropic base station density.
Revised:  Furthermore, they all can be replaced with a model where all the previously variable propagation parameters (including path-loss exponents ) are set to constants while the only trade-off being the introduction of an isotropic base station density.
Edit intent: fluency
Original:  In the case of a constant path-loss exponent, the isotropic representation becomes just a homogeneous modification of the constant intensity of the original network, thus generalizing a previous result showing that the propagation processes only depend on some moment of the emitted power and propagation effects.
Revised:  In the case of a constant path-loss exponent, the isotropic representation simplifies to a homogeneous modification of the constant intensity of the original network, thus generalizing a previous result showing that the propagation processes only depend on some moment of the emitted power and propagation effects.
Edit intent: clarity
Original:  In the case of a constant path-loss exponent, the isotropic representation becomes just a homogeneous modification of the constant intensity of the original network, thus generalizing a previous result showing that the propagation processes only depend on some moment of the emitted power and propagation effects.
Revised:  In the case of a constant path-loss exponent, the isotropic representation becomes just a homogeneous modification of the constant intensity of the original network, thus generalizing a previous result showing that the propagation processes only depend on one moment of the emitted power and propagation effects.
Edit intent: clarity
Original:  We give examples and applications to motivate these results and highlight an interesting observation regarding random path-loss power exponents.
Revised:  We give examples and applications to motivate these results and highlight an interesting observation regarding random path-loss exponents.
Edit intent: clarity
Original: We describe  algorithmic reduction of the search for integral points on a biquadratic curve y^2 = ax^4 + bx^2 + c with  ac(b^2-4ac) %DIFDELCMD < \ne %%% 0 to a finite number of Thue equations.
Revised: We describe an algorithmic reduction of the search for integral points on a biquadratic curve y^2 = ax^4 + bx^2 + c with ac(b^2-4ac) %DIFDELCMD < \ne %%% 0 to a finite number of Thue equations.
Edit intent: fluency
Original: We describe  algorithmic reduction of the search for integral points on a biquadratic curve y^2 = ax^4 + bx^2 + c with  ac(b^2-4ac) %DIFDELCMD < \ne %%% 0 to a finite number of Thue equations.
Revised: We describe algorithmic reduction of the search for integral points on a curve y^2 = ax^4 + bx^2 + c with ac(b^2-4ac) %DIFDELCMD < \ne %%% 0 to a finite number of Thue equations.
Edit intent: clarity
Original: We describe  algorithmic reduction of the search for integral points on a biquadratic curve y^2 = ax^4 + bx^2 + c with  ac(b^2-4ac) %DIFDELCMD < \ne %%% 0 to a finite number of Thue equations.
Revised: We describe algorithmic reduction of the search for integral points on a biquadratic curve y^2 = ax^4 + bx^2 + c with ac(b^2-4ac) %DIFDELCMD < \ne %%% to solving a finite number of Thue equations.
Edit intent: clarity
Original:  We discuss a particular application of our reduction for finding near multiples of squares in Lucas sequences.
Revised:  We discuss a particular application of finding near multiples of squares in Lucas sequences.
Edit intent: clarity
Original:  As an example  we establish that among Fibonacci numbers only 2 and 34 are of the form 2m^2+2;
Revised:  As an example , we establish that among Fibonacci numbers only 2 and 34 are of the form 2m^2+2;
Edit intent: fluency
Original:  We illustrate this approach with a particular application of finding near multiples of squares in Lucas sequences.
Revised:  We illustrate this approach with a particular application of finding near-multiples of squares in Lucas sequences.
Edit intent: fluency
Original: In the recent past years, CSMA (Carrier Sense Multiple Access), which resolves contentions over wireless networks in a fully distributed fashion, has  gained a lot of attentions since it has been proved in several papers that appropriate control of CSMA parameters provably guarantees optimality in terms of throughput and fairness.
Revised:  CSMA (Carrier Sense Multiple Access), which resolves contentions over wireless networks in a fully distributed fashion, has gained a lot of attentions since it has been proved in several papers that appropriate control of CSMA parameters provably guarantees optimality in terms of throughput and fairness.
Edit intent: clarity
Original: In the recent past years, CSMA (Carrier Sense Multiple Access), which resolves contentions over wireless networks in a fully distributed fashion, has  gained a lot of attentions since it has been proved in several papers that appropriate control of CSMA parameters provably guarantees optimality in terms of throughput and fairness.
Revised: In the recent past years, CSMA (Carrier Sense Multiple Access), which resolves contentions over wireless networks in a fully distributed fashion, has recently gained a lot of attentions since it has been proved in several papers that appropriate control of CSMA parameters provably guarantees optimality in terms of throughput and fairness.
Edit intent: coherence
Original: In the recent past years, CSMA (Carrier Sense Multiple Access), which resolves contentions over wireless networks in a fully distributed fashion, has  gained a lot of attentions since it has been proved in several papers that appropriate control of CSMA parameters provably guarantees optimality in terms of throughput and fairness.
Revised: In the recent past years, CSMA (Carrier Sense Multiple Access), which resolves contentions over wireless networks in a fully distributed fashion, has gained a lot of attentions since it has been proved that appropriate control of CSMA parameters provably guarantees optimality in terms of throughput and fairness.
Edit intent: clarity
Original: In the recent past years, CSMA (Carrier Sense Multiple Access), which resolves contentions over wireless networks in a fully distributed fashion, has  gained a lot of attentions since it has been proved in several papers that appropriate control of CSMA parameters provably guarantees optimality in terms of throughput and fairness.
Revised: In the recent past years, CSMA (Carrier Sense Multiple Access), which resolves contentions over wireless networks in a fully distributed fashion, has gained a lot of attentions since it has been proved in several papers that appropriate control of CSMA parameters guarantees optimality in terms of throughput and fairness.
Edit intent: clarity
Original: Most algorithms rely on the famous MCMC (Markov Chain Monte Carlo) technique, which enables one to find optimal CSMA parameters through iterative loops of  simulation-and-update  .
Revised: Most algorithms rely on the popular MCMC (Markov Chain Monte Carlo) technique, which enables one to find optimal CSMA parameters through iterative loops of simulation-and-update .
Edit intent: clarity
Original: Most algorithms rely on the famous MCMC (Markov Chain Monte Carlo) technique, which enables one to find optimal CSMA parameters through iterative loops of  simulation-and-update  .
Revised: Most algorithms rely on the famous MCMC (Markov Chain Monte Carlo) technique, which enables one to find optimal CSMA parameters through iterative loops of ` simulation-and-update .
Edit intent: fluency
Original: Most algorithms rely on the famous MCMC (Markov Chain Monte Carlo) technique, which enables one to find optimal CSMA parameters through iterative loops of  simulation-and-update  .
Revised: Most algorithms rely on the famous MCMC (Markov Chain Monte Carlo) technique, which enables one to find optimal CSMA parameters through iterative loops of simulation-and-update ' .
Edit intent: fluency
Original:  However, such a simulation-based approach often becomes a major cause of  slow convergence, being vulnerable to flow/topology changes.
Revised:  However, such a simulation-based approach often becomes a major cause of slow convergence, being poorly adaptive to flow/topology changes.
Edit intent: clarity
Original:  Our motivating tools are variational methods, referred to as Bethe and Kikuchi approximations in statistical physics, allowing us to express approximate solutions via a small number of certain non-linear equations.
Revised:  Our motivating tools are variational methods, referred to as Bethe and Kikuchi approximations in statistical physics, allowing us to express approximate solutions via a certain non-linear equations.
Edit intent: clarity
Original:  Fast convergence comes from directly solving those non-linear equations in a distributed manner, rather than multiple loops of simulation-and-update  in existing algorithms.
Revised:  Fast convergence comes from directly solving the non-linear equations in a distributed manner, rather than multiple loops of simulation-and-update in existing algorithms.
Edit intent: fluency
Original:  Fast convergence comes from directly solving those non-linear equations in a distributed manner, rather than multiple loops of simulation-and-update  in existing algorithms.
Revised:  Fast convergence comes from directly solving those non-linear system in a distributed manner, rather than multiple loops of simulation-and-update in existing algorithms.
Edit intent: clarity
Original:  Fast convergence comes from directly solving those non-linear equations in a distributed manner, rather than multiple loops of simulation-and-update  in existing algorithms.
Revised:  Fast convergence comes from directly solving those non-linear equations in a distributed manner, rather than multiple simulation-and-update in existing algorithms.
Edit intent: clarity
Original:  Fast convergence comes from directly solving those non-linear equations in a distributed manner, rather than multiple loops of simulation-and-update  in existing algorithms.
Revised:  Fast convergence comes from directly solving those non-linear equations in a distributed manner, rather than multiple loops of simulation-and-update loops in existing algorithms.
Edit intent: clarity
Original:  Our simulation results verify our theoretical developments and show that our approximate solutions are highly accurate and converge much faster than prior algorithms under various scenarios .
Revised:  We provide numerical results to show that the algorithm produces highly accurate solutions and converges much faster than prior algorithms under various scenarios .
Edit intent: clarity
Original:  Our simulation results verify our theoretical developments and show that our approximate solutions are highly accurate and converge much faster than prior algorithms under various scenarios .
Revised:  Our simulation results verify our theoretical developments and show that our approximate solutions are highly accurate and converge much faster than the prior ones .
Edit intent: clarity
Original: Measuring different delays and choosing between distinct reward-options available at those delays (intertemporal decision-making) is an essential component of animal behavior.
Revised: Animals and humans make decisions based on their expected outcomes. Since relevant outcomes are often delayed, perceiving delays and choosing between distinct reward-options available at those delays (intertemporal decision-making) is an essential component of animal behavior.
Edit intent: clarity
Original: Measuring different delays and choosing between distinct reward-options available at those delays (intertemporal decision-making) is an essential component of animal behavior.
Revised: Measuring different delays and choosing between earlier versus later rewards (intertemporal decision-making) is an essential component of animal behavior.
Edit intent: clarity
Original:  The wide variety of observations made in experiments studying intertemporal decision-making and time perception have not yet been rationalized within a single unifying theory.
Revised:  The myriad observations made in experiments studying intertemporal decision-making and time perception have not yet been rationalized within a single unifying theory.
Edit intent: clarity
Original:  The wide variety of observations made in experiments studying intertemporal decision-making and time perception have not yet been rationalized within a single unifying theory.
Revised:  The wide variety of observations made in experiments studying intertemporal decision-making and time perception have not yet been rationalized within a single theory.
Edit intent: clarity
Original:  Here we present such a theory-Training-Integrated Maximized Estimation of Reinforcement Rate (TIMERR) -which postulates that animals perform intertemporal choices by optimizing reward rates within a limited temporal window that includes a past integration interval (over which past reward rate is estimated) as well as the expected delay to future reward.
Revised:  Here we present a theory-Training--Integrated Maximized Estimation of Reinforcement Rate (TIMERR) -which postulates that animals perform intertemporal choices by optimizing reward rates within a limited temporal window that includes a past integration interval (over which past reward rate is estimated) as well as the expected delay to future reward.
Edit intent: clarity
Original:  Here we present such a theory-Training-Integrated Maximized Estimation of Reinforcement Rate (TIMERR) -which postulates that animals perform intertemporal choices by optimizing reward rates within a limited temporal window that includes a past integration interval (over which past reward rate is estimated) as well as the expected delay to future reward.
Revised:  Here we present such a theory-Training-Integrated Maximized Estimation of Reinforcement Rate (TIMERR) -which postulates that animals make intertemporal choices to optimize expected reward rates over a limited temporal window that includes a past integration interval (over which past reward rate is estimated) as well as the expected delay to future reward.
Edit intent: clarity
Original:  Here we present such a theory-Training-Integrated Maximized Estimation of Reinforcement Rate (TIMERR) -which postulates that animals perform intertemporal choices by optimizing reward rates within a limited temporal window that includes a past integration interval (over which past reward rate is estimated) as well as the expected delay to future reward.
Revised:  Here we present such a theory-Training-Integrated Maximized Estimation of Reinforcement Rate (TIMERR) -which postulates that animals perform intertemporal choices by optimizing reward rates within a limited temporal window ; this window includes a past integration interval (over which past reward rate is estimated) as well as the expected delay to future reward.
Edit intent: clarity
Original:  Here we present such a theory-Training-Integrated Maximized Estimation of Reinforcement Rate (TIMERR) -which postulates that animals perform intertemporal choices by optimizing reward rates within a limited temporal window that includes a past integration interval (over which past reward rate is estimated) as well as the expected delay to future reward.
Revised:  Here we present such a theory-Training-Integrated Maximized Estimation of Reinforcement Rate (TIMERR) -which postulates that animals perform intertemporal choices by optimizing reward rates within a limited temporal window that includes a past integration interval (over which experienced reward rate is estimated) as well as the expected delay to future reward.
Edit intent: fluency
Original:  Here we present such a theory-Training-Integrated Maximized Estimation of Reinforcement Rate (TIMERR) -which postulates that animals perform intertemporal choices by optimizing reward rates within a limited temporal window that includes a past integration interval (over which past reward rate is estimated) as well as the expected delay to future reward.
Revised:  Here we present such a theory-Training-Integrated Maximized Estimation of Reinforcement Rate (TIMERR) -which postulates that animals perform intertemporal choices by optimizing reward rates within a limited temporal window that includes a past integration interval (over which past reward rate is estimated) and the expected delay to future reward.
Edit intent: coherence
Original:  Our theory explains numerous fundamental observations and provides a single conceptual framework to understand both intertemporal decision-making and time perception.
Revised:  Our theory explains numerous fundamental observations and provides a single framework to understand both intertemporal decision-making and time perception.
Edit intent: clarity
Original: In diverse sexual populations, selection operates neither on the whole genome -- which is repeatedly taken apart and reassembled by recombination -- nor on individual alleles which are tightly linked to the chromosomal neighborhood.
Revised: In sexual populations, selection operates neither on the whole genome -- which is repeatedly taken apart and reassembled by recombination -- nor on individual alleles which are tightly linked to the chromosomal neighborhood.
Edit intent: clarity
Original: In diverse sexual populations, selection operates neither on the whole genome -- which is repeatedly taken apart and reassembled by recombination -- nor on individual alleles which are tightly linked to the chromosomal neighborhood.
Revised: In diverse sexual populations, selection operates neither on the whole genome , which is repeatedly taken apart and reassembled by recombination -- nor on individual alleles which are tightly linked to the chromosomal neighborhood.
Edit intent: fluency
Original: In diverse sexual populations, selection operates neither on the whole genome -- which is repeatedly taken apart and reassembled by recombination -- nor on individual alleles which are tightly linked to the chromosomal neighborhood.
Revised: In diverse sexual populations, selection operates neither on the whole genome -- which is repeatedly taken apart and reassembled by recombination , nor on individual alleles which are tightly linked to the chromosomal neighborhood.
Edit intent: fluency
Original: In diverse sexual populations, selection operates neither on the whole genome -- which is repeatedly taken apart and reassembled by recombination -- nor on individual alleles which are tightly linked to the chromosomal neighborhood.
Revised: In diverse sexual populations, selection operates neither on the whole genome -- which is repeatedly taken apart and reassembled by recombination -- nor on individual alleles that are tightly linked to the chromosomal neighborhood.
Edit intent: fluency
Original:  Those tightly linked alleles affect each others dynamics which reduces the efficiency of selection and distorts patterns of genetic diversity.
Revised:  The resulting interference between linked alleles reduces the efficiency of selection and distorts patterns of genetic diversity.
Edit intent: clarity
Original:  We present a simple but powerful scaling analysis identifying the unit of selection as the genomic "linkage block" with characteristic length \xi_b, which is determined in a self-consistent manner by the condition that the rate of recombination within the block is comparable to the fitness differences between different alleles of the block.
Revised:  We present a simple but powerful scaling analysis identifying the unit of selection as the genomic "linkage block" with a characteristic length determined in a self-consistent manner by the condition that the rate of recombination within the block is comparable to the fitness differences between different alleles of the block.
Edit intent: coherence