wanyu/IteraTeR_v2 huggingface dataset:
Original: In network tomography , we seek to infer the status of parameters ( such as delay) for  links inside a network through end-to-end probing between (external) boundary nodes along chosen routes.
Revised: In network tomography , we seek to infer the status of parameters ( such as delay) for links inside a network through end-to-end probing between (external) boundary nodes along predetermined routes.
Edit intent: clarity
Original: Objective: It will be argued that haptic and proprioceptive sensory inputs serve a supervisory function in movement production related to the control of virtual environments and human-machine interfaces .
Revised: Objective: It will be argued that muscular function, limb movements, and touch perception serve supervisory functions for movement control in motion and touch-based (e.g. manipulable) devices/interfaces and human-machine interfaces .
Edit intent: clarity
Original:  In this paper, a neuromechanical perspective will be used to explain the supervisory role of environmental variation on human performance.
Revised:  A neuromechanical perspective will be used to explain the supervisory role of environmental variation on human performance.
Edit intent: coherence
Original:  Method: Three experiments are presented using two different types of virtual environment that allowed for selective perturbation.
Revised:  Method: Three experiments are presented using two different types of virtual environment that allowed for selective switching between two sets of environmental forces. This switching was done in various ways to maximize the variety of results.
Edit intent: clarity
Original:  These analyses demonstrated that there are myriad consequences to force-related perturbations related to dynamic physiological regulation.
Revised:  Results presented here provide a window into performance under a range of conditions. These analyses also demonstrated myriad consequences for force-related perturbations related to dynamic physiological regulation.
Edit intent: clarity
Original:  These analyses demonstrated that there are myriad consequences to force-related perturbations related to dynamic physiological regulation.
Revised:  These analyses demonstrated that there are myriad consequences to force-related fluctuations on dynamic physiological regulation.
Edit intent: clarity
Original:  Application: The findings presented here could be applied to the dynamical control of touch-based and movement-sensitive human-machine systems.
Revised:  The findings presented here could be applied to the dynamical control of touch-based and movement-sensitive human-machine systems.
Edit intent: coherence
Original:  Application: The findings presented here could be applied to the dynamical control of touch-based and movement-sensitive human-machine systems.
Revised:  Application: The findings presented here could be applied to the dynamic control of touch-based and movement-sensitive human-machine systems.
Edit intent: clarity
Original: DHoPLLS URL is a web server that identifies closed loops , which constitute a structural basis for the protein domain hierarchy.
Revised: DHoPLLS URL is a web server that identifies closed loops - a structural basis for the protein domain hierarchy.
Edit intent: clarity
Original: DHoPLLS URL is a web server that identifies closed loops , which constitute a structural basis for the protein domain hierarchy.
Revised: DHoPLLS URL is a web server that identifies closed loops , which constitute a structural basis for protein domain hierarchy.
Edit intent: fluency
Original:  The sign of a permutation associated to its number of inversions in the usual formula for the determinant is replaced by the sign of a perfect matching associated to the number of crossings  .
Revised:  The sign of a permutation associated to its number of inversions in the usual formula for the determinant is replaced by the number of crossings .
Edit intent: clarity
Original:  Among the algorithms that are likely to play a preeminent role in the new world of computing, the fast multipole method ( F MM ) appears as a rising star.
Revised:  Among the algorithms that are likely to play a major role in future exascale computing, the fast multipole method ( F MM ) appears as a rising star.
Edit intent: clarity
Original:  Among the algorithms that are likely to play a preeminent role in the new world of computing, the fast multipole method ( F MM ) appears as a rising star.
Revised:  Among the algorithms that are likely to play a preeminent role in the new world of computing, the fast multipole method ( FMM ) appears as a rising star.
Edit intent: fluency
Original:  In this paper, we present a discussion of the features of the F MM that make it a particularly favorable algorithm for the emerging heterogeneous , massively parallel architectural landscape .
Revised:  In this paper, we present a discussion of the features that make it a particularly favorable algorithm for the emerging heterogeneous , massively parallel architectural landscape .
Edit intent: clarity
Original:  In this paper, we present a discussion of the features of the F MM that make it a particularly favorable algorithm for the emerging heterogeneous , massively parallel architectural landscape .
Revised:  In this paper, we present a discussion of the features of the F MM that make it a particularly favorable algorithm for the emerging heterogeneous and massively parallel architectural landscape .
Edit intent: fluency
Original:  An ASP is defined over a finite time horizon and,a priori , its terminal value has an \ell_1-norm symmetric distribution and an Archimedean survival copula .
Revised:  An ASP is defined over a finite time horizon and, , its terminal value has an \ell_1-norm symmetric distribution and an Archimedean survival copula .
Edit intent: clarity
Original:  An ASP is defined over a finite time horizon and,a priori , its terminal value has an \ell_1-norm symmetric distribution and an Archimedean survival copula .
Revised:  An ASP is defined over a finite time horizon and,a priori . The terminal value of an ASP has an Archimedean survival copula .
Edit intent: clarity
Original:  The terminal value of an ASP has an Archimedean survival copula , and there exists a bijection from the class of ASPs to the class of Archimedean copulas.
Revised:  The terminal value of an ASP has an Archimedean survival copula . There exists a bijection from the class of ASPs to the class of Archimedean copulas.
Edit intent: coherence
Original: Performance curves of queueing systems can be analyzed by separating them into three regions: the flat region, the knee region, and the exponential region.
Revised: Performance curves of queuing systems can be analyzed by separating them into three regions: the flat region, the knee region, and the exponential region.
Edit intent: fluency
Original:  This historical debate is mainly divided between those who claim that a knee in the curve is not a well defined term in mathematics, or it is a subjective and not really meaningful concept, and those who define knees mathematically and consider their relevance and application.
Revised:  This historical debate is mainly divided between those who claim that a knee in the curve is not a well-defined term in mathematics, or it is a subjective and not really meaningful concept, and those who define knees mathematically and consider their relevance and application.
Edit intent: fluency
Original:  Current state-of-the-art methods group documents into fixed sized blocks and compress each block with a general-purpose adaptive algorithm such as Gzip . Random access to a specific document then requires decompression of a block.
Revised:  Current state-of-the-art methods group documents into fixed-sized blocks and compress each block with a general-purpose adaptive algorithm such as Gzip . Random access to a specific document then requires decompression of a block.
Edit intent: fluency
Original:  Current state-of-the-art methods group documents into fixed sized blocks and compress each block with a general-purpose adaptive algorithm such as Gzip . Random access to a specific document then requires decompression of a block.
Revised:  Current state-of-the-art methods group documents into fixed sized blocks and compress each block with a general-purpose adaptive algorithm such as GZIP . Random access to a specific document then requires decompression of a block.
Edit intent: fluency
Original:  We build a representative sample of the collection and use it as a dictionary in an LZ77-like encoding of the rest of the collection, relative to the dictionary.
Revised:  We build a representative sample of the collection and use it as a dictionary in a LZ77-like encoding of the rest of the collection, relative to the dictionary.
Edit intent: fluency
Original:  We demonstrate on large collections,  using a dictionary as small as 0.1\% of the collection size, our algorithm is twice as effective in terms time and space compared to traditional block-oriented approaches .
Revised:  We demonstrate on large collections, that using a dictionary as small as 0.1\% of the collection size, our algorithm is twice as effective in terms time and space compared to traditional block-oriented approaches .
Edit intent: fluency
Original:  Unlike Kannan's reduction our reduction does not use the transference bound (i.e., the result \lambda_1(%DIFDELCMD < \La%%% )\lambda_1(%DIFDELCMD < \La%%% ^{*) \leq n due to Banaszczyk).}
Revised:  %DIFDELCMD < \La%%% )\lambda_1(%DIFDELCMD < \La%%% ^{*) \leq n due to Banaszczyk).}
Edit intent: coherence
Original:  Unlike Kannan's reduction our reduction does not use the transference bound (i.e., the result \lambda_1(%DIFDELCMD < \La%%% )\lambda_1(%DIFDELCMD < \La%%% ^{*) \leq n due to Banaszczyk).}
Revised:  Unlike Kannan's reduction our reduction does not use the transference bound (i.e., the result \lambda_1(%DIFDELCMD < \La%%% %DIFDELCMD < \La%%% ^{*) \leq n due to Banaszczyk).}
Edit intent: fluency
Original:  Unlike Kannan's reduction our reduction does not use the transference bound (i.e., the result \lambda_1(%DIFDELCMD < \La%%% )\lambda_1(%DIFDELCMD < \La%%% ^{*) \leq n due to Banaszczyk).}
Revised:  Unlike Kannan's reduction our reduction does not use the transference bound (i.e., the result \lambda_1(%DIFDELCMD < \La%%% )\lambda_1(%DIFDELCMD < \La%%% ) \leq n due to Banaszczyk).}
Edit intent: coherence
Original:  Among these technologies, Resistive Memories (ReRAM) have create new possibilities because of their nano-features and unique I-V characteristics.
Revised:  Among these technologies, Resistive Memories (ReRAM) created new possibilities because of their nano-features and unique I-V characteristics.
Edit intent: fluency
Original:  One particular problem that dominates the maximum array size is interference from neighboring cells due to sneak-path currents.
Revised:  One particular problem that limits the maximum array size is interference from neighboring cells due to sneak-path currents.
Edit intent: clarity
Original:  A possible device level solution to compensate this issue is to implement  memory array using complementary resistive switches (CRS).
Revised:  A possible device level solution to address this issue is to implement memory array using complementary resistive switches (CRS).
Edit intent: clarity
Original:  A possible device level solution to compensate this issue is to implement  memory array using complementary resistive switches (CRS).
Revised:  A possible device level solution to compensate this issue is to implement a memory array using complementary resistive switches (CRS).
Edit intent: fluency
Original:  Although the storage mechanism for  CRS is fundamentally different from what has been reported for memristors (low and high resistances), the device basics are similar .
Revised:  Although the storage mechanism for a CRS is fundamentally different from what has been reported for memristors (low and high resistances), the device basics are similar .
Edit intent: fluency
Original:  In this paper our intention is to introduce modeling principles that have been previously verified through measurements and extend the simulation principles based on memristors to CRS devices and hence provide an analytical approach to the design of  CRS array.
Revised:  In this paper our intention is to introduce modeling principles that have been previously verified through measurements and extend the simulation principles based on memristors to CRS devices and hence provide an analytical approach to the design of a CRS array.
Edit intent: fluency
Original:  We also present computational evidence that shows the efficacy of these inequalities used as cuts in a Branch Cut algorithm.
Revised:  We also present computational evidence that shows the efficacy of these inequalities used Cut algorithm.
Edit intent: clarity
Original:  These models and methods are realized in software systems ACCORD and Graphicord  .
Revised:  These models and methods are implemented in software systems ACCORD and Graphicord .
Edit intent: clarity
Original:  These models and methods are implemented in software systems ACCORD and Graphicord as well as in the distributed control system GAMOS used by Wingas, Germany.
Revised:  These models and methods are implemented in software systems ACCORD and Graphicord as well as in the distributed control system used by Wingas, Germany.
Edit intent: clarity
Original: Traditionally, parameter estimation in biophysical neuron and neural network models usually adopts a global search algorithm, often combined with a local search method in order to minimise the value of a cost function, which measures the discrepancy between various features of the available experimental data and model output.
Revised: Traditionally, parameter estimation in biophysical neuron and neural network models usually adopts a global search algorithm, often combined with a local search method in order to minimize the value of a cost function, which measures the discrepancy between various features of the available experimental data and model output.
Edit intent: fluency
Original:  The particular method we used was Kitagawa's self-organising state-space model, which was applied on a number of Hodgkin-Huxley models using simulated or actual electrophysiological data.
Revised:  The particular method we used was Kitagawa's self-organizing state-space model, which was applied on a number of Hodgkin-Huxley models using simulated or actual electrophysiological data.
Edit intent: fluency
Original:  Importantly, by combining the self-organising state-space model with an adaptive sampling algorithm akin to the Covariance Matrix Adaptation Evolution Strategy we achieved a significant reduction in the variance of parameter estimates.
Revised:  Importantly, by combining the self-organizing state-space model with an adaptive sampling algorithm akin to the Covariance Matrix Adaptation Evolution Strategy we achieved a significant reduction in the variance of parameter estimates.
Edit intent: fluency
Original: We design logical circuits based on the notion of zero forcing on graphs;
Revised: We design logic circuits based on the notion of zero forcing on graphs;
Edit intent: fluency
Original:  Finally, we show that zero forcing can be also used to implement reversible computation.
Revised:  Finally, we point out that zero forcing can be also used to implement reversible computation.
Edit intent: clarity
Original: Steepest descent preconditioning is considered for the recently proposed nonlinear generalized minimal residual (N-GMRES) optimization algorithm for unconstrained nonlinear optimization problems .
Revised: Steepest descent preconditioning is considered for the recently proposed nonlinear generalized minimal residual (N-GMRES) optimization algorithm for unconstrained nonlinear optimization .
Edit intent: clarity
Original:  Steepest descent preconditioning for N-GMRES optimization is also motivated by relating it to standard non-preconditioned GMRES for linear systems in the case of a standard quadratic optimization problem with symmetric positive definite operator.
Revised:  Steepest descent preconditioning for N-GMRES optimization is also motivated by relating it to standard non-preconditioned GMRES for linear systems in the case of a quadratic optimization problem with symmetric positive definite operator.
Edit intent: fluency
Original:  Moreover, performance of steepest-descent preconditioned N-GMRES is shown to be competitive with a standard nonlinear conjugate gradient method for the model problems considered.
Revised:  Moreover, performance of steepest-descent preconditioned N-GMRES is shown to be competitive with standard nonlinear conjugate gradient method for the model problems considered.
Edit intent: fluency
Original:  These results  theoretically and numerically establish steepest-descent preconditioned N-GMRES as a general optimization method for unconstrained nonlinear optimization, with performance that appears promising compared to established techniques.
Revised:  These results serve to theoretically and numerically establish steepest-descent preconditioned N-GMRES as a general optimization method for unconstrained nonlinear optimization, with performance that appears promising compared to established techniques.
Edit intent: clarity
Original: We present a set of tools for rewriting modulo associativity and commutativity  in Coq, solving a long-standing practical problem.
Revised: We present a set of tools for rewriting modulo associativity and commutativity (AC) in Coq, solving a long-standing practical problem.
Edit intent: clarity
Original:  We show that this problem is both NP-hard and fixed-parameter tractable with respect to k.
Revised:  We show that this problem is fixed-parameter tractable with respect to k.
Edit intent: clarity
Original:  16%DIFDELCMD < ] %%% that the tail of the equilibrium queue size decays doubly exponentially in the limit as N goes to infinity.
Revised:  %DIFDELCMD < ] %%% that the tail of the equilibrium queue size decays doubly exponentially in the limit as N goes to infinity.
Edit intent: fluency
Original:  The reasoning in 16%DIFDELCMD < ] %%% does not easily generalize to jobs with nonexponential service time distributions.
Revised:  The reasoning in %DIFDELCMD < ] %%% does not easily generalize to jobs with nonexponential service time distributions.
Edit intent: clarity
Original:  From this , we conclude that Maximum Matching can be expressed in ESO Logic with a first order part that is universal Horn , we can do the same for Maximum Independent Set and Maximum Clique .
Revised:  From this , we conclude that Maximum Matching can be expressed in ESO Logic with a first order part that is universal Horn we can do the same for Maximum Independent Set and Maximum Clique .
Edit intent: fluency
Original:  For problems in this category, we show that they cannot be expressed in existential second order (ESO) logic with a firstrst order part that is universal Horn (or simply, ESO \Pi_1 Horn) at the structure level, as opposed to machine level.
Revised:  For problems in this category, we show that they cannot be expressed in existential second order (ESO) logic with a first order part that is universal Horn (or simply, ESO \Pi_1 Horn) at the structure level, as opposed to machine level.
Edit intent: fluency
Original:  At the structure level, under ordered structures, least fixed point logic with counting (LFP+C) is also insufficient to capture P, the class of problems decidable in polynomial time.
Revised:  At the structure level, under ordered structures, least fixed point logic with counting (LFP+C) is insufficient to capture P, the class of problems decidable in polynomial time.
Edit intent: clarity
Original:  We also introduce new solutions to queries rarely considered in the literature such as two-dimensional quantiles, majorities, successor/predecessor and modequeries.
Revised:  We also introduce new solutions to queries less frequently considered in the literature such as two-dimensional quantiles, majorities, successor/predecessor and modequeries.
Edit intent: fluency
Original:  A graph G is called {\alpha}-linear if there exists an integral constant {\beta} such that e(G') \leq {\alpha} v(G')+{\beta} for each G'\subseteq G. In this paper, it is shown that every (1,{\lambda})-embedded graph G is 4-linear for all possible {\lambda}, and is acyclic (3{\Delta}(G)+70) -edge-choosable for {\lambda}=1,2.
Revised:  A graph G is called {\alpha}-linear if there exists an integral constant {\beta} such that e(G') \leq {\alpha} v(G')+{\beta} for each G'\subseteq G. In this paper, it is shown that every (1,{\lambda})-embedded graph G is 4-linear for all possible {\lambda}, and is acyclicly edge- (3{\Delta}(G)+70) -edge-choosable for {\lambda}=1,2.
Edit intent: clarity
Original:  A graph G is called {\alpha}-linear if there exists an integral constant {\beta} such that e(G') \leq {\alpha} v(G')+{\beta} for each G'\subseteq G. In this paper, it is shown that every (1,{\lambda})-embedded graph G is 4-linear for all possible {\lambda}, and is acyclic (3{\Delta}(G)+70) -edge-choosable for {\lambda}=1,2.
Revised:  A graph G is called {\alpha}-linear if there exists an integral constant {\beta} such that e(G') \leq {\alpha} v(G')+{\beta} for each G'\subseteq G. In this paper, it is shown that every (1,{\lambda})-embedded graph G is 4-linear for all possible {\lambda}, and is acyclic (3{\Delta}(G)+70) -choosable for {\lambda}=1,2.
Edit intent: clarity
Original:  A market for derivatives, which has all the features of a perfect market except completeness and has some risk neutral investors, may exhibit almost surely extreme price movements which represent a violation to the Gaussian random walk hypothesis.
Revised:  A market for derivatives, which has all the features of a perfect market except completeness and has some risk neutral investors, can exhibit extreme price movements which represent a violation to the Gaussian random walk hypothesis.
Edit intent: clarity
Original:  The same theorem, together with our first result, also a yields a converse to the algebraic stability theorem of [11];
Revised:  The same theorem, together with our first result, also yields a converse to the algebraic stability theorem of [11];
Edit intent: fluency
Original: Building on an idea of  Chazal et al. 11 , we introduce and study the interleaving distance , a pseudometric on isomorphism classes of  multidimensional persistence modules.
Revised: In Chazal et al. 11 , we introduce and study the interleaving distance , a pseudometric on isomorphism classes of multidimensional persistence modules.
Edit intent: coherence
Original: Building on an idea of  Chazal et al. 11 , we introduce and study the interleaving distance , a pseudometric on isomorphism classes of  multidimensional persistence modules.
Revised: Building on an idea of Chazal et al. , we introduce and study the interleaving distance , a pseudometric on isomorphism classes of multidimensional persistence modules.
Edit intent: coherence
Original:  Fourth, we introduce several notions of optimality of metrics on persistence modules and show that when the underlying field is the field of rational numbers or a field of prime order, the interleaving distance is optimal with respect to one of these notions.
Revised:  Fourth, we introduce several notions of optimality of metrics on persistence modules and show that when the underlying field is the rational numbers or a field of prime order, the interleaving distance is optimal with respect to one of these notions.
Edit intent: fluency