wanyu/IteraTeR_v2 huggingface dataset:
Original: The aim of this paper is to propose a computation offloading strategy , to be used in mobile cloud computing, in order to minimize the energy expenditure at the mobile handset necessary to run an application under a latency constraint .
Revised: The aim of this paper is to propose a computation offloading strategy for mobile edge computing .
Edit intent: clarity
Original:  Our goal is to derive the  partition of the call graph establishing which procedures are to be executed locally or remotely.
Revised:  Our goal is to derive the optimal partition of the call graph establishing which procedures are to be executed locally or remotely.
Edit intent: clarity
Original:  The main novelty of our workis th at the optimal partition is obtained jointly with the selection of the transmit power and constellation size, in order to minimize the energy consumption at the mobile handset, under a latency constraint taking into account transmit time , packet drops, and execution time.
Revised:  The main novelty of our work is that the optimal partition is obtained jointly with the selection of the transmit power and constellation size, in order to minimize the energy consumption at the mobile handset, under a latency constraint taking into account transmit time , packet drops, and execution time.
Edit intent: fluency
Original:  The main novelty of our workis th at the optimal partition is obtained jointly with the selection of the transmit power and constellation size, in order to minimize the energy consumption at the mobile handset, under a latency constraint taking into account transmit time , packet drops, and execution time.
Revised:  The main novelty of our workis th at the optimal partition is obtained jointly with the selection of the transmit power and constellation size, in order to minimize the energy consumption at the mobile handset, under a latency constraint taking into account transmit time and execution time.
Edit intent: clarity
Original:  We consider both a single channel and a multi-channel transmission strategy, thus proving that a globally optimal solution can be achieved in both cases with affordable complexity .
Revised:  We consider both single and multi-channel transmission strategy, thus proving that a globally optimal solution can be achieved in both cases with affordable complexity .
Edit intent: fluency
Original:  We consider both a single channel and a multi-channel transmission strategy, thus proving that a globally optimal solution can be achieved in both cases with affordable complexity .
Revised:  We consider both a single channel and a multi-channel transmission strategies and we prove that a globally optimal solution can be achieved in both cases with affordable complexity .
Edit intent: coherence
Original:  The theoretical findings are corroborated by numerical results and are aimed to show under what conditions , in terms of call graph topology, communication strategy, and computation parameters, the proposed offloading strategy can provide a significant performance gain .
Revised:  The theoretical findings are corroborated by numerical results and are aimed to show under what conditions in terms of call graph topology, communication strategy, and computation parameters, the proposed offloading strategy can provide a significant performance gain .
Edit intent: fluency
Original:  The theoretical findings are corroborated by numerical results and are aimed to show under what conditions , in terms of call graph topology, communication strategy, and computation parameters, the proposed offloading strategy can provide a significant performance gain .
Revised:  The theoretical findings are corroborated by numerical results and are aimed to show under what conditions , in terms of call graph topology, communication strategy, and computation parameters, the proposed offloading strategy provides large performance gains .
Edit intent: clarity
Original:  We give a polynomial time 6-approximation algorithm for finding a minimum cost subgraph of an undirected graph G that admits an orientation covering a nonnegative crossing G-supermodular demand function, as defined by Frank.
Revised:  We give a polynomial-time 6-approximation algorithm for finding a minimum cost subgraph of an undirected graph G that admits an orientation covering a nonnegative crossing G-supermodular demand function, as defined by Frank.
Edit intent: fluency
Original:  The most important example is (k, l )-edge-connectivity, a common generalization of global and rooted edge-connectivity.
Revised:  An important example is (k, l )-edge-connectivity, a common generalization of global and rooted edge-connectivity.
Edit intent: clarity
Original:  Our algorithm is based on  the iterative rounding method though the application is not standard.
Revised:  Our algorithm is based on a non-standard application of the iterative rounding method though the application is not standard.
Edit intent: clarity
Original:  First, we observe that the standard linear program  is not amenable to the iterative rounding method and therefore use an alternative LP with partition and co-partition constraints  .
Revised:  First, we observe that the standard linear program is not amenable and use an alternative LP with partition and co-partition constraints .
Edit intent: coherence
Original:  First, we observe that the standard linear program  is not amenable to the iterative rounding method and therefore use an alternative LP with partition and co-partition constraints  .
Revised:  First, we observe that the standard linear program is not amenable to the iterative rounding method and therefore use an alternative linear program with partition and co-partition constraints .
Edit intent: clarity
Original:  We disprove this conjecture by showing an O (|V|) -integrality gap even when k=2.
Revised:  We disprove this conjecture by showing an O (|V|) integrality gap even when k=2.
Edit intent: fluency
Original:  Alon and Boppana improved the result into exponential lower bound exp(\Omega( ( n / log n)^{1/3})) of a monotone circuit C to compute cliques of size (1/4) (n / log n)^{2/3}, where n is the number of vertices in a graph.
Revised:  Alon and Boppana improved the result into exponential lower bound exp(\Omega( n / log n)^{1/3})) of a monotone circuit C to compute cliques of size (1/4) (n / log n)^{2/3}, where n is the number of vertices in a graph.
Edit intent: fluency
Original:  Both proofs are based on the method of approximations using Erdos and Rado's sunflower lemma.
Revised:  Both proofs are based on the method of approximations and Erdos and Rado's sunflower lemma.
Edit intent: coherence
Original:  The proof shows that t is disjoint with an edge set z whose removal leaves no k-cliques.
Revised:  The proof shows that t is disjoint from an edge set z whose removal leaves no k-cliques.
Edit intent: fluency
Original:  We develop a theory by finding topological properties in the Hamming space 2^{[n]} where [n]={1, 2, ..., n}. A structural theorem is presented, which is closely related to the sunflower lemma and claims a stronger statement in most cases.
Revised:  We develop a theory by finding topological properties of the Hamming space 2^{[n]} where [n]={1, 2, ..., n}. A structural theorem is presented, which is closely related to the sunflower lemma and claims a stronger statement in most cases.
Edit intent: clarity
Original:  Lastly, we point out that the new methodology has potential to apply to a general circuit computing cliques due to the dynamic selection of t and z, and to improve the Alon-Boppana bound exp(\Omega( ( n / log n)^{1/3})).
Revised:  Lastly, we point out that the new methodology has potential to apply to a general circuit computing cliques due to the dynamic selection of t and z, and to improve the Alon-Boppana bound exp(\Omega( n / log n)^{1/3})).
Edit intent: fluency
Original: Empirical evidence has proliferated that living systems might operate at the vicinity of critical points  with examples ranging from spontaneous brain activity to flock dynamics.
Revised: Empirical evidence suggesting that living systems might operate at the vicinity of critical points with examples ranging from spontaneous brain activity to flock dynamics.
Edit intent: clarity
Original: Empirical evidence has proliferated that living systems might operate at the vicinity of critical points  with examples ranging from spontaneous brain activity to flock dynamics.
Revised: Empirical evidence has proliferated that living systems might operate in the vicinity of critical points with examples ranging from spontaneous brain activity to flock dynamics.
Edit intent: fluency
Original:  Such systems need to cope with and respond to a complex ever-changing environment through the construction of useful internal maps of the world .
Revised:  However, a well-founded theory for understanding how and why interacting living systems could dynamically tune themselves to be poised in the vicinity of a critical point is lacking .
Edit intent: clarity
Original:  Analytical and computational evolutionary models vividly illustrate that a community of such systems dynamically self-tunes toward a critical state either as the complexity of the environment increases or even upon attempting to map with fidelity the other agents in the community  .
Revised:  Analytical and computational evolutionary models vividly illustrate that a community of such systems dynamically self-tunes close to a critical state either as the complexity of the environment increases or even upon attempting to map with fidelity the other agents in the community .
Edit intent: clarity
Original:  Analytical and computational evolutionary models vividly illustrate that a community of such systems dynamically self-tunes toward a critical state either as the complexity of the environment increases or even upon attempting to map with fidelity the other agents in the community  .
Revised:  Analytical and computational evolutionary models vividly illustrate that a community of such systems dynamically self-tunes toward a critical state as the complexity of the environment increases or even upon attempting to map with fidelity the other agents in the community .
Edit intent: coherence
Original:  Our approach constitutes a general explanation for the emergence of critical-like behavior in complex adaptive systems .
Revised:  Our approach provides a parsimonious and general mechanism for the emergence of critical-like behavior in complex adaptive systems .
Edit intent: clarity
Original:  Our approach constitutes a general explanation for the emergence of critical-like behavior in complex adaptive systems .
Revised:  Our approach constitutes a general explanation for the emergence of critical-like behavior in living systems needing to cope with complex environments or trying to efficiently coordinate themselves as an ensemble .
Edit intent: clarity
Original: This paper considers models of large-scale networks where nodes are characterized by a set of states describing their local behavior , and by an explicit mobility model over a two-dimensional lattice.
Revised: This paper considers models of large-scale networks where nodes are characterized by their local behavior , and by an explicit mobility model over a two-dimensional lattice.
Edit intent: clarity
Original: This paper considers models of large-scale networks where nodes are characterized by a set of states describing their local behavior , and by an explicit mobility model over a two-dimensional lattice.
Revised: This paper considers models of large-scale networks where nodes are characterized by a set of states describing their local behavior and by a mobility model over a two-dimensional lattice.
Edit intent: clarity
Original:  This provides a macroscopic view of the model which becomes independent of the lattice granularity, by approximating inherently discrete stochastic movements with continuous , deterministic diffusions.
Revised:  This provides a macroscopic view of the model which approximates discrete stochastic movements with continuous , deterministic diffusions.
Edit intent: clarity
Original:  This provides a macroscopic view of the model which becomes independent of the lattice granularity, by approximating inherently discrete stochastic movements with continuous , deterministic diffusions.
Revised:  This provides a macroscopic view of the model which becomes independent of the lattice granularity, by approximating inherently discrete stochastic movements with continuous deterministic diffusions.
Edit intent: fluency
Original:  Practical video streaming systems all use some form of progressive downloading to let users download the video at a faster rate than the playback rate .
Revised:  Practical video streaming systems usually use some form of progressive downloading to let users download the video at a faster rate than the playback rate .
Edit intent: clarity
Original:  Practical video streaming systems all use some form of progressive downloading to let users download the video at a faster rate than the playback rate .
Revised:  Practical video streaming systems all use some form of progressive downloading to let users download the video at a faster rate than the video bitrate .
Edit intent: clarity
Original:  Since users may quit before viewing the complete video, however, much of the downloaded video may be "wasted".
Revised:  Since users may quit before viewing the complete video, however, much of the downloaded video will be "wasted".
Edit intent: style
Original:  We present methods we used to make highly confident SNP, indel, and homozygous reference genotype calls for NA12878, the pilot genome for the Genome in a Bottle Consortium.
Revised:  We present methods to make highly confident SNP, indel, and homozygous reference genotype calls for NA12878, the pilot genome for the Genome in a Bottle Consortium.
Edit intent: clarity
Original:  To minimize bias towards any sequencing method , we integrate 9 whole genome and 3 exome datasets from 5 different sequencing platforms (Illumina, Complete Genomics, SOLiD, 454, and Ion Torrent), 7 mappers, and 3 variant callers.
Revised:  We minimize bias towards any sequencing method , we integrate 9 whole genome and 3 exome datasets from 5 different sequencing platforms (Illumina, Complete Genomics, SOLiD, 454, and Ion Torrent), 7 mappers, and 3 variant callers.
Edit intent: fluency
Original:  To minimize bias towards any sequencing method , we integrate 9 whole genome and 3 exome datasets from 5 different sequencing platforms (Illumina, Complete Genomics, SOLiD, 454, and Ion Torrent), 7 mappers, and 3 variant callers.
Revised:  To minimize bias towards any sequencing method , we integrate 9 whole genome and 3 exome datasets from 5 sequencing technologies, 7 mappers, and 3 variant callers.
Edit intent: clarity
Original:  The resulting genotype calls are highly sensitive and specific, and allow performance assessment of more difficult variants than typically investigated using microarrays as a benchmark.
Edit intent: coherence
Original:  Observations are now made with increasing sophistication from both ground and space based instruments, and exoplanets are characterized with increasing precision.
Revised:  Observations are now made with increasing sophistication from both ground and space-based instruments, and exoplanets are characterized with increasing precision.
Edit intent: fluency
Original:  The energy harvesting secondary source (SS) helps the primary source (PS) in delivering its undelivered packets during periods of silence of the PS.
Revised:  The energy harvesting secondary source helps the primary source (PS) in delivering its undelivered packets during periods of silence of the PS.
Edit intent: clarity
Original:  The energy harvesting secondary source (SS) helps the primary source (PS) in delivering its undelivered packets during periods of silence of the PS.
Revised:  The energy harvesting secondary source (SS) helps the primary source in delivering its undelivered packets during periods of silence of the PS.
Edit intent: fluency
Original:  The PS has a queue for storing its data packets, while the SS has two data queues;
Revised:  The PS has a queue for storing its data packets, while the secondary source has two data queues;
Edit intent: clarity
Original:  The SS is assumed to be a battery-based node which harvests energy packets from the environment.
Revised:  The secondary source is assumed to be a battery-based node which harvests energy packets from the environment.
Edit intent: clarity
Original:  More specifically, if the secondary energy queue is emptied, the SS can neither help the PS nor transmit a packet from the data queues.
Revised:  More specifically, if the secondary energy queue is emptied, the secondary source can neither help the PS nor transmit a packet from the data queues.
Edit intent: clarity
Original:  We also investigate the impact of the energy arrival rates on the stability region.
Revised:  We also investigate the impact of the energy arrival rate on the stability region.
Edit intent: fluency
Original:  The primary source has a queue for storing its data packets, while the secondary source has two data queues;
Revised:  The primary source has a queue for storing its data packets, whereas the secondary source has two data queues;
Edit intent: fluency
Original:  More specifically, if the secondary energy queue is emptied , the secondary source can neither help the primary source nor transmit a packet from the data queues.
Revised:  More specifically, if the secondary energy queue is empty , the secondary source can neither help the primary source nor transmit a packet from the data queues.
Edit intent: fluency
Original:  The energy queue is modeled as a discrete time queue with mean arrival rate \lambda_{\rm e and mean service rate \rm e.
Revised:  The energy queue is modeled as a discrete time queue with and mean service rate \rm e.
Edit intent: clarity
Original:  We also investigate the impact of the energy arrival rate on the stability region  .
Revised:  We investigate the impact of the energy arrival rate on the stability region .
Edit intent: clarity
Original: In this paper, we consider a cognitive scenario where an energy harvesting secondary user (SU) coexisting with a primary user (PU).
Revised: In this paper, we consider a cognitive scenario where an energy harvesting secondary user (SU) shares the spectrum with a primary user (PU).
Edit intent: clarity
Original:  The energy harvesting secondary source helps the primary source in delivering its undelivered packets during periods of silence of the primary source.
Revised:  The secondary source helps the primary source in delivering its undelivered packets during periods of silence of the primary source.
Edit intent: clarity
Original:  Due to the interaction of the queues, we provide inner and outer bounds on the stability region of the considered system.
Revised:  Due to the interaction of the queues, we provide inner and outer bounds on the stability region of the proposed system.
Edit intent: clarity
Original: Let \(K\) be a field, \f=(f_1,\ldots,f_m) and \g=( f _1,\ldots, f _m) be two sets of m\geqslant 1 non-linear polynomials over K[x_1,\ldots,x_n].
Revised: Let \(K\) be a field, \f=(f_1,\ldots,f_m) and \g=( g _1,\ldots, f _m) be two sets of m\geqslant 1 non-linear polynomials over K[x_1,\ldots,x_n].
Edit intent: fluency
Original:  We consider the computational problem of finding -- if any -- an invertible transformation on the variables mapping \f to \g.
Revised:  We consider the computational problem of finding if any an invertible transformation on the variables mapping \f to \g.
Edit intent: fluency
Original:  Agrawal and Saxena show that {\tt   equivalence of cubic polynomials with respect to an invertible linear change of variables reduces to Graph Isomorphism (%DIFDELCMD < {\tt %%% GI ) .
Revised:  Agrawal and Saxena show that Graph Isomorphism ({\tt equivalence of cubic polynomials with respect to an invertible linear change of variables reduces to Graph Isomorphism (%DIFDELCMD < {\tt %%% GI ) .
Edit intent: fluency
Original:  Agrawal and Saxena show that {\tt   equivalence of cubic polynomials with respect to an invertible linear change of variables reduces to Graph Isomorphism (%DIFDELCMD < {\tt %%% GI ) .
Revised:  Agrawal and Saxena show that {\tt ) reduces to equivalence of cubic polynomials with respect to an invertible linear change of variables reduces to Graph Isomorphism (%DIFDELCMD < {\tt %%% GI ) .
Edit intent: fluency
Original:  Agrawal and Saxena show that {\tt   equivalence of cubic polynomials with respect to an invertible linear change of variables reduces to Graph Isomorphism (%DIFDELCMD < {\tt %%% GI ) .
Revised:  Agrawal and Saxena show that {\tt equivalence of cubic polynomials with respect to an invertible linear change of variables reduces to Graph Isomorphism (%DIFDELCMD < {\tt %%% ) .
Edit intent: fluency
Original:  Agrawal and Saxena show that {\tt   equivalence of cubic polynomials with respect to an invertible linear change of variables reduces to Graph Isomorphism (%DIFDELCMD < {\tt %%% GI ) .
Revised:  Agrawal and Saxena show that {\tt equivalence of cubic polynomials with respect to an invertible linear change of variables reduces to Graph Isomorphism (%DIFDELCMD < {\tt %%% GI .
Edit intent: fluency
Original:  and %DIFDELCMD < \g%%%  =(g_1,\ldots,g_m) be two sets of m %DIFDELCMD < \geqslant %%%  1 non-linear polynomials over K[x_1,\ldots,x_n] \) being a field)} . We consider the computational problem of finding if any an invertible transformation on the variables mapping %DIFDELCMD < \f %%% to%DIFDELCMD < \g%%%  . The corresponding equivalence problem is known as {\it Isomorphism of Polynomials with one Secret} ({\tt IP1S}) and is a fundamental problem in multivariate cryptography ;
Revised:  and %DIFDELCMD < \g%%% =(g_1,\ldots,g_m) be two sets of m %DIFDELCMD < \geqslant %%% \geq 1 non-linear polynomials over K[x_1,\ldots,x_n] \) being a field)} . We consider the computational problem of finding if any an invertible transformation on the variables mapping %DIFDELCMD < \f %%% to%DIFDELCMD < \g%%% . The corresponding equivalence problem is known as {\it Isomorphism of Polynomials with one Secret} ({\tt IP1S}) and is a fundamental problem in multivariate cryptography ;
Edit intent: fluency
Original:  and %DIFDELCMD < \g%%%  =(g_1,\ldots,g_m) be two sets of m %DIFDELCMD < \geqslant %%%  1 non-linear polynomials over K[x_1,\ldots,x_n] \) being a field)} . We consider the computational problem of finding if any an invertible transformation on the variables mapping %DIFDELCMD < \f %%% to%DIFDELCMD < \g%%%  . The corresponding equivalence problem is known as {\it Isomorphism of Polynomials with one Secret} ({\tt IP1S}) and is a fundamental problem in multivariate cryptography ;
Revised:  and %DIFDELCMD < \g%%% =(g_1,\ldots,g_m) be two sets of m %DIFDELCMD < \geqslant %%% 1 nonlinear polynomials over K[x_1,\ldots,x_n] \) being a field)} . We consider the computational problem of finding if any an invertible transformation on the variables mapping %DIFDELCMD < \f %%% to%DIFDELCMD < \g%%% . The corresponding equivalence problem is known as {\it Isomorphism of Polynomials with one Secret} ({\tt IP1S}) and is a fundamental problem in multivariate cryptography ;
Edit intent: fluency
Original:  and %DIFDELCMD < \g%%%  =(g_1,\ldots,g_m) be two sets of m %DIFDELCMD < \geqslant %%%  1 non-linear polynomials over K[x_1,\ldots,x_n] \) being a field)} . We consider the computational problem of finding if any an invertible transformation on the variables mapping %DIFDELCMD < \f %%% to%DIFDELCMD < \g%%%  . The corresponding equivalence problem is known as {\it Isomorphism of Polynomials with one Secret} ({\tt IP1S}) and is a fundamental problem in multivariate cryptography ;
Revised:  and %DIFDELCMD < \g%%% =(g_1,\ldots,g_m) be two sets of m %DIFDELCMD < \geqslant %%% 1 non-linear polynomials over K[x_1,\ldots,x_n] \) being a field)} . We consider the computational problem of finding -- if any -- an invertible transformation on the variables mapping %DIFDELCMD < \f %%% to%DIFDELCMD < \g%%% . The corresponding equivalence problem is known as {\it Isomorphism of Polynomials with one Secret} ({\tt IP1S}) and is a fundamental problem in multivariate cryptography ;
Edit intent: fluency