wanyu/IteraTeR_v2 huggingface dataset:
Original:  Within a single frame of 4,096 symbols, nodes can discover their respective neighbors with on average 99.7\% accuracy at 10 dB SNR. The complexity of the chirp decoding algorithm is sub-linear, so that it is in principle scalable to networks with  48-bit IEEE 802.11 MAC addresses.
Revised:  Within a single frame of 4,096 symbols, nodes can discover their respective neighbors with on average 99.7\% accuracy at 10 dB SNR. The complexity of the chirp decoding algorithm is sub-linear, so that it is in principle scalable to networks with billions of nodes with 48-bit IEEE 802.11 MAC addresses.
Edit intent: clarity
Original:  The compressed neighbor discovery schemes are much more efficient than conventional random access discovery, where nodes have to retransmit over many frames with random delays to be successfully discovered due to collisions .
Revised:  The compressed neighbor discovery schemes are much more efficient than conventional random-access discovery, where nodes have to retransmit over many frames with random delays to be successfully discovered due to collisions .
Edit intent: fluency
Original:  The compressed neighbor discovery schemes are much more efficient than conventional random access discovery, where nodes have to retransmit over many frames with random delays to be successfully discovered due to collisions .
Revised:  The compressed neighbor discovery schemes are much more efficient than conventional random access discovery, where nodes have to retransmit over many frames with random delays to be successfully discovered .
Edit intent: clarity
Original:  Among other results, we also determine the cycle rank of powers of path graphs, thus answering a question recently raised by Novotny et al. (2009).
Edit intent: coherence
Original:  These options have potential applications for commodities and energy trading.
Revised:  These options are oriented on applications for commodities and energy trading.
Edit intent: clarity
Original:  It is shown that pricing for these options requires solution of an stochastic control problem.
Revised:  It is shown that pricing for these options requires solution of a stochastic control problem.
Edit intent: fluency
Original: The paper introduces a modification of the passport options such that the holder selects select dynamically a weight function that control the distribution of the payments (benefits) for option holder over time.
Revised: The paper introduces a modification of the passport options such that the holder selects dynamically a weight function that control the distribution of the payments (benefits) for option holder over time.
Edit intent: fluency
Original: The paper introduces a modification of the passport options such that the holder selects select dynamically a weight function that control the distribution of the payments (benefits) for option holder over time.
Revised: The paper introduces a modification of the passport options such that the holder selects select dynamically a weight function that control the distribution of the payments (benefits) over time.
Edit intent: clarity
Original:  For instance , a control process can represent the quantity of some commodity that can be purchased by a certain given price at current time.
Revised:  For instance , a control process can represent the quantity that can be purchased by a certain given price at current time.
Edit intent: clarity
Original:  For instance , a control process can represent the quantity of some commodity that can be purchased by a certain given price at current time.
Revised:  For instance , a control process can represent the quantity of some commodity that can be purchased by a fixed price at current time.
Edit intent: clarity
Original:  It is shown that pricing for these options requires solution of a stochastic control problem.
Revised:  The pricing for these options requires solution of a stochastic control problem.
Edit intent: coherence
Original:  It is shown that pricing for these options requires solution of a stochastic control problem.
Revised:  It is shown that pricing for these options requires to solve a stochastic control problem.
Edit intent: clarity
Original:  Some  pricing rules are suggested .
Revised:  Some existence results and pricing rules are suggested .
Edit intent: clarity
Original: A network observed in a particular context may appear to have "unusual" properties.
Revised: Networks coming from protein-protein interactions, transcriptional regulation, signaling, or metabolism may appear to have "unusual" properties.
Edit intent: clarity
Original:  However, when dealing with metabolic networks, the straightforward randomization of the network  generates fictitious reactions that are biochemically meaningless.
Revised:  However, when dealing with metabolic networks, the randomization of the network generates fictitious reactions that are biochemically meaningless.
Edit intent: clarity
Original:  Here we provide several natural ensembles for randomizing such metabolic networks.
Revised:  Here we provide several natural ensembles of randomized metabolic networks.
Edit intent: clarity
Original:  An implication of the present work is that the observed global structural properties of real metabolic networks are likely to be the consequence of simple biochemical and functional constraints.
Revised:  The implication of the present work is that the observed global structural properties of real metabolic networks are likely to be the consequence of simple biochemical and functional constraints.
Edit intent: fluency
Original:  We also show that two natural greedy strategies have approximation factor O(\log \Delta(G)), where \Delta(G) is the maximum degree of the graph G . We also provide exact polynomial time algorithms for several classes of graphs.
Revised:  We also show that two natural greedy strategies have approximation factor O(\log \Delta(G)), where \Delta(G) is the maximum degree of the input graph . We also provide exact polynomial time algorithms for several classes of graphs.
Edit intent: clarity
Original:  Taken together with an earlier proposal to use graphene nanogaps for the purpose of DNA sequencing, this atomically thin carbon material is becoming recognized as a possible solution to several of the technical issues in electronic nucleobase detection , in particular that of single-base resolution .
Revised:  Taken together with an earlier proposal to use graphene nanogaps for the purpose of DNA sequencing, this approach can resolve the technical problem of achieving single-base resolution in electronic nucleobase detection , in particular that of single-base resolution .
Edit intent: clarity
Original:  Taken together with an earlier proposal to use graphene nanogaps for the purpose of DNA sequencing, this atomically thin carbon material is becoming recognized as a possible solution to several of the technical issues in electronic nucleobase detection , in particular that of single-base resolution .
Revised:  Taken together with an earlier proposal to use graphene nanogaps for the purpose of DNA sequencing, this atomically thin carbon material is becoming recognized as a possible solution to several of the technical issues in electronic nucleobase detection .
Edit intent: clarity
Original:  We have used density functional theory and the non-equilibrium Green's function method to investigate the transverse conductance properties of nucleotides inside a graphene nanogap .
Revised:  We have used density functional theory and the non-equilibrium Green's function method to investigate the transverse conductance properties of nucleotides inside the gap .
Edit intent: clarity
Original:  In particular, we determined the variation in the transmission function at both zero bias and finite bias due to changes in the nucleotides orientation and lateral position.
Revised:  In particular, we determined the electrical tunneling current variation at finite bias due to changes in the nucleotides orientation and lateral position.
Edit intent: clarity
Original:  Although the resulting tunneling current is found to fluctuate over several orders of magnitudes, a distinction between the four DNA bases appears possible, and the graphene nanogap setup can therefore be regarded as a promising approach for rapid whole-genome sequencing  .
Revised:  Although the resulting tunneling current is found to fluctuate over several orders of magnitudes, a distinction between the four DNA bases appears possible, thus ranking the approach promising for rapid whole-genome sequencing .
Edit intent: clarity
Original:  Although the resulting tunneling current is found to fluctuate over several orders of magnitudes, a distinction between the four DNA bases appears possible, and the graphene nanogap setup can therefore be regarded as a promising approach for rapid whole-genome sequencing  .
Revised:  Although the resulting tunneling current is found to fluctuate over several orders of magnitudes, a distinction between the four DNA bases appears possible, and the graphene nanogap setup can therefore be regarded as a promising approach for rapid whole-genome sequencing applications .
Edit intent: clarity
Original:  Each region represents a node of \tree and the area of each region is proportional to the weight of the corresponding node.
Revised:  Each region represents a node of \tree and its area is proportional to the weight of the corresponding node.
Edit intent: clarity
Original:  An important quality criterium for treemaps is the aspect ratio of its regions.
Revised:  An important quality criterion for treemaps is the aspect ratio of its regions.
Edit intent: fluency
Original:  Unfortunately, one cannot bound the aspect ratio if the regions are restricted to be rectangles.
Revised:  One cannot bound the aspect ratio if the regions are restricted to be rectangles.
Edit intent: coherence
Original:  Hence Onak and Sidiropoulos in SoCG 2008 introduced polygonal partitions, which use convex polygons  .
Revised:  In contrast, polygonal partitions, which use convex polygons .
Edit intent: coherence
Original:  Hence Onak and Sidiropoulos in SoCG 2008 introduced polygonal partitions, which use convex polygons  .
Revised:  Hence Onak and Sidiropoulos in SoCG 2008 introduced polygonal partitions, that use convex polygons .
Edit intent: fluency
Original:  The leaves of%DIFDELCMD < \tree %DIFDELCMD < %%% are represented by rectangles, L-, and S-shapes and internal nodes by orthoconvex polygons.
Revised:  The leaves of%DIFDELCMD < \tree %DIFDELCMD < %%% are represented by rectangles, L-, and S-shapes , and regions representing internal nodes are orthoconvex polygons.
Edit intent: clarity
Original:  We also consider the important special case that%DIFDELCMD < \depth%%% (%DIFDELCMD < \tree%%% )=1, that is, single-level treemaps.
Revised:  We %DIFDELCMD < \depth%%% (%DIFDELCMD < \tree%%% )=1, that is, single-level treemaps.
Edit intent: coherence
Original:  We also consider the important special case that%DIFDELCMD < \depth%%% (%DIFDELCMD < \tree%%% )=1, that is, single-level treemaps.
Revised:  We also consider the important special case that%DIFDELCMD < \depth%%% %DIFDELCMD < \tree%%% )=1, that is, single-level treemaps.
Edit intent: fluency
Original: In the "positive interest" models of Flesaker and Hughston , the nominal discount bond system is determined by the specification of a one-parameter family of positive martingales.
Revised: In the "positive interest" models of Flesaker-Hughston , the nominal discount bond system is determined by the specification of a one-parameter family of positive martingales.
Edit intent: fluency
Original: In the "positive interest" models of Flesaker and Hughston , the nominal discount bond system is determined by the specification of a one-parameter family of positive martingales.
Revised: In the "positive interest" models of Flesaker and Hughston , the nominal discount bond system is determined by a one-parameter family of positive martingales.
Edit intent: clarity
Original:  These distributions include jump and diffusion characteristics that generate various interesting properties for discount bond returns.
Revised:  These distributions include jump and diffusion characteristics that generate various properties for discount bond returns.
Edit intent: clarity
Original:  The models are "rational" in the sense that the discount bond price is given by the ratio of a pair of weighted sums of positive martingales.
Revised:  The models are "rational" in the sense that the discount bond price is given by a ratio of weighted sums of positive martingales.
Edit intent: clarity
Original:  Our findings lead to semi-analytical formulae for the prices of European options on discount bonds  .
Revised:  Our findings lead to semi-analytical formulae for the prices of options on discount bonds .
Edit intent: clarity
Original:  Recently, with the developments of compressive sensing, an interesting problem was proposed to recover a lowrank matrix from sparse noise .
Revised:  Recently, with the progresses of compressive sensing, an interesting problem was proposed to recover a lowrank matrix from sparse noise .
Edit intent: clarity
Original:  Besides , if the recovered rank of the matrix is low enough, it can even cope with non-sparse noise distribution .
Revised:  Moreover , if the recovered rank of the matrix is low enough, it can even cope with non-sparse noise distribution .
Edit intent: fluency
Original:  Besides , if the recovered rank of the matrix is low enough, it can even cope with non-sparse noise distribution .
Revised:  Besides , if the recovered rank of the matrix is low enough, it can even cope with non-sparse errors .
Edit intent: clarity
Original:  ~\mbox{ clrty08 , stating that p=\frac{\log n{n}} is a sharp threshold function for the property rc_1(G(n,p))\leq 2. As a by-product, we obtain a polynomial-time algorithm that makes G(n,p) rainbow-k-connected using at most one more than the optimal number of colors with probability 1-o(1), for all k\leq O(\log n) and p=n^{-\epsilon(1\pm o(1))} for some constant \epsilon\in[0,1).
Revised:  , stating that p=\frac{\log n{n}} is a sharp threshold function for the property rc_1(G(n,p))\leq 2. As a by-product, we obtain a polynomial-time algorithm that makes G(n,p) rainbow-k-connected using at most one more than the optimal number of colors with probability 1-o(1), for all k\leq O(\log n) and p=n^{-\epsilon(1\pm o(1))} for some constant \epsilon\in[0,1).
Edit intent: coherence
Original: A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by \psi_k(G) the minimum cardinality of a k-path vertex cover in G. It is shown that the problem of determining \psi_k(G) is NP-hard for each k \geq 2, while for trees the problem can be solved in linear time.
Revised: A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by \psi_k(G) the minimum cardinality of a k-path vertex cover in G. It is shown that the problem of determining \psi_k(G) is NP-hard for each k \geq 2, while for trees the problem can be solved in linear time.
Edit intent: fluency
Original:  the second part is dedicated to the evo-devo method and transposable-elements;
Revised:  the third part is dedicated to the evo-devo method and transposable-elements;
Edit intent: fluency
Original:  the third part deals with junk DNA and ageing;
Revised:  the fourth part deals with junk DNA and ageing;
Edit intent: clarity
Original:  the fourth part explores the topic of cancer  . Biologists are the intended readership of this work.
Revised:  the fifth part explores the topic of cancer . Biologists are the intended readership of this work.
Edit intent: style
Original:  The model links the properties and behaviour of genes and cells to the properties and behaviour of the organism, describing and interpreting the said phenomena with a unified framework: for this reason, we think it can be proposed as a model for all biology.
Revised:  The model links properties and behaviour of genes and cells to the properties and behaviour of the organism, describing and interpreting the said phenomena with a unified framework: for this reason, we think it can be proposed as a model for all biology.
Edit intent: fluency
Original:  The model links the properties and behaviour of genes and cells to the properties and behaviour of the organism, describing and interpreting the said phenomena with a unified framework: for this reason, we think it can be proposed as a model for all biology.
Revised:  The model links the properties and behaviour of genes and cells to properties and behaviour of the organism, describing and interpreting the said phenomena with a unified framework: for this reason, we think it can be proposed as a model for all biology.
Edit intent: fluency
Original:  the sixth part draws the conclusions . Biologists are the intended readership of this work .
Revised:  the sixth part draws the conclusions .
Edit intent: clarity
Original:  Their result achieves the optimal rate, but it can only be applied if the bits are sampled in block , and only gives weak bounds for  non-smooth min-entropy.
Revised:  Their result achieves the optimal rate, but it can only be applied if the bits are sampled in blocks , and only gives weak bounds for non-smooth min-entropy.
Edit intent: fluency
Original:  Their result achieves the optimal rate, but it can only be applied if the bits are sampled in block , and only gives weak bounds for  non-smooth min-entropy.
Revised:  Their result achieves the optimal rate, but it can only be applied if the bits are sampled in block , and only gives weak bounds for the non-smooth min-entropy.
Edit intent: fluency
Original: This paper studies an incentive structure for cooperation and its stability in peer-assisted services when there exists multiple content providers, using a coalition game theoretic approach.
Revised: This paper studies an incentive structure for cooperation and its stability in peer-assisted services when there exist multiple content providers, using a coalition game theoretic approach.
Edit intent: fluency
Original:  (i) Each peer is underpaid than his due payoff , (ii) a service monopolyis possible , and (iii) the peer payoffs based on the Shapley-like mechanism exhibit even oscillatory behaviors.
Revised:  (i) underpaid peers , (ii) a service monopolyis possible , and (iii) the peer payoffs based on the Shapley-like mechanism exhibit even oscillatory behaviors.
Edit intent: clarity
Original:  (i) Each peer is underpaid than his due payoff , (ii) a service monopolyis possible , and (iii) the peer payoffs based on the Shapley-like mechanism exhibit even oscillatory behaviors.
Revised:  (i) Each peer is underpaid than his due payoff , (ii) service monopoly , and (iii) the peer payoffs based on the Shapley-like mechanism exhibit even oscillatory behaviors.
Edit intent: clarity
Original:  OSLOM is implemented in a freely available software ( URL and we believe it will be a valuable tool in the analysis of networks.
Revised:  OSLOM is implemented in a freely available software URL and we believe it will be a valuable tool in the analysis of networks.
Edit intent: fluency
Original:  \% Please keep the Author Summary between 150 and 200 words
Edit intent: coherence
Original:  The second improves the preprocessing time of data structures with  space bound of O(n^(4/3)) or higher while matching the best known query time.
Revised:  The second improves the preprocessing time of data structures with a space bound of O(n^(4/3)) or higher while matching the best known query time.
Edit intent: fluency
Original:  The techniques that we use include modifying the parameters of planar graph decompositions, combining the different advantages of existing data structures, and using the Monge property for finding minimum elements of partial matrices.
Revised:  The techniques that we use include modifying the parameters of planar graph decompositions, combining the different advantages of existing data structures, and using the Monge property for finding minimum elements of matrices.
Edit intent: clarity
Original: System energy models are important for energy opti-mization and management in mobile systems.
Revised: System energy models are important for energy optimization and management in mobile systems.
Edit intent: fluency
Original:  A five-day field study with four laptop users further demonstrates the effectiveness, efficiency, and noninvasiveness of Sesame.
Revised:  A five-day field studies with four laptop users further demonstrates the effectiveness, efficiency, and noninvasiveness of Sesame.
Edit intent: fluency
Original:  Next, the properties of the spontaneous process of purposeful information collecting are investigated.
Revised:  Next, the properties of the spontaneous process of collecting purposeful information are investigated.
Edit intent: clarity
Original:  We show that this algorithm can achieve a regret that is uniformly  logarithmic in time and polynomial in the number of users and resources , under certain conditions on the component Markov chains .
Revised:  We show that this algorithm can achieve a regret that is uniformly logarithmic in time and polynomial in the number of users and resources .
Edit intent: clarity
Original:  Here we map the quasi-species equation for individuals of a self-reproducing population to an ensemble of " scalar field elementary units " undergoing a creation and annihilation process.
Revised:  Here we map the quasi-species equation for individuals of a self-reproducing population to an ensemble of scalar field elementary units " undergoing a creation and annihilation process.
Edit intent: fluency
Original:  Here we map the quasi-species equation for individuals of a self-reproducing population to an ensemble of " scalar field elementary units " undergoing a creation and annihilation process.
Revised:  Here we map the quasi-species equation for individuals of a self-reproducing population to an ensemble of " scalar field elementary units undergoing a creation and annihilation process.
Edit intent: fluency
Original:  However, the conventional choice of variables in spin systems may cause problems in some models when parameter choices are unrealistic from the biological perspective.
Revised:  However, the conventional choice of variables in spin systems may cause problems in some models when parameter choices are unrealistic from a biological perspective.
Edit intent: fluency
Original:  We here consider a prototypical network model that is biologically plausible in its local mechanisms.
Revised:  We consider here a prototypical network model that is biologically plausible in its local mechanisms.
Edit intent: fluency
Original: The imbalance of phylogenetic trees exhibits a systematic deviation from the expectation of a purely random tree growth process as in the Yule or ERM models .
Revised: The balance or symmetry of phylogenetic trees exhibits a systematic deviation from the expectation of a purely random tree growth process as in the Yule or ERM models .
Edit intent: clarity
Original: The imbalance of phylogenetic trees exhibits a systematic deviation from the expectation of a purely random tree growth process as in the Yule or ERM models .
Revised: The imbalance of phylogenetic trees exhibits a systematic deviation from the expectation of a purely random tree growth process as in the Yule model .
Edit intent: clarity
Original:  Depending on the exponent \alpha, the scaling of tree depth with } tree size n , and find a transition between qualitatively different scaling regimes.
Revised:  Depending on the exponent \alpha, the scaling of tree depth with } tree size n displays a transition between qualitatively different scaling regimes.
Edit intent: clarity
Original: We study the role of quantum fluctuations of atomic nuclei in thermally activated, out-of-equilibrium processes .
Revised: We study the role of quantum fluctuations of atomic nuclei in the real-time dynamics of non-equilibrium macro-molecular transitions .
Edit intent: clarity