wanyu/IteraTeR_v2 huggingface dataset:
Original:  The performance under our strategy is analyzed using a continuous time Markov chain model in terms of blocking probability, dropping probability, spectrum utilization and throughput of secondary users . Both analytical and simulation results show that our strategy lowers the blocking and dropping probabilities and enhances the spectrum utilization and throughput significantly .
Revised:  The performance under our strategy is analyzed using a continuous time Markov chain model in terms of blocking probability, dropping probability, spectrum utilization and throughput of the secondary network are evaluated . Both analytical and simulation results show that our strategy lowers the blocking and dropping probabilities and enhances the spectrum utilization and throughput significantly .
Edit intent: clarity
Original: We consider a diploid biparental multilocus population model of Moran type , in which randomly chosen pairs of diploid individuals  contribute offspring to the population.
Revised: We consider a diploid biparental multilocus population model of Moran type is our object of study. At each timestep, a pair of diploid individuals contribute offspring to the population.
Edit intent: clarity
Original:  The number of offspring can be large , in particular relative to the total population size.
Revised:  The number of offspring can be large relative to the total population size.
Edit intent: coherence
Original:  Such ' heavily skewed' reproduction mechanisms have been considered by various authors recently , e. g. Eldon and Wakeley (2008), and reviewed by Hedgecock and Pudovkin (2011).
Revised:  Similar ` heavily skewed' reproduction mechanisms have been considered by various authors recently , e. g. Eldon and Wakeley (2008), and reviewed by Hedgecock and Pudovkin (2011).
Edit intent: fluency
Original:  The chromosomes of each diploid offspring are derived from two distinct individuals, resulting in a separation of timescales phenomenon: ancestral lineages can only coalesce when in distinct individuals.
Revised:  The chromosomes of each diploid offspring , and hence ancestral lineages can only coalesce when in distinct individuals.
Edit intent: coherence
Original:  For example, the marginal genealogy at each locus is given by a \Xi-coalescent necessarily involving simultaneous multiple mergers in up to four groups, and different loci remain substantially correlated even as the recombination rate grows large.
Revised:  For example, the marginal genealogy at each locus admits simultaneous multiple mergers in up to four groups, and different loci remain substantially correlated even as the recombination rate grows large.
Edit intent: clarity
Original:  We compute correlations of coalescence times for two loci and discuss our findings for simulated data .
Revised:  Thus, genealogies for loci far apart on the same chromosome remain correlated. Correlation in coalescence times for two loci and discuss our findings for simulated data .
Edit intent: clarity
Original: We present a new model for the evolution of genetic types in the presence of so-called seed banks, i.e., where individuals may obtain their genetic type from ancestors which have lived in the near as well as the very far past.
Revised: We present a new model for seed banks, i.e., where individuals may obtain their genetic type from ancestors which have lived in the near as well as the very far past.
Edit intent: clarity
Original: We present a new model for the evolution of genetic types in the presence of so-called seed banks, i.e., where individuals may obtain their genetic type from ancestors which have lived in the near as well as the very far past.
Revised: We present a new model for the evolution of genetic types in the presence of so-called seed banks, where direct ancestors of individuals may have lived in the near as well as the very far past.
Edit intent: clarity
Original:  We prove that for age distributions with finite mean, the rescaled ancestral process converges to a time-changed Kingman coalescent, while in the case of infinite mean, ancestral lineages might not merge at all with positive probability.
Revised:  We prove that for age distributions with finite mean, the ancestral process converges to a time-changed Kingman coalescent, while in the case of infinite mean, ancestral lineages might not merge at all with positive probability.
Edit intent: clarity
Original:  The mathematical methods are based on renewal theory, the urn process introduced by Kaj et . al., as well as on a Gibbsian approach introduced by Hammond and Sheffield (2011 ) in a different context.
Revised:  The mathematical methods are based on renewal theory, the urn process introduced by Kaj et al., as well as on a Gibbsian approach introduced by Hammond and Sheffield (2011 ) in a different context.
Edit intent: fluency
Original:  The mathematical methods are based on renewal theory, the urn process introduced by Kaj et . al., as well as on a Gibbsian approach introduced by Hammond and Sheffield (2011 ) in a different context.
Revised:  The mathematical methods are based on renewal theory, the urn process introduced by Kaj et . al., as well as on a paper by Hammond and Sheffield (2011 ) in a different context.
Edit intent: clarity
Original: We consider a simple stochastic model of a urban  housing market, in which the interaction of tenants and landlords induces rent (or price) fluctuations.
Revised: We consider a simple stochastic model of a urban housing market, in which the interaction of tenants and landlords induces rent fluctuations.
Edit intent: clarity
Original:  We simulate the model numerically and measure the equilibrium price distribution, which is found to be well-described by a lognormal law.
Revised:  We simulate the model numerically and measure the equilibrium price distribution, which is found to be close to a lognormal law.
Edit intent: clarity
Original:  We also study the influence of the density of agents (or equivalently, the vacancy rate) on the price distribution.
Revised:  We also study the influence of the density of agents (or equivalently, the vacancy rate) on the rent distribution.
Edit intent: clarity
Original:  A simplified version of the model, amenable to analytical treatment, is proposed and allows us to recover a normal distribution for the logarithm of the price .
Revised:  A simplified version of the model, amenable to analytical treatment, is studied and leads to a lognormal distribution of rents .
Edit intent: clarity
Original: Motivated by its relation to the length of cutting plane proofs for the maximum independent set problem, we consider the following communication game on a given graph G  known to both players : Alice gets a set A of vertices,  Bob gets a  set B of vertices such that |A \cup B|> \alpha(G) . The goal is to find an edge lying in A \cup B.
Revised: Motivated by its relation to the length of cutting plane proofs for the maximum independent set problem, we consider the following communication game on a given graph G , known to both players : Alice gets a set A of vertices, Bob gets a set B of vertices such that |A \cup B|> \alpha(G) . The goal is to find an edge lying in A \cup B.
Edit intent: fluency
Original: Motivated by its relation to the length of cutting plane proofs for the maximum independent set problem, we consider the following communication game on a given graph G  known to both players : Alice gets a set A of vertices,  Bob gets a  set B of vertices such that |A \cup B|> \alpha(G) . The goal is to find an edge lying in A \cup B.
Revised: Motivated by its relation to the length of cutting plane proofs for the maximum independent set problem, we consider the following communication game on a given graph G known to both players : Alice gets a set A of vertices, and Bob gets a set B of vertices such that |A \cup B|> \alpha(G) . The goal is to find an edge lying in A \cup B.
Edit intent: fluency
Original:  We show that , for every n-vertex graph, about log n bits of communication are enough  .
Revised:  We show that , for every n-vertex graph, about log n bits of communication are enough for every n-vertex graph .
Edit intent: fluency
Original:  (3) provide empirical evidence that combining transfer learning with other efficiency enhancement techniques can often provide nearly multiplicative speedups.
Revised:  (3) provide empirical evidence that combining transfer learning with other efficiency enhancement techniques can often yield nearly multiplicative speedups.
Edit intent: clarity
Original:  In this paper, we present BlinkDB, a massively parallel, sampling-based approximate query engine for running interactive queries on large volumes of data.
Revised:  In this paper, we present BlinkDB, a massively parallel, sampling-based approximate query engine for running ad-hoc, interactive SQL queries on large volumes of data.
Edit intent: clarity
Original:  The key observation in BlinkDB is that one can make perfect decisions in the absence of perfect answers.
Revised:  The key insight that BlinkDB builds on is that one can make perfect decisions in the absence of perfect answers.
Edit intent: clarity
Original:  The key observation in BlinkDB is that one can make perfect decisions in the absence of perfect answers.
Revised:  The key observation in BlinkDB is that one can often make reasonable decisions in the absence of perfect answers.
Edit intent: clarity
Original:  For example, reliably detecting a malfunctioning server in a distributed collection of system logs does not require knowing every request the server processed . Based on this insight, BlinkDB allows one to tradeoff between query accuracy and response time, enabling interactive queries over massive data by running queries on data samples  .
Revised:  For example, reliably detecting a malfunctioning server using a distributed collection of system logs does not require knowing every request the server processed . Based on this insight, BlinkDB allows one to tradeoff between query accuracy and response time, enabling interactive queries over massive data by running queries on data samples .
Edit intent: clarity
Original:  For example, reliably detecting a malfunctioning server in a distributed collection of system logs does not require knowing every request the server processed . Based on this insight, BlinkDB allows one to tradeoff between query accuracy and response time, enabling interactive queries over massive data by running queries on data samples  .
Revised:  For example, reliably detecting a malfunctioning server in a distributed collection of system logs does not require analyzing every request processed by the system . Based on this insight, BlinkDB allows one to tradeoff between query accuracy and response time, enabling interactive queries over massive data by running queries on data samples .
Edit intent: clarity
Original:  For example, reliably detecting a malfunctioning server in a distributed collection of system logs does not require knowing every request the server processed . Based on this insight, BlinkDB allows one to tradeoff between query accuracy and response time, enabling interactive queries over massive data by running queries on data samples  .
Revised:  For example, reliably detecting a malfunctioning server in a distributed collection of system logs does not require knowing every request the server processed . Based on this insight, BlinkDB allows one to trade-off query accuracy for response time, enabling interactive queries over massive data by running queries on data samples .
Edit intent: fluency
Original:  To achieve this, BlinkDB uses two key ideas that differentiate it from previous sampling-based database systems : (1) an optimization framework to build a set of multi-dimensional, multi-resolution samples  , and (2) a strategy that uses a set of small samples to dynamically estimate a query's error andresponse time at runtime .
Revised:  To achieve this, BlinkDB uses two key ideas that differentiate it from previous work in this area : (1) an optimization framework to build a set of multi-dimensional, multi-resolution samples , and (2) a strategy that uses a set of small samples to dynamically estimate a query's error andresponse time at runtime .
Edit intent: clarity
Original:  To achieve this, BlinkDB uses two key ideas that differentiate it from previous sampling-based database systems : (1) an optimization framework to build a set of multi-dimensional, multi-resolution samples  , and (2) a strategy that uses a set of small samples to dynamically estimate a query's error andresponse time at runtime .
Revised:  To achieve this, BlinkDB uses two key ideas that differentiate it from previous sampling-based database systems : (1) an optimization framework to build a set of multi-dimensional, multi-resolution samples , and (2) a dynamic sample selection strategy that selects an appropriately sized sample based on a query's error andresponse time at runtime .
Edit intent: clarity
Original:  To achieve this, BlinkDB uses two key ideas that differentiate it from previous sampling-based database systems : (1) an optimization framework to build a set of multi-dimensional, multi-resolution samples  , and (2) a strategy that uses a set of small samples to dynamically estimate a query's error andresponse time at runtime .
Revised:  To achieve this, BlinkDB uses two key ideas that differentiate it from previous sampling-based database systems : (1) an optimization framework to build a set of multi-dimensional, multi-resolution samples , and (2) a strategy that uses a set of small samples to dynamically estimate a query's accuracy and/or response time requirements .
Edit intent: clarity
Original:  We have built a BlinkDB prototype, and validate its effectiveness using  well-known benchmarks and a real-world  workload derived from Conviva Networks .
Revised:  We have built an open-source version of BlinkDB and validated its effectiveness using well-known benchmarks and a real-world workload derived from Conviva Networks .
Edit intent: clarity
Original:  We have built a BlinkDB prototype, and validate its effectiveness using  well-known benchmarks and a real-world  workload derived from Conviva Networks .
Revised:  We have built a BlinkDB prototype, and validate its effectiveness using the well-known benchmarks and a real-world workload derived from Conviva Networks .
Edit intent: fluency
Original:  Our experiments  show that BlinkDB can execute a range of queries over a real-world query trace on up to 17 TB of data and 100 nodes in 2 seconds , with an error of 2-10 \%.
Revised:  Our experiments show that BlinkDB can answer a wide range of queries over a real-world query trace on up to 17 TB of data and 100 nodes in 2 seconds , with an error of 2-10 \%.
Edit intent: clarity
Original:  Our experiments  show that BlinkDB can execute a range of queries over a real-world query trace on up to 17 TB of data and 100 nodes in 2 seconds , with an error of 2-10 \%.
Revised:  Our experiments show that BlinkDB can execute a range of queries from a real-world query trace on up to 17 TB of data and 100 nodes in 2 seconds , with an error of 2-10 \%.
Edit intent: clarity
Original:  Our experiments  show that BlinkDB can execute a range of queries over a real-world query trace on up to 17 TB of data and 100 nodes in 2 seconds , with an error of 2-10 \%.
Revised:  Our experiments show that BlinkDB can execute a range of queries over a real-world query trace on up to 17 TB of data and 100 nodes in 2 seconds , with an error of 2 - 10 \%.
Edit intent: fluency
Original: The branching process (BP) approach has been successful in understanding the avalanche dynamics in complex networks.
Revised: The branching process (BP) approach has been successful in explaining the avalanche dynamics in complex networks.
Edit intent: clarity
Original:  However, its applications are mainly focused on unipartite networks in which nodes are all of the same type.
Revised:  However, its applications are mainly focused on unipartite networks , in which all nodes are of the same type.
Edit intent: fluency
Original:  Here, we develop the BP approach for a particular bipartite Boolean network , composed of logic OR and AND gates, which is motivated to understand the avalanche dynamics in metabolic networks .
Revised:  Here, we develop the BP approach to a particular bipartite Boolean network , composed of logic OR and AND gates, which is motivated to understand the avalanche dynamics in metabolic networks .
Edit intent: fluency
Original:  Here, we develop the BP approach for a particular bipartite Boolean network , composed of logic OR and AND gates, which is motivated to understand the avalanche dynamics in metabolic networks .
Revised:  Here, we develop the BP approach for a particular bipartite network composed of Boolean AND and OR logic gates .
Edit intent: coherence
Original:  We reduce the bipartite to a unipartite network by renormalizing the OR gates, and obtain an effective branching ratio for the  AND gates.
Revised:  We reduce the bipartite network into a unipartite network by renormalizing the OR gates, and obtain an effective branching ratio for the AND gates.
Edit intent: fluency
Original:  We reduce the bipartite to a unipartite network by renormalizing the OR gates, and obtain an effective branching ratio for the  AND gates.
Revised:  We reduce the bipartite to a unipartite network by renormalizing the OR gates, and obtain the effective branching ratio for the AND gates.
Edit intent: fluency
Original:  We reduce the bipartite to a unipartite network by renormalizing the OR gates, and obtain an effective branching ratio for the  AND gates.
Revised:  We reduce the bipartite to a unipartite network by renormalizing the OR gates, and obtain an effective branching ratio for the remaining AND gates.
Edit intent: clarity
Original:  Then the standard BP approach is applied to the reduced unipartite network, and the avalanche size distribution is obtained.
Revised:  Then the standard BP approach is applied to the reduced network, and the avalanche size distribution is obtained.
Edit intent: clarity
Original:  We also test the analytic result with simulations on a couple of metabolic networksin real world.
Revised:  We test the BP results with simulations on a couple of metabolic networksin real world.
Edit intent: clarity
Original: We derive a new, exact and transparent expansion for option smiles, which lends itself both to analytical approximation and, probably more importantly, to congenial numerical treatments.
Revised: We derive a new, exact and transparent expansion for option smiles, which lends itself both to analytical approximation and, perhaps more importantly, to congenial numerical treatments.
Edit intent: fluency
Original: We study the problem of medium access control in domain of event-driven wireless sensor networks ( WSN ). In this kind of WSN, sensor nodes send data to sink node only when an event occurs in the monitoring area.
Revised: We study the problem of medium access control in domain of event-driven wireless sensor networks ( WSNs ). In this kind of WSN, sensor nodes send data to sink node only when an event occurs in the monitoring area.
Edit intent: clarity
Original:  The nodes in this kind of WSN encounter correlated traffic as a subset of nodes start sending data by sensing a common event simultaneously.
Revised:  The nodes in this kind of WSNs encounter correlated traffic as a subset of nodes start sending data by sensing a common event simultaneously.
Edit intent: fluency
Original:  For WSN , many existing MAC protocols utilize the basic CSMA strategies like 802.
Revised:  For WSNs , many existing MAC protocols utilize the basic CSMA strategies like 802.
Edit intent: fluency
Original: 11 that uses Binary Exponential Backoff (BEB) algorithm to handle the collisions among packets when more than one node want to access the channel.
Revised: 11 Binary Exponential Backoff (BEB) algorithm to handle the collisions among packets when more than one node want to access the channel.
Edit intent: clarity
Original: 11 that uses Binary Exponential Backoff (BEB) algorithm to handle the collisions among packets when more than one node want to access the channel.
Revised: 11 that uses Binary Exponential Backoff (BEB) algorithm to handle the collisions among packets when more than one node need to access the channel.
Edit intent: clarity
Original: Summary: We introduce the MALDIquant R package that implements an analysis pipeline for quantitative analysis of mass spectrometric data.
Revised: Summary: MALDIquant is an R package providing a complete and modular analysis pipeline for quantitative analysis of mass spectrometric data.
Edit intent: clarity
Original: Summary: We introduce the MALDIquant R package that implements an analysis pipeline for quantitative analysis of mass spectrometric data.
Revised: Summary: We introduce the MALDIquant R package that implements an analysis pipeline for quantitative analysis of mass spectrometry data.
Edit intent: fluency
Original:  MALDIquant includes routines for importing raw spectrometric data, preprocessing (e.g. baseline removal), peak detection and peak alignment . MALDIquant is designed with application in clinical diagnostics in mind and handles replicated MALDI-TOF data as well as unequal resolution of spectra .
Revised:  MALDIquant is specifically designed with application in clinical diagnostics in mind and implements sophisticated routines for importing raw spectrometric data, preprocessing (e.g. baseline removal), peak detection and peak alignment . MALDIquant is designed with application in clinical diagnostics in mind and handles replicated MALDI-TOF data as well as unequal resolution of spectra .
Edit intent: clarity
Original:  MALDIquant includes routines for importing raw spectrometric data, preprocessing (e.g. baseline removal), peak detection and peak alignment . MALDIquant is designed with application in clinical diagnostics in mind and handles replicated MALDI-TOF data as well as unequal resolution of spectra .
Revised:  MALDIquant includes routines for importing raw data, preprocessing (e.g. baseline removal), peak detection and peak alignment . MALDIquant is designed with application in clinical diagnostics in mind and handles replicated MALDI-TOF data as well as unequal resolution of spectra .
Edit intent: clarity
Original:  MALDIquant includes routines for importing raw spectrometric data, preprocessing (e.g. baseline removal), peak detection and peak alignment . MALDIquant is designed with application in clinical diagnostics in mind and handles replicated MALDI-TOF data as well as unequal resolution of spectra .
Revised:  MALDIquant includes routines for importing raw spectrometric data, preprocessing (e.g. baseline removal), peak detection and peak alignment . MALDIquant is designed with application in clinical diagnostics in mind and handles replicated MALDI-TOF data as well as spectra with unequal resolution .
Edit intent: clarity
Original:  Availability: MALDIquant and its associated R packages readBrukerFlexData and readMzXmlData are freely available from the R archive CRAN URL and are distributed under the GNU General Public License (version 3 or later) .
Revised:  Availability: MALDIquant and its associated R packages readBrukerFlexData and readMzXmlData are freely available from the R archive CRAN URL The software is distributed under the GNU General Public License (version 3 or later) .
Edit intent: clarity
Original:  Further documentation is available from URL strimmerlab.org/software/maldiquant/.
Revised:  Further documentation is available from URL 
Edit intent: clarity
Original:  MALDIquant is specifically designed with application in clinical diagnostics in mind and implements sophisticated routines for importing raw data, preprocessing, non-linear peak alignment  and calibration.
Revised:  MALDIquant is specifically designed with application in clinical diagnostics in mind and implements sophisticated routines for importing raw data, preprocessing, non-linear peak alignment , and calibration.
Edit intent: fluency
Original: The hardness of fitness functions is an important research issue in evolutionary computation.
Revised: The hardness of fitness functions is an important research topic in the field of evolutionary computation.
Edit intent: clarity