wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this case, we recover a scenario which is common to probabilistic excitable media: as a function of the conductance coupling G among the excitable elements, the dynamic range is maximized precisely at the critical value G_c above which self-sustained activity becomes stable.
Revised:  In this case, we recover a scenario that is common to probabilistic excitable media: as a function of the conductance coupling G among the excitable elements, the dynamic range is maximized precisely at the critical value G_c above which self-sustained activity becomes stable.
Edit intent: fluency
Original:  We also show that the underlying dynamics of other well studied kinetic models of markets can be mapped to the dynamics of our auto regressive model.
Revised:  We also show that the underlying dynamics of other well studied kinetic models of markets can be mapped to the dynamics of our auto-regressive model.
Edit intent: fluency
Original:  The formulation follows the ideas originally due to Dwork and McSherry , stated implicitly in [ Dw06 ].
Revised:  The formulation follows the ideas originally due to Dwork and McSherry [ Dw06 ].
Edit intent: clarity
Original:  The formulation follows the ideas originally due to Dwork and McSherry , stated implicitly in [ Dw06 ].
Revised:  The formulation follows the ideas originally due to Dwork and McSherry , stated implicitly in [ Dwork 2006 ].
Edit intent: clarity
Original:  This  is, to our knowledge, the first place such a formulation appears explicitly.
Revised:  This paper is, to our knowledge, the first place such a formulation appears explicitly.
Edit intent: clarity
Original: Stateless geographic routing provides relatively good performance at a much lower overhead than conventional routing protocols such as AODV.
Revised: Stateless geographic routing provides relatively good performance at a fixed overhead, which is typically much lower than conventional routing protocols such as AODV.
Edit intent: clarity
Original:  However, the performance of these protocols is impacted by physical voids, and localization errors.
Revised:  However, the performance of geographic routing is impacted by physical voids, and localization errors.
Edit intent: clarity
Original:  But VCS also faces virtual anomalies . Meanwhile, only greedy forwarding was proposed as routing algorithm on VCS without an even comparable performance to the greedy forwarding on physical coordinates.
Revised:  However, VCS also faces virtual anomalies . Meanwhile, only greedy forwarding was proposed as routing algorithm on VCS without an even comparable performance to the greedy forwarding on physical coordinates.
Edit intent: coherence
Original:  We propose a spanning-path virtual coordinate system on which a spanning-path routing can work as either independent routing algorithm or the complementary to greedy forwarding , picking up its failures.
Revised:  We propose a spanning-path virtual coordinate system which can be used as a complete routing algorithm or the complementary to greedy forwarding , picking up its failures.
Edit intent: clarity
Original:  We propose a spanning-path virtual coordinate system on which a spanning-path routing can work as either independent routing algorithm or the complementary to greedy forwarding , picking up its failures.
Revised:  We propose a spanning-path virtual coordinate system on which a spanning-path routing can work as either independent routing algorithm or as the complementary algorithm to greedy forwarding , picking up its failures.
Edit intent: fluency
Original:  With our approach, and for the first time, we show a stateless and delivery guaranteed geometric routing  on VCS.
Revised:  With our approach, and for the first time, we demonstrate a stateless and delivery guaranteed geometric routing on VCS.
Edit intent: fluency
Original:  With our approach, and for the first time, we show a stateless and delivery guaranteed geometric routing  on VCS.
Revised:  With our approach, and for the first time, we show a stateless and delivery guaranteed geometric routing algorithm on VCS.
Edit intent: clarity
Original:  When it works with our previously proposed aligned virtual coordinate system (AVCS), it out-performs not only all geometric routing protocols on VCS, but also the geographic routing protocol with accurate location information , such as GPSR .
Revised:  When used in conjunction with our previously proposed aligned virtual coordinate system (AVCS), it out-performs not only all geometric routing protocols on VCS, but also the geographic routing protocol with accurate location information , such as GPSR .
Edit intent: clarity
Original:  When it works with our previously proposed aligned virtual coordinate system (AVCS), it out-performs not only all geometric routing protocols on VCS, but also the geographic routing protocol with accurate location information , such as GPSR .
Revised:  When it works with our previously proposed aligned virtual coordinate system (AVCS), it out-performs not only all geometric routing protocols on VCS, but also geographic routing with accurate location information , such as GPSR .
Edit intent: clarity
Original:  When it works with our previously proposed aligned virtual coordinate system (AVCS), it out-performs not only all geometric routing protocols on VCS, but also the geographic routing protocol with accurate location information , such as GPSR .
Revised:  When it works with our previously proposed aligned virtual coordinate system (AVCS), it out-performs not only all geometric routing protocols on VCS, but also the geographic routing protocol with accurate location information .
Edit intent: clarity
Original: The denaturation dynamics of a long double-stranded DNA is studied by  a model of the Poland-Scheraga type where helicity constraints are taken into account.
Revised: The denaturation dynamics of a long double-stranded DNA is studied by means of a model of the Poland-Scheraga type where helicity constraints are taken into account.
Edit intent: clarity
Original:  Then, in a second regime, bubbles coalesce and form entropic barriers that effectively trap residual double-stranded segments within the chain, slowing down the relaxation to fully molten configurations, which takes place at \tau_2\sim L ^{3.15 . This scenario is different from the picture in which the helical constraints are neglected.
Revised:  Then, in a second regime, bubbles coalesce and form entropic barriers that effectively trap residual double-stranded segments within the chain, slowing down the relaxation to fully molten configurations, which takes place at \tau_2\sim L ^3 . This scenario is different from the picture in which the helical constraints are neglected.
Edit intent: coherence
Original:  We examine the critical manifold of the slow-fast  system and find that -- after a saddle node bifurcation of limit cycles -- the full model dynamics follow temporarily a repelling branch of limit cycles.
Revised:  We perform a slow-fast system and find that -- after a saddle node bifurcation of limit cycles -- the full model dynamics follow temporarily a repelling branch of limit cycles.
Edit intent: clarity
Original:  We examine the critical manifold of the slow-fast  system and find that -- after a saddle node bifurcation of limit cycles -- the full model dynamics follow temporarily a repelling branch of limit cycles.
Revised:  We examine the critical manifold of the slow-fast analysis of the system and find that -- after a saddle node bifurcation of limit cycles -- the full model dynamics follow temporarily a repelling branch of limit cycles.
Edit intent: clarity
Original:  We apply it in two very different situations: (a) the detection of the binding sites for three specific transcription factors on a set of 134 estrogen-regulated genes;
Revised:  We apply it in two distinct situations: (a) the detection of the binding sites for three specific transcription factors on a set of 134 estrogen-regulated genes;
Edit intent: clarity
Original:  In both instances, experimental findings are correctly reproduced (when available) and the number of false positives is significantly reduced with respect to the other methods commonly employed.
Revised:  In both instances, experimental findings are reproduced (when available) and the number of false positives is significantly reduced with respect to the other methods commonly employed.
Edit intent: clarity
Original: In this paper , we first provide a schedulability condition for frame-based stochastic low-power real-time systems.
Revised: In this paper , we first provide a schedulability condition for frame-based stochastic real-time systems.
Edit intent: clarity
Original:  We show by experimental simulations that our approach allows for some system to save more than 20\% of energy.
Revised:  It is shown by simulations that the energy saving can be more than 20\% of energy.
Edit intent: clarity
Original:  We show by experimental simulations that our approach allows for some system to save more than 20\% of energy.
Revised:  We show by experimental simulations that our approach allows for some system to save more than 20\% for some system configurations
Edit intent: clarity
Original: We analyze the thermodynamic properties of a simplified pairing model for folded RNA molecules recently proposed by Vernizzi, Orland and Zee.
Revised: We analyze the thermodynamic properties of a simplified model for folded RNA molecules recently proposed by Vernizzi, Orland and Zee.
Edit intent: clarity
Original:  The spatial pseudoknot structure of the model can be efficiently studied by introducing an NxN hermitian random matrix model at each chain site, and associating Feynman diagrams of these models to spatial configurations of the molecules.
Revised:  The spatial pseudoknot structure of the model can be efficiently studied by introducing a N \times N hermitian random matrix model at each chain site, and associating Feynman diagrams of these models to spatial configurations of the molecules.
Edit intent: clarity
Original:  We obtain exact and asymptotic expressions for the free energy, specific heat, entanglement and chemical potential ans study their behavior as a function of temperature   .
Revised:  We obtain exact and asymptotic expressions for the free energy, specific heat, entanglement and chemical potential and study their behavior as a function of temperature .
Edit intent: fluency
Original:  The spatial pseudoknot structure of the model can be efficiently studied by introducing a N \times N hermitian random matrix model at each chain site, and associating Feynman diagrams of these models to spatial configurations of the molecules.
Revised:  The spatial pseudoknot structure of the model can be efficiently studied by introducing a NxN hermitian random matrix model at each chain site, and associating Feynman diagrams of these models to spatial configurations of the molecules.
Edit intent: clarity
Original: We analyze the thermodynamic properties of a simplified model for folded RNA molecules recently proposed by G. Vernizzi, H. Orland, A. Zee (in {\it Phys.
Revised: We analyze the thermodynamic properties of a simplified model for folded RNA molecules recently studied by G. Vernizzi, H. Orland, A. Zee (in {\it Phys.
Edit intent: clarity
Original:  The spatial pseudoknot structure of the model can be efficiently studied by introducing a NxN hermitian random matrix model at each chain site, and associating Feynman diagrams of these models to spatial configurations of the molecules.
Revised:  The spatial pseudoknot structure of the model can be efficiently studied by introducing a N \times N hermitian random matrix model at each chain site, and associating Feynman diagrams of these models to spatial configurations of the molecules.
Edit intent: clarity
Original:  Our results are consistent with the interpretation of 1/N as being a measure of the concentration of Mg ^{++} in solution.
Revised:  Our results are consistent with the interpretation of 1/N as being a measure of the concentration of ^{++} in solution.
Edit intent: clarity
Original:  It is shown that if the number of scenarios is unbounded, then all the problems under consideration are not approximable within 2\SUPERSCRIPT \log ^{1-\epsilon  }  for any \epsilon>0 unless NP \subseteq DTIME(n^{poly \log n}), where K is the number of scenarios.
Revised:  It is shown that if the number of scenarios is unbounded, then all the problems under consideration are not approximable within \log ^{1-\epsilon } for any \epsilon>0 unless NP \subseteq DTIME(n^{poly \log n}), where K is the number of scenarios.
Edit intent: clarity
Original:  It is shown that if the number of scenarios is unbounded, then all the problems under consideration are not approximable within \log^{1-\epsilon} K for any \epsilon>0 unless NP \subseteq DTIME(n^{poly \log n}), where K is the number of scenarios.
Revised:  It is shown that if the number of scenarios is unbounded, then the problems under consideration are not approximable within \log^{1-\epsilon} K for any \epsilon>0 unless NP \subseteq DTIME(n^{poly \log n}), where K is the number of scenarios.
Edit intent: clarity
Original:  We account for the protein translocation and the topology of the positioning of cleavage centers of a proteasome from first principles.
Revised:  We account for the protein translocation and the positioning of cleavage centers of a proteasome from first principles.
Edit intent: clarity
Original:  We account for the protein translocation and the topology of the positioning of cleavage centers of a proteasome from first principles.
Revised:  We account for the protein translocation and the topology of the positioning of cleavage sites of a proteasome from first principles.
Edit intent: clarity
Original:  Finally we design an experimental set-up for a synthetic polypeptide with a periodic sequence of amino acids which enables more reliable determination of translocation rates .
Revised:  Detailed investigation with this model will enable theoretical quantitative prediction of the proteasomal activity .
Edit intent: clarity
Original: DNA inversion is an important mechanism by which bacteria and bacteriophage switch reversibly between alternative phenotypic states.
Revised: DNA inversion is an important mechanism by which bacteria and bacteriophage switch reversibly between phenotypic states.
Edit intent: clarity
Original:  We extrapolate a mutation of a transition matrix as T%DIFDELCMD < \to %%%  Q^{-1}TQ  where T is a transition matrix  and Q is a matrix representation of a permutation P (where the objects permuted are states of DBN).
Revised:  We extrapolate a mutation of a transition matrix as T%DIFDELCMD < \to %%% Q^{-1}TQ , where T is a transition matrix and Q is a matrix representation of a permutation P (where the objects permuted are states of DBN).
Edit intent: fluency
Original:  We extrapolate a mutation of a transition matrix as T%DIFDELCMD < \to %%%  Q^{-1}TQ  where T is a transition matrix  and Q is a matrix representation of a permutation P (where the objects permuted are states of DBN).
Revised:  We extrapolate a mutation of a transition matrix as T%DIFDELCMD < \to %%% Q^{-1}TQ where T is a transition matrix and Q is the matrix representation of a permutation P (where the objects permuted are states of DBN).
Edit intent: fluency
Original:  And then we evaluate the results of a number of simulations with respect to ways to construct a P, and show that, in one of the simulations, linearity plays a significant role to cover all (or most of ) possible transition matrices v  . We also refer to Probabilistic Boolean Network and Hidden Markov Model .
Revised:  And then we evaluate the results of a number of simulations with respect to ways to construct a P, and show that, in one of the simulations, linearity appears to play a significant role to cover all (or most of ) possible transition matrices v . We also refer to Probabilistic Boolean Network and Hidden Markov Model .
Edit intent: clarity
Original:  And then we evaluate the results of a number of simulations with respect to ways to construct a P, and show that, in one of the simulations, linearity plays a significant role to cover all (or most of ) possible transition matrices v  . We also refer to Probabilistic Boolean Network and Hidden Markov Model .
Revised:  And then we evaluate the results of a number of simulations with respect to ways to construct a P, and show that, in one of the simulations, linearity plays a significant role to cover all (or most of ) possible transition matrices v . We also discuss the notions of a Probabilistic Boolean Network and Hidden Markov Model .
Edit intent: clarity
Original:  At any time step, the transition matrix of our DBN  is of the form Q^{-1}TQ, where T is a transition matrix defined in the course of the construction of our DBN and Q is the matrix representation of some  permutation P of the states of that DBN.
Revised:  At any time step, the transition matrix of our DBN is of the form Q^{-1}TQ, where T is a transition matrix defined in the course of the construction of our DBN and Q is the matrix representation of some randomly chosen permutation P of the states of that DBN.
Edit intent: clarity
Original:  At any time step, the transition matrix of our DBN  is of the form Q^{-1}TQ, where T is a transition matrix defined in the course of the construction of our DBN and Q is the matrix representation of some  permutation P of the states of that DBN.
Revised:  At any time step, the transition matrix of our DBN is of the form Q^{-1}TQ, where T is a transition matrix defined in the course of the construction of our DBN and Q is the matrix representation of some permutation P of the states of our DBN.
Edit intent: clarity
Original:  For each of several classes of such permutations, we carried out a number of simulations of a DBN  . In one of the simulations, linearity appears to play a significant role in that , for all but two of the single-node rule vectors associated with the transition matrix at some time step in that simulation,%DIFDELCMD < v %%% is either a single-node rule vector of a Linear Virtual Boolean Network (LVBN) or the negation of such a rule vector .
Revised:  For each of several classes of such permutations, we carried out a number of simulations of a DBN . In one of the simulations, linearity appears to play a significant role in that , for all but two of the single-node associated with the transition matrix at some time step in that simulation,%DIFDELCMD < v %%% is either a single-node rule vector of a Linear Virtual Boolean Network (LVBN) or the negation of such a rule vector .
Edit intent: fluency
Original:  For each of several classes of such permutations, we carried out a number of simulations of a DBN  . In one of the simulations, linearity appears to play a significant role in that , for all but two of the single-node rule vectors associated with the transition matrix at some time step in that simulation,%DIFDELCMD < v %%% is either a single-node rule vector of a Linear Virtual Boolean Network (LVBN) or the negation of such a rule vector .
Revised:  For each of several classes of such permutations, we carried out a number of simulations of a DBN . In one of the simulations, linearity appears to play a significant role in that , for all but two of the single-node rule vectors %DIFDELCMD < v %%% is either a single-node rule vector of a Linear Virtual Boolean Network (LVBN) or the negation of such a rule vector .
Edit intent: clarity
Original:  For each of several classes of such permutations, we carried out a number of simulations of a DBN  . In one of the simulations, linearity appears to play a significant role in that , for all but two of the single-node rule vectors associated with the transition matrix at some time step in that simulation,%DIFDELCMD < v %%% is either a single-node rule vector of a Linear Virtual Boolean Network (LVBN) or the negation of such a rule vector .
Revised:  For each of several classes of such permutations, we carried out a number of simulations of a DBN . In one of the simulations, linearity appears to play a significant role in that , for all but two of the single-node rule vectors associated with the transition matrix at some time step in that simulation,%DIFDELCMD < v %%% transition rules are transition rules of a Linear Virtual Boolean Network (LVBN) or the negation of such a rule vector .
Edit intent: clarity
Original:  We also discuss the notions of a Probabilistic Boolean Network and a Hidden Markov Model--in both cases, in the context of using an arbitrary (though not necessarily one-to-one) function to label the states of a Virtual Boolean Network (VBN) .
Revised:  We also discuss the notions of a Probabilistic Boolean Network and a Hidden Markov Model--in both cases, in the context of using an arbitrary (though not necessarily one-to-one) function to label the states of a VBN .
Edit intent: clarity
Original: We study the following paradox associated with networks growing according to super-linear preferential attachment: super-linear preference cannot produce scale-free networks in the thermodynamic limit, but there are super-linearly growing network models that match perfectly the structure of some real scale-free networks, such as the Internet.
Revised: We study the following paradox associated with networks growing according to super-linear preferential attachment: super-linear preference cannot produce scale-free networks in the thermodynamic limit, but there are super-linearly growing network models that perfectly match the structure of some real scale-free networks, such as the Internet.
Edit intent: fluency
Original:  We calculate the degree distribution in super-linearly growing networks with arbitrary average degree, and confirm that these networks are indeed degenerate in the true thermodynamic limit -- almost all nodes have low degrees.
Revised:  We calculate the degree distribution in super-linearly growing networks with arbitrary average degree, and confirm that in the true thermodynamic limit -- almost all nodes have low degrees.
Edit intent: clarity
Original:  We then show that super-linear growth have vast pre-asymptotic regimes whose depths depend both on the average degree in the network and on how super-linear the preference kernel is.
Revised:  We then show that super-linear growth has vast pre-asymptotic regimes whose depths depend both on the average degree in the network and on how super-linear the preference kernel is.
Edit intent: fluency
Original: We study the following paradox associated with networks growing according to super-linear preferential attachment: super-linear preference cannot produce scale-free networks in the thermodynamic limit, but there are super-linearly growing network models that perfectly match the structure of some real scale-free networks, such as the Internet.
Revised: We study the following paradox associated with networks growing according to superlinear preferential attachment: super-linear preference cannot produce scale-free networks in the thermodynamic limit, but there are super-linearly growing network models that perfectly match the structure of some real scale-free networks, such as the Internet.
Edit intent: fluency
Original: We study the following paradox associated with networks growing according to super-linear preferential attachment: super-linear preference cannot produce scale-free networks in the thermodynamic limit, but there are super-linearly growing network models that perfectly match the structure of some real scale-free networks, such as the Internet.
Revised: We study the following paradox associated with networks growing according to super-linear preferential attachment: superlinear preference cannot produce scale-free networks in the thermodynamic limit, but there are super-linearly growing network models that perfectly match the structure of some real scale-free networks, such as the Internet.
Edit intent: fluency