wanyu/IteraTeR_v2 huggingface dataset:
Original: We discuss a new non-linear advection-dispersion equation u_t + (2 u _{xx /u) u_x = epsilon u _{xxx , invariant under scaling of dependent variable and referred to here as SIdV.
Revised: We discuss a new non-linear PDE, u_t + (2 u _{xx /u) u_x = epsilon u _{xxx , invariant under scaling of dependent variable and referred to here as SIdV.
Edit intent: clarity
Original: We discuss a new non-linear advection-dispersion equation u_t + (2 u _{xx /u) u_x = epsilon u _{xxx , invariant under scaling of dependent variable and referred to here as SIdV.
Revised: We discuss a new non-linear advection-dispersion equation u_t + (2 u _xx /u) u_x = epsilon u _{xxx , invariant under scaling of dependent variable and referred to here as SIdV.
Edit intent: fluency
Original: We discuss a new non-linear advection-dispersion equation u_t + (2 u _{xx /u) u_x = epsilon u _{xxx , invariant under scaling of dependent variable and referred to here as SIdV.
Revised: We discuss a new non-linear advection-dispersion equation u_t + (2 u _{xx /u) u_x = epsilon u _xxx , invariant under scaling of dependent variable and referred to here as SIdV.
Edit intent: fluency
Original:   This PDE (with dispersion coefficient unity) was discovered in a genetic programming search for equations sharing the Korteweg-de Vries (KdV ) solitary wave solution.
Revised:  This PDE (with dispersion coefficient unity) was discovered in a genetic programming search for equations sharing the KdV solitary wave solution.
Edit intent: clarity
Original:  Nevertheless, SIdV possesses solitary and periodic travelling waves and recurrence properties usually associated with integrable systems.
Revised:  Nevertheless, it possesses solitary and periodic travelling waves and recurrence properties usually associated with integrable systems.
Edit intent: clarity
Original:  This novel equation (and its higher-dimensional and complex generalizations ) may find applications in physics and engineering and also be a rich source for further numerical and analytical explorations.
Revised:  This novel equation (and its higher-dimensional and complex generalizations ) may find applications in physics and engineering and also be a rich source for further explorations.
Edit intent: clarity
Original:  This paper explores the opportunity for cost saving  and proposes a novel approach for capacity provisioning under bounded latency requirements for the workload.
Revised:  This paper explores the opportunity for cost saving and proposes a novel approach for capacity provisioning under bounded latency requirements of the workload.
Edit intent: fluency
Original:  We validate our algorithms on synthetic workload generated from two real HTTP traces and show that they actually perform much better in practice than the worst case , resulting in 20-40\% cost-savings.
Revised:  We validate our algorithms on synthetic workload generated from two real HTTP traces and show that the algorithms actually perform much better in practice than the worst case , resulting in 20-40\% cost-savings.
Edit intent: clarity
Original: The statistical leverage scores of a matrix A are the squared row-norms of the matrix containing its (top) left singular vectors and the coherence is the largest leverage score.
Revised: The statistical leverage scores of a matrix A are the squared row-norms of the matrix containing its (top) left singular vectors and the coherence is the largest leverage score.
Edit intent: fluency
Original:  These quantities have been of interest in recently-popular problems such as matrix completion and Nystr\"{o}m-based low-rank matrix approximation ;
Revised:  These quantities are of interest in recently-popular problems such as matrix completion and Nystr\"{o}m-based low-rank matrix approximation ;
Edit intent: clarity
Original:  and since they define the key structural nonuniformity that must be dealt with in developing fast randomized matrix algorithms.
Revised:  moreover, they are of interest since they define the key structural nonuniformity that must be dealt with in developing fast randomized matrix algorithms.
Edit intent: clarity
Original:  Our main result is a randomized algorithm that takes as input an arbitrary n \times d matrix A, with n \gg d, and that returns as output relative-error approximations to all n of the statistical leverage scores.
Revised:  Our main result is a randomized algorithm that takes as input an arbitrary n \times d matrix A, with n \gg d, and that returns as output relative-error approximations to all n of the statistical leverage scores.
Edit intent: fluency
Original:  Our analysis may be viewed in terms of computing a relative-error approximation to an under constrained least-squares approximation problem, or, relatedly, it may be viewed as an application of Johnson-Lindenstrauss type ideas.
Revised:  Our analysis may be viewed in terms of computing a relative-error approximation to an constrained least-squares approximation problem, or, relatedly, it may be viewed as an application of Johnson-Lindenstrauss type ideas.
Edit intent: clarity
Original:  Our analysis may be viewed in terms of computing a relative-error approximation to an under constrained least-squares approximation problem, or, relatedly, it may be viewed as an application of Johnson-Lindenstrauss type ideas.
Revised:  Our analysis may be viewed in terms of computing a relative-error approximation to an under underconstrained least-squares approximation problem, or, relatedly, it may be viewed as an application of Johnson-Lindenstrauss type ideas.
Edit intent: fluency
Original:  We give the first polynomial time combinatorial algorithm for solving corresponding optimization problems, finding a epsilon-approximate solution in O(m(m+\log n)\log(MUm/epsilon)) arithmetic operations and value oracle queries, where M and U are upper bounds on simple parameters.
Revised:  We give the first polynomial time combinatorial algorithm for solving corresponding optimization problems, finding an epsilon-approximate solution in O(m(m+\log n)\log(MUm/epsilon)) arithmetic operations and value oracle queries, where M and U are upper bounds on simple parameters.
Edit intent: fluency
Original:  For (linear) generalized flows, our algorithm can be seen as a variant of the highest-gain augmenting path algorithm by Goldfarb, Jin and Orlin.
Revised:  For (linear) generalized flows, our algorithm can be seen as an extension of the highest-gain augmenting path algorithm by Goldfarb, Jin and Orlin.
Edit intent: clarity
Original:  Our result immediately enables us to extend these market models to more general settings and to solve some open problems in the literature .
Revised:  Our result immediately extends these market models to more general settings and to solve some open problems in the literature .
Edit intent: clarity
Original:  We give the first polynomial time combinatorial algorithm for solving corresponding flow maximization problems, finding an epsilon-approximate solution in O(m(m+ \log n)\log (MUm/epsilon)) arithmetic operations and value oracle queries, where M and U are upper bounds on simple parameters.
Revised:  We give a polynomial time combinatorial algorithm for solving corresponding flow maximization problems, finding an epsilon-approximate solution in O(m(m+ \log n)\log (MUm/epsilon)) arithmetic operations and value oracle queries, where M and U are upper bounds on simple parameters.
Edit intent: clarity
Original: In a Markovian stochastic volatility model, we consider financial agents whose investment criteria are modelled by forward exponential performance processes.
Revised: In a Markovian stochastic volatility model, we consider ?nancial agents whose investment criteria are modelled by forward exponential performance processes.
Edit intent: fluency
Original:  The problem of contingent claim indifference valuation is first addressed and a number of properties are proved and discussed.
Revised:  The problem of contingent claim indi?fference valuation is ? first addressed and a number of properties are proved and discussed.
Edit intent: fluency
Original:  Special attention is taken on the comparison between the forward and backward indifference valuation.
Revised:  Special attention is given to the comparison between the forward and backward indifference valuation.
Edit intent: clarity
Original:  Special attention is taken on the comparison between the forward and backward indifference valuation.
Revised:  Special attention is taken on the comparison between the forward exponential and the backward exponential utility indiff?erence valuation.
Edit intent: clarity
Original:  In addition, we initiate the problem of optimal risk sharing on this forward setting and we solve it when the agents' forward performance criteria are exponential.
Revised:  In addition, we construct the problem of optimal risk sharing on this forward setting and we solve it when the agents' forward performance criteria are exponential.
Edit intent: clarity
Original:  In addition, we initiate the problem of optimal risk sharing on this forward setting and we solve it when the agents' forward performance criteria are exponential.
Revised:  In addition, we initiate the problem of optimal risk sharing in this forward setting and we solve it when the agents' forward performance criteria are exponential.
Edit intent: clarity
Original:  In addition, we initiate the problem of optimal risk sharing on this forward setting and we solve it when the agents' forward performance criteria are exponential.
Revised:  In addition, we initiate the problem of optimal risk sharing on this forward setting and solve it when the agents' forward performance criteria are exponential.
Edit intent: fluency
Original: In a Markovian stochastic volatility model, we consider ?nancial agents whose investment criteria are modelled by forward exponential performance processes.
Revised: In a Markovian stochastic volatility model, we consider financial agents whose investment criteria are modelled by forward exponential performance processes.
Edit intent: fluency
Original:  The problem of contingent claim indi?fference valuation is ? first addressed and a number of properties are proved and discussed.
Revised:  The problem of contingent claim indifference valuation is first addressed and a number of properties are proved and discussed.
Edit intent: fluency
Original:  Special attention is given to the comparison between the forward exponential and the backward exponential utility indiff?erence valuation.
Revised:  Special attention is given to the comparison between the forward exponential and the backward exponential utility indifference valuation.
Edit intent: fluency
Original: This theoretical paper proposes a neuronal circuitry layout and synaptic plasticity principles that allow the (pyramidal) neuron to act as a combinatorial switch, whereby the neuron learns to be more prone to generate spikes given those combinations of firing input neurons for which a previous spiking of the neuron had been followed by  positive emotional response;
Revised: This theoretical paper proposes a neuronal circuitry layout and synaptic plasticity principles that allow the (pyramidal) neuron to act as a combinatorial switch, whereby the neuron learns to be more prone to generate spikes given those combinations of firing input neurons for which a previous spiking of the neuron had been followed by a positive emotional response;
Edit intent: fluency
Original:  the emotional response , it is posited, is mediated by certain modulatory neurotransmitters or hormones.
Revised:  the emotional response is mediated by certain modulatory neurotransmitters or hormones.
Edit intent: clarity
Original:  More generally, a trial-and-error learning paradigm is suggested in which the purpose of emotions is to trigger a mechanism of long-term enhancement or weakening of a neuron's spiking response to the preceding synaptic input firing pattern.
Revised:  More generally, a trial-and-error learning paradigm is suggested in which the purpose of emotions is to trigger long-term enhancement or weakening of a neuron's spiking response to the preceding synaptic input firing pattern.
Edit intent: clarity
Original:  Thus, emotions provide a feedback pathway that informs neurons whether their spiking was beneficial or detrimental given the combinationof inputs .
Revised:  Thus, emotions provide a feedback pathway that informs neurons whether their spiking was beneficial or detrimental for a particular input combination .
Edit intent: clarity
Original:  The neuron's ability to discern specific combinations of firing input neurons is achieved through  random or predetermined spatial distribution of input synapses on dendrites that results in synaptic clusters that represent various permutations of input neurons.
Revised:  The neuron's ability to discern specific combinations of firing input neurons is achieved through a random or predetermined spatial distribution of input synapses on dendrites that results in synaptic clusters that represent various permutations of input neurons.
Edit intent: fluency
Original:  The neuron's ability to discern specific combinations of firing input neurons is achieved through  random or predetermined spatial distribution of input synapses on dendrites that results in synaptic clusters that represent various permutations of input neurons.
Revised:  The neuron's ability to discern specific combinations of firing input neurons is achieved through random or predetermined spatial distribution of input synapses on dendrites that creates synaptic clusters that represent various permutations of input neurons.
Edit intent: clarity
Original:  Such nonlinear excitation corresponds to a particular firing combination of input neurons, and it is posited that its strength reflects the combinatorial memory and is regulated by long-term plasticity mechanisms.
Revised:  Such nonlinear excitation corresponds to a particular firing combination of input neurons, and it is posited that the excitation strength reflects the combinatorial memory and is regulated by long-term plasticity mechanisms.
Edit intent: fluency
Original:  It is also suggested that the spine calcium influx that may result from the spatiotemporal synaptic input coincidence may cause the spine head actin filaments to undergo mechanical (muscle-like) contraction, with the ensuing cytoskeletal deformation transmitted to the axon hillock where it may ...
Revised:  It is also suggested that the spine calcium influx that may result from the spatiotemporal synaptic input coincidence may cause the spine head actin filaments to undergo mechanical (muscle-like) contraction, with the ensuing cytoskeletal deformation transmitted to the axon initial segment ...
Edit intent: clarity
Original: This theoretical paper proposes a neuronal circuitry layout and synaptic plasticity principles that allow the (pyramidal) neuron to act as a combinatorial switch, whereby the neuron learns to be more prone to generate spikes given those combinations of firing input neurons for which a previous spiking of the neuron had been followed by a positive emotional response;
Revised: This paper proposes a neuronal circuitry layout and synaptic plasticity principles that allow the (pyramidal) neuron to act as a combinatorial switch, whereby the neuron learns to be more prone to generate spikes given those combinations of firing input neurons for which a previous spiking of the neuron had been followed by a positive emotional response;
Edit intent: clarity
Original: This theoretical paper proposes a neuronal circuitry layout and synaptic plasticity principles that allow the (pyramidal) neuron to act as a combinatorial switch, whereby the neuron learns to be more prone to generate spikes given those combinations of firing input neurons for which a previous spiking of the neuron had been followed by a positive emotional response;
Revised: This theoretical paper proposes a neuronal circuitry layout and synaptic plasticity principles that allow the (pyramidal) neuron to act as a "combinatorial switch". Namely, the neuron learns to be more prone to generate spikes given those combinations of firing input neurons for which a previous spiking of the neuron had been followed by a positive emotional response;
Edit intent: coherence
Original:  More generally, a trial-and-error learning paradigm is suggested in which the purpose of emotions is to trigger long-term enhancement or weakening of a neuron's spiking response to the preceding synaptic input firing pattern.
Revised:  More generally, a trial-and-error learning paradigm is suggested in which a global reward signal triggers long-term enhancement or weakening of a neuron's spiking response to the preceding synaptic input firing pattern.
Edit intent: clarity
Original:  More generally, a trial-and-error learning paradigm is suggested in which the purpose of emotions is to trigger long-term enhancement or weakening of a neuron's spiking response to the preceding synaptic input firing pattern.
Revised:  More generally, a trial-and-error learning paradigm is suggested in which the purpose of emotions is to trigger long-term enhancement or weakening of a neuron's spiking response to the preceding neuronal input firing pattern.
Edit intent: clarity
Original:  Thus, emotions provide a feedback pathway that informs neurons whether their spiking was beneficial or detrimental for a particular input combination.
Revised:  Thus, rewards provide a feedback pathway that informs neurons whether their spiking was beneficial or detrimental for a particular input combination.
Edit intent: clarity
Original:  Such nonlinear excitation corresponds to a particular firing combination of input neurons, and it is posited that the excitation strength reflects the combinatorial memory and is regulated by long-term plasticity mechanisms.
Revised:  Such nonlinear excitation corresponds to a particular firing combination of input neurons, and it is posited that the excitation strength encodes the combinatorial memory and is regulated by long-term plasticity mechanisms.
Edit intent: clarity
Original:  It is also suggested that the spine calcium influx that may result from the spatiotemporal synaptic input coincidence may cause the spine head actin filaments to undergo mechanical (muscle-like) contraction, with the ensuing cytoskeletal deformation transmitted to the axon initial segment  ...
Revised:  It is also suggested that the spine calcium influx that may result from the spatiotemporal synaptic input coincidence may cause the spine head actin filaments to undergo mechanical (muscle-like) contraction, with the ensuing cytoskeletal deformation transmitted to the axon initial segment where it may ...
Edit intent: clarity
Original: We propose and analyze a novel way for increasing the area spectral efficiency of video transmission in cellular communications systems.
Revised: Video on-demand streaming from Internet-based servers is becoming one of the most important services offered by wireless networks today. In order to improve the area spectral efficiency of video transmission in cellular communications systems.
Edit intent: coherence
Original:  We analyze the optimum way of assigning files to the different helpers, in order to minimize the expected file downloading time for files.
Revised:  We analyze the optimum way of assigning files to the helpers, in order to minimize the expected file downloading time for files.
Edit intent: clarity
Original:  We analyze the optimum way of assigning files to the different helpers, in order to minimize the expected file downloading time for files.
Revised:  We analyze the optimum way of assigning files to the different helpers, in order to minimize the expected downloading time for files.
Edit intent: fluency
Original:  We show that for the uncoded files, the optimum file assignment is NP-hard, and develop a greedy strategy that is provably within a factor 2 of the optimum.
Revised:  We show that the uncoded optimum file assignment is NP-hard, and develop a greedy strategy that is provably within a factor 2 of the optimum.
Edit intent: clarity
Original:  Numerical simulations based on measured traces of YouTube requests demonstrate that our approach can improve video throughput by a factor 3-5 in realistic settings .
Revised:  We present numerical results comparing proposed schemes .
Edit intent: clarity
Original:  We present numerical results comparing  proposed schemes.
Revised:  We present numerical results comparing the proposed schemes.
Edit intent: fluency
Original: As data are increasingly modeled as graphs for expressing complex relationships, the tree pattern query on graph-structured data becomes an important query of growing interests in practical applications.
Revised: As data are increasingly modeled as graphs for expressing complex relationships, the tree pattern query on graph-structured data becomes an important query in practical applications.
Edit intent: clarity
Original:  Most practical query languages such as XQuer and SPARQL support expressive logical expressions using logical-AND/OR/NOT operators to define complex structural constraints of tree patterns.
Revised:  Most practical query languages such as XQuery and SPARQL support expressive logical expressions using logical-AND/OR/NOT operators to define complex structural constraints of tree patterns.
Edit intent: fluency
Original:  Most practical query languages such as XQuer and SPARQL support expressive logical expressions using logical-AND/OR/NOT operators to define complex structural constraints of tree patterns.
Revised:  Most practical query languages such as XQuer and SPARQL support logical expressions using logical-AND/OR/NOT operators to define complex structural constraints of tree patterns.
Edit intent: clarity
Original:  Based on this observation, in this paper, (1) we propose generalized tree pattern queries (GTPQs) over graph-structured data, which fully support propositional logic on structural constraints and allow a portion of query nodes as output nodes . (2) We make a thorough study of fundamental problems of satisfiability, containment and minimization, and give computational complexities and decision procedures of these problems.
Revised:  In this paper, (1) we propose generalized tree pattern queries (GTPQs) over graph-structured data, which fully support propositional logic on structural constraints and allow a portion of query nodes as output nodes . (2) We make a thorough study of fundamental problems of satisfiability, containment and minimization, and give computational complexities and decision procedures of these problems.
Edit intent: coherence
Original:  Based on this observation, in this paper, (1) we propose generalized tree pattern queries (GTPQs) over graph-structured data, which fully support propositional logic on structural constraints and allow a portion of query nodes as output nodes . (2) We make a thorough study of fundamental problems of satisfiability, containment and minimization, and give computational complexities and decision procedures of these problems.
Revised:  Based on this observation, in this paper, (1) we propose generalized tree pattern queries (GTPQs) over graph-structured data, which fully support propositional logic on structural constraints . (2) We make a thorough study of fundamental problems of satisfiability, containment and minimization, and give computational complexities and decision procedures of these problems.
Edit intent: coherence