wanyu/IteraTeR_v2 huggingface dataset:
Original:  In particular, we focus on Barcelona and Madrid , the two most populated cities of Spain, and by examining the geolocated credit-card transactions of individuals living in the two provinces, we find that consumption habits and mobility patterns vary according to gender, age and occupation.
Revised:  In particular, we focus on Barcelona and Madrid and by examining the geolocated credit-card transactions of individuals living in the two provinces, we find that consumption habits and mobility patterns vary according to gender, age and occupation.
Edit intent: clarity
Original:  In particular, we focus on Barcelona and Madrid , the two most populated cities of Spain, and by examining the geolocated credit-card transactions of individuals living in the two provinces, we find that consumption habits and mobility patterns vary according to gender, age and occupation.
Revised:  In particular, we focus on Barcelona and Madrid , the two most populated cities of Spain, and by examining the geolocated credit-card transactions of individuals living in the two provinces, we find that the mobility patterns vary according to gender, age and occupation.
Edit intent: clarity
Original: Correlations in neural activity can severely impair the processing of information in neural networks .
Revised: High-level brain function such as memory, classification or reasoning can be realized by means of recurrent networks of simplified model neurons. Analog neuromorphic hardware constitutes a fast and energy efficient substrate for the implementation of such neural computing architectures in technical applications and neuroscientific research. The functional performance of neural networks is often critically dependent on the level of correlations in the neural activity. In finite networks .
Edit intent: clarity
Original:  In finite-size networks , correlations are however inevitable due to common presynaptic sources . Recent theoretical studies have shown that inhibitory feedback, abundant in biological neural networks, can actively suppress these shared-input correlations and thereby enable neurons to fire nearly independently.
Revised:  In finite-size networks , correlations are typically inevitable due to common presynaptic sources . Recent theoretical studies have shown that inhibitory feedback, abundant in biological neural networks, can actively suppress these shared-input correlations and thereby enable neurons to fire nearly independently.
Edit intent: clarity
Original:  In finite-size networks , correlations are however inevitable due to common presynaptic sources . Recent theoretical studies have shown that inhibitory feedback, abundant in biological neural networks, can actively suppress these shared-input correlations and thereby enable neurons to fire nearly independently.
Revised:  In finite-size networks , correlations are however inevitable due to shared presynaptic input . Recent theoretical studies have shown that inhibitory feedback, abundant in biological neural networks, can actively suppress these shared-input correlations and thereby enable neurons to fire nearly independently.
Edit intent: clarity
Original:  Theory, however, suggests that the effect is a general phenomenon, present in any system with  inhibitory feedback, irrespective of the details of the network structure and the neuron and synapse properties.
Revised:  Theory, however, suggests that the effect is a general phenomenon, present in any system with sufficient inhibitory feedback, irrespective of the details of the network structure and the neuron and synapse properties.
Edit intent: clarity
Original:  Theory, however, suggests that the effect is a general phenomenon, present in any system with  inhibitory feedback, irrespective of the details of the network structure and the neuron and synapse properties.
Revised:  Theory, however, suggests that the effect is a general phenomenon, present in any system with inhibitory feedback, irrespective of the details of the network structure or the neuronal and synaptic properties.
Edit intent: fluency
Original:  Here, we investigate the effect of network heterogeneity on correlations in sparse, random networks of inhibitory neurons with  conductance-based synapses.
Revised:  Here, we investigate the effect of network heterogeneity on correlations in sparse, random networks of inhibitory neurons with non-linear, conductance-based synapses.
Edit intent: clarity
Original:  Accelerated neuromorphic hardware is used as a user-friendly stand-alone research tool to emulate these networks .
Revised:  Emulations of these networks on the analog neuromorphic hardware system Spikey allow us to test the efficiency of decorrelation by inhibitory feedback in the presence of hardware-specific heterogeneities .
Edit intent: clarity
Original:  The configurability of the hardware substrate enables us to modulate the extent of network heterogeneity in a systematic manner.
Revised:  The configurability of the hardware substrate enables us to modulate the extent of heterogeneity in a systematic manner.
Edit intent: clarity
Original:  We selectively study the effects of shared-input and recurrent connections on correlations in synaptic inputs and spike trains.
Revised:  We selectively study the effects of shared input and recurrent connections on correlations in synaptic inputs and spike trains.
Edit intent: fluency
Original:  We selectively study the effects of shared-input and recurrent connections on correlations in synaptic inputs and spike trains.
Revised:  We selectively study the effects of shared-input and recurrent connections on correlations in membrane potentials and spike trains.
Edit intent: clarity
Original:  We compute the steady states for these ODE's.
Revised:  We show the existence and uniqueness of a steady state for these ODE's.
Edit intent: clarity
Original:  The problem is known to be \mathsf{NP -hard to approximate within a factor of 2 ^{ cj } for some constant c . Our algorithm also approximates the problem of finding the largest determinant principal j\times j submatrix of a rank d positive semidefinite matrix , with approximation ratio e^{j + o(j) .
Revised:  The problem is known to be \mathrm{NP -hard to approximate within a factor of 2 ^{ cj } for some constant c . Our algorithm also approximates the problem of finding the largest determinant principal j\times j submatrix of a rank d positive semidefinite matrix , with approximation ratio e^{j + o(j) .
Edit intent: fluency
Original:  The problem is known to be \mathsf{NP -hard to approximate within a factor of 2 ^{ cj } for some constant c . Our algorithm also approximates the problem of finding the largest determinant principal j\times j submatrix of a rank d positive semidefinite matrix , with approximation ratio e^{j + o(j) .
Revised:  The problem is known to be \mathsf{NP -hard to approximate within a factor of 2 ^{ j } for some constant c . Our algorithm also approximates the problem of finding the largest determinant principal j\times j submatrix of a rank d positive semidefinite matrix , with approximation ratio e^{j + o(j) .
Edit intent: clarity
Original:  The problem is known to be \mathsf{NP -hard to approximate within a factor of 2 ^{ cj } for some constant c . Our algorithm also approximates the problem of finding the largest determinant principal j\times j submatrix of a rank d positive semidefinite matrix , with approximation ratio e^{j + o(j) .
Revised:  The problem is known to be \mathsf{NP -hard to approximate within a factor of 2 ^{ cj } for some constant c . Our algorithm also gives a factor e^{j + o(j) the problem of finding the largest determinant principal j\times j submatrix of a rank d positive semidefinite matrix , with approximation ratio e^{j + o(j) .
Edit intent: clarity
Original:  The problem is known to be \mathsf{NP -hard to approximate within a factor of 2 ^{ cj } for some constant c . Our algorithm also approximates the problem of finding the largest determinant principal j\times j submatrix of a rank d positive semidefinite matrix , with approximation ratio e^{j + o(j) .
Revised:  The problem is known to be \mathsf{NP -hard to approximate within a factor of 2 ^{ cj } for some constant c . Our algorithm also approximates the problem of finding the principal j\times j submatrix of a rank d positive semidefinite matrix , with approximation ratio e^{j + o(j) .
Edit intent: clarity
Original:  We achieve our approximation by rounding solutions to a generlization of the D-optimal design problem, or, equivalently, the dual of an appropriate smallest enclosing ellipsoid probelm .
Revised:  We achieve our approximation by rounding solutions to a generalization of the D-optimal design problem, or, equivalently, the dual of an appropriate smallest enclosing ellipsoid probelm .
Edit intent: fluency
Original:  We achieve our approximation by rounding solutions to a generlization of the D-optimal design problem, or, equivalently, the dual of an appropriate smallest enclosing ellipsoid probelm .
Revised:  We achieve our approximation by rounding solutions to a generlization of the D-optimal design problem, or, equivalently, the dual of an appropriate smallest enclosing ellipsoid problem .
Edit intent: fluency
Original:  To understand this identification challenge, we extract a positive martingale component from the stochastic discount factor process using Perron-Frobenius theory .
Revised:  To understand this identification challenge, we extract a positive martingale component from the stochastic discount factor process using Perron-Frobenius Theory .
Edit intent: fluency
Original:  Even though this probability measure may fail to capture investor beliefs, we conclude that it is valuable as a tool for characterizing long-term risk pricing .
Revised:  While this probability measure may fail to capture investor beliefs, we conclude that it is valuable as a tool for characterizing long-term risk pricing .
Edit intent: coherence
Original:  Even though this probability measure may fail to capture investor beliefs, we conclude that it is valuable as a tool for characterizing long-term risk pricing .
Revised:  Even though this probability measure is of substantive interest, interpreting it as the true probability distribution may bias our inference about investor aversion to risk as reflected in risk-return tradeoffs .
Edit intent: clarity
Original:  To understand this identification challenge , we extract a positive martingale component from the stochastic discount factor process using Perron-Frobenius Theory.
Revised:  To understand this identification challenge , we extract a positive martingale component of the stochastic discount factor process using Perron-Frobenius Theory.
Edit intent: fluency
Original:  The vice versa is also true, thus unveiling a new boson-fermion duality.
Revised:  The vice versa is also true, thus unveiling a curious boson-fermion duality.
Edit intent: clarity
Original:  In conclusion, EGG parameterization should not be limited into f_d and cpm only.
Revised:  In conclusion, EGG parameterization should not be limited to f_d and cpm only.
Edit intent: fluency
Original:  The problem of computing the edit distance between two strings is a classic computational task, with a well-known algorithm based on dynamic programming.
Revised:  The problem of computing the edit distance between two strings is a classical computational task, with a well-known algorithm based on dynamic programming.
Edit intent: fluency
Original:  Specifically, we show that, if the edit distance can be computed in time O(n^{2-delta}) for some constant delta>0, then the satisfiability of conjunctive normal form formulas with N variables and M clauses can be solved in time M^{O(1)} 2^{( 1-epsilon )N} for a constant epsilon >0.
Revised:  Specifically, we show that, if the edit distance can be computed in time O(n^{2-delta}) for some constant delta>0, then the satisfiability of conjunctive normal form formulas with N variables and M clauses can be solved in time M^{O(1)} 2^{( 1-eps )N} for a constant epsilon >0.
Edit intent: fluency
Original:  Specifically, we show that, if the edit distance can be computed in time O(n^{2-delta}) for some constant delta>0, then the satisfiability of conjunctive normal form formulas with N variables and M clauses can be solved in time M^{O(1)} 2^{( 1-epsilon )N} for a constant epsilon >0.
Revised:  Specifically, we show that, if the edit distance can be computed in time O(n^{2-delta}) for some constant delta>0, then the satisfiability of conjunctive normal form formulas with N variables and M clauses can be solved in time M^{O(1)} 2^{( 1-epsilon )N} for a constant eps >0.
Edit intent: fluency
Original:  Thus we cannot simultaneously solve (in general) shifted systems with unrelated right-hand sides using this strategy, and all shifted residuals cannot be simultaneously minimized over a Krylov subspace such that collinearity is maintained.
Revised:  Thus we cannot simultaneously solve shifted systems with unrelated right-hand sides using this strategy, and all shifted residuals cannot be simultaneously minimized over a Krylov subspace such that collinearity is maintained.
Edit intent: coherence
Original:  These are not block versions of the shifted FOM method of Simoncini BIT '03%DIFDELCMD < ] %DIFDELCMD < %%% or the shifted GMRES method of Frommer and Gl\"assner SISC '98%DIFDELCMD < ]%%% . These methodsare compatible with unrelated right-hand sides , and residual collinearity is no longer a requirement at restart  .
Revised:  These are not block versions of the shifted FOM method of Simoncini %DIFDELCMD < ] %DIFDELCMD < %%% or the shifted GMRES method of Frommer and Gl\"assner SISC '98%DIFDELCMD < ]%%% . These methodsare compatible with unrelated right-hand sides , and residual collinearity is no longer a requirement at restart .
Edit intent: clarity
Original:  These are not block versions of the shifted FOM method of Simoncini BIT '03%DIFDELCMD < ] %DIFDELCMD < %%% or the shifted GMRES method of Frommer and Gl\"assner SISC '98%DIFDELCMD < ]%%% . These methodsare compatible with unrelated right-hand sides , and residual collinearity is no longer a requirement at restart  .
Revised:  These are not block versions of the shifted FOM method of Simoncini BIT '03%DIFDELCMD < ] %DIFDELCMD < %%% SISC '98%DIFDELCMD < ]%%% . These methodsare compatible with unrelated right-hand sides , and residual collinearity is no longer a requirement at restart .
Edit intent: coherence
Original:  These are not block versions of the shifted FOM method of Simoncini BIT '03%DIFDELCMD < ] %DIFDELCMD < %%% or the shifted GMRES method of Frommer and Gl\"assner SISC '98%DIFDELCMD < ]%%% . These methodsare compatible with unrelated right-hand sides , and residual collinearity is no longer a requirement at restart  .
Revised:  These are not block versions of the shifted FOM method of Simoncini BIT '03%DIFDELCMD < ] %DIFDELCMD < %%% or the shifted GMRES method of Frommer and Gl\"assner SISC '98%DIFDELCMD < ]%%% . These methodsare compatible with unrelated right-hand sides . Because residual collinearity is no longer a requirement at restart .
Edit intent: coherence
Original:  The proposed approach provides several opportunities to re-distribute the smartness and decision making among various elements of the network including the packets themselves toward providing a decentralized solution for SDNs  . In particular, a region-based representation of the network topology is proposed which is then used to describe the routing actions along the possible paths for a packet flow.
Revised:  The proposed approach provides several opportunities to re-distribute the smartness and decision making among various elements of a network including the packets themselves toward providing a decentralized solution for SDNs . In particular, a region-based representation of the network topology is proposed which is then used to describe the routing actions along the possible paths for a packet flow.
Edit intent: fluency
Original:  This would bring efficiency and scalability, and therefore also lower environmental footprint to the ever-growing networks.
Revised:  This would bring efficiency and scalability, and therefore also lower environmental footprint for the ever-growing networks.
Edit intent: fluency
Original:  We give a complete characterization of this new class, as well as quadratic-time algorithms to recognize graphs from this class and to produce a corresponding interval representation if one exists  .
Revised:  We give a complete characterization of this new class, as well as quadratic-time algorithms that recognize graphs from this class and to produce a corresponding interval representation if one exists .
Edit intent: fluency
Original:  We give a complete characterization of this new class, as well as quadratic-time algorithms to recognize graphs from this class and to produce a corresponding interval representation if one exists  .
Revised:  We give a complete characterization of this new class, as well as quadratic-time algorithms to recognize graphs from this class and produce a corresponding interval representation if one exists .
Edit intent: fluency
Original:  For instance, MMR vaccine coverage has undergone an important decrease in a large part of Europe and US as a consequence of erroneously alleged side-effects , leading to recent measles outbreaks.
Revised:  For instance, MMR vaccine coverage has undergone an important decrease in a large part of Europe and US as a consequence of erroneously alleged side effects , leading to recent measles outbreaks.
Edit intent: fluency
Original: We suggest an information-theoretic approach for measuring linguistic style coordination in dialogues.
Revised: We suggest an information-theoretic approach for measuring stylistic coordination in dialogues.
Edit intent: clarity
Original:  We revisit some of the previous studies that reported strong sig- natures of stylistic accommodation, and find that a significant part of the observed coordination can be attributed to a simple confounding effect - length coordination.
Revised:  We revisit some of the previous studies that reported strong signatures of stylistic accommodation, and find that a significant part of the observed coordination can be attributed to a simple confounding effect - length coordination.
Edit intent: fluency
Original: The analysis of dynamical systems that attempts to model chemical reaction , gene-regulatory, population, and ecosystem networks all rely on models having interacting components.
Revised: The relationship between network topology and system dynamics has significant implications for unifying our understanding of the interplay among metabolic , gene-regulatory, population, and ecosystem networks all rely on models having interacting components.
Edit intent: clarity
Original:  In particular, we determine the probability distribution of robustness over system connectivity and show that robustness is maximized by maximizing the number of links between strongly connected components of the graph representing the underlying system connectivity.
Revised:  In particular, we determine the probability distribution of robustness over system connectivity and show that robustness is classified by the number of links between strongly connected components of the graph representing the underlying system connectivity.
Edit intent: clarity
Original:  This covers the widely studied case where patches are classified as being either suitable or unsuitable for occupancy.
Revised:  This covers the widely studied case where patches are classified as either suitable or unsuitable for occupancy.
Edit intent: fluency
Original:  WiMAX has been developed over 10 years, but it is still unknown by most people.
Revised:  WiMAX has been developed over 10 years, but it is still unknown to most people.
Edit intent: fluency
Original:  However, compared with WLAN, it has many advantages in transmission speed and coverage area.
Revised:  However, compared to WLAN, it has many advantages in transmission speed and coverage area.
Edit intent: fluency
Original:  However , compared to WLAN, it has many advantages in transmission speed and coverage area.
Revised:  However compared to WLAN, it has many advantages in transmission speed and coverage area.
Edit intent: fluency
Original: Drug-drug interactions (DDIs) are major causes of morbidity and mortality and a subject of intense scientific interest.
Revised: Drug-drug interaction (DDI) is a major cause of morbidity and mortality and a subject of intense scientific interest.
Edit intent: fluency
Original:  While evidence for DDI ranges in scale from intracellular biochemistry to human populations, literature mining methods have not been used to extract specific types of experimental evidence  which are reported differently for distinct experimental goals.
Revised:  Though DDI is investigated in domains ranging in scale from intracellular biochemistry to human populations, literature mining methods have not been used to extract specific types of experimental evidence which are reported differently for distinct experimental goals.
Edit intent: clarity
Original:  While evidence for DDI ranges in scale from intracellular biochemistry to human populations, literature mining methods have not been used to extract specific types of experimental evidence  which are reported differently for distinct experimental goals.
Revised:  While evidence for DDI ranges in scale from intracellular biochemistry to human populations, literature mining has not been used to extract specific types of experimental evidence which are reported differently for distinct experimental goals.
Edit intent: clarity
Original:  While evidence for DDI ranges in scale from intracellular biochemistry to human populations, literature mining methods have not been used to extract specific types of experimental evidence  which are reported differently for distinct experimental goals.
Revised:  While evidence for DDI ranges in scale from intracellular biochemistry to human populations, literature mining methods have not been used to extract specific types of experimental evidence , which are reported differently for distinct experimental goals.
Edit intent: fluency
Original:  We used a manually curated corpus of PubMed abstracts and annotated sentences to evaluate the efficacy of literature mining in classifying PubMed abstracts containing pharmacokinetic evidence for DDIs, as well as extracting sentences containing such evidence  .
Revised:  We used a manually curated corpus of PubMed abstracts and annotated sentences to evaluate the efficacy of literature mining on two tasks: first, identifying PubMed abstracts containing pharmacokinetic evidence for DDIs, as well as extracting sentences containing such evidence .
Edit intent: clarity
Original:  We used a manually curated corpus of PubMed abstracts and annotated sentences to evaluate the efficacy of literature mining in classifying PubMed abstracts containing pharmacokinetic evidence for DDIs, as well as extracting sentences containing such evidence  .
Revised:  We used a manually curated corpus of PubMed abstracts and annotated sentences to evaluate the efficacy of literature mining in classifying PubMed abstracts containing pharmacokinetic evidence of DDIs; second, extracting sentences containing such evidence .
Edit intent: coherence
Original:  We used a manually curated corpus of PubMed abstracts and annotated sentences to evaluate the efficacy of literature mining in classifying PubMed abstracts containing pharmacokinetic evidence for DDIs, as well as extracting sentences containing such evidence  .
Revised:  We used a manually curated corpus of PubMed abstracts and annotated sentences to evaluate the efficacy of literature mining in classifying PubMed abstracts containing pharmacokinetic evidence for DDIs, as well as extracting sentences containing such evidence from abstracts .
Edit intent: clarity
Original:  We implemented a text mining pipeline  using several linear classifiers and a variety of feature transformation methods .
Revised:  We implemented a text mining pipeline using several linear classifiers and a variety of feature transforms .
Edit intent: clarity