wanyu/IteraTeR_v2 huggingface dataset:
Original:  On the one hand, this favors the formation of rafts of penguins but, on the other hand, this may lead to the panic of isolated and exposed individuals.
Revised:  On the one hand, this favors the formation of rafts of penguins but, on the other hand, this may lead to the "panic" of isolated and exposed individuals.
Edit intent: fluency
Original:  Due to the discontinuous behavior of the speed of the penguins, the mathematical treatment (to get existence and uniqueness of the solution) is based on a  stop-and-go  procedure.
Revised:  Due to the discontinuous behavior of the speed of the penguins, the mathematical treatment (to get existence and uniqueness of the solution) is based on a " stop-and-go procedure.
Edit intent: fluency
Original:  Due to the discontinuous behavior of the speed of the penguins, the mathematical treatment (to get existence and uniqueness of the solution) is based on a  stop-and-go  procedure.
Revised:  Due to the discontinuous behavior of the speed of the penguins, the mathematical treatment (to get existence and uniqueness of the solution) is based on a stop-and-go " procedure.
Edit intent: fluency
Original:  By following the mapping to bond percolation we give the exact expression for the epidemic threshold and the fraction of the infected individuals in arbitrary number of layers  .
Revised:  By following the mapping to bond percolation we give the analytical expression for the epidemic threshold and the fraction of the infected individuals in arbitrary number of layers .
Edit intent: clarity
Original:  In polynomial time,the differencing algorithm by Karmarkar and Karp from 1982 can produce a solution with difference at most n^{-\Theta(\log n)}, but no further improvement has been made since then.
Revised:  In polynomial time,the differencing algorithm by Karmarkar and Karp from 1982 can produce a solution with difference at most n^{-\Theta(\log n)}, but no further improvement has been made since then.
Edit intent: fluency
Original: Boundary prediction in images and videos has been a very active topic of research  and organizing visual information into boundaries and segments is believed to be a corner stone of visual perception.
Revised: Boundary estimation in images and videos has been a very active topic of research and organizing visual information into boundaries and segments is believed to be a corner stone of visual perception.
Edit intent: clarity
Original: Boundary prediction in images and videos has been a very active topic of research  and organizing visual information into boundaries and segments is believed to be a corner stone of visual perception.
Revised: Boundary prediction in images and videos has been a very active topic of research , and organizing visual information into boundaries and segments is believed to be a corner stone of visual perception.
Edit intent: fluency
Original:  While prior work has focused on predicting boundaries for observed frames, our work aims at predicting boundaries of future unobserved frames.
Revised:  While prior work has focused on estimating boundaries for observed frames, our work aims at predicting boundaries of future unobserved frames.
Edit intent: clarity
Original: Most or all known methods for analysing  communication complexity of unstructured search are based on the hardness of the set disjointness problem.
Revised: Many known methods for analysing communication complexity of unstructured search are based on the hardness of the set disjointness problem.
Edit intent: clarity
Original: Most or all known methods for analysing  communication complexity of unstructured search are based on the hardness of the set disjointness problem.
Revised: Most or all known methods for analysing the communication complexity of unstructured search are based on the hardness of the set disjointness problem.
Edit intent: fluency
Original:  We feel that such techniques may "hide" certain important aspects of the original problem.
Revised:  Such techniques may "hide" certain important aspects of the original problem.
Edit intent: clarity
Original:  We feel that such techniques may "hide" certain important aspects of the original problem.
Revised:  We feel that such techniques may "hide" important aspects of the original problem.
Edit intent: clarity
Original:  Intuitively, search is a much simpler task: while set disjointness is hard even for NP, a successful search inherently results in a short witness, which makes it easy for NP.
Revised:  Intuitively, search is a much simpler task: while set disjointness is hard even for NP, successful search necessarily results in a short witness, which makes it easy for NP.
Edit intent: clarity
Original:  The possibility to deduce hardness of search problems from that of disjointness may be just an artefact of the definitions.
Revised:  Accordingly, the possibility to deduce hardness of search problems from that of disjointness may be just an artefact of the definitions.
Edit intent: coherence
Original:  The possibility to deduce hardness of search problems from that of disjointness may be just an artefact of the definitions.
Revised:  The possibility to deduce hardness of search problems from that of set disjointness can be viewed as an artefact of the definitions.
Edit intent: clarity
Original:  The possibility to deduce hardness of search problems from that of disjointness may be just an artefact of the definitions.
Revised:  The possibility to deduce hardness of search problems from that of disjointness may be just an artefact of specific definitions.
Edit intent: clarity
Original:  We call this problem inevitable intersection, its analysis seems to require a new, more subtle approach - in particular, not relying on the hardness of set disjointness .
Revised:  We call it inevitable intersection .
Edit intent: coherence
Original:  We consider how this succinct representation of the voters affects the computational complexity of election problems.
Revised:  We consider how this representation affects the complexity of election problems.
Edit intent: clarity
Original:  However, we found one natural NP-hard election problem where the complexity does increase, namely the complexity of winner determination for Kemeny elections.
Revised:  However, we found one natural NP-hard election problem where the complexity does increase, namely winner determination for Kemeny elections.
Edit intent: clarity
Original:  High-multiplicity representation may be exponentially smaller than standard representation, and so many polynomial-time algorithms for election problems in standard representation become exponential . Surprisingly, for polynomial-time election problems, we are often able to either adapt the same approach or provide new algorithms to show that these problems remain polynomial-time in the high-multiplicity case;
Revised:  High-multiplicity representation may be exponentially smaller than standard representation, and so many polynomial-time algorithms for election problems in standard representation become exponential-time . Surprisingly, for polynomial-time election problems, we are often able to either adapt the same approach or provide new algorithms to show that these problems remain polynomial-time in the high-multiplicity case;
Edit intent: clarity
Original: This paper introduces a reliable and efficient localized duality-type error estimator for total energy error of the multigrid finite element .
Revised: This paper introduces a localized duality-type error estimator for total energy error of the multigrid finite element .
Edit intent: clarity
Original:  The algebraic error is estimated by the extrapolated multigrid rate of convergence and the difference between two consecutive iterates.
Revised:  The algebraic part of the total error is further estimated by the extrapolated multigrid rate of convergence and the difference between two consecutive iterates.
Edit intent: clarity
Original:  The algebraic error is estimated by the extrapolated multigrid rate of convergence and the difference between two consecutive iterates.
Revised:  The algebraic error is estimated by the extrapolated convergence rate of the solver and the difference between two consecutive iterates.
Edit intent: clarity
Original:  A stopping criteria is proposed to save the multigrid algorithm from over-solving .
Revised:  A stopping criteria is proposed to save the iterative solvers from over-solving .
Edit intent: clarity
Original: Computing the frustration index of a signed graph is a key to solving problems in different fields of research including social networks, physics, material science, and biology.
Revised: Computing the frustration index of a signed graph is a key step toward solving problems in different fields of research including social networks, physics, material science, and biology.
Edit intent: clarity
Original: Computing the frustration index of a signed graph is a key to solving problems in different fields of research including social networks, physics, material science, and biology.
Revised: Computing the frustration index of a signed graph is a key to solving problems in many fields including social networks, physics, material science, and biology.
Edit intent: clarity
Original:  In social networks the frustration index determines network distance from a state of  structural balance.
Revised:  The frustration index determines network distance from a state of structural balance.
Edit intent: clarity
Original:  In social networks the frustration index determines network distance from a state of  structural balance.
Revised:  In social networks the frustration index determines the distance of a network from a state of structural balance.
Edit intent: clarity
Original:  Although the definition of  frustration index goes back to 1960, an exact algorithmic computation method has not yet been proposed.
Revised:  Although the definition of the frustration index goes back to 1960, an exact algorithmic computation method has not yet been proposed.
Edit intent: fluency
Original:  Although the definition of  frustration index goes back to 1960, an exact algorithmic computation method has not yet been proposed.
Revised:  Although the definition of frustration index goes back to 1960, its exact algorithmic computation method has not yet been proposed.
Edit intent: clarity
Original:  The main reason seems to be the complexity of computing the frustration index which is closely related to well-known NP-hard problems such as MAXCUT.
Revised:  The main reason seems to be the complexity of computing the frustration index which is closely related to classic NP-hard problems such as MAXCUT.
Edit intent: clarity
Original:  The solve timeand solution quality comparison against the literature shows the superiority of our models in both random and real signed networks .
Revised:  The solve timeand solution quality comparison against the literature shows the superiority of our models to both exact and heuristic methods in the literature .
Edit intent: clarity
Original: Computing the frustration index of a signed graph is a key step toward solving problems in many fields including social networks, physics , material science, and biology.
Revised: Computing the frustration index of a signed graph is a key step toward solving problems in many fields including social networks, physics , and biology.
Edit intent: clarity
Original:  The modeling procedure is carried out for Prisoner's Dilemma (PD) and Snowdrift (SD) games that both use either birth-death (BD) or death-birth (DB) strategy updating.
Revised:  The modeling procedure is carried out for Prisoner's Dilemma (PD) and Snowdrift (SD) games that both use either birth--death (BD) or death-birth (DB) strategy updating.
Edit intent: fluency
Original:  The modeling procedure is carried out for Prisoner's Dilemma (PD) and Snowdrift (SD) games that both use either birth-death (BD) or death-birth (DB) strategy updating.
Revised:  The modeling procedure is carried out for Prisoner's Dilemma (PD) and Snowdrift (SD) games that both use either birth-death (BD) or death--birth (DB) strategy updating.
Edit intent: fluency
Original:  With the main focus on using dynamic fitness landscapes as  an alternative tool for analyzing coevolutionary games , landscape measures such as modality, ruggedness and information content are computed and analyzed.
Revised:  The main focus is on using dynamic fitness landscapes as an alternative tool for analyzing coevolutionary games , landscape measures such as modality, ruggedness and information content are computed and analyzed.
Edit intent: clarity
Original:  With the main focus on using dynamic fitness landscapes as  an alternative tool for analyzing coevolutionary games , landscape measures such as modality, ruggedness and information content are computed and analyzed.
Revised:  With the main focus on using dynamic fitness landscapes as an alternative tool for analyzing coevolutionary games , landscape measures such as modality, ruggedness and information content can be computed and analyzed.
Edit intent: clarity
Original:  In addition, fixation properties of the games and quantifiers characterizing the network of interaction are calculated numerically.
Revised:  In addition, fixation properties of the games and quantifiers characterizing the interaction networks are calculated numerically.
Edit intent: clarity
Original:  Relations are established between landscape properties expressed by landscape measures and quantifiers of coevolutionary game dynamics such as fixation probabilities, fixation times and network properties 
Revised:  Relations are established between landscape properties expressed by landscape measures and quantifiers of coevolutionary game dynamics such as fixation probabilities, fixation times and network properties .
Edit intent: fluency
Original: Mobile edge computing enables the provision of computationally demanding Augmented Reality (AR) applications on mobile devices.
Revised: Mobile edge computing is a provisioning solution to enable Augmented Reality (AR) applications on mobile devices.
Edit intent: clarity
Original:  In this letter, we propose a resource allocation approach whereby transmitted, received and processed data are shared partially among the users to obtain an efficient utilization of the communication and computation resources.
Revised:  In this letter, we propose a resource allocation approach over both communication and computation resources.
Edit intent: clarity
Original:  The approach, implemented via Successive Convex Approximation (SCA), is seen to yield considerable gains in mobile energy consumption as compared to the conventional independent offloading across users.
Revised:  The approach, implemented via Successive Convex Approximation (SCA), is seen to yield considerable gains in mobile energy consumption as compared to conventional independent offloading across users.
Edit intent: fluency
Original:  We show that by using time-dilated convolutions with a very deep VGG-style CNN with batch normalization  , we achieve best published single model accuracy result on the switchboard-2000 benchmark dataset .
Revised:  We show results using time-dilated convolutions with a very deep VGG-style CNN with batch normalization , we achieve best published single model accuracy result on the switchboard-2000 benchmark dataset .
Edit intent: clarity
Original:  We show that by using time-dilated convolutions with a very deep VGG-style CNN with batch normalization  , we achieve best published single model accuracy result on the switchboard-2000 benchmark dataset .
Revised:  We show that by using time-dilated convolutions in a very deep VGG-style CNN with batch normalization , we achieve best published single model accuracy result on the switchboard-2000 benchmark dataset .
Edit intent: clarity
Original: We initiate the theoretical study of a fundamental practical problem: how to schedule the congestion-free rerouting of k flows?
Revised: We initiate the theoretical study of a fundamental practical problem: how to schedule the rerouting of k flows?
Edit intent: clarity
Original:  Interestingly, we find that for general k, deciding whether an unsplittable multi-commodity flow rerouting schedule exists, is even NP-hard  on DAGs.
Revised:  Interestingly, we find that for general k, deciding whether an unsplittable multi-commodity flow rerouting schedule exists, is NP-hard on DAGs.
Edit intent: clarity
Original:  Interestingly, we find that for general k, deciding whether an unsplittable multi-commodity flow rerouting schedule exists, is even NP-hard  on DAGs.
Revised:  Interestingly, we find that for general k, deciding whether an unsplittable multi-commodity flow rerouting schedule exists, is even NP-hard even on DAGs.
Edit intent: clarity
Original:  Both NP-hardness proofs are non-trivial.
Revised:  Our NP-hardness proofs are non-trivial.
Edit intent: fluency
Original:  For arbitrary but fixed k, we introduce a weaker  dependency graph and present our main contribution: an elegant linear-time algorithm which solves the problem in time 2^{O(k\log k)}O( |G| \left|\right| ).
Revised:  For arbitrary but fixed k, we introduce a weaker notion of a dependency graph and present our main contribution: an elegant linear-time algorithm which solves the problem in time 2^{O(k\log k)}O( |G| \left|\right| ).
Edit intent: clarity
Original:  For arbitrary but fixed k, we introduce a weaker  dependency graph and present our main contribution: an elegant linear-time algorithm which solves the problem in time 2^{O(k\log k)}O( |G| \left|\right| ).
Revised:  For arbitrary but fixed k, we introduce a weaker dependency graph and present our main contribution: an elegant linear-time algorithm which solves the problem in time 2^{O(k\log k)}O( \left|\right| ).
Edit intent: coherence
Original:  We initiate the theoretical study a fundamental algorithmic problem: How to schedule the rerouting of k unsplittable network flows ( of a certain demand ) from their current paths to their respective new paths, in a congestion-free manner?
Revised:  We initiate the theoretical study a fundamental algorithmic problem: How to reroute k unsplittable flows of a certain demand ) from their current paths to their respective new paths, in a congestion-free manner?
Edit intent: clarity
Original:  We show that the problem is generally NP-hard already for k = 2 flows, which motivates us to study rerouting on a most fundamental family of flow graphs, namely DAGs.
Revised:  We show that the problem is generally NP-hard already for k = 2 flows, which motivates us to study rerouting on a most basic class of flow graphs, namely DAGs.
Edit intent: clarity
Original:  Our NP-hardness proofs are non-trivial.
Revised:  Both NP-hardness proofs are non-trivial.
Edit intent: fluency
Original:  We then present two polynomial-time algorithms to solve the route update problem for a constant number of flows on DAGs.
Revised:  Our main contribution is a polynomial-time algorithms to solve the route update problem for a constant number of flows on DAGs.
Edit intent: clarity
Original:  We then present two polynomial-time algorithms to solve the route update problem for a constant number of flows on DAGs.
Revised:  We then present two polynomial-time algorithms to solve the route update problem for a bounded number of flows on DAGs.
Edit intent: clarity
Original:  Both algorithms employ a decomposition of the flow graph into smaller parts which we call blocks.
Revised:  At the heart of our algorithm lies a novel decomposition of the flow graph into smaller parts which we call blocks.
Edit intent: clarity
Original:  For arbitrary but fixed k, we introduce a weaker notion of a dependency graph and present our main contribution: an elegant linear-time algorithm which solves the problem in time 2^{O(k\log k)O(}%DIFDELCMD < \left|%%% G%DIFDELCMD < \right|%%% ) .
Revised:  For arbitrary but fixed k, we introduce a weaker notion of a dependency graph and present our main contribution: an elegant linear-time algorithm which solves the problem in time 2^{O(k\log k)O(}%DIFDELCMD < \left|%%% %DIFDELCMD < \right|%%% ) .
Edit intent: fluency
Original:  We validate our approach using public indoor scene datasets and show that our method outperforms an object occurrence based and a learned 2D pairwise relation based baselines .
Revised:  We validate our approach using public indoor scene datasets and show that our method outperforms an object occurrence based and a learned 2D pairwise relations .
Edit intent: clarity
Original: The computational mechanisms by which nonlinear recurrent neural networks (RNNs) achieve their goals remains an open question.
Edit intent: clarity
Original:  There exist many problem domains where intelligibility of the network model is crucial for deployment.
Revised:  There exist many problem domains where the interpretability of neural network models is essential for deployment.
Edit intent: clarity
Original:  Here we introduce a recurrent architecture composed of input-switched affine transformations , in other words an RNN without any nonlinearity and with one set of weightsper input.
Revised:  Here we introduce a recurrent architecture composed of input-switched affine transformations - in other words an RNN without any nonlinearity and with one set of weightsper input.
Edit intent: fluency
Original: This paper proposes an architecture of partial sum generator for constituent codes based polar code decoder.
Revised: This paper proposes the architecture of partial sum generator for constituent codes based polar code decoder.
Edit intent: fluency
Original:  The overhead compared with conventional partial sum generator is evaluated as well .
Revised:  The overhead compared with conventional partial sum generator is evaluated .
Edit intent: clarity
Original:  Using the decoded features, the dreamed object category could be correctly identified by matching them to the averaged features for multiple candidate categories.
Revised:  Using the decoded features, the dreamed object category could be correctly identified by matching them to the averaged features for candidate categories.
Edit intent: clarity
Original: In this paper, we study the word problem of automaton semigroups and automaton groups from a complexity point of view.
Revised: In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view.
Edit intent: fluency
Original:  We also show that there is an automaton group whose word problem with a single rational constraint is PSPACE-complete.
Revised:  We also show that there is an automaton group for which the word problem with a single rational constraint is PSPACE-complete.
Edit intent: clarity
Original: Predators may attack isolated or grouped preys in a cooperative, collective way.
Revised: Predators may attack isolated or grouped prey in a cooperative, collective way.
Edit intent: fluency
Original:  Pop. Biol. %DIFDELCMD < {\bf %DIFDELCMD < %%% 65 , 263 (2004)  ] to spatially distributed groups and compare the resulting behavior with their mean field predictions for the coevolving densities of predator and prey strategies.
Revised:  Pop. Biol. %DIFDELCMD < {\bf %DIFDELCMD < %%% 65 (2004) ] to spatially distributed groups and compare the resulting behavior with their mean field predictions for the coevolving densities of predator and prey strategies.
Edit intent: coherence
Original:  Pop. Biol. %DIFDELCMD < {\bf %DIFDELCMD < %%% 65 , 263 (2004)  ] to spatially distributed groups and compare the resulting behavior with their mean field predictions for the coevolving densities of predator and prey strategies.
Revised:  Pop. Biol. %DIFDELCMD < {\bf %DIFDELCMD < %%% 65 , 263 (2004) ] to spatially distributed populations and compare the resulting behavior with their mean field predictions for the coevolving densities of predator and prey strategies.
Edit intent: clarity