wanyu/IteraTeR_v2 huggingface dataset:
Original:  This procedure is stable (at least to certain types of pertur- bations of the input) , and so using the diagram as a signature of the input - for example, deriving features from it that are then used in machine learning - is a well-justified con- cept .
Revised:  This procedure is stable (at least to certain types of perturbations of the input) , and so using the diagram as a signature of the input - for example, deriving features from it that are then used in machine learning - is a well-justified con- cept .
Edit intent: fluency
Original:  This procedure is stable (at least to certain types of pertur- bations of the input) , and so using the diagram as a signature of the input - for example, deriving features from it that are then used in machine learning - is a well-justified con- cept .
Revised:  This procedure is stable (at least to certain types of pertur- bations of the input) . This justifies the use of the diagram as a signature of the input - for example, deriving features from it that are then used in machine learning - is a well-justified con- cept .
Edit intent: coherence
Original:  This procedure is stable (at least to certain types of pertur- bations of the input) , and so using the diagram as a signature of the input - for example, deriving features from it that are then used in machine learning - is a well-justified con- cept .
Revised:  This procedure is stable (at least to certain types of pertur- bations of the input) , and so using the diagram as a signature of the input , and the use of features derived from it in machine learning - is a well-justified con- cept .
Edit intent: clarity
Original:  This procedure is stable (at least to certain types of pertur- bations of the input) , and so using the diagram as a signature of the input - for example, deriving features from it that are then used in machine learning - is a well-justified con- cept .
Revised:  This procedure is stable (at least to certain types of pertur- bations of the input) , and so using the diagram as a signature of the input - for example, deriving features from it that are then used in machine learning .
Edit intent: coherence
Original:  However, these computations also produce a great deal of other potentially useful but unstable information : for example, each point in the diagram corresponds to a specific positive simplex .
Revised:  However, these computations also produce other potentially useful but unstable information : for example, each point in the diagram corresponds to a specific positive simplex .
Edit intent: clarity
Original:  However, these computations also produce a great deal of other potentially useful but unstable information : for example, each point in the diagram corresponds to a specific positive simplex .
Revised:  However, these computations also produce a great deal of other potentially useful but unstable information . For example, each point in the diagram corresponds to a specific positive simplex .
Edit intent: fluency
Original:  We recast these problems as real-valued functions which are discontinuous but measur- able , and then observe that convolving such a function with a Lipschitz function produces a Lipschitz function.
Revised:  We recast these problems as real-valued functions which are discontinuous but measurable , and then observe that convolving such a function with a Lipschitz function produces a Lipschitz function.
Edit intent: fluency
Original:  We recast these problems as real-valued functions which are discontinuous but measur- able , and then observe that convolving such a function with a Lipschitz function produces a Lipschitz function.
Revised:  We recast these problems as real-valued functions which are discontinuous but measur- able , and then observe that convolving such a function with a suitable function produces a Lipschitz function.
Edit intent: clarity
Original:  We illustrate this approach with numerous examplesand several experiments .
Revised:  We illustrate this approach with a number of examples .
Edit intent: clarity
Original:  However, these computations also produce other potentially useful but unstable information .
Revised:  These computations also produce other potentially useful but unstable information .
Edit intent: coherence
Original:  However, these computations also produce other potentially useful but unstable information .
Revised:  However, these computations also produce other information of great interest to practitioners that is unfortunately unstable .
Edit intent: clarity
Original:  The persistent homology algorithm is generally seen as a procedure which starts with a filtered complex and ends with a persistence diagram.
Revised:  The persistent homology algorithm is usually viewed as a procedure which starts with a filtered complex and ends with a persistence diagram.
Edit intent: coherence
Original:  These computations also produce other information of great interest to practitioners that is unfortunately unstable.
Revised:  However, these computations also produce other information of great interest to practitioners that is unfortunately unstable.
Edit intent: coherence
Original: This work presents new results on approximate range counting.
Revised: This work presents several new results for approximate range counting.
Edit intent: clarity
Original:  This technique can be viewed as an enhancement of Aronov and Har-Peled's technique SIAM Journal of Computing, 2008%DIFDELCMD < ]%%% . The key reasons are the following: (a) The new technique is sensitive to the value of k: As an application, this work presents a structure for approximate halfspace range counting in R ^d, d\geq 4 , which occupies O(n) space andsolves the query in roughly O%DIFDELCMD < \left(%%% (n/k)^{1-1/\lfloor d/2\rfloor}%DIFDELCMD < \right) %%% time.
Revised:  This technique can be viewed as an enhancement of Aronov and Har-Peled's technique %DIFDELCMD < ]%%% . The key reasons are the following: (a) The new technique is sensitive to the value of k: As an application, this work presents a structure for approximate halfspace range counting in R ^d, d\geq 4 , which occupies O(n) space andsolves the query in roughly O%DIFDELCMD < \left(%%% (n/k)^{1-1/\lfloor d/2\rfloor}%DIFDELCMD < \right) %%% time.
Edit intent: clarity
Original:  This technique can be viewed as an enhancement of Aronov and Har-Peled's technique SIAM Journal of Computing, 2008%DIFDELCMD < ]%%% . The key reasons are the following: (a) The new technique is sensitive to the value of k: As an application, this work presents a structure for approximate halfspace range counting in R ^d, d\geq 4 , which occupies O(n) space andsolves the query in roughly O%DIFDELCMD < \left(%%% (n/k)^{1-1/\lfloor d/2\rfloor}%DIFDELCMD < \right) %%% time.
Revised:  This technique can be viewed as an enhancement of Aronov and Har-Peled's technique SIAM Journal of Computing, 2008%DIFDELCMD < ]%%% . The key reasons are the following: (a) The new technique is sensitive to the value of k: As an application, this work presents a structure for approximate halfspace range counting in R ^d, d\geq 4 %DIFDELCMD < \left(%%% (n/k)^{1-1/\lfloor d/2\rfloor}%DIFDELCMD < \right) %%% time.
Edit intent: coherence
Original:  Here, we present the development of the network of norms that sustain the online social system Wikipedia .
Revised:  One exception is that of the network of norms that sustain the online social system Wikipedia .
Edit intent: clarity
Original:  We do so using a network of pages that establish, describe, and interpret the society 's norms.
Revised:  We do so using a network of pages that establish, describe, and interpret the community 's norms.
Edit intent: clarity
Original:  Fifteen years of high-resolution data allow us to study how this network evolves over time.
Edit intent: coherence
Original:  The earliest users create norms that  dominate the network and persist over time.
Revised:  The earliest users create norms that both dominate the network and persist over time.
Edit intent: clarity
Original:  These core norms govern both content and interpersonal interactions , using abstract principles such as neutrality, verifiability, and assume good faith.
Revised:  These core norms govern both content and interpersonal interactions using abstract principles such as neutrality, verifiability, and assume good faith.
Edit intent: fluency
Original:  We study the fifteen year evolution of this network using the interconnected set of pages that establish, describe, and interpret the community's norms.
Revised:  We study the fifteen-year evolution of this network using the interconnected set of pages that establish, describe, and interpret the community's norms.
Edit intent: fluency
Original:  Despite Wikipedia's reputation for ad hoc governance, we find that its normative evolution is highly conservative.
Revised:  Despite Wikipedia's reputation for ad hoc governance, we find that its normative evolution is highly conservative.
Edit intent: fluency
Original:  Furthermore, by a deterministic analysis of length of the traversed path, we show that it is at most 9 times longer than the shortest path which is optimal.
Edit intent: coherence
Original: The sequence of amino acid monomers in the primary structure of  protein is decided by the corresponding sequence of codons (triplets of nucleic acid monomers) on the template messenger RNA (mRNA).
Revised: The sequence of amino acid monomers in the primary structure of a protein is decided by the corresponding sequence of codons (triplets of nucleic acid monomers) on the template messenger RNA (mRNA).
Edit intent: fluency
Original: The neuronal representation of objects exhibit enormous variability due to changes in the object's physical features such as location, size, orientation, and intensity.
Revised: Objects are represented in sensory systems by continuous manifolds due to sensitivity of neuronal responses to changes in physical features such as location, size, orientation, and intensity.
Edit intent: clarity
Original: The neuronal representation of objects exhibit enormous variability due to changes in the object's physical features such as location, size, orientation, and intensity.
Revised: The neuronal representation of objects exhibit enormous variability due to changes in the object's physical features such as location, orientation, and intensity.
Edit intent: clarity
Original:  We evaluate how the perceptron capacity depends on the dimensionality, size  and shape of the classified manifolds .
Revised:  We evaluate how the perceptron capacity depends on the dimensionality, size , and shape of the classified manifolds .
Edit intent: fluency
Original:  A method to obtain s-PD-sets of minimum size s\left }} \right \rfloor\left }} \right \rfloor + 1 for partial permutation decoding for binary linear Hadamard codes H_m of length 2^m, for all m\geq 4 and 1<s\leq%DIFDELCMD < \left \lfloor{%%% \frac{2^m-m-1{1+m}}%DIFDELCMD < } \right %DIFDELCMD < \rfloor%%% , is described.
Revised:  An explicit construction of\left }} \right \rfloor\left }} \right \rfloor + 1 for partial permutation decoding for binary linear Hadamard codes H_m of length 2^m, for all m\geq 4 and 1<s\leq%DIFDELCMD < \left \lfloor{%%% \frac{2^m-m-1{1+m}}%DIFDELCMD < } \right %DIFDELCMD < \rfloor%%% , is described.
Edit intent: clarity
Original:  A method to obtain s-PD-sets of minimum size s\left }} \right \rfloor\left }} \right \rfloor + 1 for partial permutation decoding for binary linear Hadamard codes H_m of length 2^m, for all m\geq 4 and 1<s\leq%DIFDELCMD < \left \lfloor{%%% \frac{2^m-m-1{1+m}}%DIFDELCMD < } \right %DIFDELCMD < \rfloor%%% , is described.
Revised:  A method to obtain s-PD-sets of minimum size s\left \frac{2^m-m-1{1+m}} \right \rfloor\left }} \right \rfloor + 1 for partial permutation decoding for binary linear Hadamard codes H_m of length 2^m, for all m\geq 4 and 1<s\leq%DIFDELCMD < \left \lfloor{%%% \frac{2^m-m-1{1+m}}%DIFDELCMD < } \right %DIFDELCMD < \rfloor%%% , is described.
Edit intent: fluency
Original:  A method to obtain s-PD-sets of minimum size s\left }} \right \rfloor\left }} \right \rfloor + 1 for partial permutation decoding for binary linear Hadamard codes H_m of length 2^m, for all m\geq 4 and 1<s\leq%DIFDELCMD < \left \lfloor{%%% \frac{2^m-m-1{1+m}}%DIFDELCMD < } \right %DIFDELCMD < \rfloor%%% , is described.
Revised:  A method to obtain s-PD-sets of minimum size s\left }} \right \rfloor-PD-sets of minimum size\left }} \right \rfloor + 1 for partial permutation decoding for binary linear Hadamard codes H_m of length 2^m, for all m\geq 4 and 1<s\leq%DIFDELCMD < \left \lfloor{%%% \frac{2^m-m-1{1+m}}%DIFDELCMD < } \right %DIFDELCMD < \rfloor%%% , is described.
Edit intent: fluency
Original:  A method to obtain s-PD-sets of minimum size s\left }} \right \rfloor\left }} \right \rfloor + 1 for partial permutation decoding for binary linear Hadamard codes H_m of length 2^m, for all m\geq 4 and 1<s\leq%DIFDELCMD < \left \lfloor{%%% \frac{2^m-m-1{1+m}}%DIFDELCMD < } \right %DIFDELCMD < \rfloor%%% , is described.
Revised:  A method to obtain s-PD-sets of minimum size s\left }} \right \rfloor\left \frac{2^m-m-1{1+m}} \right \rfloor + 1 for partial permutation decoding for binary linear Hadamard codes H_m of length 2^m, for all m\geq 4 and 1<s\leq%DIFDELCMD < \left \lfloor{%%% \frac{2^m-m-1{1+m}}%DIFDELCMD < } \right %DIFDELCMD < \rfloor%%% , is described.
Edit intent: fluency
Original:  A method to obtain s-PD-sets of minimum size s\left }} \right \rfloor\left }} \right \rfloor + 1 for partial permutation decoding for binary linear Hadamard codes H_m of length 2^m, for all m\geq 4 and 1<s\leq%DIFDELCMD < \left \lfloor{%%% \frac{2^m-m-1{1+m}}%DIFDELCMD < } \right %DIFDELCMD < \rfloor%%% , is described.
Revised:  A method to obtain s-PD-sets of minimum size s\left }} \right \rfloor\left }} \right \rfloor + 1 for partial permutation decoding for binary linear Hadamard codes H_m of length 2^m, for all m\geq 4 %DIFDELCMD < \left \lfloor{%%% \frac{2^m-m-1{1+m}}%DIFDELCMD < } \right %DIFDELCMD < \rfloor%%% , is described.
Edit intent: coherence
Original:  We show that the edge weights in  one-mode projections are distributed according to a Poisson binomial distribution .
Revised:  We show that the edge weights in the one-mode projections are distributed according to a Poisson binomial distribution .
Edit intent: fluency
Original:  Being able to extract the backbone of a projection proves to be highly beneficial to filter out redundant information in large complex networks and to narrow down the information in the one-mode projection to the most relevant.
Revised:  Being able to extract the backbone of a projection is highly beneficial in filtering out redundant information in large complex networks and to narrow down the information in the one-mode projection to the most relevant.
Edit intent: coherence
Original:  Being able to extract the backbone of a projection proves to be highly beneficial to filter out redundant information in large complex networks and to narrow down the information in the one-mode projection to the most relevant.
Revised:  Being able to extract the backbone of a projection proves to be highly beneficial to filter out redundant information in large complex networks and narrowing down the information in the one-mode projection to the most relevant.
Edit intent: fluency
Original:  We further demonstrate that the backbone of a one-mode projection aids in the detection of communities.
Revised:  We demonstrate that the backbone of a one-mode projection aids in the detection of communities.
Edit intent: clarity
Original: We address quadrature-based approximations of the bilinear inverse form u^\top A^{-1}u, where A is a real symmetric positive definite matrix , and analyze properties of the Gauss, Gauss-Radau, and Gauss-Lobatto quadrature .
Revised: We address quadrature-based approximations of the bilinear inverse form u^\top A^{-1}u, where A is a positive definite matrix , and analyze properties of the Gauss, Gauss-Radau, and Gauss-Lobatto quadrature .
Edit intent: clarity
Original:  In particular, we establish monotonicity of the bounds given by these quadrature rules, compare the tightness of these bounds , and derive associated convergence rates.
Edit intent: coherence
Original:  To our knowledge, this is the first work to establish these properties of Gauss-type quadrature for computing bilinear inverse forms, thus filling a theoretical gap regarding this classical topic.
Revised:  To our knowledge, ours is the first work to establish these properties of Gauss-type quadrature for computing bilinear inverse forms, thus filling a theoretical gap regarding this classical topic.
Edit intent: clarity
Original:  To our knowledge, this is the first work to establish these properties of Gauss-type quadrature for computing bilinear inverse forms, thus filling a theoretical gap regarding this classical topic.
Revised:  To our knowledge, this is the first work to demonstrate these key properties of Gauss-type quadrature for computing bilinear inverse forms, thus filling a theoretical gap regarding this classical topic.
Edit intent: clarity
Original:  To our knowledge, this is the first work to establish these properties of Gauss-type quadrature for computing bilinear inverse forms, thus filling a theoretical gap regarding this classical topic.
Revised:  To our knowledge, this is the first work to establish these properties of Gauss-type quadrature , which is a classical and deeply studied topic.
Edit intent: clarity
Original:  We illustrate the empirical benefits of our theoretical results by applying quadrature to speed up two Markov Chain sampling procedures for (discrete) determinantal point processes  .
Revised:  We illustrate empirical consequences of our results by using quadrature to accelerate machine learning tasks involving determinantal point processes .
Edit intent: clarity
Original:  The transmitter and receivers are not time synchronized and one needs to explicitly account for the clock offset and clock drift in addition to the vehicle motion to obtain accurate range estimates .
Revised:  The transmitter and receivers are not time synchronized and one needs to explicitly account for the clock offset and clock drift in addition to the vehicle motion to accurately estimate the vehicle ranges .
Edit intent: clarity
Original:  We develop a range estimation algorithm based on a local polynomial smoothing of the vehicle motion and experimentally verify that the performance  is close to that obtained using unicast round-trip time ranging.
Revised:  We develop a range estimation algorithm using local polynomial smoothing of the vehicle motion and experimentally verify that the performance is close to that obtained using unicast round-trip time ranging.
Edit intent: fluency
Original:  We develop a range estimation algorithm based on a local polynomial smoothing of the vehicle motion and experimentally verify that the performance  is close to that obtained using unicast round-trip time ranging.
Revised:  We develop a range estimation algorithm based on a local polynomial smoothing of the vehicle motion and experimentally verify that the performance of the proposed approach is close to that obtained using unicast round-trip time ranging.
Edit intent: clarity
Original:  Our scheme requires additional timestamp information to be transmitted as part of the DSRC messages, and we develop a novel timestamp compression algorithm to minimize the resulting overhead .
Revised:  Our scheme requires additional timestamp information to be transmitted as part of the broadcast messages, and we develop a novel timestamp compression algorithm to minimize the resulting overhead .
Edit intent: clarity
Original:  The Enhaced Distributed Channel Access (EDCA) MAC protocol for WLANs proposes up to four Access Categories (AC) that can be mapped to different traffic priorities.
Revised:  The Enhanced Distributed Channel Access (EDCA) MAC protocol for WLANs proposes up to four Access Categories (AC) that can be mapped to different traffic priorities.
Edit intent: fluency
Original:  The Enhaced Distributed Channel Access (EDCA) MAC protocol for WLANs proposes up to four Access Categories (AC) that can be mapped to different traffic priorities.
Revised:  The Enhaced Distributed Channel Access (EDCA) protocol for WLANs proposes up to four Access Categories (AC) that can be mapped to different traffic priorities.
Edit intent: clarity
Original:  Further, EDCA also considers the intricacies related to the management of multiple queues, virtual collisions and priority .
Revised:  Further, EDCA also considers the intricacies related to the management of multiple queues, virtual collisions and traffic differentiation .
Edit intent: clarity
Original:  Between 1920 and 1980, the exponent \alpha is the largest one for the set of states classified as 'the South', but the smallest one for the set of states classified as "Midwest + West".
Revised:  Between 1920 and 1980, the exponent alpha is the largest one for the set of states classified as 'the South', but the smallest one for the set of states classified as "Midwest + West".
Edit intent: fluency
Original: Here, we present the World Trade Atlas 1870-2013, a collection of annual world trade maps in which distances incorporate the different dimensions that affect international trade , beyond mere geography.
Revised: Here, we present the World Trade Atlas 1870-2013, a collection of annual world trade maps in which distances incorporate the different dimensions that affect international trade beyond mere geography.
Edit intent: fluency
Original: This paper focuses on the design of provably efficient online link scheduling algorithms for multi-hop wireless networks.
Revised: This paper focuses on the design of provably efficient online link scheduling algorithms for multi-hop wireless networks.
Edit intent: fluency
Original:  We consider single-hop flows and the one-hop interference model.
Revised:  We consider single-hop traffic and the one-hop interference model.
Edit intent: clarity
Original:  The objective is twofold: 1) maximize the throughput when the flow sources continuously inject packets into the network, and 2) minimize the evacuation time when there are no future packet arrivals.
Revised:  The objective is twofold: 1) maximizing the throughput when the flow sources continuously inject packets into the network, and 2) minimize the evacuation time when there are no future packet arrivals.
Edit intent: fluency
Original:  The objective is twofold: 1) maximize the throughput when the flow sources continuously inject packets into the network, and 2) minimize the evacuation time when there are no future packet arrivals.
Revised:  The objective is twofold: 1) maximize the throughput when the flow sources continuously inject packets into the network, and 2) minimizing the evacuation time when there are no future packet arrivals.
Edit intent: fluency
Original:  The prior works mostly employ the link-based approach, which leads to throughput-efficient algorithms but often does not guarantee satisfactory evacuation time performance.
Revised:  The prior work mostly employs the link-based approach, which leads to throughput-efficient algorithms but often does not guarantee satisfactory evacuation time performance.
Edit intent: fluency
Original:  In this paper, we adopt a novelnode-based approach and propose aservice-balanced online scheduling algorithm, called NSB , which gives balanced scheduling opportunities to the nodes with heavy workload .
Revised:  In this paper, we node-based approach and propose aservice-balanced online scheduling algorithm, called NSB , which gives balanced scheduling opportunities to the nodes with heavy workload .
Edit intent: clarity
Original:  In this paper, we adopt a novelnode-based approach and propose aservice-balanced online scheduling algorithm, called NSB , which gives balanced scheduling opportunities to the nodes with heavy workload .
Revised:  In this paper, we adopt a novel and propose aservice-balanced online scheduling algorithm, called NSB , which gives balanced scheduling opportunities to the nodes with heavy workload .
Edit intent: clarity