wanyu/IteraTeR_v2 huggingface dataset:
Original: As the Internet faces scalability, mobility, and security issues, new network architectures are being proposed to better accommodate the needs of modern  applications.
Revised: As the Internet faces scalability, mobility, and security issues, new network architectures are being proposed to better accommodate the needs of modern systems and applications.
Edit intent: clarity
Original:  It comes with a potential for a wide range of benefits, including reduced congestion and improved delivery speed by means of content caching, simpler configuration of network devices, and security at the data level.
Revised:  CON comes with a potential for a wide range of benefits, including reduced congestion and improved delivery speed by means of content caching, simpler configuration of network devices, and security at the data level.
Edit intent: fluency
Original:  In this paper, we present a systematic privacy analysis of CON and the common building blocks among its various architectural instances , in order to highlight emerging privacy threats  and analyze a few potential countermeasures.
Revised:  In this paper, we provide a systematic privacy analysis of CON and the common building blocks among its various architectural instances , in order to highlight emerging privacy threats and analyze a few potential countermeasures.
Edit intent: clarity
Original:  In this paper, we present a systematic privacy analysis of CON and the common building blocks among its various architectural instances , in order to highlight emerging privacy threats  and analyze a few potential countermeasures.
Revised:  In this paper, we present a systematic privacy analysis of CON and the common building blocks among its various architectural instances in order to highlight emerging privacy threats and analyze a few potential countermeasures.
Edit intent: fluency
Original:  In this paper, we present a systematic privacy analysis of CON and the common building blocks among its various architectural instances , in order to highlight emerging privacy threats  and analyze a few potential countermeasures.
Revised:  In this paper, we present a systematic privacy analysis of CON and the common building blocks among its various architectural instances , in order to highlight emerging privacy threats , and analyze a few potential countermeasures.
Edit intent: fluency
Original:  Finally, we compare the feasibility and effectiveness of privacy-enhancing technologies in CON as opposed to today's Internet , and conclude by identifying a list of open research challenges .
Revised:  Finally, we present a comparison between CON and today's Internet , and conclude by identifying a list of open research challenges .
Edit intent: clarity
Original:  Our results show that  the differences between the wall shear stress predicted by a Newtonian model and the well known Carreau-Yasuda generalized Newtonian model are only significant if the vascular pathology under study is associated with a pathological threshold in the range 0.94 Pa to 1.56 Pa, where the results of the TBD analysis of the rheology models considered differs.
Revised:  Our results show that , in the model under study, the differences between the wall shear stress predicted by a Newtonian model and the well known Carreau-Yasuda generalized Newtonian model are only significant if the vascular pathology under study is associated with a pathological threshold in the range 0.94 Pa to 1.56 Pa, where the results of the TBD analysis of the rheology models considered differs.
Edit intent: clarity
Original:  We observe similar biomimetic beating behaviorin silico by clamping an active filament at one end and solving for hydrodynamics interactions.
Revised:  We observe similar biomimetic beating behavior by clamping an active filament at one end and solving for hydrodynamics interactions.
Edit intent: clarity
Original:  Recently, Constantinescu and Ilie (Bulletin EATCS 89, 167--170, 2006) introduced the notion of  Abelian period .
Revised:  Recently, Constantinescu and Ilie (Bulletin EATCS 89, 167--170, 2006) introduced the notion of an Abelian period .
Edit intent: fluency
Original:  However, to the best of our knowledge, no efficient algorithm is known for computing these periods.
Edit intent: coherence
Original:  In particular, it is well known that Maximum-Distance-Separable (MDS) codes, such as Reed-Solomon codes, provide the maximum storage efficiency  .
Revised:  In particular, it is well known that Maximum-Distance-Separable (MDS) codes, such as Reed-Solomon codes, provide the maximum storage efficiency in distributed storage systems .
Edit intent: clarity
Original:  While the use of codes for providing improved reliability in archival storage systems, where the data is less frequently accessed (or so-called "cold data") , is well understood, the role of codes in the storage of more frequently accessed and active "hot data" is less clear.
Revised:  While the use of codes for providing improved reliability in archival storage systems, where the data is less frequently accessed , is well understood, the role of codes in the storage of more frequently accessed and active "hot data" is less clear.
Edit intent: clarity
Original:  In this paper, we answer this question in the affirmative by studying coded data storage systems based on MDS codes through the lens of queueing theory, and term this the "MDS queue."
Revised:  In this paper, we study storage systems based on MDS codes through the lens of queueing theory, and term this the "MDS queue."
Edit intent: clarity
Original:  In our analysis of MDS queues, we present insightful scheduling policies that form upper and lower bounds to performance , and show that they are quite tight . Extensive simulations of the MDS queue using Markov-Chain-Monte-Carlo (MCMC) methods are also provided and used to validate our theoretical analysis.
Revised:  In our analysis of MDS queues, we present insightful scheduling policies that form upper and lower bounds to performance . Extensive simulations of the MDS queue using Markov-Chain-Monte-Carlo (MCMC) methods are also provided and used to validate our theoretical analysis.
Edit intent: coherence
Original:  In our analysis of MDS queues, we present insightful scheduling policies that form upper and lower bounds to performance , and show that they are quite tight . Extensive simulations of the MDS queue using Markov-Chain-Monte-Carlo (MCMC) methods are also provided and used to validate our theoretical analysis.
Revised:  In our analysis of MDS queues, we present insightful scheduling policies that form upper and lower bounds to performance , and show that they are quite tight . Extensive simulations are also provided and used to validate our theoretical analysis.
Edit intent: clarity
Original: It is well known that Maximum-Distance-Separable (MDS) codes, such as Reed-Solomon codes, provide the maximum storage efficiency in distributed storage systems .
Revised: It is well known that Maximum-Distance-Separable (MDS) codes, such as Reed-Solomon codes, provide the maximum storage efficiency .
Edit intent: clarity
Original:  In this paper, we study  storage systems based on MDS codes through the lens of queueing theory, and term this the "MDS queue."
Revised:  In this paper, we study data storage systems based on MDS codes through the lens of queueing theory, and term this the "MDS queue."
Edit intent: fluency
Original: Affective video indexing is the area of research that develops techniques to automatically generate descriptions  that encode the emotional reactions which videos evoke in viewers.
Revised: Affective video indexing is the area of research that develops techniques to automatically generate descriptions of video content that encode the emotional reactions which videos evoke in viewers.
Edit intent: clarity
Original: Affective video indexing is the area of research that develops techniques to automatically generate descriptions  that encode the emotional reactions which videos evoke in viewers.
Revised: Affective video indexing is the area of research that develops techniques to automatically generate descriptions that encode the emotional reactions which the video content evokes in viewers.
Edit intent: clarity
Original:  This paper provides a set of corpus development specifications based on state-of-the-art practice intended to support researchers in this field.
Revised:  This paper provides a set of corpus development guidelines based on state-of-the-art practice intended to support researchers in this field.
Edit intent: clarity
Original:  Affective video indexing faces unique challenges, since viewer-reported affective reactions are difficult to collect, and collection efforts must be carefully designed in order to both cover the full scope of affective response and also capture its stability .
Revised:  Affective video indexing faces unique challenges, since viewer-reported affective reactions are difficult to assess. Moreover affect assessment efforts must be carefully designed in order to both cover the full scope of affective response and also capture its stability .
Edit intent: coherence
Original:  Affective video indexing faces unique challenges, since viewer-reported affective reactions are difficult to collect, and collection efforts must be carefully designed in order to both cover the full scope of affective response and also capture its stability .
Revised:  Affective video indexing faces unique challenges, since viewer-reported affective reactions are difficult to collect, and collection efforts must be carefully designed in order to both cover the types of affective responses that video content evokes in viewers and also capture its stability .
Edit intent: clarity
Original:  Affective video indexing faces unique challenges, since viewer-reported affective reactions are difficult to collect, and collection efforts must be carefully designed in order to both cover the full scope of affective response and also capture its stability .
Revised:  Affective video indexing faces unique challenges, since viewer-reported affective reactions are difficult to collect, and collection efforts must be carefully designed in order to both cover the full scope of affective response and also capture the stable and consistent aspects of these responses .
Edit intent: clarity
Original:  Three dimensions emerge as critical for affective video corpora, and form the basis for our proposed specifications : the context of viewer response, personal variation among viewers, and the effectiveness and efficiency of corpus creation.
Revised:  Three dimensions emerge as critical for affective video corpora, and form the basis for our proposed guidelines : the context of viewer response, personal variation among viewers, and the effectiveness and efficiency of corpus creation.
Edit intent: clarity
Original:  Finally, we present examples of three recent corpora and discuss how these corpora make progressive steps towards fulfilling the specifications .
Revised:  Finally, we present examples of three recent corpora and discuss how these corpora make progressive steps towards fulfilling the guidelines .
Edit intent: clarity
Original:  We prove that the resulting algorithm runs in polynomial time with approximation bound e\log(md) +\frac{e\log(e){\ln(md)+1} }  which is in O(\ln(md)) . This improves the O(\ln^2d) bound of the existing polynomial time algorithm for VS  .
Revised:  We prove that the resulting algorithm runs in polynomial time with approximation bound e\log(md) +\frac{e\log(e){\ln(md)+1} } , which is in O(\ln(md)) . This improves the O(\ln^2d) bound of the existing polynomial time algorithm for VS .
Edit intent: fluency
Original: This paper describes about "Almost all monotone circuit family" and introduce its interesting advantages to measuring problem complexity . Explained in Michael Sipser "Introduction to the Theory of COMPUTATION", circuit family that emulate Deterministic Turing machine (DTM)  are almost all monotone circuit family except some NOT-gate that connect input variables (like negation normal form (NNF)).
Revised: This paper describes about "Almost all monotone circuit family" and introduce its interesting advantages to measuring problem complexity . Explained in Michael Sipser "Introduction to the Theory of COMPUTATION", circuit family that emulate Deterministic Turing machine (DTM) . Circuit family that emulate DTM are almost all monotone circuit family except some NOT-gate that connect input variables (like negation normal form (NNF)).
Edit intent: fluency
Original: This paper describes about "Almost all monotone circuit family" and introduce its interesting advantages to measuring problem complexity . Explained in Michael Sipser "Introduction to the Theory of COMPUTATION", circuit family that emulate Deterministic Turing machine (DTM)  are almost all monotone circuit family except some NOT-gate that connect input variables (like negation normal form (NNF)).
Revised: This paper describes about "Almost all monotone circuit family" and introduce its interesting advantages to measuring problem complexity . Explained in Michael Sipser "Introduction to the Theory of COMPUTATION", circuit family that emulate Deterministic Turing machine (DTM) are almost all monotone circuit family except some NOT-gate which connect input variables (like negation normal form (NNF)).
Edit intent: fluency
Original: Many HIV patients now have access to combination antiretroviral treatment (ART)  .
Revised: Access to combination antiretroviral treatment (ART) .
Edit intent: clarity
Original:  In the last decades  HIV treatments have become better and better at slowing down the evolution of drug resistance, so that some patients are treated for many years without having any resistance problems.
Revised:  In the last decades , HIV treatments have become better and better at slowing down the evolution of drug resistance, so that some patients are treated for many years without having any resistance problems.
Edit intent: fluency
Original: The paper investigates the properties of a class of resource allocation algorithms for communication networks: if a node of this network has x requests to transmit, then it receives a fraction of the capacity proportional to log (1+x), the logarithm of its current load.
Revised: The paper investigates the properties of a class of resource allocation algorithms for communication networks: if a node of this network has x requests to transmit, then it receives a fraction of the capacity proportional to \log (1+x), the logarithm of its current load.
Edit intent: fluency
Original:  A  fluid scaling analysis of such a network  is presented.
Revised:  A detailed fluid scaling analysis of such a network is presented.
Edit intent: clarity
Original:  As a consequence, the associated stochastic processes turn out to have unusual scaling behaviors which give an interesting fairness property to this class of algorithms .
Revised:  As a consequence, the associated stochastic processes turn out to have unusual scaling behaviors .
Edit intent: clarity
Original:  Finally, we consider a variant of the problem, in which a given polynomial-time mixed-state quantum circuit accepts a quantum state as input, and the question is to decide if there is an input to this circuit which makes its output separable across some bipartite cut.
Revised:  We consider a variant of the problem, in which a given polynomial-time mixed-state quantum circuit accepts a quantum state as input, and the question is to decide if there is an input to this circuit which makes its output separable across some bipartite cut.
Edit intent: coherence
Original:  We prove that this latter problem is a complete promise problem for the class QIP of problems decidable by quantum interactive proof systems  .
Revised:  We prove that this problem is a complete promise problem for the class QIP of problems decidable by quantum interactive proof systems .
Edit intent: clarity
Original:  We  consider a variant of the problem, in which a given polynomial-time mixed-state quantum circuit accepts a quantum state as input, and the question is to decide if there is an input to this circuit which makes its output separable across some bipartite cut.
Revised:  We also consider a variant of the problem, in which a given polynomial-time mixed-state quantum circuit accepts a quantum state as input, and the question is to decide if there is an input to this circuit which makes its output separable across some bipartite cut.
Edit intent: coherence
Original:  Furthermore, we analyze the effects of different system parameters on the connectivity of the network through simulation and analysis.
Revised:  Furthermore, we investigate the effects of different system parameters on the connectivity of the network through simulation and analysis.
Edit intent: fluency
Original: We prove that the)n^2-}\big( 2p-2{p-1}\big) rank of the n\times n matrix multiplication is at least 3n^2-22n^3/2-3n.
Revised: We prove that the)n^2-}\big( 2p-2{p-1}\big)n for the rank of the n\times n matrix multiplication is at least 3n^2-22n^3/2-3n.
Edit intent: clarity
Original:  The previous bounds were 3n^2-4n^{2/3)n^2-}\big(2p{p}\big) due to Landsberg and 5/2n ^2-3n due to Blaser.
Revised:  The previous bounds were 3n^2-4n^{2/3)n^2-}\big(2p{p}\big)n due to Landsberg and 5/2n ^2-3n due to Blaser.
Edit intent: fluency
Original: We consider the problem of achieving average consensus with linear iterations in optimal time on a fixed, undirected graph.
Revised: We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph.
Edit intent: clarity
Original: Central Counterparties (CCPs) are widely promoted as a requirement for safe  with little dissent except on technical grounds (such as proliferation of CCPs).
Revised: Central Counterparties (CCPs) are widely promoted as a requirement for safe banking with little dissent except on technical grounds (such as proliferation of CCPs).
Edit intent: clarity
Original:  In the operational semantics based on provability, executing the additive-conjunctive goal G_1  G_2 from a program %DIFDELCMD < \Pscr %%%  simply terminates with a success if both G_1 and G_2 are solvable from %DIFDELCMD < \Pscr%%%  . This is an unsatisfactory situation, as a central action of  -- the action of choosing either G_1 or G_2 by the user -- is missing in this semantics.
Revised:  In the operational semantics based on provability, executing the additive-conjunctive goal G_1 G_2 from a program %DIFDELCMD < \Pscr %%% P simply terminates with a success if both G_1 and G_2 are solvable from %DIFDELCMD < \Pscr%%% . This is an unsatisfactory situation, as a central action of -- the action of choosing either G_1 or G_2 by the user -- is missing in this semantics.
Edit intent: clarity
Original:  In the operational semantics based on provability, executing the additive-conjunctive goal G_1  G_2 from a program %DIFDELCMD < \Pscr %%%  simply terminates with a success if both G_1 and G_2 are solvable from %DIFDELCMD < \Pscr%%%  . This is an unsatisfactory situation, as a central action of  -- the action of choosing either G_1 or G_2 by the user -- is missing in this semantics.
Revised:  In the operational semantics based on provability, executing the additive-conjunctive goal G_1 G_2 from a program %DIFDELCMD < \Pscr %%% simply terminates with a success if both G_1 and G_2 are solvable from %DIFDELCMD < \Pscr%%% P . This is an unsatisfactory situation, as a central action of -- the action of choosing either G_1 or G_2 by the user -- is missing in this semantics.
Edit intent: clarity
Original: We present a linear time certifying algorithm that tests graphs for 3-edge-connectivity  .
Revised: We present a linear time certifying algorithm that tests graphs for 3-edge-connectivity ; the algorithm works in linear time .
Edit intent: coherence
Original:  If the input graph is 3-edge-connected, the algorithm returns a construction sequence that constructs the graph starting from the graph with two nodes and three parallel edges using only operations that  preserve 3-edge-connectivity.
Revised:  If it is 3-edge-connected, the algorithm returns a construction sequence that constructs the graph starting from the graph with two nodes and three parallel edges using only operations that preserve 3-edge-connectivity.
Edit intent: clarity
Original:  If the input graph is 3-edge-connected, the algorithm returns a construction sequence that constructs the graph starting from the graph with two nodes and three parallel edges using only operations that  preserve 3-edge-connectivity.
Revised:  If the input graph is 3-edge-connected, it returns a construction sequence that constructs the graph starting from the graph with two nodes and three parallel edges using only operations that preserve 3-edge-connectivity.
Edit intent: clarity
Original:  If the input graph is 3-edge-connected, the algorithm returns a construction sequence that constructs the graph starting from the graph with two nodes and three parallel edges using only operations that  preserve 3-edge-connectivity.
Revised:  If the input graph is 3-edge-connected, the algorithm returns a construction sequence that constructs the input graph from the graph with two nodes and three parallel edges using only operations that preserve 3-edge-connectivity.
Edit intent: clarity
Original:  If the input graph is 3-edge-connected, the algorithm returns a construction sequence that constructs the graph starting from the graph with two nodes and three parallel edges using only operations that  preserve 3-edge-connectivity.
Revised:  If the input graph is 3-edge-connected, the algorithm returns a construction sequence that constructs the graph starting from the graph with two vertices and three parallel edges using only operations that preserve 3-edge-connectivity.
Edit intent: clarity
Original:  No previous algorithm returned a certificate in the case of a 3-edge-connected input graph.
Revised:  Additionally, we show how compute and certify the 3-edge-connected input graph.
Edit intent: coherence
Original: Visual distortions of perceived lengths, angles, or forms, are generally known as " geometric--optical illusions" (GOI).
Revised: Visual distortions of perceived lengths, angles, or forms, are generally known as " geometric-optical illusions" (GOI).
Edit intent: fluency
Original:  In the present paper we focus on a class of GOI s where the distortion of a straight line segment (the "target" stimulus) is induced by an array of non-intersecting curvilinear elements ("context" stimulus).
Revised:  In the present paper we focus on a class of s where the distortion of a straight line segment (the "target" stimulus) is induced by an array of non-intersecting curvilinear elements ("context" stimulus).
Edit intent: clarity
Original:  In the present paper we focus on a class of GOI s where the distortion of a straight line segment (the "target" stimulus) is induced by an array of non-intersecting curvilinear elements ("context" stimulus).
Revised:  In the present paper we focus on a class of GOI GOIs where the distortion of a straight line segment (the "target" stimulus) is induced by an array of non-intersecting curvilinear elements ("context" stimulus).
Edit intent: fluency
Original:  Assuming local target--context interactions in a vector field representation of the context, we propose to model the perceptual distortion of the target as the solution to a minimization problem in the calculus of variations.
Revised:  Assuming local target-context interactions in a vector field representation of the context, we propose to model the perceptual distortion of the target as the solution to a minimization problem in the calculus of variations.
Edit intent: fluency
Original: Recent works have validated the possibility of energy efficiency improvement in radio access networks ( RAN), depending on dynamically turn on/off some base stations (BSs).
Revised: Recent works have validated the possibility of improving energy efficiency in radio access networks ( RAN), depending on dynamically turn on/off some base stations (BSs).
Edit intent: fluency