wanyu/IteraTeR_v2 huggingface dataset:
Original:  However, the wide range of manifestations of the law in and outside genomes suggest that the striking similarities between non-coding DNA and certain linguistics units could be anecdotal for understanding the recurrence of that statistical law.
Revised:  However, the wide range of manifestations of the law in and outside genomes suggests that the striking similarities between non-coding DNA and certain linguistics units could be anecdotal for understanding the recurrence of that statistical law.
Edit intent: fluency
Original:  In fact, we show that any non-adaptive strategy needs an expected number of \Omega (n \log n) guesses.
Revised:  In fact, we show that an optimal non-adaptive strategy needs an expected number of \Omega (n \log n) guesses.
Edit intent: clarity
Original:  For infinite variation processes , the wings of the limiting smile are determined by the jump activity indices of the positive and negative jumps, whereas in the finite variation case , the wings have a constant model-independent slope.
Revised:  For infinite variation processes , the wings of the limiting smile are determined by the jump activity indices of the positive and negative jumps, whereas in the former , the wings have a constant model-independent slope.
Edit intent: clarity
Original:  This makes infinite variation L\'evy models better suited for calibration based on short-maturity option prices.
Revised:  This result gives a theoretical justification for the preference of the infinite variation L\'evy models better suited for calibration based on short-maturity option prices.
Edit intent: clarity
Original:  This makes infinite variation L\'evy models better suited for calibration based on short-maturity option prices.
Revised:  This makes infinite variation L\'evy models over the finite variation ones in the calibration based on short-maturity option prices.
Edit intent: clarity
Original:  Moreover, we give a constructive proof, that for any fixed, finite abelian group G there exists a constant d, such that for any tree  the associated projective scheme can be defined by an ideal generated in degree at most d.
Revised:  Moreover, we give a constructive proof, that for any fixed, finite abelian group G there exists a constant d, such that for any tree , the associated projective scheme can be defined by an ideal generated in degree at most d.
Edit intent: fluency
Original: We determine the maximum number of intersections between two polygons with p and q vertices, respectively, in the plane.
Revised: We investigate the maximum number of intersections between two polygons with p and q vertices, respectively, in the plane.
Edit intent: clarity
Original:  We prove that the conjectured maximum (p-1)(q-1)+2 is correct for all odd p and q.
Revised:  The conjectured maximum is (p-1)(q-1)+2 is correct for all odd p and q.
Edit intent: clarity
Original:  We prove that the conjectured maximum (p-1)(q-1)+2 is correct for all odd p and q.
Revised:  We prove that the conjectured maximum (p-1)(q-1)+2 for all odd p and q.
Edit intent: clarity
Original:  Often, it can be assumed %DIFDELCMD < {\em %DIFDELCMD < %%% a priori that the underlying discrete-time random walk model is independent from absolute position (homogeneity), direction (isotropy) and time (stationarity)  .
Revised:  Often, it can be assumed %DIFDELCMD < {\em %DIFDELCMD < %%% a priori that the underlying discrete-time random walk model is independent from absolute position (homogeneity), direction (isotropy) and time (stationarity) .
Edit intent: fluency
Original:  We finally compare the proposed approach with an exact iterative algorithm (presented in ref.
Revised:  We finally compare the proposed approach with an exact iterative algorithm (presented in 
Edit intent: coherence
Original: The observed body masses for all extant cetacean species, including the 175,000,000g Blue Whale, are predicted, with no tunable parameters, by a macroevolutionary tradeoff between short-term selective advantages and long-term extinction risks from increased species body size, unfolding in a pelagic environment.
Revised: The evolution and distribution of species body sizes for terrestrial mammals is well-explained by a macroevolutionary tradeoff between short-term selective advantages and long-term extinction risks from increased species body size, unfolding in a pelagic environment.
Edit intent: clarity
Original:  Let a co-author C have written J (joint) publications with someone . Rank all the co-authors of that individual according to their number of joint publications, giving a rank r to each co-author, starting with r=1 for the most prolific.
Revised:  Let a co-author C have written J (joint) publications with one or several colleagues . Rank all the co-authors of that individual according to their number of joint publications, giving a rank r to each co-author, starting with r=1 for the most prolific.
Edit intent: clarity
Original:  Examining a finite set of researchers from a group of researchers from statistical physics, over a "long" time interval, a very simple relationship is empirically found between the number of joint publications J by coauthors and their rank of importance, i.e. J \propto 1/r.
Revised:  It is empirically found that a very simple relationship is empirically found between the number of joint publications J by coauthors and their rank of importance, i.e. J \propto 1/r.
Edit intent: clarity
Original:  Examining a finite set of researchers from a group of researchers from statistical physics, over a "long" time interval, a very simple relationship is empirically found between the number of joint publications J by coauthors and their rank of importance, i.e. J \propto 1/r.
Revised:  Examining a finite set of researchers from a group of researchers from statistical physics, over a "long" time interval, a very simple relationship holds between the number of joint publications J by coauthors and their rank of importance, i.e. J \propto 1/r.
Edit intent: clarity
Original:  Thus , in the same spirit as for the Hirsch core, one can define a "co-author core", and introduce indices operating on an author.
Revised:  Thereafter , in the same spirit as for the Hirsch core, one can define a "co-author core", and introduce indices operating on an author.
Edit intent: fluency
Original:  Therefore, variants and generalizations could be later produced in order to quantify co-author roles  in a temporary or long lasting stable team  .
Revised:  Therefore, variants and generalizations could be later produced in order to quantify co-author roles , in a temporary or long lasting stable team .
Edit intent: fluency
Original: The linear noise approximation is commonly used to obtain intrinsic noise statistics such as Fano factors and coefficients of variation for biochemical networks.
Revised: The linear noise approximation is commonly used to obtain intrinsic noise statistics for biochemical networks.
Edit intent: clarity
Original:  We here describe modifications to the software intrinsic Noise Analyzer (iNA) which enable it to accurately compute noise statistics over wide ranges of molecule numbers.
Revised:  We here describe modifications to the software intrinsic Noise Analyzer (iNA) which allows for accurate computation of noise statistics over wide ranges of molecule numbers.
Edit intent: clarity
Original:  Inspired by biological processes such as protein synthesis  and motor protein transport, we intro- duce the concept of localized dynamical sites coupled to a driven lattice gas dynamics.
Revised:  Inspired by biological processes such as protein synthesis and motor protein transport, we introduce the concept of localized dynamical sites coupled to a driven lattice gas dynamics.
Edit intent: fluency
Original:  Crucially, we find a novel dynamical regime characterized by an intermittent current and subject to severe finite-size effects that can enhance the transport at high particle densities.
Revised:  Crucially, we find a novel regime characterized by an intermittent current and subject to severe finite-size effects that can enhance the transport at high particle densities.
Edit intent: clarity
Original:  Arising around NP-complete  problems , large cycles theory has undergone a natural  growth and evolution, giving rise to a wide variety of results.
Revised:  Arising around NP-complete problems have undergone a natural growth and evolution, giving rise to a wide variety of results.
Edit intent: clarity
Original:  We focus on large cycles theory (LCT) - a simplified version of well-known hamiltonian graph theory , that joins together a number of NP-complete cycle problems in discrete mathematics.
Revised:  We focus on large cycles theory (LCT) - a simplified version of well-known hamiltonian graph theory . LCT joins together a number of NP-complete cycle problems in discrete mathematics.
Edit intent: coherence
Original:   We show that all theorems in LCT have descended from some common primitive propositions such as "every complete graph is hamiltonian" and "every graph contains a cycle of length at least one" by improvements, modifications and generalizations, combined with inductive reasoning.
Revised:  We show that all theorems in LCT have descended from some common primitive propositions such as "every complete graph is hamiltonian" or "every graph contains a cycle of length at least one" by improvements, modifications and generalizations, combined with inductive reasoning.
Edit intent: fluency
Original:   We show that all theorems in LCT have descended from some common primitive propositions such as "every complete graph is hamiltonian" and "every graph contains a cycle of length at least one" by improvements, modifications and generalizations, combined with inductive reasoning.
Revised:  We show that all theorems in LCT have descended from some common primitive propositions such as "every complete graph is hamiltonian" and "every graph contains a cycle of length at least one" via improvements, modifications and generalizations, combined with inductive reasoning.
Edit intent: clarity
Original:  In this problem, we are given a fixed string F of length n and we consider a stream in which symbols arrive one at a time.
Edit intent: coherence
Original:  The task is to output the Hamming distance between F and the string that consists of the last n symbols of the stream.
Revised:  The task is to output the Hamming distance between a fixed string of length n and the last n symbols of the stream.
Edit intent: clarity
Original:  The task is to output the Hamming distance between F and the string that consists of the last n symbols of the stream.
Revised:  The task is to output the Hamming distance between F and the string that consists of the last n symbols of a stream.
Edit intent: fluency
Original:  We give a lower bound of Omega((d/w) log n) time on average per output for this problem , where d is the number of bits needed to represent an input symbol.
Revised:  We give a lower bound of Omega((d/w) log n) time on average per output , where d is the number of bits needed to represent an input symbol.
Edit intent: clarity
Original:  We argue that this bound is in fact tight within the model using an existing reduction from online to offline pattern matching problems.
Revised:  We argue that this bound is tight within the model using an existing reduction from online to offline pattern matching problems.
Edit intent: clarity
Original: We develop an analytical method to calculate encounter times of two random walkers in one dimension when each individual is segregated in its own spatial compartment and shares with its neighbor only a fraction of the available space, finding very good agreement with numerically-exact calculations.
Revised: We develop an analytical method to calculate encounter times of two random walkers in one dimension when each individual is segregated in its own spatial domain and shares with its neighbor only a fraction of the available space, finding very good agreement with numerically-exact calculations.
Edit intent: clarity
Original:  We model a population of susceptible and infected territorial individuals which have such spatial heterogeneity , and which may transmit an epidemic when they meet.
Revised:  We model a population of susceptible and infected territorial individuals with this spatial arrangement , and which may transmit an epidemic when they meet.
Edit intent: clarity
Original:  Here a self-contained direct proof of the membership in 2-ExpTime is provided .
Revised:  Here a self-contained direct proof of the membership in 2-ExpTime is given .
Edit intent: clarity
Original:  This is done via a Prover-Refuter game which shows that there is an alternating Turing machine deciding the problem in exponencial space.
Revised:  This is done via a Prover-Refuter game which shows that there is an alternating Turing machine deciding the problem in exponential space.
Edit intent: fluency
Original:  To have an explicit proof of the upper bound seems useful also due to the recent shift of the known lower bound from PSPACE (Srba, 2002) to ExpTime (Kiefer, 2012).
Revised:  To have an explicit proof of the upper bound seems useful also due to the shift of the known lower bound from PSPACE (Srba, 2002) to ExpTime (Kiefer, 2012).
Edit intent: clarity
Original:  To have an explicit proof of the upper bound seems useful also due to the recent shift of the known lower bound from PSPACE (Srba, 2002) to ExpTime (Kiefer, 2012).
Revised:  To have an explicit proof of the upper bound seems useful also due to the recent shift of the known lower bound from PSpace (Srba, 2002) to ExpTime (Kiefer, 2012).
Edit intent: fluency
Original:  Model-based methods founded on quantitative descriptions of gene regulation are among the most promising, but many such methods still rely on ad hoc inference approaches and lack experimental interpretability.
Revised:  Model-based methods founded on quantitative descriptions of gene regulation are among the most promising, but many such methods still rely on ad hoc inference approaches lacking experimental interpretability.
Edit intent: coherence
Original:  We propose an experimental design and develop an associated statistical method for learning a quantitative, interpretable, predictive, biophysics-based ordinary differential equation model for gene regulation.
Revised:  We propose an experimental design and develop an associated statistical method for learning a quantitative, interpretable, predictive, biophysics-based ordinary differential equation model of gene regulation.
Edit intent: fluency
Original:  The key point demonstrated is that the total duration of calls of a particular type depends on the number of calls of that type.
Revised:  The key point demonstrated is that the total duration of calls of a particular type increases with the number of calls of that type.
Edit intent: clarity
Original: We answer two questions of Harju: (1) An infinite square-free ternary word with an n-stem factorization exists for any n\ge 123.
Revised: We answer a question of Harju: (1) An infinite square-free ternary word with an n-stem factorization exists for any n\ge 123.
Edit intent: clarity
Original: We answer two questions of Harju: (1) An infinite square-free ternary word with an n-stem factorization exists for any n\ge 123.
Revised: We answer two questions of Harju: An infinite square-free ternary word with an n-stem factorization exists for any n\ge 123.
Edit intent: coherence
Original:  We leave open the existence question for 13%DIFDELCMD < \le %%% n%DIFDELCMD < \le %%% 122. (2) The Thue word has no n-stem factorization for any n >3.\ge 
Revised:  We leave open the existence question for 13%DIFDELCMD < \le %%% %DIFDELCMD < \le %%% 122. (2) The Thue word has no n-stem factorization for any n >3.\ge 
Edit intent: clarity
Original: Multiuser Multi-Packet Transmission (MPT) from an Access Point (AP) equipped with multiple antennas to multiple single antenna nodes can be achieved by exploiting the spatial dimension of the channel.
Revised: Multiuser Multi-Packet Transmission (MPT) from an Access Point (AP) equipped with multiple antennas to multiple single-antenna nodes can be achieved by exploiting the spatial dimension of the channel.
Edit intent: fluency
Original:  In this paper we present a queueing model to analytically study such systems from the link-layer perspective, in presence of random packet arrivals and heterogeneous channel conditions  .
Revised:  In this paper we present a queueing model to analytically study such systems from the link-layer perspective, in presence of random packet arrivals , heterogeneous channel conditions .
Edit intent: fluency
Original: Wireless objects equipped with multiple antennas are able to simultaneously transmit or receive multiple packets by exploiting the channel's spatial dimensions.
Revised: Wireless objects equipped with multiple antennas are able to simultaneously transmit multiple packets by exploiting the channel's spatial dimensions.
Edit intent: clarity
Original:  In this paper, we study the benefits of such Multiple Packet Transmission /Reception (MPTR ) approach, when it is used in combination with a  CSMA/CA MAC protocol for fully interconnected networks, addressing the interactions between the two mechanisms and showing the performance gains that can be achieved.
Revised:  In this paper, we study the benefits of such Multiple Packet Transmission (MPT ) approach, when it is used in combination with a CSMA/CA MAC protocol for fully interconnected networks, addressing the interactions between the two mechanisms and showing the performance gains that can be achieved.
Edit intent: clarity
Original:  In this paper, we study the benefits of such Multiple Packet Transmission /Reception (MPTR ) approach, when it is used in combination with a  CSMA/CA MAC protocol for fully interconnected networks, addressing the interactions between the two mechanisms and showing the performance gains that can be achieved.
Revised:  In this paper, we study the benefits of such Multiple Packet Transmission /Reception (MPTR ) approach, when it is used in combination with a CSMA/CA ) protocol for fully interconnected networks, addressing the interactions between the two mechanisms and showing the performance gains that can be achieved.
Edit intent: coherence
Original:  To this end, a new MAC protocol, called MACMA (MACprotocol for Multiple Antenna wireless objects) , is introduced and formulated as a very basic MAC protocol that captures the fundamental properties  of a CSMA/CA channel access protocol supporting MPTR.
Revised:  To this end, a very simple Media Access Control (MAC) protocol that captures the fundamental properties of a CSMA/CA channel access protocol supporting MPTR.
Edit intent: clarity
Original:  Using the MACMA protocol as a reference, a new mathematical model for CSMA/CA MAC protocols supporting MPTR is presented for the case of non-saturated traffic sources with finite buffer space.
Revised:  Using the MACMA protocol as a reference, a new analytical model is presented for the case of non-saturated traffic sources with finite buffer space.
Edit intent: clarity
Original:  Simulation results show that the analytical model is able to accurately characterize MACMA's steady-state behavior for different number of antennas and different traffic loads, providing a useful tool to understand the performance gains that the proposed scheme can achieve .
Revised:  Simulation results show that the analytical model is able to accurately characterize the steady-state behavior for different number of antennas and different traffic loads, providing a useful tool to understand the performance gains that the proposed scheme can achieve .
Edit intent: clarity
Original:  Simulation results show that the analytical model is able to accurately characterize MACMA's steady-state behavior for different number of antennas and different traffic loads, providing a useful tool to understand the performance gains that the proposed scheme can achieve .
Revised:  Simulation results show that the analytical model is able to accurately characterize MACMA's steady-state behavior for different number of antennas and different traffic loads, providing a useful tool for understanding the performance gains that the proposed scheme can achieve .
Edit intent: fluency
Original:  Our model replicates the qualitative and quantitative behavior of CSD found in experimental studies and elucidates the effect of oxygen deprivation on CSD recovery.
Edit intent: coherence
Original:  We show that during CSD, the metabolic activity of the cortex outstrips the physiological limits placed on oxygen delivery, regardless of vascular constriction or dilation.
Revised:  We show that during CSD, the metabolic demands of the cortex outstrips the physiological limits placed on oxygen delivery, regardless of vascular constriction or dilation.
Edit intent: clarity
Original:  We show that during CSD, the metabolic activity of the cortex outstrips the physiological limits placed on oxygen delivery, regardless of vascular constriction or dilation.
Revised:  We show that during CSD, the metabolic activity of the cortex exceed the physiological limits placed on oxygen delivery, regardless of vascular constriction or dilation.
Edit intent: clarity
Original:  However, vasoconstriction and vasodilation play important roles in determining the susceptibility of the cortical tissue to CSD and its recovery.
Revised:  However, vasoconstriction and vasodilation play important roles in the propagation of CSD and its recovery.
Edit intent: clarity
Original:  Our study incorporates relevant perfusion and metabolic factors into a model of CSD, and in doing so, helps explain the varied phenotypes of this phenomenon%DIFDELCMD < {\it %%% in vitro and%DIFDELCMD < {\it %%% in vivo .
Revised:  Our %DIFDELCMD < {\it %%% in vitro and%DIFDELCMD < {\it %%% in vivo .
Edit intent: clarity
Original:  Our study incorporates relevant perfusion and metabolic factors into a model of CSD, and in doing so, helps explain the varied phenotypes of this phenomenon%DIFDELCMD < {\it %%% in vitro and%DIFDELCMD < {\it %%% in vivo .
Revised:  Our study incorporates relevant perfusion and metabolic factors into a model of CSD, and in doing so, helps explain the varied phenotypes of this phenomenon%DIFDELCMD < {\it %%% and%DIFDELCMD < {\it %%% in vivo .
Edit intent: fluency
Original:  Our study incorporates relevant perfusion and metabolic factors into a model of CSD, and in doing so, helps explain the varied phenotypes of this phenomenon%DIFDELCMD < {\it %%% in vitro and%DIFDELCMD < {\it %%% in vivo .
Revised:  Our study incorporates relevant perfusion and metabolic factors into a model of CSD, and in doing so, helps explain the varied phenotypes of this phenomenon%DIFDELCMD < {\it %%% in vitro %DIFDELCMD < {\it %%% in vivo .
Edit intent: coherence
Original:  Raman and Saurabh (2006 ) proved that every connected oriented graph G on n vertices and m arcs , contains an acyclic subgraph with at least m{2}+n-1{4} arcs.
Revised:  Raman and Saurabh (2006 ) proved that every connected oriented graph G on n vertices and m arcs contains an acyclic subgraph with at least m{2}+n-1{4} arcs.
Edit intent: fluency
Original:  We also prove that there is a polynomial time algorithm that either establishes that the input instance of the problem is a Yes-instance or reduces the input instance to an equivalent one with O(k^2) vertices .
Revised:  We also prove that there is a polynomial time algorithm that either establishes that the input instance of the problem is a Yes-instance or reduces the input instance to an equivalent one of size O(k^2) vertices .
Edit intent: clarity
Original:  We also prove that there is a polynomial time algorithm that either establishes that the input instance of the problem is a Yes-instance or reduces the input instance to an equivalent one with O(k^2) vertices .
Revised:  We also prove that there is a polynomial time algorithm that either establishes that the input instance of the problem is a Yes-instance or reduces the input instance to an equivalent one with O(k^2) .
Edit intent: clarity