wanyu/IteraTeR_v2 huggingface dataset:
Original:  For the within-host competition between multiple viral strains, a strain with an " optimum " replication rate in the persistence range could outcompete another strain with a higher or lower replication rate, therefore natural selection of viruses stabilizes the viral persistence.
Revised:  For the within-host competition between multiple viral strains, a strain with an " optimum " replication rate could outcompete another strain with a higher or lower replication rate, therefore natural selection of viruses stabilizes the viral persistence.
Edit intent: clarity
Original:  However, when strains with higher and lower replication rates than the " optimum " value  are both present, competition between strains does not result in dominance of one strain, but in their coexistence at a certain well-defined ratio .
Revised:  However, when strains with higher and lower than the " optimum " value are both present, competition between strains does not result in dominance of one strain, but in their coexistence at a certain well-defined ratio .
Edit intent: clarity
Original:  However, when strains with higher and lower replication rates than the " optimum " value  are both present, competition between strains does not result in dominance of one strain, but in their coexistence at a certain well-defined ratio .
Revised:  However, when strains with higher and lower replication rates than the " optimum " value are both present, competition between strains does not result in dominance of one strain, but in their coexistence .
Edit intent: clarity
Original:  Remarkably the two problems that we identify are closely related to a hard data-mining problem at the cutting edge of genetics having to do with the identification of epistatically interacting quantitative trait loci .
Revised:  Remarkably the two problems that we identify are closely related to a hard data-mining problem at the cutting edge of computational genetics .
Edit intent: clarity
Original:  Each femtocell maximizes their individual utility consisting of a SINR based reward less an incurred cost (interference to the macrocell).
Revised:  Each femtocell maximizes its individual utility consisting of a SINR based reward less an incurred cost (interference to the macrocell).
Edit intent: fluency
Original: Two tier cellular networks, comprising of a central macrocell underlaid with short range femtocell hotspots offer an economical way to improve cellular capacity.
Revised: In a two tier cellular network -- comprised of a central macrocell underlaid with short range femtocell hotspots offer an economical way to improve cellular capacity.
Edit intent: fluency
Original: Two tier cellular networks, comprising of a central macrocell underlaid with short range femtocell hotspots offer an economical way to improve cellular capacity.
Revised: Two tier cellular networks, comprising of a central macrocell underlaid with shorter range femtocell hotspots offer an economical way to improve cellular capacity.
Edit intent: fluency
Original:  To quantify near-far effects with universal frequency reuse, this paper derives a fundamental relation providing the largest feasible macrocell Signal-to-Interference-Plus- Noise Ratio (SINR), given any set of feasible femtocell SINRs.
Revised:  To quantify near-far effects with universal frequency reuse, this paper derives a fundamental relation providing the largest feasible cellular Signal-to-Interference-Plus-Noise Ratio (SINR), given any set of feasible femtocell SINRs.
Edit intent: clarity
Original:   A distributed utility-based SINR adaptation at femtocells is proposed in order to alleviate cross-tier interference at the macrocell from overlaid femtocell infrastructure .
Revised:  A distributed utility-based SINR adaptation at femtocells is proposed in order to alleviate cross-tier interference at the macrocell from cochannel femtocells .
Edit intent: clarity
Original:  Each femtocell maximizes its individual utility consisting of a SINR based reward less an incurred cost (interference to the macrocell).
Revised:  Each femtocell maximizes their individual utility consisting of a SINR based reward less an incurred cost (interference to the macrocell).
Edit intent: fluency
Original:  In the event that cross-tier interference prevents a macro-user from obtaining its SINR target, an algorithm is proposed that adaptively curtails transmission powers of the strongest femtocell interferers.
Revised:  In the event that cross-tier interference prevents a macro-user from obtaining its SINR target, an algorithm is proposed that reduces transmission powers of the strongest femtocell interferers.
Edit intent: clarity
Original:  For the first one, Ford's alpha model,  power-law scaling in the depth was established analytically .
Revised:  For the first one, Ford's alpha model, although a power-law scaling in the depth was established analytically .
Edit intent: coherence
Original:  A second model, the activity model, is introduced here.
Revised:  We introduce here a new model, the activity model, is introduced here.
Edit intent: clarity
Original:  We show analytically and numerically that its depth also displays power-law scaling  at a critical parameter value.
Revised:  We show analytically and numerically that it also displays a power-law scaling at a critical parameter value.
Edit intent: clarity
Original: Although the spike-trains in neural networks are mainly constrained by the neural dynamic itself, global temporal constraints (refractoriness, time precision, propagation delays, ..) are also to be taken into account.
Revised: Although the spike-trains in neural networks are mainly constrained by the neural dynamics itself, global temporal constraints (refractoriness, time precision, propagation delays, ..) are also to be taken into account.
Edit intent: fluency
Original:  These constraints are revisited in this paper and their consequences are developed at the simulation level .
Revised:  These constraints are revisited in this paper in order to use them in event-based simulation paradigms .
Edit intent: clarity
Original:  We first introduce these constraints, review their obvious consequence in terms of the amount of information in a spike train and discusse in details the impact at the level of the network dynamics, thanks to recent theoretical results.
Revised:  We first review these constraints, review their obvious consequence in terms of the amount of information in a spike train and discusse in details the impact at the level of the network dynamics, thanks to recent theoretical results.
Edit intent: coherence
Original:  Then, the consequences of these time constraints at the simulation level are developed, showing event-based simulation of time-constrained networks can be impacted and somehow improved in this context: the underlying data-structures are strongly simplified, while event-based and clock-based mechanisms can be easily mixed.
Revised:  Then, the consequences of these time constraints at the simulation level , showing how event-based simulation of time-constrained networks can be impacted and somehow improved in this context: the underlying data-structures are strongly simplified, while event-based and clock-based mechanisms can be easily mixed.
Edit intent: clarity
Original:  Then, the consequences of these time constraints at the simulation level are developed, showing event-based simulation of time-constrained networks can be impacted and somehow improved in this context: the underlying data-structures are strongly simplified, while event-based and clock-based mechanisms can be easily mixed.
Revised:  Then, the consequences of these time constraints at the simulation level are developed, showing event-based simulation of time-constrained networks can be simplified in this context: the underlying data-structures are strongly simplified, while event-based and clock-based mechanisms can be easily mixed.
Edit intent: clarity
Original:  These ideas are applied to punctual conductance based generalized integrate and fire neural network simulation, while spike-response model simulation is also revisited within this framework.
Revised:  These ideas are applied to punctual conductance-based generalized integrate-and-fire neural networks simulation, while spike-response model simulation is also revisited within this framework.
Edit intent: fluency
Original:  These ideas are applied to punctual conductance based generalized integrate and fire neural network simulation, while spike-response model simulation is also revisited within this framework.
Revised:  These ideas are applied to punctual conductance based generalized integrate and fire neural network simulation, while spike-response model simulations are also revisited within this framework.
Edit intent: fluency
Original:  These mechanisms are compared using existing benchmarks .
Revised:  As an outcome, a fast minimal complementary alternative with respect to existing simulation event-based methods, with the possibility to simulate interesting neuron models is implemented and experimented .
Edit intent: coherence
Original:  Ces avanc\'ees dans la mod\'elisation d'automates d\'ecisionnels permettent d'envisager un avenir riche pour ces technologies, les acteurs en faisant d\'ej\`a usage pour plus de 30 \% de leurs techniques de trading. ----- Algorithmic trading comes from the dematerialization of purchase orders or sales of assets . Since 1980 , the computerization of the stock market offers real-time processing of financial information.
Revised:  Ces avanc\'ees dans la mod\'elisation d'automates d\'ecisionnels permettent d'envisager un avenir riche pour ces technologies, les acteurs en faisant d\'ej\`a usage pour plus de 30 \% de leurs techniques de trading. ----- Algorithmic trading comes from the dematerialization of purchase orders or sales of assets . Since 1980 the computerization of the stock market offers real-time processing of financial information.
Edit intent: fluency
Original:  Ces avanc\'ees dans la mod\'elisation d'automates d\'ecisionnels permettent d'envisager un avenir riche pour ces technologies, les acteurs en faisant d\'ej\`a usage pour plus de 30 \% de leurs techniques de trading. ----- Algorithmic trading comes from the dematerialization of purchase orders or sales of assets . Since 1980 , the computerization of the stock market offers real-time processing of financial information.
Revised:  Ces avanc\'ees dans la mod\'elisation d'automates d\'ecisionnels permettent d'envisager un avenir riche pour ces technologies, les acteurs en faisant d\'ej\`a usage pour plus de 30 \% de leurs techniques de trading. ----- Algorithmic trading comes from the dematerialization of purchase orders or sales of assets . Since 1980 , the computerization of the stock market offers real time processing of financial information.
Edit intent: fluency
Original:  This technological revolution has helped developed processes and mathematical assessment methods to identify the moment when transactions return profits . Current research concerns autonomous programmed transaction systems acting during certain periods with certain algorithms.
Revised:  This technological revolution has offered processes and mathematic methods to identify the moment when transactions return profits . Current research concerns autonomous programmed transaction systems acting during certain periods with certain algorithms.
Edit intent: clarity
Original:  This technological revolution has helped developed processes and mathematical assessment methods to identify the moment when transactions return profits . Current research concerns autonomous programmed transaction systems acting during certain periods with certain algorithms.
Revised:  This technological revolution has helped developed processes and mathematical assessment methods to identify best return on transactions . Current research concerns autonomous programmed transaction systems acting during certain periods with certain algorithms.
Edit intent: clarity
Original:  There are about thirty algorithms to assist the trader , the best known are the VWAP, the TWAP, and the TVOL.
Revised:  There are about thirty algorithms to assist the traders , the best known are the VWAP, the TWAP, and the TVOL.
Edit intent: fluency
Original:  There are about thirty algorithms to assist the trader , the best known are the VWAP, the TWAP, and the TVOL.
Revised:  There are about thirty algorithms to assist the trader , the best known are the VWAP, the TWAP, TVOL.
Edit intent: fluency
Original:  The most recent algorithms offer decision-making strategies and are the subject of much research.
Revised:  The algorithms offer the latest strategies and decision-making are the subject of much research.
Edit intent: clarity
Original:  These advances in modeling automated decision-making suggest a rich future for these technologies, already used for more than 30\% of technical trading.
Revised:  These advances in modeling decision-making suggest a rich future for these technologies, already used for more than 30\% of technical trading.
Edit intent: clarity
Original:  These advances in modeling automated decision-making suggest a rich future for these technologies, already used for more than 30\% of technical trading.
Revised:  These advances in modeling automated decision-making suggest a rich future for these technologies, the players already in use for more than 30\% of technical trading.
Edit intent: clarity
Original:  These advances in modeling automated decision-making suggest a rich future for these technologies, already used for more than 30\% of technical trading.
Revised:  These advances in modeling automated decision-making suggest a rich future for these technologies, already used for more than 30\% of their trading.
Edit intent: clarity
Original: We study the statistical characterizers of transport in 2-d and 1-d communication networks of nodes and randomly distributed hubs.
Revised: We identify the statistical characterizers of transport in 2-d and 1-d communication networks of nodes and randomly distributed hubs.
Edit intent: clarity
Original: We study the global stability of two models for the HIV virus dynamics, that take into account the CTL immune response and  antigenic variation.
Revised: We study the global stability of two models for the HIV virus dynamics, that take into account the CTL immune response and display antigenic variation.
Edit intent: clarity
Original:  For both models, we characterise the stable equilibrium points for the entire biologically relevant parameter range.
Revised:  We also characterise the stable equilibrium points for the entire biologically relevant parameter range.
Edit intent: clarity
Original:  In the model with antigenic variation, which can have a large number of equilibrium points, this allows us to determine what is the diversity of the persistent strains.
Revised:  As a byproduct, we are able to determine what is the diversity of the persistent strains.
Edit intent: coherence
Original:  Finally, our category is also considerably larger than the category of bigraphs, notably encompassing in the same framewwork terms and a flexible form of higher-order contexts.
Revised:  Finally, our category is also considerably larger than the category of bigraphs, notably encompassing in the same framework terms and a flexible form of higher-order contexts.
Edit intent: fluency
Original: In this paper, a model for understanding the effects of selection using systems- level and computational approaches is introduced.
Revised: In this paper, a model for understanding the effects of selection using systems- level computational approaches is introduced.
Edit intent: coherence
Original: We have used laser hole-drilling to assess mechanical changes in an embryonic epithelium during development - in vivo and with subcellular resolution.
Revised: We use laser hole-drilling to assess mechanical changes in an embryonic epithelium during development - in vivo and with subcellular resolution.
Edit intent: coherence
Original: We have used laser hole-drilling to assess mechanical changes in an embryonic epithelium during development - in vivo and with subcellular resolution.
Revised: We have used laser hole-drilling to assess the mechanics of an embryonic epithelium during development - in vivo and with subcellular resolution.
Edit intent: clarity
Original:  This method uses a single laser pulse to ablate a cylindrical hole (1 micron in diameter, 5-7 micron tall) clean through the epithelium, and tracks the subsequent recoil of adjacent cells ( with ms time resolution ).
Revised:  We ablate a 1-micron cylindrical hole clean through the epithelium, and tracks the subsequent recoil of adjacent cells ( with ms time resolution ).
Edit intent: clarity
Original:  This method uses a single laser pulse to ablate a cylindrical hole (1 micron in diameter, 5-7 micron tall) clean through the epithelium, and tracks the subsequent recoil of adjacent cells ( with ms time resolution ).
Revised:  This method uses a single laser pulse to ablate a cylindrical hole (1 micron in diameter, 5-7 micron tall) clean through the epithelium, and track the subsequent recoil of adjacent cells ( with ms time resolution ).
Edit intent: fluency
Original:  This method uses a single laser pulse to ablate a cylindrical hole (1 micron in diameter, 5-7 micron tall) clean through the epithelium, and tracks the subsequent recoil of adjacent cells ( with ms time resolution ).
Revised:  This method uses a single laser pulse to ablate a cylindrical hole (1 micron in diameter, 5-7 micron tall) clean through the epithelium, and tracks the subsequent recoil of adjacent cells ( on ms time scales ).
Edit intent: clarity
Original:  We find that substantial in-plane tension is carried across each cell surface and not just along cell-cell interfaces .
Revised:  The mechanical behavior of this epithelium falls between that of a continuous sheet and a 2D cellular foam (a network of tensile interfaces). Tensile stress is carried both by cell-cell interfaces .
Edit intent: coherence
Original:  The results of these laser hole-drilling experiments provide new avenues for evaluating extant computational models . Similar experiments should be applicable to a wide range of morphogenetic events .
Revised:  The results of these laser hole-drilling experiments provide new avenues for evaluating extant computational models .
Edit intent: clarity
Original:  This training is accompanied by physiological adaptation, and can be thought of computationally as a relative degree of isomorphy between prosthetic devices, physiology, and behavior.
Revised:  This training is accompanied by physiological adaptation, and can be thought of computationally as a relative degree of matching between prosthetic devices, physiology, and behavior.
Edit intent: clarity
Original:  In a narrow range of parameters that includes most infectious diseases which confer long lasting immunity the oscillations persist for infinite populations.
Revised:  In a narrow range of parameters that includes many infectious diseases which confer long lasting immunity the oscillations persist for infinite populations.
Edit intent: clarity
Original:  We prove extensions to the classes Merlin-Arthur (MA ) and Quantum-Classical-Merlin-Arthur (QCMA) . Our results have implications on the complexity of approximating the ground state energy of a quantum local Hamiltonian with a unique ground state and an inverse polynomial spectral gap.
Revised:  We prove extensions to the classes Merlin-Arthur MA and Quantum-Classical-Merlin-Arthur (QCMA) . Our results have implications on the complexity of approximating the ground state energy of a quantum local Hamiltonian with a unique ground state and an inverse polynomial spectral gap.
Edit intent: fluency
Original:  We prove extensions to the classes Merlin-Arthur (MA ) and Quantum-Classical-Merlin-Arthur (QCMA) . Our results have implications on the complexity of approximating the ground state energy of a quantum local Hamiltonian with a unique ground state and an inverse polynomial spectral gap.
Revised:  We prove extensions to the classes Merlin-Arthur (MA ) and Quantum-Classical-Merlin-Arthur QCMA . Our results have implications on the complexity of approximating the ground state energy of a quantum local Hamiltonian with a unique ground state and an inverse polynomial spectral gap.
Edit intent: clarity
Original:  We prove extensions to the classes Merlin-Arthur (MA ) and Quantum-Classical-Merlin-Arthur (QCMA) . Our results have implications on the complexity of approximating the ground state energy of a quantum local Hamiltonian with a unique ground state and an inverse polynomial spectral gap.
Revised:  We prove extensions to the classes Merlin-Arthur (MA ) and Quantum-Classical-Merlin-Arthur (QCMA) . Our results have implications for the complexity of approximating the ground state energy of a quantum local Hamiltonian with a unique ground state and an inverse polynomial spectral gap.
Edit intent: fluency
Original:  We show that the estimation , to within polynomial accuracy , of the ground state energy of poly-gapped 1-D local Hamiltonians is QCMA-hard  , under randomized reductions.
Revised:  We show that the estimation ( to within polynomial accuracy , of the ground state energy of poly-gapped 1-D local Hamiltonians is QCMA-hard , under randomized reductions.
Edit intent: fluency
Original:  We show that the estimation , to within polynomial accuracy , of the ground state energy of poly-gapped 1-D local Hamiltonians is QCMA-hard  , under randomized reductions.
Revised:  We show that the estimation , to within polynomial accuracy ) of the ground state energy of poly-gapped 1-D local Hamiltonians is QCMA-hard , under randomized reductions.
Edit intent: fluency
Original:  This is in strong contrast to the case of constant gapped 1-D Hamiltonians, which is in NP  . Moreover, it shows that unless QCMA can be reduced to NP by randomized reductions, there is no classical description of the ground state of every poly-gapped local Hamiltonian which allows the calculation of expectation values efficiently .
Revised:  This is in stark contrast to the case of constant gapped 1-D Hamiltonians, which is in NP . Moreover, it shows that unless QCMA can be reduced to NP by randomized reductions, there is no classical description of the ground state of every poly-gapped local Hamiltonian which allows the calculation of expectation values efficiently .
Edit intent: clarity
Original:  This is in strong contrast to the case of constant gapped 1-D Hamiltonians, which is in NP  . Moreover, it shows that unless QCMA can be reduced to NP by randomized reductions, there is no classical description of the ground state of every poly-gapped local Hamiltonian which allows the calculation of expectation values efficiently .
Revised:  This is in strong contrast to the case of constant gapped 1-D Hamiltonians, which is in NP . Moreover, it shows that unless QCMA can be reduced to NP by randomized reductions, there is no classical description of the ground state of every poly-gapped local Hamiltonian that allows efficient calculation of expectation values efficiently .
Edit intent: fluency
Original:  This is in strong contrast to the case of constant gapped 1-D Hamiltonians, which is in NP  . Moreover, it shows that unless QCMA can be reduced to NP by randomized reductions, there is no classical description of the ground state of every poly-gapped local Hamiltonian which allows the calculation of expectation values efficiently .
Revised:  This is in strong contrast to the case of constant gapped 1-D Hamiltonians, which is in NP . Moreover, it shows that unless QCMA can be reduced to NP by randomized reductions, there is no classical description of the ground state of every poly-gapped local Hamiltonian which allows the calculation of expectation values .
Edit intent: clarity
Original:  Finally, we discuss a few obstacles towards establishing an analogous result to the class Quantum-Merlin-Arthur (QMA).
Revised:  Finally, we discuss a few of the obstacles to the establishment of an analogous result to the class Quantum-Merlin-Arthur (QMA).
Edit intent: fluency