wanyu/IteraTeR_v2 huggingface dataset:
Original:  Thapper and Zivny FOCS'12%DIFDELCMD < ] %%% described when a certain linear programming relaxation solves instances of the problem, Kolmogorov ICALP'13%DIFDELCMD < ] %%% simplified this description for finite-valued languages , Huber, Krokhin and Powell SODA'13%DIFDELCMD < ] %%% classified all finite-valued languages on three-element domains , and Thapper and Zivny [STOC'13] found a complete classification of the complexity for finite-valued languages on arbitrary finite domains.
Revised:  Thapper and Zivny FOCS'12%DIFDELCMD < ] %%% described when a certain linear programming relaxation solves instances of the problem, Kolmogorov ICALP'13%DIFDELCMD < ] %%% simplified this description for finite-valued languages , Huber, Krokhin and Powell %DIFDELCMD < ] %%% classified all finite-valued languages on three-element domains , and Thapper and Zivny [STOC'13] found a complete classification of the complexity for finite-valued languages on arbitrary finite domains.
Edit intent: clarity
Original:  Thapper and Zivny FOCS'12%DIFDELCMD < ] %%% described when a certain linear programming relaxation solves instances of the problem, Kolmogorov ICALP'13%DIFDELCMD < ] %%% simplified this description for finite-valued languages , Huber, Krokhin and Powell SODA'13%DIFDELCMD < ] %%% classified all finite-valued languages on three-element domains , and Thapper and Zivny [STOC'13] found a complete classification of the complexity for finite-valued languages on arbitrary finite domains.
Revised:  Thapper and Zivny FOCS'12%DIFDELCMD < ] %%% described when a certain linear programming relaxation solves instances of the problem, Kolmogorov ICALP'13%DIFDELCMD < ] %%% simplified this description for finite-valued languages , Huber, Krokhin and Powell SODA'13%DIFDELCMD < ] %%% on arbitrary finite domains has been obtained Thapper and Zivny [STOC'13] found a complete classification of the complexity for finite-valued languages on arbitrary finite domains.
Edit intent: coherence
Original:  A novel form of asexual speciation emerges which is fundamentally driven by this predator-prey-like interaction, rather than by spatial separation or minima in an underlying fitness landscape .
Revised:  A novel form of asexual speciation , which is fundamentally driven by this predator-prey-like interaction, rather than by spatial separation or minima in an underlying fitness landscape .
Edit intent: clarity
Original:  A novel form of asexual speciation emerges which is fundamentally driven by this predator-prey-like interaction, rather than by spatial separation or minima in an underlying fitness landscape .
Revised:  A novel form of asexual speciation emerges which is fundamentally driven by the coevolutionary interaction .
Edit intent: clarity
Original: We introduce and analyze a within-host dynamical model of the complex coevolution between a rapidly mutating pathogen and the adaptive immune response.
Revised: We introduce and analyze a within-host dynamical model of the coevolution between rapidly mutating pathogens and the adaptive immune response.
Edit intent: clarity
Original:  Our results highlight the rich dynamics and trade-offs underlying the distinct phases of chronic diseases: progression from acute to chronic infection, the increased fragility of the immune system, and its eventual catastrophic loss of  control.
Revised:  Our results highlight the rich dynamics and trade-offs underlying the distinct phases of chronic diseases: progression from acute to chronic infection, the increased fragility of the immune system, and leads to the eventual catastrophic loss of control.
Edit intent: coherence
Original:  Our results highlight the rich dynamics and trade-offs underlying the distinct phases of chronic diseases: progression from acute to chronic infection, the increased fragility of the immune system, and its eventual catastrophic loss of  control.
Revised:  Our results highlight the rich dynamics and trade-offs underlying the distinct phases of chronic diseases: progression from acute to chronic infection, the increased fragility of the immune system, and its eventual catastrophic loss of immune control.
Edit intent: fluency
Original:  We find that in equilibrium systems the precision of sensing is fundamentally limited by the number of receptors;
Revised:  We find that in equilibrium systems the precision is limited by the number of receptors;
Edit intent: clarity
Original:  the signaling network that transmits the information from the receptors to the interior of the cell can never increase the precisionof sensing.
Revised:  the downstream network can never increase the precisionof sensing.
Edit intent: clarity
Original:  We show that this limit arises from a fundamental trade-off between the removal of the extrinsic noise in the receptor state and the suppression of the intrinsic noise in the signaling network.
Revised:  We show that this limit arises from a trade-off between the removal of the extrinsic noise in the receptor state and the suppression of the intrinsic noise in the signaling network.
Edit intent: clarity
Original:  We show that this limit arises from a fundamental trade-off between the removal of the extrinsic noise in the receptor state and the suppression of the intrinsic noise in the signaling network.
Revised:  We show that this limit arises from a fundamental trade-off between the removal of extrinsic noise in the receptor state and the suppression of the intrinsic noise in the signaling network.
Edit intent: fluency
Original:  We show that this limit arises from a fundamental trade-off between the removal of the extrinsic noise in the receptor state and the suppression of the intrinsic noise in the signaling network.
Revised:  We show that this limit arises from a fundamental trade-off between the removal of the extrinsic noise in the receptor and intrinsic noise in the signaling network.
Edit intent: clarity
Original:  We next prove that only non-equilibrium systems can lift this trade-off : They can integrate the receptor state over time while suppressing the intrinsic noise by using energy to store the receptor state into stable modification states of the readout molecules.
Revised:  We next prove that only non-equilibrium systems can lift this trade-off : They can integrate the receptor state over time in chemical modification states of the readout molecules.
Edit intent: clarity
Original:  We show that exactly counting the number of connected induced k-vertex subgraphs in an n-vertex graph is #W[1]-hard, but we show on the other hand  that there exists an FPTRAS for p-#Induced Subgraph With Property(\Phi) whenever \Phi is monotone and all the minimal graphs satisfying \Phi have bounded treewidth.
Revised:  We show that exactly counting the number of connected induced k-vertex subgraphs in an n-vertex graph is #W[1]-hard, but on the other hand that there exists an FPTRAS for p-#Induced Subgraph With Property(\Phi) whenever \Phi is monotone and all the minimal graphs satisfying \Phi have bounded treewidth.
Edit intent: fluency
Original:  We prove a tight bound of \Theta (dn) for the determinantal complexity of \mathsf{IMM . To the best of our knowledge, a \Theta(n) bound for the determinantal complexity of IMM_{n,d was known only for constant d>1 which was proved by Jansen.
Revised:  We prove a tight bound of \Theta (dn) for the determinantal complexity of \mathsf{IMM . To the best of our knowledge, a \Theta(n) bound for the determinantal complexity of IMM_{n,d was known only for constant d>1 by Jansen.
Edit intent: coherence
Original:  Here we apply  game-theoretic bet-hedging strategy described by Kelly to derive the optimal fraction of phage population that should enter the relative safety of the lysogenic state.
Revised:  Here we apply the game-theoretic bet-hedging strategy described by Kelly to derive the optimal fraction of phage population that should enter the relative safety of the lysogenic state.
Edit intent: fluency
Original:  Here we apply  game-theoretic bet-hedging strategy described by Kelly to derive the optimal fraction of phage population that should enter the relative safety of the lysogenic state.
Revised:  Here we apply game-theoretic bet-hedging strategy introduced by Kelly to derive the optimal fraction of phage population that should enter the relative safety of the lysogenic state.
Edit intent: clarity
Original:  Here we apply  game-theoretic bet-hedging strategy described by Kelly to derive the optimal fraction of phage population that should enter the relative safety of the lysogenic state.
Revised:  Here we apply game-theoretic bet-hedging strategy described by Kelly to derive the optimal lysogenic fraction of the lysogenic state.
Edit intent: clarity
Original:  We find that this strategy prescribes lysogenization frequency equal to the probability that lysis fails to give subsequent proliferation.
Revised:  We show that it is realized when the lysogenization frequency is approximately equal to the probability that lysis fails to give subsequent proliferation.
Edit intent: clarity
Original:  Virulent strategy works best for phages with stable capsids, large diversity of hosts, and access to multiple independent environments reachable by diffusion.
Revised:  Virulent strategy works best for phages with large diversity of hosts, and access to multiple independent environments reachable by diffusion.
Edit intent: clarity
Original:  Conversely, temperate or dormant strategies are favored when the environment is subject to frequent and severe temporal fluctuations.
Revised:  Conversely, progressively more temperate or even dormant strategies are favored when the environment is subject to frequent and severe temporal fluctuations.
Edit intent: clarity
Original:  Conversely, temperate or dormant strategies are favored when the environment is subject to frequent and severe temporal fluctuations.
Revised:  Conversely, temperate or dormant strategies are favored in the environments, that are subject to frequent and severe temporal fluctuations.
Edit intent: clarity
Original: A Management Information System (MIS) is an information system that is intended to be used by the higher management of an organization  .
Revised: A Management Information System (MIS) is a systematic organization and presentation of information that is generally required by the management of an organization .
Edit intent: clarity
Original:  The MIS generally collects summarized data from different departments or subsystems of an organization and presents in a form that is helpful to the management for taking better decisions for the organization .
Revised:  The MIS data may be derived from various units of the organization or from other sources. However it is very difficult to say the exact structure of MIS as the structure and goals of different types of organizations are different. Hence both the data and structure of MIS is dependent on the type of organization and often customized to the specific requirement of the management .
Edit intent: coherence
Original:  We consider the Edge Editing to a Connected Graph of Given Degrees problem that asks for a graph G, non-negative integers d,k and a function \delta:V(G)->{1,...,d}, whether it is possible to obtain a  graph G' from G such that the degree of v is \delta(v) for any vertex v by at most k edge editing operations.
Revised:  We consider the Edge Editing to a Connected Graph of Given Degrees problem that asks for a graph G, non-negative integers d,k and a function \delta:V(G)->{1,...,d}, whether it is possible to obtain a connected graph G' from G such that the degree of v is \delta(v) for any vertex v by at most k edge editing operations.
Edit intent: fluency
Original: Regular vegetation patterns in semiarid ecosystems are believed to arise from the interplay between long-range competition between plants and facilitation processes acting at smaller distances.
Revised: Regular vegetation patterns in semiarid ecosystems are believed to arise from the interplay between long-range competition and facilitation processes acting at smaller distances.
Edit intent: clarity
Original:  Let G=(V,E) be graph and let f:V\rightarrow \{ %DIFDELCMD < \red%%% ,%DIFDELCMD < \blue%%% {\rm  {\rm  \} be a 2-coloring.
Revised:  Let G=(V,E) be graph and let f:V\rightarrow \{ %DIFDELCMD < \red%%% %DIFDELCMD < \blue%%% {\rm {\rm \} be a 2-coloring.
Edit intent: coherence
Original:  Let G=(V,E) be graph and let f:V\rightarrow \{ %DIFDELCMD < \red%%% ,%DIFDELCMD < \blue%%% {\rm  {\rm  \} be a 2-coloring.
Revised:  Let G=(V,E) be graph and let f:V\rightarrow \{ %DIFDELCMD < \red%%% ,%DIFDELCMD < \blue%%% {\rm ,{\rm \} be a 2-coloring.
Edit intent: fluency
Original:  We prove that this problem admits a kernel with at most 7k vertices and an algorithm of running time O^*(16^k) .
Revised:  We prove that this problem admits a kernel with at most 7k .
Edit intent: clarity
Original:  The observed processes i.e unfolding or reduction events, are typically considered  stochastic and by its nature are susceptible to be censored by the finite duration of the experiment.
Revised:  The observed processes i.e unfolding or reduction events, are typically considered to be stochastic and by its nature are susceptible to be censored by the finite duration of the experiment.
Edit intent: fluency
Original:  Here we provide a formal analytical and experimental description on the number of observed events under various conditions of practical interest.
Revised:  Here we develop a formal analytical and experimental description on the number of observed events under various conditions of practical interest.
Edit intent: clarity
Original:  This analysis for the first time informs on the nature of the process under which a protein is attached between the substrate and pulling probe .
Revised:  This analysis for the first time informs on the nature of the substrate and pulling probe .
Edit intent: clarity
Original:  The programs developed in this research are written using C/C++  and freely accessible at ftp ://ftp.genomics.org.cn/pub/gce  .
Revised:  The programs developed in this research are written using C/C++ , and freely accessible at ftp ://ftp.genomics.org.cn/pub/gce .
Edit intent: fluency
Original:  The programs developed in this research are written using C/C++  and freely accessible at ftp ://ftp.genomics.org.cn/pub/gce  .
Revised:  The programs developed in this research are written using C/C++ and freely accessible at ftp ://ftp.genomics.org.cn/pub/gce ) .
Edit intent: fluency
Original: Genome-wide association studies directly assay approximately 10^6 single nucleotide polymorphisms (SNPs) in a study population.
Revised: Genome wide association studies directly assay approximately 10^6 single nucleotide polymorphisms (SNPs) in a study population.
Edit intent: fluency
Original: Genome-wide association studies directly assay approximately 10^6 single nucleotide polymorphisms (SNPs) in a study population.
Revised: Genome-wide association studies directly assay 10^6 single nucleotide polymorphisms (SNPs) in a study population.
Edit intent: clarity
Original:  This method uses a customization of the DEFLATE (gzip) algorithm, and maintains constant-time access to any SNP (but linear O(number individuals) access to a given genotype) .
Revised:  This method uses a customization of the DEFLATE (gzip) algorithm, and maintains constant-time access to any SNP .
Edit intent: clarity
Original: The temporal aspect of a pupal-water-loss model is improved on .
Revised: The temporal aspect of a model of pupal dehydration is improved upon .
Edit intent: clarity
Original:  A one-to-one mapping between the constant-temperature time-domain of the data and that of some more general case at hand is obtained by adapting the puparial-duration formula of Phelps and Burrows (1969) and Hargrove (2004).
Revised:  A one-to-one mapping between the constant-temperature time domain of the data and that of some more general case at hand is obtained by adapting the puparial-duration formula of Phelps and Burrows (1969) and Hargrove (2004).
Edit intent: fluency
Original:  A one-to-one mapping between the constant-temperature time-domain of the data and that of some more general case at hand is obtained by adapting the puparial-duration formula of Phelps and Burrows (1969) and Hargrove (2004).
Revised:  A one-to-one mapping between the constant-temperature time-domain of the data and that of some more general case at hand is obtained by exploiting the puparial-duration formula of Phelps and Burrows (1969) and Hargrove (2004).
Edit intent: clarity
Original:  In this way pertinent temperature and humidity input-data can be retrieved and a jacobian formulated .
Revised:  In this way integration on the constant-temperature time domain is facilitated .
Edit intent: clarity
Original:  The observed dependence of  transpiration on time is attributed to an alternation between two essential rates , for which the deposition of a thin, pupal skin inside the puparium and its subsequent demise are thought to be responsible.
Revised:  The observed dependence of pupal transpiration on time is attributed to an alternation between two essential rates , for which the deposition of a thin, pupal skin inside the puparium and its subsequent demise are thought to be responsible.
Edit intent: fluency
Original:  The observed dependence of  transpiration on time is attributed to an alternation between two essential rates , for which the deposition of a thin, pupal skin inside the puparium and its subsequent demise are thought to be responsible.
Revised:  The observed dependence of transpiration on time is attributed to an alternation between two , essential modes , for which the deposition of a thin, pupal skin inside the puparium and its subsequent demise are thought to be responsible.
Edit intent: clarity
Original:  The results of the Bursell (1958) investigation into pupal dehydration are otherwise used as a rudimentary data set.
Revised:  The results of the Bursell (1958) investigation into pupal dehydration are used as a rudimentary data set.
Edit intent: coherence
Original:  With the conclusion of this work comes the revelation that the classification of species as hygrophilic, mesophylic and xerophylic is largely true only in so much as their third and fourth instars are and, possibly, the hours shortly before eclosion.
Revised:  With the conclusion of this work comes the revelation that the classification of species as hygrophilic, mesophilic and xerophilic is largely true only in so much as their third and fourth instars are and, possibly, the hours shortly before eclosion.
Edit intent: fluency
Original: The likelihood computation of a huge number of particles  leads to enormous computational demands in a class of applications of the particle filter, such as visual target tracking and robot localization .
Revised: The likelihood calculation of a vast number of particles leads to enormous computational demands in a class of applications of the particle filter, such as visual target tracking and robot localization .
Edit intent: fluency
Original:  To alleviate this computational bottleneck, we propose a numerical fitting approach for fast computation of the likelihood of particles .
Revised:  To alleviate this computational bottleneck, a numerical fitting approach for fast computation of the likelihood of particles .
Edit intent: clarity
Original:  To alleviate this computational bottleneck, we propose a numerical fitting approach for fast computation of the likelihood of particles .
Revised:  To alleviate this computational bottleneck, we propose a numerical fitting approach for fast computing the likelihood of particles .
Edit intent: clarity
Original:  In which, the Likelihood Probability Density Function (Li-PDF) of the particles is constructed in real-time by using a  small number of so-called fulcrums  .
Revised:  In which, the Likelihood Probability Density Function (Li-PDF) by using a small number of so-called fulcrums .
Edit intent: clarity
Original:  More importantly, the Li-PDF based likelihood computation is of sufficient quality to guarantee accuracy provided an appropriate fitting function and sufficient and properly spaced fulcrums are used.
Revised:  The proposed approach guarantees the estimation quality when an appropriate fitting function and sufficient and properly spaced fulcrums are used.
Edit intent: clarity
Original:  More importantly, the Li-PDF based likelihood computation is of sufficient quality to guarantee accuracy provided an appropriate fitting function and sufficient and properly spaced fulcrums are used.
Revised:  More importantly, the Li-PDF based likelihood computation is of sufficient quality to guarantee accuracy provided an appropriate fitting function and properly distributed fulcrums are used.
Edit intent: clarity
Original: The likelihood calculation of a vast number of particles is a critical operation for the particle filter but it often leads to enormous computational demands, especially in a variety of applications where the observation information is rich.
Revised: The likelihood calculation of a vast number of particles is the computational bottleneck for the particle filter but it often leads to enormous computational demands, especially in a variety of applications where the observation information is rich.
Edit intent: clarity
Original: The likelihood calculation of a vast number of particles is a critical operation for the particle filter but it often leads to enormous computational demands, especially in a variety of applications where the observation information is rich.
Revised: The likelihood calculation of a vast number of particles is a critical operation for the particle filter in applications where the observation information is rich.
Edit intent: clarity
Original:  To alleviate this computational bottleneck, a numerical fitting approach for fast computing the likelihood of particles is proposed.
Revised:  For fast computing the likelihood of particles is proposed.
Edit intent: clarity
Original:  The key is numerically fitting the Likelihood Probability Density Function (Li-PDF) by using a comparably small number of so-called fulcrums (support points for fitting) and the observation .
Revised:  The key is numerically fitting the Likelihood Probability Density Function (Li-PDF) by using a comparably small number of so-called fulcrums .
Edit intent: coherence
Original:  The likelihood of particles is  analytically inferred, explicitly or implicitly, based on the Li-PDF instead of directly computed based on the observation, which reduces the computation required and enables real time filtering.
Revised:  The likelihood of particles is thereby analytically inferred, explicitly or implicitly, based on the Li-PDF instead of directly computed based on the observation, which reduces the computation required and enables real time filtering.
Edit intent: coherence
Original:  The likelihood of particles is  analytically inferred, explicitly or implicitly, based on the Li-PDF instead of directly computed based on the observation, which reduces the computation required and enables real time filtering.
Revised:  The likelihood of particles is analytically inferred, explicitly or implicitly, based on the Li-PDF instead of directly computed by utilizing the observation, which reduces the computation required and enables real time filtering.
Edit intent: clarity
Original:  The likelihood of particles is  analytically inferred, explicitly or implicitly, based on the Li-PDF instead of directly computed based on the observation, which reduces the computation required and enables real time filtering.
Revised:  The likelihood of particles is analytically inferred, explicitly or implicitly, based on the Li-PDF instead of directly computed based on the observation, which can significantly reduce the computation and enables real time filtering.
Edit intent: clarity
Original:  The solutions for construction of the fitting function and fulcrums are addressed respectively in detail.
Revised:  The details for construction of the fitting function and fulcrums are addressed respectively in detail.
Edit intent: clarity