wanyu/IteraTeR_v2 huggingface dataset:
Original:  In addition,  some eigenproblem sequences show a connection between the solutions of adjacent eigenproblems.
Revised:  In addition, some eigenproblem sequences there is a connection between the solutions of adjacent eigenproblems.
Edit intent: clarity
Original:  Whenever  is possible to unravel the existence of such a connection, the eigenproblem sequence is said to be a correlated.
Revised:  Whenever it is possible to unravel the existence of such a connection, the eigenproblem sequence is said to be a correlated.
Edit intent: fluency
Original:  Whenever  is possible to unravel the existence of such a connection, the eigenproblem sequence is said to be a correlated.
Revised:  Whenever is possible to unravel the existence of such a connection, the eigenproblem sequence is said to be correlated.
Edit intent: fluency
Original:  We propose a novel approach which exploits such correlation through the use of an eigensolver based on subspace iteration and accelerated with Chebyshev polynomials (ChFSI).
Revised:  We propose a alternative approach which exploits such correlation through the use of an eigensolver based on subspace iteration and accelerated with Chebyshev polynomials (ChFSI).
Edit intent: clarity
Original:  The resulting eigensolver , is optimized by minimizing the number of matvec multiplications and parallelized using the Elemental library framework.
Revised:  The resulting eigensolver is optimized by minimizing the number of matvec multiplications and parallelized using the Elemental library framework.
Edit intent: fluency
Original:  Numerical results shows that ChFSI achieves excellent scalability and is competitive with current dense linear algebra parallel eigensolvers.
Revised:  Numerical results show that ChFSI achieves excellent scalability and is competitive with current dense linear algebra parallel eigensolvers.
Edit intent: fluency
Original:  Identification of emerging antigenic variants among circulating influenza viruses is critical to the vaccine virus selection process, with effectiveness maximized when vaccine constituents are antigenically matched to circulating viruses.
Revised:  Identification of emerging antigenic variants is critical to the vaccine virus selection process, with effectiveness maximized when vaccine constituents are antigenically matched to circulating viruses.
Edit intent: clarity
Original:  Reverse genetics was used to demonstrate the causal effect onantigenicity of a subset of substitutions including one instance where multiple contemporaneous substitutions made a definitive identification impossiblein silico .
Revised:  Reverse genetics was used to demonstrate the causal effect onantigenicity of a subset of substitutions including one instance where multiple contemporaneous substitutions made a definitive identification impossible .
Edit intent: clarity
Original:  We will      see that in many instances , therandom-revlex strategy works  better than Benedetti--Lutz's (uniform) random strategyin various practical instances \texttt{  .
Revised:  We will of the see that in many instances , therandom-revlex strategy works better than Benedetti--Lutz's (uniform) random strategyin various practical instances \texttt{ .
Edit intent: clarity
Original:  We will      see that in many instances , therandom-revlex strategy works  better than Benedetti--Lutz's (uniform) random strategyin various practical instances \texttt{  .
Revised:  We will see that in many instances random-revlex strategy works better than Benedetti--Lutz's (uniform) random strategyin various practical instances \texttt{ .
Edit intent: fluency
Original:  We will      see that in many instances , therandom-revlex strategy works  better than Benedetti--Lutz's (uniform) random strategyin various practical instances \texttt{  .
Revised:  We will see that in many instances , the strategy works better than Benedetti--Lutz's (uniform) random strategyin various practical instances \texttt{ .
Edit intent: clarity
Original:  We will      see that in many instances , therandom-revlex strategy works  better than Benedetti--Lutz's (uniform) random strategyin various practical instances \texttt{  .
Revised:  We will see that in many instances , therandom-revlex the better than Benedetti--Lutz's (uniform) random strategyin various practical instances \texttt{ .
Edit intent: clarity
Original:  We will      see that in many instances , therandom-revlex strategy works  better than Benedetti--Lutz's (uniform) random strategyin various practical instances \texttt{  .
Revised:  We will see that in many instances , therandom-revlex strategy works better than Benedetti--Lutz's (uniform) \texttt{ .
Edit intent: clarity
Original:  We will      see that in many instances , therandom-revlex strategy works  better than Benedetti--Lutz's (uniform) random strategyin various practical instances \texttt{  .
Revised:  We will see that in many instances , therandom-revlex strategy works better than Benedetti--Lutz's (uniform) random strategyin various practical instances \texttt{random .
Edit intent: fluency
Original:  We will      see that in many instances , therandom-revlex strategy works  better than Benedetti--Lutz's (uniform) random strategyin various practical instances \texttt{  .
Revised:  We will see that in many instances , therandom-revlex strategy works better than Benedetti--Lutz's (uniform) random strategyin various practical instances \texttt{ strategy .
Edit intent: clarity
Original:  A prototype implementation shows that the method is promising, complementing techniques that are used by contemporary interactive provers.
Revised:  A prototype implementation shows that the method works well on a variety of examples, and complements techniques that are used by contemporary interactive provers.
Edit intent: clarity
Original:  The \varepsilon-scaling allows to derive exact log-asymptotics for path functionals of the process ;
Revised:  The \varepsilon-scaling allows to derive exact log-asymptotics for path functionals of the process :
Edit intent: fluency
Original:  It is known that either there is an infinite tower between two languages or all the towers are finite .
Revised:  It is known that either there is an infinite tower .
Edit intent: coherence
Original:  We investigate upper and lower bounds on the length of finite towers between two regular languages with respect to the size of nondeterministic finite automata representing the languages in the case there is no infinite tower.
Revised:  We investigate upper and lower bounds on the length of finite towers between two regular languages with respect to the size of the automata representing the languages in the case there is no infinite tower.
Edit intent: clarity
Original:  Assuming that each queue of type ~ r is replicated ~ k times,
Revised:  Assuming that each queue of type r is replicated ~ k times,
Edit intent: fluency
Original:  Assuming that each queue of type ~ r is replicated ~ k times,
Revised:  Assuming that each queue of type ~ r is replicated k times,
Edit intent: fluency
Original:  we consider a set of policies that are periodic with period k \sum_r p_r and such that exactly p_r jobs are sent in a period to each queue of type ~ r. When k\to\infty, our main result shows that all the policies in this set are equivalent, in the sense that they yield the same mean stationary waiting time, and optimal, in the sense that no other policy having the same aggregate arrival rate to all queues of a given type can do better in minimizing the stationary mean waiting time.
Revised:  we consider a set of policies that are periodic with period k \sum_r p_r and such that exactly p_r jobs are sent in a period to each queue of type r. When k\to\infty, our main result shows that all the policies in this set are equivalent, in the sense that they yield the same mean stationary waiting time, and optimal, in the sense that no other policy having the same aggregate arrival rate to all queues of a given type can do better in minimizing the stationary mean waiting time.
Edit intent: clarity
Original: Content Centric Networking enhances large scale content delivery through en-route caching at nodes along the path from the content's origin to the requesting nodes , so that future requests can be served without going back to the origin of the content.
Revised: Content caching at intermediate nodes is a very effective way for optimizing the operations of Content Centric Networking , so that future requests can be served without going back to the origin of the content.
Edit intent: clarity
Original: Content caching at intermediate nodes is a very effective way for optimizing the operations of Content Centric Networking , so that future requests can be served without going back to the origin of the content.
Revised: Content caching at intermediate nodes is a very effective way to optimize the operations of Content Centric Networking , so that future requests can be served without going back to the origin of the content.
Edit intent: fluency
Original: Content caching at intermediate nodes is a very effective way for optimizing the operations of Content Centric Networking , so that future requests can be served without going back to the origin of the content.
Revised: Content caching at intermediate nodes is a very effective way for optimizing the operations of Computer networks , so that future requests can be served without going back to the origin of the content.
Edit intent: clarity
Original:  Moreover, the Content Centric Networking framework still faces challenges when implemented in the current network layering paradigm, as it requires a radical change in the TCP/IP protocol stack.
Edit intent: coherence
Original: Mutualisms are known to run in parallel with antagonistic interactions, like parasitism or competition .
Revised: Plant-pollinator associations are often seen as purely mutualistic, while in reality they can be more complex. Indeed they may also display a diverse array of antagonistic interactions, like parasitism or competition .
Edit intent: clarity
Original:  In this paper we develop a model that captures the basic features of the interaction between a flowering plant and an insect , in which adult insects are plant pollinators, and larvae feed on the plant's vegetative tissues .
Revised:  In this paper , we developed a model that captures the basic features of the interaction between a flowering plant and an insect , in which adult insects are plant pollinators, and larvae feed on the plant's vegetative tissues .
Edit intent: fluency
Original:  In this paper we develop a model that captures the basic features of the interaction between a flowering plant and an insect , in which adult insects are plant pollinators, and larvae feed on the plant's vegetative tissues .
Revised:  In this paper we develop a model that captures the basic features of the interaction between a flowering plant and an insect with a larval stage that feeds on the plant's vegetative tissues .
Edit intent: clarity
Original:  Our model is able to display a rich set of dynamics, the most remarkable of which involves victim--exploiter oscillations that allow plants to attain abundances above their carrying capacities, thus enabling the periodic alternation between mutualism and herbivory .
Revised:  Our model is able to display a rich set of dynamics, the most remarkable of which involves victim--exploiter oscillations that allow plants to attain abundances above their carrying capacities, and the periodic alternation between mutualism and herbivory .
Edit intent: coherence
Original:  Our model is able to display a rich set of dynamics, the most remarkable of which involves victim--exploiter oscillations that allow plants to attain abundances above their carrying capacities, thus enabling the periodic alternation between mutualism and herbivory .
Revised:  Our model is able to display a rich set of dynamics, the most remarkable of which involves victim--exploiter oscillations that allow plants to attain abundances above their carrying capacities, thus enabling the periodic alternation between states dominated by mutualism or antagonism .
Edit intent: clarity
Original:  These changes in the life cycle could be caused by a variety of external drivers, such as temperature, pollution, and changes in the diversity of plant hosts and alternative pollinators.
Revised:  These changes in the life cycle could be caused by a variety of external drivers, such as temperature, pollution, and changes in the diet of adult pollinators. Abstract
Edit intent: clarity
Original:  Keywords: mutualism,  herbivory, insects, stage-structure , bi-stability , oscillations
Revised:  Keywords: mutualism, herbivory, insects, stage-structure , oscillations
Edit intent: clarity
Original: The introduction of SDN in IP backbones requires the coexistence of regular IP forwarding /routing and SDN based forwarding  for different types of advanced services (VPNs, Virtual Leased Lines, Traffic Engineering...).
Revised: The introduction of SDN in IP backbones requires the coexistence of regular IP forwarding and SDN based forwarding for different types of advanced services (VPNs, Virtual Leased Lines, Traffic Engineering...).
Edit intent: clarity
Original:  In this paper we first consider such "hybrid" IP/SDN networking scenario from the point of view of the possible services and the network architecture to be implemented .
Revised:  In this paper we first introduce the architecture and the services of an "hybrid" IP/SDN networking scenario from the point of view of the possible services and the network architecture to be implemented .
Edit intent: clarity
Original:  In this paper we first consider such "hybrid" IP/SDN networking scenario from the point of view of the possible services and the network architecture to be implemented .
Revised:  In this paper we first consider such "hybrid" IP/SDN networking scenario .
Edit intent: clarity
Original:  Then we design and implement a Linux based Hybrid IP/SDN node (OSHI) by combining Open Source components ( Quagga for OSPF routing and Open vSwitch as OpenFlow switch).
Revised:  Then we describe the design and implementation of an Open Source Hybrid IP/SDN node (OSHI) by combining Open Source components ( Quagga for OSPF routing and Open vSwitch as OpenFlow switch).
Edit intent: clarity
Original:  Then we design and implement a Linux based Hybrid IP/SDN node (OSHI) by combining Open Source components ( Quagga for OSPF routing and Open vSwitch as OpenFlow switch).
Revised:  Then we design and implement a Linux based Hybrid IP/SDN (OSHI) by combining Open Source components ( Quagga for OSPF routing and Open vSwitch as OpenFlow switch).
Edit intent: clarity
Original:  Then we design and implement a Linux based Hybrid IP/SDN node (OSHI) by combining Open Source components ( Quagga for OSPF routing and Open vSwitch as OpenFlow switch).
Revised:  Then we design and implement a Linux based Hybrid IP/SDN node (OSHI) node. It combines Quagga for OSPF routing and Open vSwitch as OpenFlow switch).
Edit intent: clarity
Original:  The whole OSHI development and test environment is available in a ready-to-go Virtual Box VM image that can be downloaded from our web page, thus starting to experiment hybrid IP/SDN networking with complex topologies in few minutes .
Revised:  The whole OSHI development and test environment is available in a VirtualBox VM image that can be downloaded from our web page, thus starting to experiment hybrid IP/SDN networking with complex topologies in few minutes .
Edit intent: clarity
Original:  The whole OSHI development and test environment is available in a ready-to-go Virtual Box VM image that can be downloaded from our web page, thus starting to experiment hybrid IP/SDN networking with complex topologies in few minutes .
Revised:  The whole OSHI development and test environment is available in a ready-to-go Virtual Box VM image that can be downloaded .
Edit intent: clarity
Original: We show that if f(x_1,\ldots,x_n)is a polynomial with s monomials and g(x_1,\ldots ,x_n) divides f then g has at most \max(s^{O(\log s \log\log s),d^{O(\log d)}) monomials, where d is a bound on the individual degrees of f.
Revised: ,d^{O(\log d)}) monomials, where d is a bound on the individual degrees of f.
Edit intent: coherence
Original:  The resulting algorithm is elementary and has been successfully applied to previously out-of-reach problems .
Revised:  The resulting algorithm is elementary and has been successfully applied to problems that were previously out of reach .
Edit intent: clarity
Original:  Additionally, this irredundant covering H inducing R consists of some blocks of the relation R.
Revised:  Additionally, this irredundant covering H inducing R consists of some blocks of the tolerance R.
Edit intent: clarity
Original:  We give a necessary and sufficient condition under which H and the set of R-blocks coincide.
Revised:  We give necessary and sufficient condition under which H and the set of R-blocks coincide.
Edit intent: fluency
Original:  We give a necessary and sufficient condition under which H and the set of R-blocks coincide.
Revised:  We give a necessary and sufficient conditions under which H and the set of R-blocks coincide.
Edit intent: fluency
Original:  The result is establish by applying the notion of Helly numbers of quasiordered sets.
Revised:  The result is established by applying the notion of Helly numbers of quasiordered sets.
Edit intent: fluency
Original:  The result is established by applying the notion of Helly numbers of quasiordered sets.
Revised:  These results are established by applying the notion of Helly numbers of quasiordered sets.
Edit intent: fluency
Original:  Applying a non-Bayesian time-varying model approach to analyze the famous equation for the  futures premium, we find that the market efficiency of the two major rice futures markets varied with time.
Revised:  Applying a non-Bayesian time-varying model approach to the fundamental equation for the futures premium, we find that the market efficiency of the two major rice futures markets varied with time.
Edit intent: clarity
Original:  Applying a non-Bayesian time-varying model approach to analyze the famous equation for the  futures premium, we find that the market efficiency of the two major rice futures markets varied with time.
Revised:  Applying a non-Bayesian time-varying model approach to analyze the famous equation for the futures premium, we detect when each market efficiency of the two major rice futures markets varied with time.
Edit intent: clarity
Original: This paper examines how the Tokyo and Osaka rice futures markets in prewar Japan were evolving in view of market efficiency.
Revised: This paper studies the interrelation between spot and futures prices in the two major rice markets in prewar Japan were evolving in view of market efficiency.
Edit intent: clarity
Original: This paper examines how the Tokyo and Osaka rice futures markets in prewar Japan were evolving in view of market efficiency.
Revised: This paper examines how the Tokyo and Osaka rice futures markets in prewar Japan from the perspective of market efficiency.
Edit intent: clarity
Original:  Applying a non-Bayesian time-varying model approach to the fundamental equation for the spot returns and the futures premium, we detect when each market efficiency of the two major rice markets reduced .
Revised:  Applying a non-Bayesian time-varying model approach to the fundamental equation for spot returns and the futures premium, we detect when each market efficiency of the two major rice markets reduced .
Edit intent: fluency
Original:  Applying a non-Bayesian time-varying model approach to the fundamental equation for the spot returns and the futures premium, we detect when each market efficiency of the two major rice markets reduced .
Revised:  Applying a non-Bayesian time-varying model approach to the fundamental equation for the spot returns and the futures premium, we detect when efficiency reductions in the two major rice markets reduced .
Edit intent: clarity
Original:  Applying a non-Bayesian time-varying model approach to the fundamental equation for the spot returns and the futures premium, we detect when each market efficiency of the two major rice markets reduced .
Revised:  Applying a non-Bayesian time-varying model approach to the fundamental equation for the spot returns and the futures premium, we detect when each market efficiency of the two major rice markets occurred .
Edit intent: clarity
Original:  We also examined what government interventions affected the rice markets .
Revised:  We also examine how government interventions affected the rice markets .
Edit intent: fluency
Original:  The former for suppressing rice price , letting the imported rice deliverable in the futures exchanges , reduced efficiency of the rice markets.
Revised:  The former for suppressing rice price , letting the imported rice deliverable in the futures exchanges and reduced the efficiency of the rice markets.
Edit intent: coherence
Original:  The latter for equalizing difference in varieties of rice between inland and colonies, promotion of japonica rice cropping in the colonies , ameliorated the disruption.
Revised:  Another intervention balanced the differences in rice varieties from the inland region and the colonies, which promoted japonica rice cropping in the colonies , ameliorated the disruption.
Edit intent: clarity
Original:  The latter for equalizing difference in varieties of rice between inland and colonies, promotion of japonica rice cropping in the colonies , ameliorated the disruption.
Revised:  The latter for equalizing difference in varieties of rice between inland and colonies, promotion of japonica rice cropping in the colonies and ameliorated the disruption.
Edit intent: fluency
Original: We study voting games on possibly interconnected issues, where voters might hold a principled opinion about a subset of the issues at stake  while willing to strike deals on the remaining ones, and can influence one another before casting their ballots in order to obtain an individually more favourable outcome .
Revised: We study voting games on possibly interconnected issues, where voters might hold an objective over some issues at stake while willing to strike deals on the remaining ones, and can influence one another before casting their ballots in order to obtain an individually more favourable outcome .
Edit intent: clarity
Original: We study voting games on possibly interconnected issues, where voters might hold a principled opinion about a subset of the issues at stake  while willing to strike deals on the remaining ones, and can influence one another before casting their ballots in order to obtain an individually more favourable outcome .
Revised: We study voting games on possibly interconnected issues, where voters might hold a principled opinion about a subset of the issues at stake , while willing to strike deals on the remaining ones, and can influence one another before casting their ballots in order to obtain an individually more favourable outcome .
Edit intent: fluency
Original: We study voting games on possibly interconnected issues, where voters might hold a principled opinion about a subset of the issues at stake  while willing to strike deals on the remaining ones, and can influence one another before casting their ballots in order to obtain an individually more favourable outcome .
Revised: We study voting games on possibly interconnected issues, where voters might hold a principled opinion about a subset of the issues at stake while willing to strike deals on the remaining ones, and can influence one another 's voting decision before the vote takes place .
Edit intent: clarity
Original:  We analyse voters' rational behaviour in a two-phase game, allowing players to undergo a negotiation phase before their vote, and showing under what conditions undesirable equilibria can be removed as an effect of the pre-vote phase.
Revised:  We analyse voters' rational behaviour in the resulting two-phase game, allowing players to undergo a negotiation phase before their vote, and showing under what conditions undesirable equilibria can be removed as an effect of the pre-vote phase.
Edit intent: clarity