wanyu/IteraTeR_v2 huggingface dataset:
Original: Current state-of-the-art approaches to collective attention and information life-cycle are aimed to prove how topics arise and fade in well-defined dynamical classes, with either the accent placed on human temporal dynamics or on semiotic dynamics.
Revised: Online social networks have transformed the way in which humans communicate and interact, leading to a new information ecosystem where people send and receive information through multiple channels, including traditional communication media. Despite many attempts to characterize the structure and dynamics of these techno-social systems, little is known about fundamental aspects such as how collective attention arises and what determines the information life-cycle are aimed to prove how topics arise and fade in well-defined dynamical classes, with either the accent placed on human temporal dynamics or on semiotic dynamics.
Edit intent: coherence
Original: Current state-of-the-art approaches to collective attention and information life-cycle are aimed to prove how topics arise and fade in well-defined dynamical classes, with either the accent placed on human temporal dynamics or on semiotic dynamics.
Revised: Current state-of-the-art approaches to collective attention and information life-cycle . Current approaches to these problems either focus on human temporal dynamics or on semiotic dynamics.
Edit intent: clarity
Original:  On the other hand, recent works have highlighted the competitive nature of information systems, in which humans and memes strive for scarce resources --visibility and attention, respectively.
Revised:  On the other hand, recent works have highlighted the competitive nature of information systems, in which humans and memes striving for scarce resources --visibility and attention, respectively.
Edit intent: fluency
Original:  On the other hand, recent works have highlighted the competitive nature of information systems, in which humans and memes strive for scarce resources --visibility and attention, respectively.
Revised:  On the other hand, recent works have highlighted the competitive nature of information systems, in which humans and memes strive for scarce resources -visibility and attention, respectively.
Edit intent: fluency
Original:  However, RF energy harvesting imposes new challenges into the design of wireless networks.
Revised:  However, RF energy harvesting imposes new challenges into the analysis of wireless networks.
Edit intent: clarity
Original:  In this work , we investigate the performance of a slotted Aloha random access wireless network consisting of two types of nodes, namely type I which has unlimited energy supply and type II which is solely powered by an RF energy harvesting circuit.
Revised:  Our objective in this work is to investigate the performance of a slotted Aloha random access wireless network consisting of two types of nodes, namely type I which has unlimited energy supply and type II which is solely powered by an RF energy harvesting circuit.
Edit intent: clarity
Original:  In this work , we investigate the performance of a slotted Aloha random access wireless network consisting of two types of nodes, namely type I which has unlimited energy supply and type II which is solely powered by an RF energy harvesting circuit.
Revised:  In this work , we investigate the performance of a slotted Aloha random access wireless network consisting of two types of nodes, namely Type I which has unlimited energy supply and type II which is solely powered by an RF energy harvesting circuit.
Edit intent: fluency
Original:  In this work , we investigate the performance of a slotted Aloha random access wireless network consisting of two types of nodes, namely type I which has unlimited energy supply and type II which is solely powered by an RF energy harvesting circuit.
Revised:  In this work , we investigate the performance of a slotted Aloha random access wireless network consisting of two types of nodes, namely type I which has unlimited energy supply and Type II which is solely powered by an RF energy harvesting circuit.
Edit intent: fluency
Original:  The transmissions of a type I node are recycled by a type II node to replenish its battery.
Revised:  The transmissions of a Type I node are recycled by a type II node to replenish its battery.
Edit intent: fluency
Original:  The transmissions of a type I node are recycled by a type II node to replenish its battery.
Revised:  The transmissions of a type I node are recycled by a Type II node to replenish its battery.
Edit intent: fluency
Original:  Second, we characterize an outer bound on the stable throughput region of RF EH-networks under the half-duplex and full-duplex energy harvesting paradigms .
Revised:  Second, we characterize an outer bound on the stable throughput region under half-duplex and full-duplex energy harvesting paradigms .
Edit intent: clarity
Original:  For each individual task model, researchers tend to develop different types of techniques for  schedulability tests with different computation complexity and performance.
Revised:  For each individual task model, researchers tend to develop different types of techniques for deriving schedulability tests with different computation complexity and performance.
Edit intent: clarity
Original:  In this paper, we present a general schedulability analysis framework, namely the k2U framework, that can be potentially applied to analyze a large set of real- time task models under any fixed-priority scheduling algorithm, on both uniprocessors and multiprocessors.
Revised:  In this paper, we present a general schedulability analysis framework, namely the k2U framework, that can be potentially applied to analyze a large set of real-time task models under any fixed-priority scheduling algorithm, on both uniprocessors and multiprocessors.
Edit intent: fluency
Original:  The key to k2U is a k-point effective schedulability test, which can be viewed as a blackbox interface to apply the k2U framework.
Revised:  The key to k2U is a k-point effective schedulability test, which can be viewed as a "blackbox" interface to apply the k2U framework.
Edit intent: fluency
Original:  In this paper, we present a general schedulability analysis framework, namely the k2U framework, that can be potentially applied to analyze a large set of real-time task models under any fixed-priority scheduling algorithm, on both uniprocessors and multiprocessors .
Revised:  In this paper, we present a general schedulability analysis framework, namely the k2U framework, that can be potentially applied to analyze a large set of real-time task models under any fixed-priority scheduling algorithm, on both uniprocessor and multiprocessor scheduling .
Edit intent: clarity
Original:  The key to k2U is a k-point effective schedulability test, which can be viewed as a "blackbox" interface to apply the k2U framework .
Revised:  The key to k2U is a k-point effective schedulability test, which can be viewed as a "blackbox" interface .
Edit intent: clarity
Original:  We show the generality of k2U by applying it to different task models, which results in new and better tests compared to the state-of-the-art.
Revised:  We show the generality of k2U by applying it to different task models, which results in new and improved tests compared to the state-of-the-art.
Edit intent: clarity
Original: We propose a game for recognising formal languages , in which two players with imperfect information need to coordinate on a common decision, given private input information .
Revised: We study a game for recognising formal languages , in which two players with imperfect information need to coordinate on a common decision, given private input information .
Edit intent: clarity
Original: We propose a game for recognising formal languages , in which two players with imperfect information need to coordinate on a common decision, given private input information .
Revised: We propose a game for recognising formal languages in which two players with imperfect information need to coordinate on a common decision, given private input information .
Edit intent: fluency
Original:  We show that this model of consensus acceptor games characterises context-sensitive languages , and conversely, that winning strategies in such games can be described by context-sensitive languages.
Revised:  We show that the acceptor model based on consensus games characterises context-sensitive languages , and conversely, that winning strategies in such games can be described by context-sensitive languages.
Edit intent: clarity
Original:  We show that this model of consensus acceptor games characterises context-sensitive languages , and conversely, that winning strategies in such games can be described by context-sensitive languages.
Revised:  We show that this model of consensus acceptor games characterises context-sensitive languages and conversely, that winning strategies in such games can be described by context-sensitive languages.
Edit intent: fluency
Original: We study a game for recognising formal languages  in which two players with imperfect information need to coordinate on a common decision, given private input strings correlated by a finite graph.
Revised: We study a game for recognising formal languages , in which two players with imperfect information need to coordinate on a common decision, given private input strings correlated by a finite graph.
Edit intent: fluency
Original: We study a game for recognising formal languages  in which two players with imperfect information need to coordinate on a common decision, given private input strings correlated by a finite graph.
Revised: We study a game for recognising formal languages in which two players with imperfect information need to coordinate on a common decision, given private input words correlated by a finite graph.
Edit intent: clarity
Original: Motility initiation in crawling cells requires a symmetry breaking mechanism which transforms a symmetric state into a polarized state  . Experiments on keratocytes suggest that polarization is triggered by  increased contractility of motor proteins  .
Revised: Motility initiation in crawling cells requires transformation of a symmetric state into a polarized state . Experiments on keratocytes suggest that polarization is triggered by increased contractility of motor proteins .
Edit intent: clarity
Original: Motility initiation in crawling cells requires a symmetry breaking mechanism which transforms a symmetric state into a polarized state  . Experiments on keratocytes suggest that polarization is triggered by  increased contractility of motor proteins  .
Revised: Motility initiation in crawling cells requires a symmetry breaking mechanism which transforms a symmetric state into a polarized state . Experiments on keratocytes suggest that polarization is triggered by the increased contractility of motor proteins .
Edit intent: fluency
Original: Motility initiation in crawling cells requires transformation of a symmetric state into a polarized state while motility arrest is associated with re-symmetrization  . Experiments on keratocytes suggest that polarization is triggered by the increased contractility of motor proteins but the conditions of re-symmetrization remain unclear .
Revised: Motility initiation in crawling cells requires transformation of a symmetric state into a polarized state . In contrast, motility arrest is associated with re-symmetrization . Experiments on keratocytes suggest that polarization is triggered by the increased contractility of motor proteins but the conditions of re-symmetrization remain unclear .
Edit intent: coherence
Original: Motility initiation in crawling cells requires transformation of a symmetric state into a polarized state while motility arrest is associated with re-symmetrization  . Experiments on keratocytes suggest that polarization is triggered by the increased contractility of motor proteins but the conditions of re-symmetrization remain unclear .
Revised: Motility initiation in crawling cells requires transformation of a symmetric state into a polarized state while motility arrest is associated with re-symmetrization of the internal configuration of a cell . Experiments on keratocytes suggest that polarization is triggered by the increased contractility of motor proteins but the conditions of re-symmetrization remain unclear .
Edit intent: clarity
Original: Motility initiation in crawling cells requires transformation of a symmetric state into a polarized state while motility arrest is associated with re-symmetrization  . Experiments on keratocytes suggest that polarization is triggered by the increased contractility of motor proteins but the conditions of re-symmetrization remain unclear .
Revised: Motility initiation in crawling cells requires transformation of a symmetric state into a polarized state while motility arrest is associated with re-symmetrization . Experiments on keratocytes suggest that polarization is triggered by the increased contractility of motor proteins but the conditions of re-symmetrization remain unknown .
Edit intent: clarity
Original: We consider the computational complexity of counting the number of answers to a logical formula on a finite structure.
Revised: We consider the problem of counting the number of answers to a logical formula on a finite structure.
Edit intent: clarity
Original:  We then proceed to study an extension of first-order logic in which algorithms for the counting problem at hand can be naturally and conveniently expressed  .
Revised:  We then proceed to study an extension of first-order logic in which algorithms for this counting problem can be naturally and conveniently expressed .
Edit intent: clarity
Original:  In the Italian Facebook we have found an interesting case: a page having more than 40K followers that every day posts the same picture of Toto Cutugno, a popular Italian singer.
Revised:  In the Italian Facebook we have found an interesting case: a page having more than 40K followers that every day posts the same picture of a popular Italian singer.
Edit intent: clarity
Original:  In this work, we use such a page as a benchmark to study and model the effects of content heterogeneity on popularity.
Revised:  In this work, we use such a page as a control to study and model the effects of content heterogeneity on popularity.
Edit intent: clarity
Original:  In this work, we use such a page as a benchmark to study and model the effects of content heterogeneity on popularity.
Revised:  In this work, we use such a page as a benchmark to study and model the relationship between content heterogeneity on popularity.
Edit intent: clarity
Original: Linear arithmetic extended with free predicate symbols is undecidable, in general.
Revised: First-order predicate logic extended with linear arithmetic is undecidable, in general.
Edit intent: clarity
Original:  We show that the restriction of linear arithmetic inequations to simple bounds extended with the Bernays-Sch\"onfinkel-Ramsey free first-order fragment is decidable and NEXPTIME-complete.
Revised:  We show that the Bernays-Sch\"onfinkel-Ramsey (BSR) fragment extended with linear arithmetic restricted to simple bounds extended with the Bernays-Sch\"onfinkel-Ramsey free first-order fragment is decidable and NEXPTIME-complete.
Edit intent: clarity
Original:  The  result is almost tight because the Bernays-Sch\"onfinkel-Ramsey fragment is undecidable in combination with linear difference inequations, simple additive inequations, quotient inequations and multiplicative inequations.
Revised:  The decidability result is almost tight because the Bernays-Sch\"onfinkel-Ramsey fragment is undecidable in combination with linear difference inequations, simple additive inequations, quotient inequations and multiplicative inequations.
Edit intent: clarity
Original:  We also consider  the case when the "amount of non-convexity" decays towards the optimum of the function.
Revised:  We also consider in detail the case when the "amount of non-convexity" decays towards the optimum of the function.
Edit intent: clarity
Original:  Other applications of the random walk method include private computation of empirical risk minimizers, two-stage stochastic programming, and approximate dynamic programming for online learning.
Revised:  Other applications of the method discussed in this work include private computation of empirical risk minimizers, two-stage stochastic programming, and approximate dynamic programming for online learning.
Edit intent: clarity
Original:  Such a multi-tiered structure appears to constitute suboptimal use of the positional information provided by the input morphogen because noise is added at each tier.
Revised:  Such a multi-tiered structure appears to constitute sub-optimal use of the positional information provided by the input morphogen because noise is added at each tier.
Edit intent: fluency
Original:  We argue that the relevant performance measure is not solely the amount of information carried by the morphogen , but the amount of information that can be accessed by the downstream network .
Revised:  We argue that the relevant performance measure is not solely the amount of information carried by the morphogen , but the amount of information that can be usefully extracted and interpreted by downstream elements .
Edit intent: clarity
Original:  We demonstrate that quantifying the information that is accessible to the system naturally explains the prevalence of multi-tiered network architectures as a consequence of the noise inherent to the control of gene expression.
Revised:  We demonstrate that quantifying the information that is _accessible_ to the system naturally explains the prevalence of multi-tiered network architectures as a consequence of the noise inherent to the control of gene expression.
Edit intent: fluency
Original:  In this paper, we analyze , model, and tune the performance of OpenFFT, paying a particular attention to tuning of communication that dominates the run time of large-scale calculations.
Revised:  In this paper, we analyze and tune the performance of OpenFFT, paying a particular attention to tuning of communication that dominates the run time of large-scale calculations.
Edit intent: clarity
Original:  We first analyze its performance on different machines for a thorough understanding of the behaviors of the package and machines.
Revised:  We first analyze its performance on different machines for an understanding of the behaviors of the package and machines.
Edit intent: clarity
Original:  We then build a performance model of OpenFFT on the machines, dividing it into computation and communication with a modeling of network overhead.
Edit intent: coherence
Original:  Based on the performance analysis, we develop six communication methods for performing communication with the aim of covering varied calculation scales on a wide variety of computational platforms.
Revised:  Based on the performance analysis, we develop six communication methods for performing communication with the aim of covering varied calculation scales on a variety of computational platforms.
Edit intent: clarity
Original:  OpenFFT is therefore augmented with an auto-tuning of communication to select the best method in run time depending on their performance.
Revised:  OpenFFT is then augmented with an auto-tuning of communication to select the best method in run time depending on their performance.
Edit intent: coherence
Original:  Numerical results demonstrate that the optimized OpenFFT is able to deliver  good performance in comparison with other state-of-the-art packages at different computational scales on a number of parallel machines .
Revised:  Numerical results demonstrate that the optimized OpenFFT is able to deliver relatively good performance in comparison with other state-of-the-art packages at different computational scales on a number of parallel machines .
Edit intent: clarity
Original:  it contributes in understanding the  relation between market  informational efficiency and the arbitrage-free option pricing methodology.
Revised:  it contributes in understanding the relation between market 's informational efficiency and the arbitrage-free option pricing methodology.
Edit intent: fluency
Original:  However, not all cities are equal and hierarchy in terms of influence at local, regional or global scales naturally emerges.
Revised:  However, not all cities are equal and a natural hierarchy at local, regional or global scales naturally emerges.
Edit intent: clarity
Original:  In this work, we take a different approach and introduce a method that uses geolocated Twitter information to quantify the impact of cities on rural or other urban areas.
Revised:  In this work, we introduce a method that uses geolocated Twitter information to quantify the impact of cities on rural or other urban areas.
Edit intent: coherence
Original:  The hierarchy of cities dramatically changes when referred only to urban users, with New York and London playing a predominant role  .
Revised:  The hierarchy of cities dramatically changes when referred only to urban users, with New York and London play a predominant role .
Edit intent: fluency
Original:  This equation can be numerically implemented using the conjugate gradient iterative method.
Revised:  This equation can be solved numerically using the conjugate gradient iterative method.
Edit intent: clarity
Original:  This equation can be numerically implemented using the conjugate gradient iterative method.
Revised:  This equation can be numerically implemented using the conjugate gradient method.
Edit intent: clarity
Original:  the recovered parameter distributions offer an exact method to compute the 95 %DIFDELCMD < \\%%% %DIF < parametric confidence  intervals (CI)  , that, in turn, using a suitable analysis statistic, will be narrower than the ones obtained from bootstrapping;
Revised:  the recovered parameter distributions offer an exact method to compute the 95 %DIFDELCMD < \\%%% %DIF < parametric confidence intervals (CI) ) , that, in turn, using a suitable analysis statistic, will be narrower than the ones obtained from bootstrapping;
Edit intent: fluency
Original:  Decentralized Congestion Control (DCC) algorithms have been proposed to control the channel load.
Revised:  Decentralized Congestion Control (DCC) algorithms have been proposed to minimize the channel load.
Edit intent: clarity
Original:  When  the awareness requirements allow , ECPR can improve the average message rate by 18\% compared to algorithms that perform rate adaptation only.
Revised:  When the awareness requirements , ECPR can improve the average message rate by 18\% compared to algorithms that perform rate adaptation only.
Edit intent: clarity
Original: We consider restricted versions of%DIFDELCMD < {\rm %%% postBQP where postselection probabilities can be efficiently calculated by classical or quantum computers.
Revised: %DIFDELCMD < {\rm %%% postBQP where postselection probabilities can be efficiently calculated by classical or quantum computers.
Edit intent: clarity
Original: We consider restricted versions of%DIFDELCMD < {\rm %%% postBQP where postselection probabilities can be efficiently calculated by classical or quantum computers.
Revised: We consider restricted versions of%DIFDELCMD < {\rm %%% where postselection probabilities can be efficiently calculated by classical or quantum computers.
Edit intent: clarity
Original:  We show that such restricted%DIFDELCMD < {\rm %%% postBQP classes are in%DIFDELCMD < {\rm %DIFDELCMD < %%% AWPP (\subseteq{\rm PP=}%DIFDELCMD < {\rm %%% postBQP ).
Revised:  We show that such restricted%DIFDELCMD < {\rm %%% classes are in%DIFDELCMD < {\rm %DIFDELCMD < %%% AWPP (\subseteq{\rm PP=}%DIFDELCMD < {\rm %%% postBQP ).
Edit intent: fluency
Original:  We show that such restricted%DIFDELCMD < {\rm %%% postBQP classes are in%DIFDELCMD < {\rm %DIFDELCMD < %%% AWPP (\subseteq{\rm PP=}%DIFDELCMD < {\rm %%% postBQP ).
Revised:  We show that such restricted%DIFDELCMD < {\rm %%% postBQP %DIFDELCMD < {\rm %DIFDELCMD < %%% AWPP (\subseteq{\rm PP=}%DIFDELCMD < {\rm %%% postBQP ).
Edit intent: clarity