wanyu/IteraTeR_v2 huggingface dataset:
Original:  The proposed class of Lyapunov functions allow for the routing policies to control the traffic along short paths for a large portion of state-space while ensuring a negative expected drift, hence, enabling the design of routing policies with much improved delay performances .
Revised:  The proposed class of Lyapunov functions allow for the routing policy to control the traffic along short paths for a large portion of state-space while ensuring a negative expected drift, hence, enabling the design of routing policies with much improved delay performances .
Edit intent: fluency
Original:  The proposed class of Lyapunov functions allow for the routing policies to control the traffic along short paths for a large portion of state-space while ensuring a negative expected drift, hence, enabling the design of routing policies with much improved delay performances .
Revised:  The proposed class of Lyapunov functions allow for the routing policies to control the traffic along short paths for a large portion of state-space while ensuring a negative expected drift, hence, enabling the design of routing policies with much improved delay performance .
Edit intent: fluency
Original: This paper considers the problem of routing packets across a multi-hop wireless network while ensuring throughput optimality.
Revised: This paper considers the problem of throughput optimal routing/scheduling in a multi-hop wireless network while ensuring throughput optimality.
Edit intent: clarity
Original:  The few well-known throughput optimal routing policies in the literature are constructed using simple quadratic or exponential Lyapunov functions of the queue backlogs and as such they do not use any metric of closeness to the destination.
Revised:  The few well-known throughput optimal policies in the literature are constructed using simple quadratic or exponential Lyapunov functions of the queue backlogs and as such they do not use any metric of closeness to the destination.
Edit intent: clarity
Original:  The proposed class of Lyapunov functions allow for the routing policy to control the traffic along short paths for a large portion of state-space while ensuring a negative expected drift , hence, enabling the design of routing policies with much improved delay performance .
Revised:  The proposed class of Lyapunov functions allow for the routing policy to control the traffic along short paths for a large portion of state-space while ensuring a negative expected drift . This structure enables the design of routing policies with much improved delay performance .
Edit intent: clarity
Original:  The proposed class of Lyapunov functions allow for the routing policy to control the traffic along short paths for a large portion of state-space while ensuring a negative expected drift , hence, enabling the design of routing policies with much improved delay performance .
Revised:  The proposed class of Lyapunov functions allow for the routing policy to control the traffic along short paths for a large portion of state-space while ensuring a negative expected drift , hence, enabling the design of a large class of routing policies .
Edit intent: clarity
Original:  The environment undergoes sudden ``catastrophes'' , the probability of which depends on the composition of the population.
Revised:  The environment undergoes sudden "catastrophes" , the probability of which depends on the composition of the population.
Edit intent: fluency
Original:  In the ``no switching'' strategy, the population maximises its instantaneous growth rate, regardless of catastrophes.
Revised:  In the "no switching" strategy, the population maximises its instantaneous growth rate, regardless of catastrophes.
Edit intent: fluency
Original:  In the ``switching'' strategy, the microbial switching rate is tuned to minimise the environmental response.
Revised:  In the "switching" strategy, the microbial switching rate is tuned to minimise the environmental response.
Edit intent: fluency
Original: We build a very simple model of leveraged asset purchases with margin calls.
Revised: We build a simple model of leveraged asset purchases with margin calls.
Edit intent: clarity
Original:  Investment funds use what is perhaps the most basic financial strategy, called 'value investing' , i.e. systematically attempting to buy underpriced assets.
Revised:  Investment funds use what is perhaps the most basic financial strategy, called "value investing" , i.e. systematically attempting to buy underpriced assets.
Edit intent: fluency
Original:  Previous explanations of fat tails and clustered volatility depended on 'irrational behavior' , such as trend following.
Revised:  Previous explanations of fat tails and clustered volatility depended on "irrational behavior" , such as trend following.
Edit intent: fluency
Original:  For the second case, perfect anonymity is considered, and a maximal throughput strategy with perfect anonymity is found that minimizes the average delay .
Revised:  For the second case, perfect anonymity is considered, and maximal throughput strategies with perfect anonymity is found that minimizes the average delay .
Edit intent: fluency
Original:  For the second case, perfect anonymity is considered, and a maximal throughput strategy with perfect anonymity is found that minimizes the average delay .
Revised:  For the second case, perfect anonymity is considered, and a maximal throughput strategy with perfect anonymity are found under a strict latency constraint and an average queue length constraint .
Edit intent: clarity
Original:  This work also leads to a complexity-theoretic solution to a long-standing open problem in probability theory.
Revised:  Our work also leads to a complexity-theoretic solution to a long-standing open problem in probability theory.
Edit intent: fluency
Original:  This work also leads to a complexity-theoretic solution to a long-standing open problem in probability theory.
Revised:  This work also leads to similar complexity-theoretic solution to a long-standing open problem in probability theory.
Edit intent: clarity
Original:  This work also leads to a complexity-theoretic solution to a long-standing open problem in probability theory.
Revised:  This work also leads to a complexity-theoretic answers to a related long-standing open problem in probability theory.
Edit intent: clarity
Original:  Thus, in order to develop effective conservation strategies for these spiders, better understanding of life history processes should be prioritized over  understanding of dispersal strategies.
Revised:  Thus, in order to develop effective conservation strategies for these spiders, better understanding of life history processes should be prioritized over an understanding of dispersal strategies.
Edit intent: fluency
Original:  This is an important issue since random instances can be considered as a good model for instances typically encountered in practical applications .
Revised:  This is an important issue since random instances are a good model for instances typically encountered in practical applications .
Edit intent: clarity
Original: A strong direct product theorem says that if we want to compute k independent instances of a function, using less than k times the resources needed for one instance, then the overall success probability will be exponentially small in k.
Revised: A strong direct product theorem states that if we want to compute k independent instances of a function, using less than k times the resources needed for one instance, then the overall success probability will be exponentially small in k.
Edit intent: coherence
Original:  We show that this bound even holds in an AM communication protocol with limited ambiguity.
Revised:  We show that this bound even holds for AM communication protocols with limited ambiguity.
Edit intent: clarity
Original:  The main result implies a new lower bound for Disjointness in a restricted 3-player NOF protocol, and optimal communication-space tradeoffs for Boolean matrix product.
Revised:  This also implies a new lower bound for Disjointness in a restricted 3-player NOF protocol, and optimal communication-space tradeoffs for Boolean matrix product.
Edit intent: clarity
Original:  We also discuss a new lower bound technique for randomized communication complexity called the generalized rectangle boundthat we use in our proof .
Revised:  We also discuss a new lower bound technique for randomized communication complexity which we call the smooth rectangle bound .
Edit intent: clarity
Original: Symmetry structure in natural and artificial systems such as crystallography, chemistry, physics, and permutation puzzles, et cetera, can facilitate understanding and manipulation of these systems, as is well-known in the mathematical sciences and from the algebraic theory of groups (the latter now with about two centuries of continuous development).
Revised: For natural and artificial systems such as crystallography, chemistry, physics, and permutation puzzles, et cetera, can facilitate understanding and manipulation of these systems, as is well-known in the mathematical sciences and from the algebraic theory of groups (the latter now with about two centuries of continuous development).
Edit intent: clarity
Original: Symmetry structure in natural and artificial systems such as crystallography, chemistry, physics, and permutation puzzles, et cetera, can facilitate understanding and manipulation of these systems, as is well-known in the mathematical sciences and from the algebraic theory of groups (the latter now with about two centuries of continuous development).
Revised: Symmetry structure in natural and artificial systems with some symmetry structure, computational understanding and manipulation of these systems, as is well-known in the mathematical sciences and from the algebraic theory of groups (the latter now with about two centuries of continuous development).
Edit intent: clarity
Original: The term quantum neural computing was coined to indicate a unity in the functioning of the brain  .
Revised: The term quantum neural computing indicates a unity in the functioning of the brain .
Edit intent: clarity
Original: This paper reports the results of an experiment on the use of Kak's B-matrix approach to spreading activity in a Hebbian neural network.
Revised: This paper reports the results of an experiment on the use of Kak's B-Matrix approach to spreading activity in a Hebbian neural network.
Edit intent: fluency
Original: This work reports potentials for rapid initiation of sensor networks which make nodes collaborate to relay data to a common data collecting unit (sink node).
Revised: This work shows potentials for rapid initiation of sensor networks which make nodes collaborate to relay data to a common data collecting unit (sink node).
Edit intent: clarity
Original: This work reports potentials for rapid initiation of sensor networks which make nodes collaborate to relay data to a common data collecting unit (sink node).
Revised: This work reports potentials for rapid initiation of sensor networks where nodes collaborate to relay data to a common data collecting unit (sink node).
Edit intent: clarity
Original: This work reports potentials for rapid initiation of sensor networks which make nodes collaborate to relay data to a common data collecting unit (sink node).
Revised: This work reports potentials for rapid initiation of sensor networks which make nodes collaborate to relay messages to a common data collecting unit (sink node).
Edit intent: clarity
Original:  The present observations from simulations are associated to generic phase transition phenomena, which takes place in networks close to percolation thresholds .
Revised:  The present observations from simulations are associated to generic phase transition phenomena, which are known to take place in networks close to percolation thresholds .
Edit intent: clarity
Original:  An initial method, here used for referenceor comparison , assumes the sink node starts the organisation in a common way by transmitting a control message advertising its availability for its neighbours.
Revised:  An initial method, which here serves as reference , assumes the sink node starts the organisation in a common way by transmitting a control message advertising its availability for its neighbours.
Edit intent: clarity
Original:  A node which in this way receives a message implying an improved route to the sink, advertises its new finding and remembers the neighbouring node with the currently best way downstream to the sink .
Revised:  A node which in this way receives a message implying an improved route to the sink, advertises its new finding and remembers which neighbouring node the message came from .
Edit intent: clarity
Original:  The present distributed approach has a potential for simple improvements which are of interest when minimisation of storage and communication of network information is a concern (for example for acoustic underwater networks and general security) .
Revised:  The present distributed approach has a potential for simple improvements which are of interest when minimisation of storage and communication of network information is a concern .
Edit intent: coherence
Original:  This is a well studied problem where for example Dijkstra's algorithm provides a solution for non-negative edge weights.
Revised:  This is a well-studied problem where for example Dijkstra's algorithm provides a solution for non-negative edge weights.
Edit intent: fluency
Original:  This distributed approach has a potential for simple improvements which are of interest when minimisation of storage and communication of network information is a concern.
Revised:  This distributed approach has potential for simple improvements which are of interest when minimisation of storage and communication of network information is a concern.
Edit intent: fluency
Original:  This distributed approach has a potential for simple improvements which are of interest when minimisation of storage and communication of network information is a concern.
Revised:  This distributed approach has a potential for simple improvements which are of interest when minimisation of storage and communication of network information are a concern.
Edit intent: fluency
Original: This paper describes the relationship between trading network and WWW network from the perspective of link preferential attachment , a mechanism known to be the underlying principle in the network evolution and has been incorporated to formulate two famous web pages ranking algorithms, PageRank and HITS.
Revised: This paper describes the relationship between trading network and WWW network from preferential attachment mechanism perspective. This mechanism is known to be the underlying principle in the network evolution and has been incorporated to formulate two famous web pages ranking algorithms, PageRank and HITS.
Edit intent: clarity
Original:  We point out the differences between these networks in the preferential attachment mechanism, derive the formulation of HITS-based ranking algorithm for trading network as a direct consequence of the differences, and apply the same framework when deriving the formulation back to HITS that turns to become a technique to accelerate its convergences.
Revised:  We point out the differences between these networks in the preferential attachment mechanism, derive the formulation of HITS-based ranking algorithm for trading network as a direct consequence of the differences, and apply the same framework when deriving the formulation back to the HITS formulation that turns to become a technique to accelerate its convergences.
Edit intent: coherence
Original: Bloom filters are well-known space-efficient data structures that answer set membership queries with some probability of false positives.
Revised: Bloom filters are well-known space-efficient data structure that answers set membership queries with some probability of false positives.
Edit intent: fluency
Original:  In this paper, we consider the design of  in-packet Bloom filters (iBF).
Revised:  In this paper, we consider the design of such in-packet Bloom filters (iBF).
Edit intent: clarity
Original:  An evaluation of the design parameters and implementation alternatives validates the usefulness of the proposed extensions, providing for enhanced and novel iBF networking applications.
Revised:  An evaluation of the design parameters and implementation alternatives validate the usefulness of the proposed extensions, providing for enhanced and novel iBF networking applications.
Edit intent: fluency
Original:  An evaluation of the design parameters and implementation alternatives validates the usefulness of the proposed extensions, providing for enhanced and novel iBF networking applications.
Revised:  An evaluation of the design parameters and implementation alternatives validates the usefulness of the extensions, providing for enhanced and novel iBF networking applications.
Edit intent: clarity
Original:  The one is a polynomial of two variables , motivated by performance analysis of the Bethe approximation of the Ising partition function.
Revised:  One is a polynomial of two variables , motivated by performance analysis of the Bethe approximation of the Ising partition function.
Edit intent: clarity
Original:  The one is a polynomial of two variables , motivated by performance analysis of the Bethe approximation of the Ising partition function.
Revised:  The one is a polynomial of two variables whose investigation is motivated by the performance analysis of the Bethe approximation of the Ising partition function.
Edit intent: clarity
Original:  The other  polynomial of one variable  is obtained by its specialization .
Revised:  The other is a polynomial of one variable is obtained by its specialization .
Edit intent: fluency
Original:  The other  polynomial of one variable  is obtained by its specialization .
Revised:  The other polynomial of one variable that is obtained by its specialization .
Edit intent: clarity
Original:  It is shown that these polynomials satisfy deletion-contraction relations and are essentially new examples of  V-function, which is introduced by Tutte (1947, Proc.
Revised:  It is shown that these polynomials satisfy deletion-contraction relations and are new examples of V-function, which is introduced by Tutte (1947, Proc.
Edit intent: clarity
Original:  It is shown that these polynomials satisfy deletion-contraction relations and are essentially new examples of  V-function, which is introduced by Tutte (1947, Proc.
Revised:  It is shown that these polynomials satisfy deletion-contraction relations and are essentially new examples of the V-function, which is introduced by Tutte (1947, Proc.
Edit intent: fluency
Original:  It is shown that these polynomials satisfy deletion-contraction relations and are essentially new examples of  V-function, which is introduced by Tutte (1947, Proc.
Revised:  It is shown that these polynomials satisfy deletion-contraction relations and are essentially new examples of V-function, which was introduced by Tutte (1947, Proc.
Edit intent: fluency
Original:  For these polynomials, we discuss  interpretations of special values , and then obtain the bound on the number of sub-coregraphs, i.e., the spanning subgraphs with no vertices of degree one.
Revised:  For these polynomials, we discuss the interpretations of special values , and then obtain the bound on the number of sub-coregraphs, i.e., the spanning subgraphs with no vertices of degree one.
Edit intent: fluency
Original:  For these polynomials, we discuss  interpretations of special values , and then obtain the bound on the number of sub-coregraphs, i.e., the spanning subgraphs with no vertices of degree one.
Revised:  For these polynomials, we discuss interpretations of special values and then obtain the bound on the number of sub-coregraphs, i.e., the spanning subgraphs with no vertices of degree one.
Edit intent: fluency
Original:  For these polynomials, we discuss  interpretations of special values , and then obtain the bound on the number of sub-coregraphs, i.e., the spanning subgraphs with no vertices of degree one.
Revised:  For these polynomials, we discuss interpretations of special values , and then obtain the bound on the number of sub-coregraphs, i.e., spanning subgraphs with no vertices of degree one.
Edit intent: fluency
Original:  Properties of the coefficients and the possible region of zeros are also discussed for this polynomial.
Revised:  The properties of the coefficients and the possible region of zeros are also discussed for this polynomial.
Edit intent: fluency
Original:  Conduction velocity restitution is the simplest nontrivial spatially extended problem in excitable media, and in the case of cardiac tissue it is an important tool for prediction of cardiac arrythmias and fibrillation.
Revised:  Conduction velocity restitution is the simplest nontrivial spatially extended problem in excitable media, and in the case of cardiac tissue it is an important tool for prediction of cardiac arrhythmias and fibrillation.
Edit intent: fluency
Original:  The ionic models include a simplified ``caricature'' of the Noble (1962) model and the Beeler and Reuter (1977) model, which are treated with the nonstandard method .
Revised:  The ionic models include a simplified "caricature" of the Noble (1962) model and the Beeler and Reuter (1977) model, which are treated with the nonstandard method .
Edit intent: fluency
Original: We present a framework for developing algorithms that estimate the state and functional topology of complex dynamic geometric networks (i.e. networks that can be mapped to geometric graphs in some space) and for simulating signal propagation in geometric networks .
Revised: We present a framework for simulating signal propagation in geometric networks (i.e. networks that can be mapped to geometric graphs in some space) and for simulating signal propagation in geometric networks .
Edit intent: clarity
Original: We present a framework for developing algorithms that estimate the state and functional topology of complex dynamic geometric networks (i.e. networks that can be mapped to geometric graphs in some space) and for simulating signal propagation in geometric networks .
Revised: We present a framework for developing algorithms that estimate the state and functional topology of complex dynamic geometric networks (i.e. networks that can be mapped to geometric graphs in some space) and for developing algorithms that estimate (i.e. map) the state and functional topology of complex dynamic geometric net- works .
Edit intent: clarity
Original:  One important global property is the tendency of nodes with similar numbers of edges to be connected .
Revised:  One important global property is the tendency of nodes with similar numbers of edges to connect .
Edit intent: clarity
Original:  Here we demonstrate the importance of edge direction by studying assortativityin directed networks .
Revised:  Here we demonstrate that edge direction has profound effects on assortativity .
Edit intent: clarity
Original:  By comparison to randomized networks , we discover significant features of three network classes: online /social networks, food webs, and word-adjacency networks.
Revised:  By comparison to randomized networks . We apply these measures to three network classes---online /social networks, food webs, and word-adjacency networks.
Edit intent: clarity
Original: A notion of branch-width may be defined for matroids , which generalizes the one known for graphs  .
Revised: A notion of branch-width , which generalizes the one known for graphs .
Edit intent: clarity
Original: A notion of branch-width may be defined for matroids , which generalizes the one known for graphs  .
Revised: A notion of branch-width may be defined for matroids , which generalizes the one known for graphs , can be defined for matroids .
Edit intent: coherence
Original:  Finally  we introduce a new class of non-necessarily representable matroids  described by a grammar , on which MSOM is decidable in linear time.
Revised:  Finally , we introduce a new class of non-necessarily representable matroids described by a grammar , on which MSOM is decidable in linear time.
Edit intent: fluency