wanyu/IteraTeR_v2 huggingface dataset:
Original:  Theories based on some form of cellular bistability, however, do not seem to be able to account for the fact that noisy neurons can collectively store information in a robust manner.
Revised:  Theories based on some form of cellular bistability, however, do not seem able to account for the fact that noisy neurons can collectively store information in a robust manner.
Edit intent: fluency
Original:  We show how a sufficiently clustered network of simple model neurons can be instantly induced into metastable states capable of retaining information for a short time . Cluster Reverberation, as we call it, could constitute a viable mechanism available to the brain for robust short-term memory with no need of synaptic learning.
Revised:  We show how a sufficiently clustered network of simple model neurons can be instantly induced into metastable states capable of retaining information for a short time . Cluster Reverberation, as we call it, could constitute a viable means available to the brain for robust short-term memory with no need of synaptic learning.
Edit intent: clarity
Original:  We show how a sufficiently clustered network of simple model neurons can be instantly induced into metastable states capable of retaining information for a short time . Cluster Reverberation, as we call it, could constitute a viable mechanism available to the brain for robust short-term memory with no need of synaptic learning.
Revised:  We show how a sufficiently clustered network of simple model neurons can be instantly induced into metastable states capable of retaining information for a short time . Cluster Reverberation, as we call it, could constitute a viable mechanism available to the brain for sensory and/or short-term memory with no need of synaptic learning.
Edit intent: clarity
Original:  We also provide a foundation for model selection through the implementation and assessment of three model selection approaches: a traditional p-value based backward selection approach, an information criterion approach (AIC), and a graphical goodness of fit (GOF) approach.
Revised:  We also provide a foundation for model selection through the implementation and assessment of three selection approaches: a traditional p-value based backward selection approach, an information criterion approach (AIC), and a graphical goodness of fit (GOF) approach.
Edit intent: fluency
Original: Our goal , in this paper, is to infer the topology of a network when (i) we can send probes between sources and receivers at the edge of the network and (ii) intermediate nodes can perform simple network coding operations, i.e., additions.
Revised: Our goal is to infer the topology of a network when (i) we can send probes between sources and receivers at the edge of the network and (ii) intermediate nodes can perform simple network coding operations, i.e., additions.
Edit intent: coherence
Original:  Stanley's theorem states a relation between `` the sum of the numbers of distinct members in the partitions of a positive integer n '' and `` the total number of 1's that occur in the partitions of n '' . Our generalization states a similar relation between `` the sum of the numbers of distinct members in the partitions of n '' and the total number of 2's or 3's or any general k that occur in the partitions of n and the subsequent integers  .
Revised:  Stanley's theorem states a relation between " the sum of the numbers of distinct members in the partitions of a positive integer n '' and `` the total number of 1's that occur in the partitions of n '' . Our generalization states a similar relation between `` the sum of the numbers of distinct members in the partitions of n '' and the total number of 2's or 3's or any general k that occur in the partitions of n and the subsequent integers .
Edit intent: fluency
Original:  Stanley's theorem states a relation between `` the sum of the numbers of distinct members in the partitions of a positive integer n '' and `` the total number of 1's that occur in the partitions of n '' . Our generalization states a similar relation between `` the sum of the numbers of distinct members in the partitions of n '' and the total number of 2's or 3's or any general k that occur in the partitions of n and the subsequent integers  .
Revised:  Stanley's theorem states a relation between `` the sum of the numbers of distinct members in the partitions of a positive integer n " and " the total number of 1's that occur in the partitions of n '' . Our generalization states a similar relation between `` the sum of the numbers of distinct members in the partitions of n '' and the total number of 2's or 3's or any general k that occur in the partitions of n and the subsequent integers .
Edit intent: fluency
Original:  Stanley's theorem states a relation between `` the sum of the numbers of distinct members in the partitions of a positive integer n '' and `` the total number of 1's that occur in the partitions of n '' . Our generalization states a similar relation between `` the sum of the numbers of distinct members in the partitions of n '' and the total number of 2's or 3's or any general k that occur in the partitions of n and the subsequent integers  .
Revised:  Stanley's theorem states a relation between `` the sum of the numbers of distinct members in the partitions of a positive integer n '' and `` the total number of 1's that occur in the partitions of n " . Our generalization states a similar relation between `` the sum of the numbers of distinct members in the partitions of n '' and the total number of 2's or 3's or any general k that occur in the partitions of n and the subsequent integers .
Edit intent: fluency
Original:  Stanley's theorem states a relation between `` the sum of the numbers of distinct members in the partitions of a positive integer n '' and `` the total number of 1's that occur in the partitions of n '' . Our generalization states a similar relation between `` the sum of the numbers of distinct members in the partitions of n '' and the total number of 2's or 3's or any general k that occur in the partitions of n and the subsequent integers  .
Revised:  Stanley's theorem states a relation between `` the sum of the numbers of distinct members in the partitions of a positive integer n '' and `` the total number of 1's that occur in the partitions of n '' . Our generalization states a similar relation between " the sum of the numbers of distinct members in the partitions of n '' and the total number of 2's or 3's or any general k that occur in the partitions of n and the subsequent integers .
Edit intent: fluency
Original:  Stanley's theorem states a relation between `` the sum of the numbers of distinct members in the partitions of a positive integer n '' and `` the total number of 1's that occur in the partitions of n '' . Our generalization states a similar relation between `` the sum of the numbers of distinct members in the partitions of n '' and the total number of 2's or 3's or any general k that occur in the partitions of n and the subsequent integers  .
Revised:  Stanley's theorem states a relation between `` the sum of the numbers of distinct members in the partitions of a positive integer n '' and `` the total number of 1's that occur in the partitions of n '' . Our generalization states a similar relation between `` the sum of the numbers of distinct members in the partitions of n " and the total number of 2's or 3's or any general k that occur in the partitions of n and the subsequent integers .
Edit intent: fluency
Original:  An instance of this problem consists of a matrix A \in [0,1]^{m \times n}, a vector b \in [1,\infty)^m, and a monotone submodular set function f: 2^{[n]} \rightarrow R \bbR _+. The objective is to find a set S that maximizes f(S) subject to A x_{S} \leq b . Here, x_S stands for the characteristic vector of the set S. A well-studied special case of this problem is when the objective function f is linear.
Revised:  An instance of this problem consists of a matrix A \in [0,1]^{m \times n}, a vector b \in [1,\infty)^m, and a monotone submodular set function f: 2^{[n]} \rightarrow \bbR _+. The objective is to find a set S that maximizes f(S) subject to A x_{S} \leq b . Here, x_S stands for the characteristic vector of the set S. A well-studied special case of this problem is when the objective function f is linear.
Edit intent: clarity
Original:  An instance of this problem consists of a matrix A \in [0,1]^{m \times n}, a vector b \in [1,\infty)^m, and a monotone submodular set function f: 2^{[n]} \rightarrow R \bbR _+. The objective is to find a set S that maximizes f(S) subject to A x_{S} \leq b . Here, x_S stands for the characteristic vector of the set S. A well-studied special case of this problem is when the objective function f is linear.
Revised:  An instance of this problem consists of a matrix A \in [0,1]^{m \times n}, a vector b \in [1,\infty)^m, and a monotone submodular set function f: 2^{[n]} \rightarrow R \bbR _+. The objective is to find a set S that maximizes f(S) subject to A x_{S} \leq b , where x_S stands for the characteristic vector of the set S. A well-studied special case of this problem is when the objective function f is linear.
Edit intent: coherence
Original:  An instance of this problem consists of a matrix A \in [0,1]^{m \times n}, a vector b \in [1,\infty)^m, and a monotone submodular set function f: 2^{[n]} \rightarrow R \bbR _+. The objective is to find a set S that maximizes f(S) subject to A x_{S} \leq b . Here, x_S stands for the characteristic vector of the set S. A well-studied special case of this problem is when the objective function f is linear.
Revised:  An instance of this problem consists of a matrix A \in [0,1]^{m \times n}, a vector b \in [1,\infty)^m, and a monotone submodular set function f: 2^{[n]} \rightarrow R \bbR _+. The objective is to find a set S that maximizes f(S) subject to A x_{S} \leq b . Here, x_S stands for the characteristic vector of the set S. A well-studied special case of this problem is when f is linear.
Edit intent: clarity
Original:  One immediate corollary of this result is that the algorithm under consideration achieves constant factor approximation when the number of constraints is constant or when the width of the packing constraints is sufficiently large.
Revised:  One immediate corollary of this result is that the algorithm under consideration achieves constant factor approximation when the number of constraints is constant or when the width of the constraints is sufficiently large.
Edit intent: clarity
Original:  This result (almost) matches the theoretical lower bound of 1 - 1/e , which already holds for maximizing a monotone submodular function subject to a cardinality constraint .
Revised:  This result essentially matches the theoretical lower bound of 1 - 1/e , which already holds for maximizing a monotone submodular function subject to a cardinality constraint .
Edit intent: clarity
Original: In this work we study a weak Prisoner's Dilemma game in which both strategies and update rules are subjected to evolutionary pressure.
Revised: In this work we study a weak Prisoner\^as Dilemma game in which both strategies and update rules are subjected to evolutionary pressure.
Edit intent: fluency
Original:  Furthermore, on those networks, the update rule leading to a larger fraction of cooperation, replicator dynamics, is selected during co-evolution.
Revised:  Furthermore, on those networks, the update rule leading to a larger fraction , which we call replicator dynamics, is selected during co-evolution.
Edit intent: clarity
Original:  The resulting so called h-index is reevaluated and compared to both the " traditional "  h-index and as well as to a recent proposal by Hirsh .
Revised:  The resulting so called h-index is reevaluated and compared to both the " traditional " h-index a recent proposal by Hirsh .
Edit intent: coherence
Original:  It is found that both the h-index and the number of papers are drastically changed with a redistribution of associated ranking of scientists  .
Revised:  It is found that both the h-index , the gh-index is a function of the total number of citations of each paper. A highly cited paper allows a better allocation for all co-authors while a less cited paper contributes essentially to one or two of the co-authors. The scheme produces a substantial redistribution of the ranking of scientists .
Edit intent: coherence
Original:  In this paper we consider this problem at the abstraction level of program schemas , in which computations occur in the Herbrand domain of terms and predicate symbols, which represent arbitrary predicate functions, are allowed.
Revised:  In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of terms and predicate symbols, which represent arbitrary predicate functions, are allowed.
Edit intent: fluency
Original:  The road-constrained and high mobility of vehicles, their unbounded power source, and the emergence of roadside wireless infrastructures make VANETs a challenging research topic.
Revised:  The road-constrained , high mobility of vehicles, their unbounded power source, and the emergence of roadside wireless infrastructures make VANETs a challenging research topic.
Edit intent: coherence
Original:  A key to the development of protocols for intervehicle communication and services lies in the knowledge of the topological characteristics of the VANET communication graph.
Revised:  A key to the development of protocols for inter-vehicle communication and services lies in the knowledge of the topological characteristics of the VANET communication graph.
Edit intent: fluency
Original:  This paper explores the dynamics of VANETs in urban environments  . Using both real and realistic mobility traces, we study the networking shape of VANETs in urban environments under different transmission and market penetration ranges.
Revised:  This paper explores the dynamics of VANETs in urban environments . Using both real and realistic mobility traces, we study the networking shape of VANETs under different transmission and market penetration ranges.
Edit intent: fluency
Original:  Several latent facts about the VANET graph are revealed and implications for their exploitation in protocol design are examined .
Revised:  Through extensive simulations we investigate the performance of VANET routing protocols by exploiting the knowledge of VANET graphs analysis .
Edit intent: clarity
Original: The standard NP-complete max-cut problem is reformulated as a binary quadratic program xQx s.t x^2= 1.
Revised: The standard NP-complete max-cut problem reduced to a binary quadratic program xQx s.t x^2= 1.
Edit intent: clarity
Original:  Without loss of generality matrix Q can be assumed positive semidefinite .
Revised:  Without loss of generality matrix Q can be assumed positive definite .
Edit intent: fluency
Original:  It is shown that for some \alpha a global minimum of sum of squares of polynomials Q {\bf  (\alpha, x)= \alpha x^T Q x + \sum_i (x_i^2-1)^2, provides a solition to max-cut problem  .
Revised:  It is shown that for some \alpha a global minimum of sum of squares of polynomials {\bf (\alpha, x)= \alpha x^T Q x + \sum_i (x_i^2-1)^2, provides a solition to max-cut problem .
Edit intent: fluency
Original:  It is shown that for some \alpha a global minimum of sum of squares of polynomials Q {\bf  (\alpha, x)= \alpha x^T Q x + \sum_i (x_i^2-1)^2, provides a solition to max-cut problem  .
Revised:  It is shown that for some \alpha a global minimum of sum of squares of polynomials Q {\bf Q (\alpha, x)= \alpha x^T Q x + \sum_i (x_i^2-1)^2, provides a solition to max-cut problem .
Edit intent: fluency
Original:  (3) for sufficiently small%DIFDELCMD < \alphathe %DIFDELCMD < %%% global minimum of Q(\alpha, x) is the global minimum of binary quadratic program.
Revised:  (3) %DIFDELCMD < \alphathe %DIFDELCMD < %%% global minimum of Q(\alpha, x) is the global minimum of binary quadratic program.
Edit intent: clarity
Original:  It is shown that for some \alpha a global minimum of sum of squares of polynomials%DIFDELCMD < {\bf %DIFDELCMD < %%% Q (\alpha, x)= \alpha x^T Q x + \sum_i (x_i^2-1)^2, provides arbitrary approximation to max-cut problem in polynomial time.
Revised:  It is shown that for some \alpha a global minimum of sum of squares of polynomials%DIFDELCMD < {\bf %DIFDELCMD < %%% (\alpha, x)= \alpha x^T Q x + \sum_i (x_i^2-1)^2, provides arbitrary approximation to max-cut problem in polynomial time.
Edit intent: fluency
Original:  In particular, for sufficiently small \alpha (1) the global minimum%DIFDELCMD < \tilde {\bf %%% Q (\alpha) of%DIFDELCMD < {\bf %%% Q (x;\alpha) can be found with arbitrary precision by semi-definite program in polynomial time;
Revised:  In particular, for sufficiently small \alpha (1) the global minimum%DIFDELCMD < \tilde {\bf %%% (\alpha) of%DIFDELCMD < {\bf %%% Q (x;\alpha) can be found with arbitrary precision by semi-definite program in polynomial time;
Edit intent: fluency
Original:  In particular, for sufficiently small \alpha (1) the global minimum%DIFDELCMD < \tilde {\bf %%% Q (\alpha) of%DIFDELCMD < {\bf %%% Q (x;\alpha) can be found with arbitrary precision by semi-definite program in polynomial time;
Revised:  In particular, for sufficiently small \alpha (1) the global minimum%DIFDELCMD < \tilde {\bf %%% Q %DIFDELCMD < {\bf %%% Q (x;\alpha) can be found with arbitrary precision by semi-definite program in polynomial time;
Edit intent: clarity
Original:  In particular, for sufficiently small \alpha (1) the global minimum%DIFDELCMD < \tilde {\bf %%% Q (\alpha) of%DIFDELCMD < {\bf %%% Q (x;\alpha) can be found with arbitrary precision by semi-definite program in polynomial time;
Revised:  In particular, for sufficiently small \alpha (1) the global minimum%DIFDELCMD < \tilde {\bf %%% Q (\alpha) of%DIFDELCMD < {\bf %%% (x;\alpha) can be found with arbitrary precision by semi-definite program in polynomial time;
Edit intent: fluency
Original: Intentional interference constitutes a major threat for communication networks operating over a shared medium and where availability is imperative.
Revised: Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative.
Edit intent: coherence
Original:  Our simulation results validate our theoretical results and also show that our algorithm manages to guarantee constant througput where the 802.11 MAC protocol basically fails to deliver any packets.
Revised:  Our simulation results validate our theoretical results and also show that our algorithm manages to guarantee constant throughput where the 802.11 MAC protocol basically fails to deliver any packets.
Edit intent: fluency
Original:  This paper proposes the medium access (MAC) protocol AntiJam that is provably robust against a powerful reactive adversary who can jam a (1-\epsilon)-portion of the time steps, where \epsilon is an arbitrary constant.
Revised:  This paper proposes the medium access (MAC) protocol AntiJam that is provably robust against a powerful reactive adversary who can jam a (1-\epsilon)-portion of the time steps, where \epsilon is an arbitrary constant.
Edit intent: fluency
Original:  In addition, AntiJam features a low convergence time and has good fairness properties.
Revised:  In addition, AntiJam features a low convergence time and has good fairness properties.
Edit intent: fluency
Original:  This paper proposes the medium access (MAC) protocol AntiJam that is provably robust against a powerful reactive adversary who can jam a (1-\epsilon)-portion of the time steps, where \epsilon is an arbitrary constant.
Revised:  This article proposes the medium access (MAC) protocol AntiJam that is provably robust against a powerful reactive adversary who can jam a (1-\epsilon)-portion of the time steps, where \epsilon is an arbitrary constant.
Edit intent: fluency
Original: We present  simulations of biomolecular electrostatics at a scale not reached before, thanks to both algorithmic and hardware acceleration.
Revised: We present simulations of biomolecular electrostatics enabled by the combination of algorithmic and hardware acceleration.
Edit intent: clarity
Original:  Computational experiments are presented simulating the electrostatics of protein--drug binding and several multi-million atom systems consisting of hundreds to thousands of copies of the problems, which models over 20 million atoms and has more than six billion unknowns , one iteration step requires only a few minutes on 512 GPU nodes.
Revised:  The applications demonstrated include the electrostatics of protein--drug binding and several multi-million atom systems consisting of hundreds to thousands of copies of the problems, which models over 20 million atoms and has more than six billion unknowns , one iteration step requires only a few minutes on 512 GPU nodes.
Edit intent: clarity
Original:  Computational experiments are presented simulating the electrostatics of protein--drug binding and several multi-million atom systems consisting of hundreds to thousands of copies of the problems, which models over 20 million atoms and has more than six billion unknowns , one iteration step requires only a few minutes on 512 GPU nodes.
Revised:  Computational experiments are presented simulating the electrostatics of protein-drug binding and several multi-million atom systems consisting of hundreds to thousands of copies of the problems, which models over 20 million atoms and has more than six billion unknowns , one iteration step requires only a few minutes on 512 GPU nodes.
Edit intent: fluency
Original:  Computational experiments are presented simulating the electrostatics of protein--drug binding and several multi-million atom systems consisting of hundreds to thousands of copies of the problems, which models over 20 million atoms and has more than six billion unknowns , one iteration step requires only a few minutes on 512 GPU nodes.
Revised:  Computational experiments are presented simulating the electrostatics of protein--drug binding and several multi-million atom systems consisting of hundreds to thousands of copies of the problems, which models over 20 million atoms and one billion unknowns required only one minute on 512 GPU nodes.
Edit intent: clarity
Original:  We are currently adapting our solver to model the linearized Poisson-Boltzmann equation for dilute ionic solutions, and our BEM simulator is flexible enough to solve a variety of other integral equation problems as well , ranging from simple Poisson problems to Helmholtz problems in electromagnetics and acoustics to high Reynolds number flows .
Revised:  We are currently adapting our BEM software to solve the linearized Poisson-Boltzmann equation for dilute ionic solutions, and our BEM simulator is flexible enough to solve a variety of other integral equation problems as well , ranging from simple Poisson problems to Helmholtz problems in electromagnetics and acoustics to high Reynolds number flows .
Edit intent: clarity
Original:  We are currently adapting our solver to model the linearized Poisson-Boltzmann equation for dilute ionic solutions, and our BEM simulator is flexible enough to solve a variety of other integral equation problems as well , ranging from simple Poisson problems to Helmholtz problems in electromagnetics and acoustics to high Reynolds number flows .
Revised:  We are currently adapting our solver to model the linearized Poisson-Boltzmann equation for dilute ionic solutions, and it is also designed to be flexible enough to solve a variety of other integral equation problems as well , ranging from simple Poisson problems to Helmholtz problems in electromagnetics and acoustics to high Reynolds number flows .
Edit intent: clarity