wanyu/IteraTeR_v2 huggingface dataset:
Original:  Through such an iterative aggregation of the neighborhood, the proposed method naturally captures the cascading effect of information diffusion in social networks . Experiments conducted on both synthetic data and real-world Sina Weibo data demonstrate that our method significantly outperforms the state-of-the-art methods for popularity prediction.
Revised:  Through such an iterative aggregation of the neighborhood, the proposed method naturally captures the cascading effect of information diffusion in social networks . Experiments conducted on both synthetic data and real-world Sina Weibo datasets demonstrate that our method significantly outperforms the state-of-the-art methods for popularity prediction.
Edit intent: clarity
Original: We characterize the asymptotic small-time and large-time implied volatility smile for the rough Heston model introduced by El Euch, Jaissonand Rosenbaum .0pt in the small-time, large-time and \alpha }\to \to  We show that the asymptotic short-maturity smile scales in qualitatively the same way as a general rough stochastic volatility model , and is characterized by0pt , \mbox{ FGP18a }0pt et al.)
Revised: We characterize the behaviour of the Rough Heston model introduced by El Euch, Jaissonand Rosenbaum .0pt in the small-time, large-time and \alpha }\to \to We show that the asymptotic short-maturity smile scales in qualitatively the same way as a general rough stochastic volatility model , and is characterized by0pt , \mbox{ FGP18a }0pt et al.)
Edit intent: clarity
Original: We characterize the asymptotic small-time and large-time implied volatility smile for the rough Heston model introduced by El Euch, Jaissonand Rosenbaum .0pt in the small-time, large-time and \alpha }\to \to  We show that the asymptotic short-maturity smile scales in qualitatively the same way as a general rough stochastic volatility model , and is characterized by0pt , \mbox{ FGP18a }0pt et al.)
Revised: We characterize the asymptotic small-time and large-time implied volatility smile for the rough Heston model introduced by El Euch, Jaissonand Rosenbaum .0pt in the small-time, large-time and \alpha }\to \to We show that the short-maturity smile scales in qualitatively the same way as a general rough stochastic volatility model , and is characterized by0pt , \mbox{ FGP18a }0pt et al.)
Edit intent: fluency
Original:  The solution of this VIE satisfies a space-time scaling property which simplifies its computation.
Revised:  The solution to this VIE satisfies a space-time scaling property which simplifies its computation.
Edit intent: clarity
Original: Resource allocation problems are a fundamental domain in which to evaluate the fairness properties of algorithms , and the trade-offs between fairness and utilization have a long history in this domain.
Revised: Resource allocation problems are a fundamental domain in which to evaluate the fairness properties of algorithms . The trade-offs between fairness and utilization have a long history in this domain.
Edit intent: coherence
Original:  A recent line of work has considered fairness questions for resource allocation when the demands for the resource are distributed across multiple groups and drawn from a probability distribution .
Revised:  A recent line of work has considered fairness questions for resource allocation when the demands for the resource are distributed across multiple groups and drawn from probability distributions .
Edit intent: fluency
Original:  A largely open question in this area has been to bound the gap between the maximum possible utilization of the resource and the maximum  subject to this fairness condition.
Revised:  A largely open question in this area has been to bound the gap between the maximum possible utilization of the resource and the maximum possible utilization subject to this fairness condition.
Edit intent: fluency
Original:  Here  we obtain some of the first provable upper bounds on this gap.
Revised:  Here , we obtain some of the first provable upper bounds on this gap.
Edit intent: fluency
Original:  We show lower bounds but also some general upper bounds for arbitrary distributions, as well as much stronger upper bounds for specific families of distributions that are typically used to model levels of demand.
Revised:  We obtain an upper bound for arbitrary distributions, as well as much stronger upper bounds for specific families of distributions that are typically used to model levels of demand.
Edit intent: clarity
Original:  In particular, we find --- somewhat surprisingly --- that there are natural classes of distributions for which it is possible to simultaneously achieve maximum utilization and the given notion of fairness ;
Revised:  In particular, we find - somewhat surprisingly - that there are natural classes of distributions for which it is possible to simultaneously achieve maximum utilization and the given notion of fairness ;
Edit intent: fluency
Original:  and we show that for power-law distributions, there is a non-trivial gap between the solutions, but this gap can be bounded by a constant  independent of the parameters of the distribution.
Revised:  and we show that for power-law distributions, there is a non-trivial gap between the solutions, but this gap can be bounded by a constant factor independent of the parameters of the distribution.
Edit intent: clarity
Original:  The  binding event of RNAP to the active state of the gene is an probabilistic process and therefore introduces noise in the protein levels.
Revised:  The binding event of RNAP to the active state of the gene is an probabilistic process and therefore , introduces noise or fluctuations in the protein levels.
Edit intent: clarity
Original: Gene expression is a  noisy process.
Revised: Gene expression is a random or noisy process.
Edit intent: clarity
Original:  That consists of several random events among which the reinitiation of transcription by RNAP is an important one.
Revised:  The process consists of several random events among which the reinitiation of transcription by RNAP is an important one.
Edit intent: clarity
Original:  The gene turns into the inactive state as the bound transcription factors leave the promoter.
Revised:  The gene turns into inactive state as the bound transcription factors leave the promoter.
Edit intent: fluency
Original:  In this paper, we analytically calculate the noise in mRNA and protein levels and also the probability distribution of mRNA numbers exactly with the binding event of RNAP in gene transcription process.
Revised:  In this paper, we analytically calculate the noise in mRNA and protein levels and also the probability distribution of mRNA numbers exactly with the binding event of RNAPs in gene transcription process.
Edit intent: fluency
Original:  We find that the reinitiation of transcription behaves like the fine-tuned control process to regulate the mRNA/protein level in the cell .
Revised:  We find that the reinitiation of transcription can behave as a fine-tuned control process to regulate the mRNA/protein level in the cell .
Edit intent: clarity
Original:  However, PrEP provides no direct protection against STIs other than HIV, unlike condoms.
Revised:  However, PrEP provides no direct protection against sexually transmitted infections (STIs) other than HIV, unlike condoms.
Edit intent: clarity
Original:  We find that when HIV is the only one circulating, PrEP is effective in reducing HIV prevalence, even with high risk compensation.
Revised:  We find that when HIV is the only disease circulating, PrEP is effective in reducing HIV prevalence, even with high risk compensation.
Edit intent: clarity
Original:  Instead, the complex interplay between the two diseases shows that different levels of risk compensations require different intervention strategies.
Revised:  Instead, the complex interplay between the two diseases shows that different levels of risk compensation require different intervention strategies.
Edit intent: fluency
Original:  They can be used to produce guarantees on quantitative aspects of system behaviour, such as safety, reliability and performance, or to help synthesise controllers that ensure such guarantees are met.
Revised:  They can be used to produce guarantees on quantitative aspects of system behaviour, for example safety, reliability and performance, or to help synthesise controllers that ensure such guarantees are met.
Edit intent: clarity
Original: This article explains how to apply time-frequency scattering, a convolutional operator extracting modulations in the time--frequency domain at different rates and scales, to the re-synthesis and manipulation of audio textures.
Revised: This article explains how to apply time--frequency scattering, a convolutional operator extracting modulations in the time--frequency domain at different rates and scales, to the re-synthesis and manipulation of audio textures.
Edit intent: fluency
Original:  After implementing phase retrieval in the scattering network by gradient backpropagation, we introduce scale-rate DAFx, a class of audio transformations expressed in the domain of time-frequency scattering coefficients.
Revised:  After implementing phase retrieval in the scattering network by gradient backpropagation, we introduce scale--rate DAFx, a class of audio transformations expressed in the domain of time-frequency scattering coefficients.
Edit intent: fluency
Original:  After implementing phase retrieval in the scattering network by gradient backpropagation, we introduce scale-rate DAFx, a class of audio transformations expressed in the domain of time-frequency scattering coefficients.
Revised:  After implementing phase retrieval in the scattering network by gradient backpropagation, we introduce scale-rate DAFx, a class of audio transformations expressed in the domain of time--frequency scattering coefficients.
Edit intent: fluency
Original:  One example of scale-rate DAFx is chirp rate inversion, which causes each sonic event to be locally reversed in time while leaving the arrow of time globally unchanged.
Revised:  One example of scale--rate DAFx is chirp rate inversion, which causes each sonic event to be locally reversed in time while leaving the arrow of time globally unchanged.
Edit intent: fluency
Original:  (1) factorization of Parigot's \lambda\mu-reduction into multiplicative and exponential steps by means of explicit operators, (2) adaptation of Laurent's original \sigma-equivalence to \Lambda M, and ( 3) interpretation of \Lambda M into Laurent's polarized proof-nets (PPN) . More precisely, we first give a translation of \Lambda M-terms into PPN which simulates the reduction relation of our calculusinto cut elimination of PPN.
Revised:  (1) factorization of \lambda\mu-reduction into multiplicative and exponential steps by means of explicit operators, (2) adaptation of Laurent's original \sigma-equivalence to \Lambda M, and ( 3) interpretation of \Lambda M into Laurent's polarized proof-nets (PPN) . More precisely, we first give a translation of \Lambda M-terms into PPN which simulates the reduction relation of our calculusinto cut elimination of PPN.
Edit intent: clarity
Original:  (1) factorization of Parigot's \lambda\mu-reduction into multiplicative and exponential steps by means of explicit operators, (2) adaptation of Laurent's original \sigma-equivalence to \Lambda M, and ( 3) interpretation of \Lambda M into Laurent's polarized proof-nets (PPN) . More precisely, we first give a translation of \Lambda M-terms into PPN which simulates the reduction relation of our calculusinto cut elimination of PPN.
Revised:  (1) factorization of Parigot's \lambda\mu-reduction into multiplicative and exponential steps by means of explicit term operators of \Lambda M, and ( 3) interpretation of \Lambda M into Laurent's polarized proof-nets (PPN) . More precisely, we first give a translation of \Lambda M-terms into PPN which simulates the reduction relation of our calculusinto cut elimination of PPN.
Edit intent: clarity
Original:  (1) factorization of Parigot's \lambda\mu-reduction into multiplicative and exponential steps by means of explicit operators, (2) adaptation of Laurent's original \sigma-equivalence to \Lambda M, and ( 3) interpretation of \Lambda M into Laurent's polarized proof-nets (PPN) . More precisely, we first give a translation of \Lambda M-terms into PPN which simulates the reduction relation of our calculusinto cut elimination of PPN.
Revised:  (1) factorization of Parigot's \lambda\mu-reduction into multiplicative and exponential steps by means of explicit operators, (2) adaptation of Laurent's original \sigma-equivalence to \Lambda M, and ( 2) translation of \Lambda M-terms into Laurent's polarized proof-nets (PPN) . More precisely, we first give a translation of \Lambda M-terms into PPN which simulates the reduction relation of our calculusinto cut elimination of PPN.
Edit intent: clarity
Original:  Most notably, \simeq is shown to be a strong bisimulation with respect to reduction in \Lambda M, %DIFDELCMD < \ie %%%  two \simeq-equivalent terms have the exact same reduction semantics, a result which fails for Regnier's \sigma-equivalence in \lambda-calculus as well as for Laurent's \sigma-equivalence in \lambda\mu.
Revised:  Most notably, \simeq is shown to be a strong bisimulation with respect to reduction in \Lambda M, %DIFDELCMD < \ie %%% i.e. two \simeq-equivalent terms have the exact same reduction semantics, a result which fails for Regnier's \sigma-equivalence in \lambda-calculus as well as for Laurent's \sigma-equivalence in \lambda\mu.
Edit intent: coherence
Original: The prefix palindromic length PPL_u(n) of an infinite word u is the minimal number of palindromes to which the prefix of length n of u can be decomposed .
Revised: The prefix palindromic length PPL_u(n) of an infinite word u is the minimal number of concatenated palindromes needed to express the prefix of length n of u can be decomposed .
Edit intent: clarity
Original: The prefix palindromic length PPL_u(n) of an infinite word u is the minimal number of palindromes to which the prefix of length n of u can be decomposed .
Revised: The prefix palindromic length PPL_u(n) of an infinite word u is the minimal number of palindromes to which the prefix of length n of u .
Edit intent: clarity
Original:  Up to now, the conjecture has been proved only for some particular cases , including all words avoiding some power k . However, even in that  case the existing upper bound for the minimal number n such that PPL_u(n)>K is greater than any constant to the power K. Precise values of PPL_u(n) are not known even for simplest examples like the Fibonacci word.
Revised:  Up to now, the conjecture has been proven for almost all words , including all words avoiding some power k . However, even in that case the existing upper bound for the minimal number n such that PPL_u(n)>K is greater than any constant to the power K. Precise values of PPL_u(n) are not known even for simplest examples like the Fibonacci word.
Edit intent: clarity
Original:  Up to now, the conjecture has been proved only for some particular cases , including all words avoiding some power k . However, even in that  case the existing upper bound for the minimal number n such that PPL_u(n)>K is greater than any constant to the power K. Precise values of PPL_u(n) are not known even for simplest examples like the Fibonacci word.
Revised:  Up to now, the conjecture has been proved only for some particular cases , including all words avoiding some power k . However, even in that simple case the existing upper bound for the minimal number n such that PPL_u(n)>K is greater than any constant to the power K. Precise values of PPL_u(n) are not known even for simplest examples like the Fibonacci word.
Edit intent: clarity
Original:  In this paper, we give a first example of such a precise computation and compute the function of the prefix palindromic length of the Thue-Morse word, a famous test object for all functions on infinite words.
Revised:  In this paper, we give the first example of such a precise computation and compute the function of the prefix palindromic length of the Thue-Morse word, a famous test object for all functions on infinite words.
Edit intent: fluency
Original:  It happens that the sequence (PPL_t(n)) is 2-regular, which raises the question if it is the case for all automatic sequences.
Revised:  It happens that this sequence is 2-regular, which raises the question if it is the case for all automatic sequences.
Edit intent: clarity
Original:  It happens that the sequence (PPL_t(n)) is 2-regular, which raises the question if it is the case for all automatic sequences.
Revised:  It happens that the sequence (PPL_t(n)) is 2-regular, which raises the question if this fact can be generalized to all automatic sequences.
Edit intent: clarity
Original:  To consider continuous-time networks, we associate each edge in a graph with a time-dependent tie strength that can take continuous non-negative values and that decays in time after the most recent interactions .
Revised:  To consider continuous-time networks, we associate each edge in a graph with a time-dependent tie strength that can take continuous non-negative values and decays in time after the most recent interactions .
Edit intent: coherence
Original:  To consider continuous-time networks, we associate each edge in a graph with a time-dependent tie strength that can take continuous non-negative values and that decays in time after the most recent interactions .
Revised:  To consider continuous-time networks, we associate each edge in a graph with a time-dependent tie strength that can take continuous non-negative values and that decays in time after the most recent interaction .
Edit intent: fluency
Original:  We investigate how the mean tie strength evolves with time in several models, and we explore --- both numerically and analytically --- criteria for the emergence of a giant connected component in some of these models  .
Revised:  We investigate how the mean tie strength evolves with time in several models, and we explore -- both numerically and analytically --- criteria for the emergence of a giant connected component in some of these models .
Edit intent: fluency
Original:  We investigate how the mean tie strength evolves with time in several models, and we explore --- both numerically and analytically --- criteria for the emergence of a giant connected component in some of these models  .
Revised:  We investigate how the mean tie strength evolves with time in several models, and we explore --- both numerically and analytically -- criteria for the emergence of a giant connected component in some of these models .
Edit intent: fluency
Original:  Often, KWS systems are speaker-independent, which means that any person -- user or not -- might trigger them.
Revised:  Often, KWS systems are speaker-independent, which means that any person --user or not-- might trigger them.
Edit intent: fluency
Original: Intelligent reflecting surface (IRS) has recently been recognized  a promising technology to enhance the energy and spectrum efficiency of wireless networks by controlling the wireless medium with the configurable electromagnetic materials.
Revised: Intelligent reflecting surface (IRS) has recently been recognized as a promising technology to enhance the energy and spectrum efficiency of wireless networks by controlling the wireless medium with the configurable electromagnetic materials.
Edit intent: fluency
Original:  However, this problem turns out to be a highly intractable nonconvex bi-quadratic programming problem, for which an alternative minimization framework is proposed via solving the nonconvex quadratic programs alternatively.
Revised:  However, this problem turns out to be a highly intractable non-convex bi-quadratic programming problem, for which an alternative minimization framework is proposed via solving the nonconvex quadratic programs alternatively.
Edit intent: fluency
Original:  However, this problem turns out to be a highly intractable nonconvex bi-quadratic programming problem, for which an alternative minimization framework is proposed via solving the nonconvex quadratic programs alternatively.
Revised:  However, this problem turns out to be a highly intractable nonconvex bi-quadratic programming problem, for which an alternative minimization framework is proposed via solving the non-convex quadratic programs alternatively.
Edit intent: fluency
Original:  We further develop a novel difference-of-convex (DC) programming algorithm to solve the resulting nonconvex quadratic programs efficiently by lifting the quadratic programs into rank-one constrained matrix optimization problems, followed by representing the nonconvex rank function as a DC function.
Revised:  We further develop a novel difference-of-convex (DC) programming algorithm to solve the resulting non-convex quadratic programs efficiently by lifting the quadratic programs into rank-one constrained matrix optimization problems, followed by representing the nonconvex rank function as a DC function.
Edit intent: fluency
Original:  We further develop a novel difference-of-convex (DC) programming algorithm to solve the resulting nonconvex quadratic programs efficiently by lifting the quadratic programs into rank-one constrained matrix optimization problems, followed by representing the nonconvex rank function as a DC function.
Revised:  We further develop a novel difference-of-convex (DC) programming algorithm to solve the resulting nonconvex quadratic programs efficiently by lifting the quadratic programs into rank-one constrained matrix optimization problems, followed by representing the non-convex rank function as a DC function.
Edit intent: fluency
Original:  Simulation results demonstrate that the performance gains of the proposed methodologies .
Revised:  Simulation results demonstrate the performance gains of the proposed methodologies .
Edit intent: fluency
Original:  Simulation results demonstrate that the performance gains of the proposed methodologies .
Revised:  Simulation results demonstrate that the performance gains of the proposed method .
Edit intent: clarity
Original: This paper is concerned with the numerical simulation of the three dimensional time-dependent inverse source problem of acoustic waves.
Revised: This paper is concerned with the numerical simulation of three dimensional time-dependent inverse source problem of acoustic waves.
Edit intent: fluency
Original: This paper is concerned with the numerical simulation of the three dimensional time-dependent inverse source problem of acoustic waves.
Revised: This paper is concerned with the numerical simulation of the three dimensional time-dependent inverse source problems of acoustic waves.
Edit intent: fluency
Original:  The  modified method of fundamental solutions (MMFS), which expands the solution utilizing the time convolution of the Green's function and the signal function, are proposed to reconstruct both multiple stationary point sources and a moving point source .
Revised:  The modified method of fundamental solutions (MMFS), which expands the solution utilizing the time convolution of the Green's function and the signal function, is proposed to solve the problem .
Edit intent: clarity
Original:  For the reconstruction of a moving point source, moreover, the MMFS is simplified as a simple sampling method at each time steps . Numerical experiments are provided to show the effectiveness of the proposed methods.
Revised:  For the reconstruction of a moving point source, moreover, the MMFS is simplified as a simple sampling method at each time step . Numerical experiments are provided to show the effectiveness of the proposed methods.
Edit intent: fluency
Original: We show that the basic classification framework alone can be used to tackle some of the most challenging computer vision tasks .
Revised: We show that the basic classification framework alone can be used to tackle some of the most challenging tasks in image synthesis .
Edit intent: clarity
Original: Line charts are commonly used to visualize a series of data samples .
Revised: Line charts are commonly used to visualize a series of data values .
Edit intent: clarity