wanyu/IteraTeR_v2 huggingface dataset:
Original: In this paper  we consider the problem of scheduling jobs on parallel identical machines, where the processing times of jobs are uncertain: only interval bounds of processing times are known.
Revised: In this paper , we consider the problem of scheduling jobs on parallel identical machines, where the processing times of jobs are uncertain: only interval bounds of processing times are known.
Edit intent: fluency
Original:  In order to cope with the uncertainty  we consider the maximum regret objective and we seek a schedule which performs well under all possible instantiations of processing times.
Revised:  In order to cope with the uncertainty , we consider the maximum regret objective and we seek a schedule which performs well under all possible instantiations of processing times.
Edit intent: fluency
Original:  In order to cope with the uncertainty  we consider the maximum regret objective and we seek a schedule which performs well under all possible instantiations of processing times.
Revised:  In order to cope with the uncertainty we consider the maximum regret objective and we seek a schedule that performs well under all possible instantiations of processing times.
Edit intent: fluency
Original:  In this paper  we show that the problem is strongly NP-hard also in the case of parallel identical machines.
Revised:  In this paper , we show that the problem is strongly NP-hard also in the case of parallel identical machines.
Edit intent: fluency
Original: Directed links  arise naturally in many social networks ( and other complex networks ) , giving rise to directed graphs  as basic topological models for these networks.
Revised: Directed links arise naturally in many social networks and other complex networks ) , giving rise to directed graphs as basic topological models for these networks.
Edit intent: fluency
Original: Directed links  arise naturally in many social networks ( and other complex networks ) , giving rise to directed graphs  as basic topological models for these networks.
Revised: Directed links arise naturally in many social networks ( and other complex networks , giving rise to directed graphs as basic topological models for these networks.
Edit intent: fluency
Original:  In particular we study the problem of maximizing achievable reciprocity  of digraphs with prescribed node in-degree and out-degree sequences , and show that the maximum reciprocity hinges crucially on the prescribed degree sequences, which may intuitively be interpreted as constraints on node "social bandwidth" capacities, thus impose fundamental limits on the achievable reciprocities.
Revised:  In particular we study the problem of maximizing achievable reciprocity for an ensemble of digraphs with prescribed node in-degree and out-degree sequences , and show that the maximum reciprocity hinges crucially on the prescribed degree sequences, which may intuitively be interpreted as constraints on node "social bandwidth" capacities, thus impose fundamental limits on the achievable reciprocities.
Edit intent: clarity
Original:  In particular we study the problem of maximizing achievable reciprocity  of digraphs with prescribed node in-degree and out-degree sequences , and show that the maximum reciprocity hinges crucially on the prescribed degree sequences, which may intuitively be interpreted as constraints on node "social bandwidth" capacities, thus impose fundamental limits on the achievable reciprocities.
Revised:  In particular we study the problem of maximizing achievable reciprocity of digraphs with the same prescribed in- and out-degree sequences , and show that the maximum reciprocity hinges crucially on the prescribed degree sequences, which may intuitively be interpreted as constraints on node "social bandwidth" capacities, thus impose fundamental limits on the achievable reciprocities.
Edit intent: clarity
Original:  In particular we study the problem of maximizing achievable reciprocity  of digraphs with prescribed node in-degree and out-degree sequences , and show that the maximum reciprocity hinges crucially on the prescribed degree sequences, which may intuitively be interpreted as constraints on node "social bandwidth" capacities, thus impose fundamental limits on the achievable reciprocities.
Revised:  In particular we study the problem of maximizing achievable reciprocity of digraphs with prescribed node in-degree and out-degree sequences . We show that the maximum reciprocity hinges crucially on the prescribed degree sequences, which may intuitively be interpreted as constraints on node "social bandwidth" capacities, thus impose fundamental limits on the achievable reciprocities.
Edit intent: coherence
Original:  In particular we study the problem of maximizing achievable reciprocity  of digraphs with prescribed node in-degree and out-degree sequences , and show that the maximum reciprocity hinges crucially on the prescribed degree sequences, which may intuitively be interpreted as constraints on node "social bandwidth" capacities, thus impose fundamental limits on the achievable reciprocities.
Revised:  In particular we study the problem of maximizing achievable reciprocity of digraphs with prescribed node in-degree and out-degree sequences , and show that the maximum reciprocity hinges crucially on the in- and out-degree sequences, which may intuitively be interpreted as constraints on node "social bandwidth" capacities, thus impose fundamental limits on the achievable reciprocities.
Edit intent: fluency
Original:  In particular we study the problem of maximizing achievable reciprocity  of digraphs with prescribed node in-degree and out-degree sequences , and show that the maximum reciprocity hinges crucially on the prescribed degree sequences, which may intuitively be interpreted as constraints on node "social bandwidth" capacities, thus impose fundamental limits on the achievable reciprocities.
Revised:  In particular we study the problem of maximizing achievable reciprocity of digraphs with prescribed node in-degree and out-degree sequences , and show that the maximum reciprocity hinges crucially on the prescribed degree sequences, which may be intuitively interpreted as constraints on node "social bandwidth" capacities, thus impose fundamental limits on the achievable reciprocities.
Edit intent: fluency
Original:  In particular we study the problem of maximizing achievable reciprocity  of digraphs with prescribed node in-degree and out-degree sequences , and show that the maximum reciprocity hinges crucially on the prescribed degree sequences, which may intuitively be interpreted as constraints on node "social bandwidth" capacities, thus impose fundamental limits on the achievable reciprocities.
Revised:  In particular we study the problem of maximizing achievable reciprocity of digraphs with prescribed node in-degree and out-degree sequences , and show that the maximum reciprocity hinges crucially on the prescribed degree sequences, which may intuitively be interpreted as constraints on some "social bandwidth" capacities, thus impose fundamental limits on the achievable reciprocities.
Edit intent: clarity
Original:  In particular we study the problem of maximizing achievable reciprocity  of digraphs with prescribed node in-degree and out-degree sequences , and show that the maximum reciprocity hinges crucially on the prescribed degree sequences, which may intuitively be interpreted as constraints on node "social bandwidth" capacities, thus impose fundamental limits on the achievable reciprocities.
Revised:  In particular we study the problem of maximizing achievable reciprocity of digraphs with prescribed node in-degree and out-degree sequences , and show that the maximum reciprocity hinges crucially on the prescribed degree sequences, which may intuitively be interpreted as constraints on node "social capacities" of nodes and impose fundamental limits on the achievable reciprocities.
Edit intent: clarity
Original:  We also provide a simple upper bound on the maximum reciprocityand sufficient conditions for achieving the bound .
Revised:  We also provide a simple upper bound on maximum reciprocity, and provide conditions for achieving the bound .
Edit intent: clarity
Original:  We also provide a simple upper bound on the maximum reciprocityand sufficient conditions for achieving the bound .
Revised:  We also provide a simple upper bound on the maximum reciprocityand sufficient conditions for achieving it .
Edit intent: clarity
Original:  We demonstrate that many real networks exhibit surprisingly high reciprocities that are fairly close to the upper bound .
Revised:  We demonstrate that many real networks exhibit reciprocities surprisingly close to the upper bound .
Edit intent: clarity
Original:  Our results imply that many users in these social networks are in a sense more "social" than as suggested by the (average) reciprocity metric in that they are more willing to reciprocate, subject to their "social bandwidth " constraints  .
Revised:  Our results imply that many users in these social networks are in a sense more "social" than suggested by the (average) reciprocity metric in that they are more willing to reciprocate, subject to their "social bandwidth " constraints .
Edit intent: clarity
Original:  Our results imply that many users in these social networks are in a sense more "social" than as suggested by the (average) reciprocity metric in that they are more willing to reciprocate, subject to their "social bandwidth " constraints  .
Revised:  Our results imply that many users in these social networks are in a sense more "social" than as suggested by the (average) reciprocity metric in that they are more willing to reciprocate, subject to their "social capacity " constraints .
Edit intent: clarity
Original: Incremental view maintenance is an essential tool for speeding up the processing of large, locally changing workloads.
Revised: Incremental view maintenance is an essential technique for speeding up the processing of large, locally changing workloads.
Edit intent: clarity
Original:  To address this problem, we first show how to efficiently incrementalize IncNRA + , a large fragment of NRA + whose deltas never generate inner bag updates.
Revised:  To address this problem, we first show how to efficiently incrementalize IncNRA + ; a large fragment of NRA + whose deltas never generate inner bag updates.
Edit intent: fluency
Original:  We then provide a semantics-preserving transformation that takes any nested query into a collection of IncNRA + queries.
Revised:  We then provide a semantics-preserving translation that takes any nested query into a collection of IncNRA + queries.
Edit intent: clarity
Original:  We then provide a semantics-preserving transformation that takes any nested query into a collection of IncNRA + queries.
Revised:  We then provide a semantics-preserving transformation that takes any NRC+ query to a collection of IncNRA + queries.
Edit intent: clarity
Original:  This constitutes the first static solution for the efficient incremental processing of languages with nested collections.
Edit intent: coherence
Original:  Finally, we generalize our static approach for the efficient incrementalization of NRA ] + to a family of simply-typed lambda calculi, given that its primitives are themselves efficiently incrementalizable .
Revised:  Finally, we generalize our static approach for the efficient incrementalization of NRA ] + .
Edit intent: clarity
Original: Given a set V of points in \mathbb R^d, two points p, q from V form a double-normal pair, if the set V lies between two parallel hyperplanes that pass through p and q respectively and that are orthogonal to the segment pq.
Revised: Given a set V of points in \mathbb R^d, two points p, q from V form a double-normal pair, if the set V lies between two parallel hyperplanes that pass through p and q , respectively, and that are orthogonal to the segment pq.
Edit intent: fluency
Original:  It is not difficult to get from the famous Erd \H os-Stone theorem that N_d(n) = \frac 12(1-1/k)n^2+o(n^2) for a suitable integer k = k(d) and it was shown in the paper by J. Pach and K. Swanepoel that \lceil d/2\rceil\le k(d)\le d-1 and that asymptotically k(d)\gtrsim d-O(\log d).
Revised:  It is not difficult to get from the famous Erd \H{o theorem that N_d(n) = \frac 12(1-1/k)n^2+o(n^2) for a suitable integer k = k(d) and it was shown in the paper by J. Pach and K. Swanepoel that \lceil d/2\rceil\le k(d)\le d-1 and that asymptotically k(d)\gtrsim d-O(\log d).
Edit intent: clarity
Original: We prove that for any \varepsilon > 0 it is Unique-Games-hard to approximate the non-commutative Grothendieck problem to within a factor 1/2 + \varepsilon, which matches the approximation ratio of the algorithm of Naor, Regev, and Vidick (STOC'13).
Revised: We prove that for any \varepsilon > 0 it is NP-hard to approximate the non-commutative Grothendieck problem to within a factor 1/2 + \varepsilon, which matches the approximation ratio of the algorithm of Naor, Regev, and Vidick (STOC'13).
Edit intent: clarity
Original:  We propose a training objective that implements this idea in the context of a neural network, whose hidden layer is trained to be predictive of the classification target , but uninformative as to the domain of the input.
Revised:  We propose a training objective that implements this idea in the context of a neural network, whose hidden layer is trained to be predictive of the classification task , but uninformative as to the domain of the input.
Edit intent: clarity
Original:  Our experiments on a sentiment analysis classification benchmark, where the target  data available at the training time is unlabeled, show that our neural network for domain adaption algorithm has better performance than either a standard neural networks and a SVM, trained on input features extracted with the state-of-the-art marginalized stacked denoising autoencoders of Chen et al. (2012).
Revised:  Our experiments on a sentiment analysis classification benchmark, where the target data available at the training time is unlabeled, show that our neural network for domain adaption algorithm has better performance than either a standard neural network or an SVM, even if trained on input features extracted with the state-of-the-art marginalized stacked denoising autoencoders of Chen et al. (2012).
Edit intent: clarity
Original:  This leads to the following question: given a  query language and a relation  , does there exist a query in the given language that defines the given relation?
Revised:  This leads to the following question: given a query language and a relation , does there exist a query in the language that defines the given relation?
Edit intent: fluency
Original:  This leads to the following question: given a  query language and a relation  , does there exist a query in the given language that defines the given relation?
Revised:  This leads to the following question: given a query language and a relation , does there exist a query in the given language that defines the relation?
Edit intent: fluency
Original:  When the given query language is standard regular expressions, the definability problem is known to be Pspace-complete .
Revised:  When the given query language is standard regular expressions, the definability problem is known to be PSPACE-complete .
Edit intent: fluency
Original:  We show that the definability problem is Expspace-complete when the query language is REM, and it is Pspace-complete when the query language is REE.
Revised:  We show that the definability problem is EXPSPACE-complete when the query language is REM, and it is Pspace-complete when the query language is REE.
Edit intent: fluency
Original:  We show that the definability problem is Expspace-complete when the query language is REM, and it is Pspace-complete when the query language is REE.
Revised:  We show that the definability problem is Expspace-complete when the query language is REM, and it is PSPACE-complete when the query language is REE.
Edit intent: fluency
Original: Epidemic outbreaks of new pathogens, or known pathogens in new populations, spread fear much because they are hard to predict.
Revised: Epidemic outbreaks of new pathogens, or known pathogens in new populations, cause a great deal of fear because they are hard to predict.
Edit intent: clarity
Original:  Under the assumption of perfect information -- i.e.  knowing the state of each individual with respect to the disease -- the predictability decreases exponentially, or faster, with time.
Revised:  Under the assumption of perfect information -- i.e. , knowing the state of each individual with respect to the disease -- the predictability decreases exponentially, or faster, with time.
Edit intent: fluency
Original:  With a weaker assumption on the information available, assuming that we know only the fraction of currently infectious, recovered  or susceptible individuals, the predictability also decreases exponentially most of the time.
Revised:  With a weaker assumption on the information available, assuming that we know only the fraction of currently infectious, recovered , or susceptible individuals, the predictability also decreases exponentially most of the time.
Edit intent: fluency
Original:  In other words, to predict its final size with a given accuracy, we would need increasingly much information about the outbreak.
Revised:  In other words, to predict its final size with a given accuracy, we would need increasingly more information about the outbreak.
Edit intent: clarity
Original:  We show that they are feasible with very little effort, and analyze the risk potential of abandoned Internet resources for the European service region: our findings reveal that currently 73 /24 IP prefixes and 7 ASes are vulnerable to be attacked .
Revised:  We show that they are feasible with very little effort, and analyze the risk potential of abandoned Internet resources for the European service region: our findings reveal that currently 73 /24 IP prefixes and 7 ASes are vulnerable to be stealthily abused .
Edit intent: clarity
Original:  Numerical simulations, supported by analytical calculations in the linear model, show that aging leads to non-exponential length distributions in steady state , as well as oscillations in microtubule length .
Revised:  Numerical simulations, supported by analytical calculations in the linear model, show that aging leads to non-exponential length distributions in steady state . More importantly, oscillations ensue in microtubule length .
Edit intent: clarity
Original:  Our study shows that age-dependence of catastrophe could function as an intrinsic mechanism to generate oscillatory dynamics in a microtubule population, distinct from hitherto identified ones.
Revised:  Our study shows that age dependence of catastrophe could function as an intrinsic mechanism to generate oscillatory dynamics in a microtubule population, distinct from hitherto identified ones.
Edit intent: fluency
Original:  The bounds are valid for all finite field sizes and show that a small blocking factor can give high probability of success for all field cardinalities and matrix dimensions.
Revised:  The bounds are valid for all finite field sizes and show that a small blocking factor can give high probability of success for all cardinalities and matrix dimensions.
Edit intent: fluency
Original:  Finally, given \varepsilon,\delta\in(0,1) and for any measure, we show an O(n\log n+ (n/\varepsilon^2)\log(1/\delta))-time Monte Carlo algorithm that returns a value that with probability at least 1-\delta  differs at most \varepsilon from the probability that the measure is at least w.
Revised:  Finally, given \varepsilon,\delta\in(0,1) and for any measure, we show an O(n\log n+ (n/\varepsilon^2)\log(1/\delta))-time Monte Carlo algorithm that returns a value that , with probability of success at least 1-\delta differs at most \varepsilon from the probability that the measure is at least w.
Edit intent: clarity
Original:  Finally, given \varepsilon,\delta\in(0,1) and for any measure, we show an O(n\log n+ (n/\varepsilon^2)\log(1/\delta))-time Monte Carlo algorithm that returns a value that with probability at least 1-\delta  differs at most \varepsilon from the probability that the measure is at least w.
Revised:  Finally, given \varepsilon,\delta\in(0,1) and for any measure, we show an O(n\log n+ (n/\varepsilon^2)\log(1/\delta))-time Monte Carlo algorithm that returns a value that with probability at least 1-\delta , differs at most \varepsilon from the probability that the measure is at least w.
Edit intent: fluency
Original:  This embedding relation is a significant extension of the subnetwork relation.
Revised:  This embedding relation is a significant generalization of the subnetwork relation.
Edit intent: clarity
Original:  Moreover, many calculation elements are inherently parallel and suitable for GPU implementation  .
Revised:  Moreover, many of the calculations are inherently parallel and suitable for GPU implementation .
Edit intent: clarity
Original: Motor-driven intracellular transport is a complex phenomenon where multiple motor proteins attached  to a cargo are simultaneously engaged in pulling activity, often leading to tug-of-war and bidirectional motion.
Revised: Motor-driven cargo transport is a complex phenomenon where multiple motor proteins attached to a cargo are simultaneously engaged in pulling activity, often leading to tug-of-war and bidirectional motion.
Edit intent: clarity
Original: Motor-driven intracellular transport is a complex phenomenon where multiple motor proteins attached  to a cargo are simultaneously engaged in pulling activity, often leading to tug-of-war and bidirectional motion.
Revised: Motor-driven intracellular transport is a complex phenomenon where multiple motor proteins attached on to a cargo are simultaneously engaged in pulling activity, often leading to tug-of-war and bidirectional motion.
Edit intent: fluency
Original: Motor-driven intracellular transport is a complex phenomenon where multiple motor proteins attached  to a cargo are simultaneously engaged in pulling activity, often leading to tug-of-war and bidirectional motion.
Revised: Motor-driven intracellular transport is a complex phenomenon where multiple motor proteins attached to a cargo engage in pulling activity, often leading to tug-of-war and bidirectional motion.
Edit intent: clarity
Original: Motor-driven intracellular transport is a complex phenomenon where multiple motor proteins attached  to a cargo are simultaneously engaged in pulling activity, often leading to tug-of-war and bidirectional motion.
Revised: Motor-driven intracellular transport is a complex phenomenon where multiple motor proteins attached to a cargo are simultaneously engaged in pulling activity, often leading to tug-of-war , displaying bidirectional motion.
Edit intent: clarity
Original:  A few papers have studied more realistic models of cargo transport by including elastic motor-cargo coupling, but either restricts the number of motors and/or uses purely phenomenological forms for energy-dependent hopping rates.
Edit intent: coherence
Original:  Here, we study a generic Model In which N motors are elastically coupled to a cargo, which itself is subject to thermal noise in the cytoplasm and  an additional external applied force.
Revised:  Here, we study a generic model in which N motors are elastically coupled to a cargo, which itself is subject to thermal noise in the cytoplasm and an additional external applied force.
Edit intent: fluency
Original:  Here, we study a generic Model In which N motors are elastically coupled to a cargo, which itself is subject to thermal noise in the cytoplasm and  an additional external applied force.
Revised:  Here, we study a generic Model In which N motors are elastically coupled to a cargo, which itself is subjected to thermal noise in the cytoplasm and an additional external applied force.
Edit intent: fluency