wanyu/IteraTeR_v2 huggingface dataset:
Original:  We propose Graph Convolution Machine \textit{ (GCM), an end-to-end framework that consists of three components: an encoder, graph convolution (GC) layers, and a decoder.
Revised:  We propose \textit{ (GCM), an end-to-end framework that consists of three components: an encoder, graph convolution (GC) layers, and a decoder.
Edit intent: clarity
Original: The activity of neuronal networks can exhibit periods of bursting, the properties of which remain unclear.
Revised: In the absence of inhibition, excitatory neuronal networks can exhibit periods of bursting, the properties of which remain unclear.
Edit intent: clarity
Original:  To study the bursting dynamics of a network , we develop a new stochastic model based on synaptic properties that also accounts for afterhyperpolarization , which shapes the end of a burst.
Revised:  To study the bursting dynamics of a network , we develop here a bursting model based on synaptic properties that also accounts for afterhyperpolarization , which shapes the end of a burst.
Edit intent: clarity
Original:  Bursting is defined by long deterministic excursions outside the basin of attraction, while the interburst duration is defined by the escape induced by random fluctuations.
Revised:  We show here that bursting is defined by long deterministic excursions outside the basin of attraction, while the interburst duration is defined by the escape induced by random fluctuations.
Edit intent: coherence
Original:  Bursting is defined by long deterministic excursions outside the basin of attraction, while the interburst duration is defined by the escape induced by random fluctuations.
Revised:  Bursting is defined by long deterministic excursions away from the attractor, while IBI corresponds to escape induced by random fluctuations.
Edit intent: clarity
Original:  To characterize the distribution of the burst durations, we determine the distribution of exit points located on the two-dimensional separatrix \Sigma .
Revised:  To characterize the distribution of the burst durations, depends on the distribution of exit points located on the two-dimensional separatrix \Sigma .
Edit intent: clarity
Original:  Finally, we explore how various parameters such as the network connectivity and the afterhyperpolarization characteristics influence bursting and AHP dynamics .
Revised:  Finally, to better characterize the role of several parameters such as the network connectivity and the afterhyperpolarization characteristics influence bursting and AHP dynamics .
Edit intent: clarity
Original:  This paper describes the functionalities of the SBS Brand Intelligence App (SBS BI), which has been designed to assess brand importance and provide brand analytics through the analysis of (big) textual data.
Revised:  This chapter describes the functionalities of the SBS Brand Intelligence App (SBS BI), which has been designed to assess brand importance and provide brand analytics through the analysis of (big) textual data.
Edit intent: clarity
Original:  This paper describes the functionalities of the SBS Brand Intelligence App (SBS BI), which has been designed to assess brand importance and provide brand analytics through the analysis of (big) textual data.
Revised:  This paper describes the functionalities of the SBS Brand Intelligence App (SBS BI), which has been designed to assess brand importance and provides brand analytics through the analysis of (big) textual data.
Edit intent: fluency
Original:  However, coordinating adaptive workflows with traditional procedural programming languages can be difficult , because system flow is determined by unpredictable scientific phenomena, which often appear in an unknown order and can evade event handling.
Revised:  However, coordinating adaptive workflows with traditional procedural programming languages can be difficult because system flow is determined by unpredictable scientific phenomena, which often appear in an unknown order and can evade event handling.
Edit intent: fluency
Original:  This makes the implementation of adaptive workflows tedious and errorprone .
Revised:  This makes the implementation of adaptive workflows tedious and error-prone .
Edit intent: fluency
Original:  Not much work has been done to adopt these methods into the field of in situ visualization and analysis.
Revised:  However, there is a dearth of research on adapting these approaches to in situ visualization and analysis.
Edit intent: clarity
Original:  With this paper, we present a proof-of-concept language , parser and runtime system for designing adaptive systems through a declarative and reactive programming paradigm.
Revised:  With this paper, we present a language design and runtime system for designing adaptive systems through a declarative and reactive programming paradigm.
Edit intent: clarity
Original:  With this paper, we present a proof-of-concept language , parser and runtime system for designing adaptive systems through a declarative and reactive programming paradigm.
Revised:  With this paper, we present a proof-of-concept language , parser and runtime system for developing adaptive systems through a declarative and reactive programming paradigm.
Edit intent: clarity
Original:  We illustrate how an adaptive workflow  system is implemented using our approach , and demonstrate it with use cases from real scientific simulations .
Revised:  We illustrate how an adaptive workflow system is implemented using our approach and demonstrate it with use cases from real scientific simulations .
Edit intent: fluency
Original: Selection on the Cartesian sum, A + B, is a classic and important problem.
Revised: Selection and sorting the Cartesian sum, A + B, is a classic and important problem.
Edit intent: clarity
Original:  Kaplanet al.
Revised:  Kaplan
Edit intent: clarity
Original:  Here, a new optimal algorithm is presented, which uses layer-ordered heaps.
Revised:  Here, a new algorithm is presented, which uses layer-ordered heaps.
Edit intent: clarity
Original:  Our generalized skeletonization factorization retains the locality property afforded by the "proxy point method ", and allows for a parallelized implementation where different processors work on different parts of the boundary simultaneously.
Revised:  Our generalized skeletonization factorization retains the locality property afforded by the "proxy point method ," and allows for a parallelized implementation where different processors work on different parts of the boundary simultaneously.
Edit intent: fluency
Original:  Further, when the boundary undergoes local geometric perturbations (such as movement of an interior hole), the solution can be recomputed in logarithmic time with respect to the number of  discretization nodes.
Revised:  Further, when the boundary undergoes local geometric perturbations (such as movement of an interior hole), the factorization can be recomputed in logarithmic time with respect to the number of discretization nodes.
Edit intent: clarity
Original:  Further, when the boundary undergoes local geometric perturbations (such as movement of an interior hole), the solution can be recomputed in logarithmic time with respect to the number of  discretization nodes.
Revised:  Further, when the boundary undergoes local geometric perturbations (such as movement of an interior hole), the solution can be recomputed efficiently with respect to the number of discretization nodes.
Edit intent: clarity
Original:  The leading front of a collective migrating epithelial cell layer often destabilizes into multicellular finger-like protrusions  each of which is guided by a leader cell at the fingertip.
Revised:  The leading front of a collective migrating epithelial cell layer often destabilizes into multicellular finger-like protrusions , each of which is guided by a leader cell at the fingertip.
Edit intent: fluency
Original:  In addition, we also study this phenomenon in the context of active fluid , which justifies  our assumptions in the computational model.
Revised:  In addition, we also study the driving instability in the context of active fluid , which justifies our assumptions in the computational model.
Edit intent: clarity
Original:  In addition, we also study this phenomenon in the context of active fluid , which justifies  our assumptions in the computational model.
Revised:  In addition, we also study this phenomenon in the context of active fluid , which justifies some of our assumptions in the computational model.
Edit intent: clarity
Original:  We show that no finger protrusions could emerge in a  homogenous active fluid .
Revised:  We show that no finger protrusions would emerge in a homogenous active fluid .
Edit intent: clarity
Original:  The aim is to perform target search and destroy operation in an unknown / uncertain environment, without any communication within the swarm.
Revised:  The aim is to perform target search and destroy operation in an unknown and uncertain environment, without any communication within the swarm.
Edit intent: fluency
Original:  We trained a linear mapping between fMRI data, acquired over images from 150 different categories of ImageNet, and their corresponding BigBiGAN latent vectors.
Revised:  We computed a linear mapping between fMRI data, acquired over images from 150 different categories of ImageNet, and their corresponding BigBiGAN latent vectors.
Edit intent: clarity
Original: Envision for smart city and Internet of Everything imperiously appeals to the implementation of massive machine type communication (mMTC ), some features of which, such as massive number of devices and bursty short packet transmissions, require new methods to enable the cellular system to seamlessly support the integrationof mMTC . Rigorous theoretical analysis is indispensable to obtain constructive insight for the design of mMTC mechanism .
Revised: The vision for smart city and Internet of Everything imperiously appeals to the implementation of massive machine type communication (mMTC ), some features of which, such as massive number of devices and bursty short packet transmissions, require new methods to enable the cellular system to seamlessly support the integrationof mMTC . Rigorous theoretical analysis is indispensable to obtain constructive insight for the design of mMTC mechanism .
Edit intent: fluency
Original: Envision for smart city and Internet of Everything imperiously appeals to the implementation of massive machine type communication (mMTC ), some features of which, such as massive number of devices and bursty short packet transmissions, require new methods to enable the cellular system to seamlessly support the integrationof mMTC . Rigorous theoretical analysis is indispensable to obtain constructive insight for the design of mMTC mechanism .
Revised: Envision for smart city imperiously appeals to the implementation of massive machine type communication (mMTC ), some features of which, such as massive number of devices and bursty short packet transmissions, require new methods to enable the cellular system to seamlessly support the integrationof mMTC . Rigorous theoretical analysis is indispensable to obtain constructive insight for the design of mMTC mechanism .
Edit intent: coherence
Original: Envision for smart city and Internet of Everything imperiously appeals to the implementation of massive machine type communication (mMTC ), some features of which, such as massive number of devices and bursty short packet transmissions, require new methods to enable the cellular system to seamlessly support the integrationof mMTC . Rigorous theoretical analysis is indispensable to obtain constructive insight for the design of mMTC mechanism .
Revised: Envision for smart city and Internet of Everything imperiously appeals to the implementation of Internet-of-Things (IoT ), some features of which, such as massive number of devices and bursty short packet transmissions, require new methods to enable the cellular system to seamlessly support the integrationof mMTC . Rigorous theoretical analysis is indispensable to obtain constructive insight for the design of mMTC mechanism .
Edit intent: clarity
Original: Envision for smart city and Internet of Everything imperiously appeals to the implementation of massive machine type communication (mMTC ), some features of which, such as massive number of devices and bursty short packet transmissions, require new methods to enable the cellular system to seamlessly support the integrationof mMTC . Rigorous theoretical analysis is indispensable to obtain constructive insight for the design of mMTC mechanism .
Revised: Envision for smart city and Internet of Everything imperiously appeals to the implementation of massive machine type communication (mMTC ), some features of which, such as massive access and bursty short packet transmissions, require new methods to enable the cellular system to seamlessly support the integrationof mMTC . Rigorous theoretical analysis is indispensable to obtain constructive insight for the design of mMTC mechanism .
Edit intent: clarity
Original: Envision for smart city and Internet of Everything imperiously appeals to the implementation of massive machine type communication (mMTC ), some features of which, such as massive number of devices and bursty short packet transmissions, require new methods to enable the cellular system to seamlessly support the integrationof mMTC . Rigorous theoretical analysis is indispensable to obtain constructive insight for the design of mMTC mechanism .
Revised: Envision for smart city and Internet of Everything imperiously appeals to the implementation of massive machine type communication (mMTC ), some features of which, such as massive number of devices and bursty short packet transmissions, require new methods to enable the cellular system to seamlessly support its integration . Rigorous theoretical analysis is indispensable to obtain constructive insight for the design of mMTC mechanism .
Edit intent: clarity
Original: Envision for smart city and Internet of Everything imperiously appeals to the implementation of massive machine type communication (mMTC ), some features of which, such as massive number of devices and bursty short packet transmissions, require new methods to enable the cellular system to seamlessly support the integrationof mMTC . Rigorous theoretical analysis is indispensable to obtain constructive insight for the design of mMTC mechanism .
Revised: Envision for smart city and Internet of Everything imperiously appeals to the implementation of massive machine type communication (mMTC ), some features of which, such as massive number of devices and bursty short packet transmissions, require new methods to enable the cellular system to seamlessly support the integrationof mMTC . Rigorous theoretical analysis is indispensable to obtain constructive insight for the networking design of massive access .
Edit intent: clarity
Original:  In this paper, we propose and define the notion of massive and sporadic access (MSA) to quantitatively describe the scenario of mMTC .
Revised:  In this paper, we propose and define the notion of massive and sporadic access (MSA) to quantitatively describe the massive access of IoT devices .
Edit intent: clarity
Original:  We evaluate the  correlation of interference and the correlation of successful transmission events, and verify that these correlations are negligible in the scenario of MSA.
Revised:  We evaluate the correlation of interference and successful transmission events, and verify that these correlations are negligible in the scenario of MSA.
Edit intent: fluency
Original:  We evaluate the  correlation of interference and the correlation of successful transmission events, and verify that these correlations are negligible in the scenario of MSA.
Revised:  We evaluate the correlation of interference and the correlation of successful transmission events, and verify that such correlation is negligible in the scenario of MSA.
Edit intent: clarity
Original:  In view of this, in order to resolve the difficulty in the precise spatio-temporal analysis that complex interactions persist among the queues, we propose the approximation that all nodes are moving extremely fast so that their locations are independent at different time instants .
Revised:  In view of this, in order to resolve the difficulty in any precise spatio-temporal analysis that complex interactions persist among the queues, we propose the approximation that all nodes are moving extremely fast so that their locations are independent at different time instants .
Edit intent: clarity
Original:  In view of this, in order to resolve the difficulty in the precise spatio-temporal analysis that complex interactions persist among the queues, we propose the approximation that all nodes are moving extremely fast so that their locations are independent at different time instants .
Revised:  In view of this, in order to resolve the difficulty in the precise spatio-temporal analysis where complex interactions persist among the queues, we propose the approximation that all nodes are moving extremely fast so that their locations are independent at different time instants .
Edit intent: fluency
Original:  In view of this, in order to resolve the difficulty in the precise spatio-temporal analysis that complex interactions persist among the queues, we propose the approximation that all nodes are moving extremely fast so that their locations are independent at different time instants .
Revised:  In view of this, in order to resolve the difficulty in the precise spatio-temporal analysis that complex interactions persist among the queues, we propose an approximation that all nodes are moving extremely fast so that their locations are independent at different time instants .
Edit intent: fluency
Original:  In view of this, in order to resolve the difficulty in the precise spatio-temporal analysis that complex interactions persist among the queues, we propose the approximation that all nodes are moving extremely fast so that their locations are independent at different time instants .
Revised:  In view of this, in order to resolve the difficulty in the precise spatio-temporal analysis that complex interactions persist among the queues, we propose the approximation that all nodes are moving so fast that their locations are independent at different time instants .
Edit intent: clarity
Original:  In view of this, in order to resolve the difficulty in the precise spatio-temporal analysis that complex interactions persist among the queues, we propose the approximation that all nodes are moving extremely fast so that their locations are independent at different time instants .
Revised:  In view of this, in order to resolve the difficulty in the precise spatio-temporal analysis that complex interactions persist among the queues, we propose the approximation that all nodes are moving extremely fast so that their locations are independent at different time slots .
Edit intent: clarity
Original:  Furthermore, we compare the original static network and the equivalent network with high mobility to demonstrate the effectiveness of the proposed approximation method .
Revised:  Furthermore, we compare the original static network and the equivalent network with high mobility to demonstrate the effectiveness of the proposed approximation approach .
Edit intent: clarity
Original:  The proposed approach is promising for providing a convenient and general solution to evaluate and design the mMTC with massive and sporadic access.
Revised:  The proposed approach is promising for providing a convenient and general solution to evaluate and design the IoT network with massive and sporadic access.
Edit intent: clarity
Original:  In this work, we introduce a Bayesian nonparametric formulation of the SBM and a corresponding algorithm to efficiently find communities in bipartite networks without overfitting .
Revised:  Here we introduce a Bayesian nonparametric formulation of the SBM and a corresponding algorithm to efficiently find communities in bipartite networks without overfitting .
Edit intent: clarity
Original:  Numerical experiments in three space dimensions demonstrate up to order 12 in time and 17 in space for constant , spatiotemporally varying as well as  solution-dependent viscosity.
Revised:  Numerical experiments in three space dimensions demonstrate up to order 12 in time and 17 in space for constant as well as solution-dependent viscosity.
Edit intent: clarity
Original:  Numerical experiments in three space dimensions demonstrate up to order 12 in time and 17 in space for constant , spatiotemporally varying as well as  solution-dependent viscosity.
Revised:  Numerical experiments in three space dimensions demonstrate up to order 12 in time and 17 in space for constant , spatiotemporally varying as well as varying, solution-dependent viscosity.
Edit intent: clarity
Original:  The phenomenon of order reduction also reported by Minion Saye is observed in the case of time-dependent boundary conditions , where it manifests in terms of a slower convergence of the correction sweeps .
Revised:  Saye is observed in the case of time-dependent boundary conditions , where it manifests in terms of a slower convergence of the correction sweeps .
Edit intent: clarity
Original:  The phenomenon of order reduction also reported by Minion Saye is observed in the case of time-dependent boundary conditions , where it manifests in terms of a slower convergence of the correction sweeps .
Revised:  The phenomenon of order reduction also reported by Minion Saye is observed in the case of time-dependent boundary conditions .
Edit intent: clarity
Original:  We show that for every choice of 0<\beta , \varepsilon < 1  there exists p<1/2 and a distribution H of linear sketches of size \tau = O(\log ^4 (u)\varepsilon^{-2}\beta^{-2}) such that:
Revised:  We show that for every choice of 0<\beta < 1 there exists p<1/2 and a distribution H of linear sketches of size \tau = O(\log ^4 (u)\varepsilon^{-2}\beta^{-2}) such that:
Edit intent: fluency
Original:  1) For random H\simH and noise vector \varphi, given Hx + \varphi we can compute an estimate of \Vert x  \Vert _0 that is accurate within a factor 1\pm\beta, plus an additive error O(\log ^3 (u)\varepsilon^{-2}\beta^{-2}), with high probability , and 2) For every H\sim\mathcal{H}, Hx + \varphi is \varepsilon-differentially private over the randomness in \varphi.
Revised:  1) For random H\simH and noise vector \varphi, given Hx + \varphi we can compute an estimate of \Vert x \Vert _0 that is accurate within a factor 1\pm\beta, plus additive error O(\log ^3 (u)\varepsilon^{-2}\beta^{-2}), with high probability , and 2) For every H\sim\mathcal{H}, Hx + \varphi is \varepsilon-differentially private over the randomness in \varphi.
Edit intent: fluency
Original:  1) For random H\simH and noise vector \varphi, given Hx + \varphi we can compute an estimate of \Vert x  \Vert _0 that is accurate within a factor 1\pm\beta, plus an additive error O(\log ^3 (u)\varepsilon^{-2}\beta^{-2}), with high probability , and 2) For every H\sim\mathcal{H}, Hx + \varphi is \varepsilon-differentially private over the randomness in \varphi.
Revised:  1) For random H\simH and noise vector \varphi, given Hx + \varphi we can compute an estimate of \Vert x \Vert _0 that is accurate within a factor 1\pm\beta, plus an additive error O(\log (u)\varepsilon^{-2}\beta^{-2}), with high probability , and 2) For every H\sim\mathcal{H}, Hx + \varphi is \varepsilon-differentially private over the randomness in \varphi.
Edit intent: clarity
Original:  1) For random H\simH and noise vector \varphi, given Hx + \varphi we can compute an estimate of \Vert x  \Vert _0 that is accurate within a factor 1\pm\beta, plus an additive error O(\log ^3 (u)\varepsilon^{-2}\beta^{-2}), with high probability , and 2) For every H\sim\mathcal{H}, Hx + \varphi is \varepsilon-differentially private over the randomness in \varphi.
Revised:  1) For random H\simH and noise vector \varphi, given Hx + \varphi we can compute an estimate of \Vert x \Vert _0 that is accurate within a factor 1\pm\beta, plus an additive error O(\log ^3 (u)\varepsilon^{-2}\beta^{-2}), with probability 1-1/u , and 2) For every H\sim\mathcal{H}, Hx + \varphi is \varepsilon-differentially private over the randomness in \varphi.
Edit intent: clarity