wanyu/IteraTeR_v2 huggingface dataset:
Original: We study the problem of computing the join of n relations in multiple rounds of MapReduce.
Revised: We study the problem of computing the equijoin of n relations in multiple rounds of MapReduce.
Edit intent: fluency
Original:  We introduce a distributed and generalized version of Yannakakis's algorithm, called GYM. GYM takes as input any generalized hypertree decomposition (GHD) of a query , having widthw and depth d, and computes the query in O(d + \log(n)) rounds and O(n(\mathrm{IN^w + OUT)^2\w{\em } \iw memory available per machine in the cluster and \mathrm{IN and OUT are the sizes of input and output of the query, respectively.
Revised:  We introduce a distributed and generalized version of Yannakakis's algorithm, called GYM. GYM takes as input any generalized hypertree decomposition (GHD) of a query , having widthw and depth d, and computes the query in O(d + \log(n)) rounds and O(n(\mathrm{IN^w + OUT)^2\w,{\em } \iw memory available per machine in the cluster and \mathrm{IN and OUT are the sizes of input and output of the query, respectively.
Edit intent: fluency
Original:  M is assumed to be IN^{1{\epsilon}} for some constant \epsilon > 1. Using GYM we achieve two main results}  : (1) Every width-w query can be computed in O(n) rounds of MapReduce with O(n \frac{(\mathrm{IN^w + \mathrm{OUT})^2}{M}) cost;
Revised:  M is assumed to be IN^{1{\epsilon}} for some constant \epsilon > 1. Using GYM we achieve two main results} , we show that : (1) Every width-w query can be computed in O(n) rounds of MapReduce with O(n \frac{(\mathrm{IN^w + \mathrm{OUT})^2}{M}) cost;
Edit intent: coherence
Original:  M is assumed to be IN^{1{\epsilon}} for some constant \epsilon > 1. Using GYM we achieve two main results}  : (1) Every width-w query can be computed in O(n) rounds of MapReduce with O(n \frac{(\mathrm{IN^w + \mathrm{OUT})^2}{M}) cost;
Revised:  M is assumed to be IN^{1{\epsilon}} for some constant \epsilon > 1. Using GYM we achieve two main results} : (1) Every width-w query can be computed in O(n) rounds with O(n \frac{(\mathrm{IN^w + \mathrm{OUT})^2}{M}) cost;
Edit intent: clarity
Original:  } (2) Every width-w query can be computed in O(\log(n)) rounds of MapReduce with O(n\frac{(\mathrm{IN^{3w} + \mathrm{OUT})^2}{M})} ^{\max(\w, 3\iw)} + \mathrm{OUT})^2}{M}) communication cost.
Revised:  } (2) Q can be computed in O(\log(n)) rounds of MapReduce with O(n\frac{(\mathrm{IN^{3w} + \mathrm{OUT})^2}{M})} ^{\max(\w, 3\iw)} + \mathrm{OUT})^2}{M}) communication cost.
Edit intent: clarity
Original:  } (2) Every width-w query can be computed in O(\log(n)) rounds of MapReduce with O(n\frac{(\mathrm{IN^{3w} + \mathrm{OUT})^2}{M})} ^{\max(\w, 3\iw)} + \mathrm{OUT})^2}{M}) communication cost.
Revised:  } (2) Every width-w query can be computed in O(\log(n)) rounds ^{3w} + \mathrm{OUT})^2}{M})} ^{\max(\w, 3\iw)} + \mathrm{OUT})^2}{M}) communication cost.
Edit intent: clarity
Original:  We achieve our second result by showing how to construct a\w\iw O(\log(n)) -depth and width-3w GHD of a query of width w . We describe another general technique to construct GHDs with even shorter depth and longer widths , effectively showing a spectrum of tradeoffs one can make between communication and the number of rounds of MapReduce .
Revised:  We achieve our second result by showing how to construct a\w\iw O(\log(n)) . We describe another general technique to construct GHDs with even shorter depth and longer widths , effectively showing a spectrum of tradeoffs one can make between communication and the number of rounds of MapReduce .
Edit intent: clarity
Original:  We achieve our second result by showing how to construct a\w\iw O(\log(n)) -depth and width-3w GHD of a query of width w . We describe another general technique to construct GHDs with even shorter depth and longer widths , effectively showing a spectrum of tradeoffs one can make between communication and the number of rounds of MapReduce .
Revised:  We achieve our second result by showing how to construct a\w\iw O(\log(n)) -depth and width-3w GHD of a query of width w . We describe another technique to construct GHDs with even shorter depth and longer widths , effectively showing a spectrum of tradeoffs one can make between communication and the number of rounds of MapReduce .
Edit intent: clarity
Original:  We achieve our second result by showing how to construct a\w\iw O(\log(n)) -depth and width-3w GHD of a query of width w . We describe another general technique to construct GHDs with even shorter depth and longer widths , effectively showing a spectrum of tradeoffs one can make between communication and the number of rounds of MapReduce .
Revised:  We achieve our second result by showing how to construct a\w\iw O(\log(n)) -depth and width-3w GHD of a query of width w . We describe another general technique to construct GHDs with longer widths and shorter depths, demonstrating a spectrum of tradeoffs one can make between communication and the number of rounds of MapReduce .
Edit intent: clarity
Original:  We achieve our second result by showing how to construct a\w\iw O(\log(n)) -depth and width-3w GHD of a query of width w . We describe another general technique to construct GHDs with even shorter depth and longer widths , effectively showing a spectrum of tradeoffs one can make between communication and the number of rounds of MapReduce .
Revised:  We achieve our second result by showing how to construct a\w\iw O(\log(n)) -depth and width-3w GHD of a query of width w . We describe another general technique to construct GHDs with even shorter depth and longer widths , effectively showing a spectrum of tradeoffs one can make between communication and the number of rounds .
Edit intent: clarity
Original: We study how excitation propagates in chains of inhibition-stabilized neural networks with nearest-neighbor coupling.
Revised: To gain insight into neural events responsible for visual perception of spatial and temporal optical patterns, we study how neural activation propagates in chains of inhibition-stabilized neural networks with nearest-neighbor coupling.
Edit intent: clarity
Original:  The excitation generated by local stimuli in such networks propagates across space and time , forming spatiotemporal waves that affect the dynamics of excitation generated by stimuli separated spatially and temporally.
Revised:  The activation generated by local stimuli in such networks propagates across space and time , forming spatiotemporal waves that affect the dynamics of excitation generated by stimuli separated spatially and temporally.
Edit intent: clarity
Original:  The excitation generated by local stimuli in such networks propagates across space and time , forming spatiotemporal waves that affect the dynamics of excitation generated by stimuli separated spatially and temporally.
Revised:  The excitation generated by local stimuli in such networks propagates between locations , forming spatiotemporal waves that affect the dynamics of excitation generated by stimuli separated spatially and temporally.
Edit intent: clarity
Original:  The excitation generated by local stimuli in such networks propagates across space and time , forming spatiotemporal waves that affect the dynamics of excitation generated by stimuli separated spatially and temporally.
Revised:  The excitation generated by local stimuli in such networks propagates across space and time , forming spatiotemporal waves that affect the dynamics of activation generated by stimuli separated spatially and temporally.
Edit intent: clarity
Original:  These interactions form characteristic interference patterns, manifested as network preferences : for spatial and temporal frequencies of stimulus intensity, for stimulus velocities, and as contextual ("lateral") interactions between stimuli.
Revised:  These interactions form characteristic interference patterns, manifested as intrinsic preferences of the network for spatiotemporal frequencies of stimulus intensity, for stimulus velocities, and as contextual ("lateral") interactions between stimuli.
Edit intent: clarity
Original: To gain insight into  neural events responsible for visual perception of spatial and temporal optical patterns, we study how neural activation propagates in chains of inhibition-stabilized neural networks with nearest-neighbor coupling.
Revised: To gain insight into the neural events responsible for visual perception of spatial and temporal optical patterns, we study how neural activation propagates in chains of inhibition-stabilized neural networks with nearest-neighbor coupling.
Edit intent: fluency
Original: To gain insight into  neural events responsible for visual perception of spatial and temporal optical patterns, we study how neural activation propagates in chains of inhibition-stabilized neural networks with nearest-neighbor coupling.
Revised: To gain insight into neural events responsible for visual perception of spatial and temporal optical patterns, we study how neural activation spreads in arrays of inhibition-stabilized neural networks with nearest-neighbor coupling.
Edit intent: clarity
Original:  The activation generated by local stimuli in such networks  propagates between locations, forming spatiotemporal waves that affect the dynamics of activation generated by stimuli separated spatially and temporally  .
Revised:  The activation generated in such networks propagates between locations, forming spatiotemporal waves that affect the dynamics of activation generated by stimuli separated spatially and temporally .
Edit intent: clarity
Original:  These interactions form characteristic interference patterns , manifested as intrinsic preferences of the network for spatiotemporal frequencies of stimulus intensity, for stimulus velocities, and as contextual ( "lateral" ) interactions between stimuli .
Revised:  These interactions form characteristic interference patterns that make the network intrinsically selective for certain stimuli, such as modulations of luminance at specific spatial and temporal frequencies and specific velocities of visual motion. Due to the inherent nonlinearity of the network, its intrinsic tuning depends on stimulus intensity and contrast. The interference patterns have multiple features of "lateral" ) interactions between stimuli .
Edit intent: clarity
Original:  These interactions form characteristic interference patterns , manifested as intrinsic preferences of the network for spatiotemporal frequencies of stimulus intensity, for stimulus velocities, and as contextual ( "lateral" ) interactions between stimuli .
Revised:  These interactions form characteristic interference patterns , manifested as intrinsic preferences of the network for spatiotemporal frequencies of stimulus intensity, for stimulus velocities, and as contextual ( "lateral" interactions between stimuli .
Edit intent: fluency
Original:  With much advancement in the field of nanotechnology, bioengineering  and synthetic biology over the past decade, micro- and nano-scales devices are becoming a reality.
Revised:  With significant advances in the fields of nanotechnology, bioengineering and synthetic biology over the past decade, micro- and nano-scales devices are becoming a reality.
Edit intent: clarity
Original:  With much advancement in the field of nanotechnology, bioengineering  and synthetic biology over the past decade, micro- and nano-scales devices are becoming a reality.
Revised:  With much advancement in the field of nanotechnology, bioengineering , and synthetic biology over the past decade, micro- and nano-scales devices are becoming a reality.
Edit intent: fluency
Original:  With much advancement in the field of nanotechnology, bioengineering  and synthetic biology over the past decade, micro- and nano-scales devices are becoming a reality.
Revised:  With much advancement in the field of nanotechnology, bioengineering and synthetic biology over the past decade, microscale and nanoscale devices are becoming a reality.
Edit intent: fluency
Original:  At the same time, despite the prevalence of radio communication, there are still areas where traditional electromagnetic waves find it difficult or expensive to reach.
Revised:  At the same time, despite the prevalence of radio communication, there are still areas where traditional electromagnetic waves find it inefficient or expensive to reach.
Edit intent: clarity
Original:  Points of interest in industry, cities, medical , and military applications often lie in embedded and entrenched areas, accessible only by ventricles at scales too small for conventional radio- and micro-waves , or they are located in such a way that directional high frequency systems are ineffective.
Revised:  Points of interest in industry, cities, medicine , and military applications often lie in embedded and entrenched areas, accessible only by ventricles at scales too small for conventional radio- and micro-waves , or they are located in such a way that directional high frequency systems are ineffective.
Edit intent: fluency
Original:  Points of interest in industry, cities, medical , and military applications often lie in embedded and entrenched areas, accessible only by ventricles at scales too small for conventional radio- and micro-waves , or they are located in such a way that directional high frequency systems are ineffective.
Revised:  Points of interest in industry, cities, medical , and military applications often lie in embedded and entrenched areas, accessible only by ventricles at scales too small for conventional wave based communications , or they are located in such a way that directional high frequency systems are ineffective.
Edit intent: clarity
Original:  Points of interest in industry, cities, medical , and military applications often lie in embedded and entrenched areas, accessible only by ventricles at scales too small for conventional radio- and micro-waves , or they are located in such a way that directional high frequency systems are ineffective.
Revised:  Points of interest in industry, cities, medical , and military applications often lie in embedded and entrenched areas, accessible only by ventricles at scales too small for conventional radio- and micro-waves , or they are structured in such a way that directional high frequency systems are ineffective.
Edit intent: clarity
Original:  With significant advances in the fields of nanotechnology, bioengineering , and synthetic biology over the past decade, microscale and nanoscale devices are becoming a reality.
Revised:  With significant advances in the fields of nanotechnology, bioengineering and synthetic biology over the past decade, microscale and nanoscale devices are becoming a reality.
Edit intent: fluency
Original:  With significant advances in the fields of nanotechnology, bioengineering , and synthetic biology over the past decade, microscale and nanoscale devices are becoming a reality.
Revised:  With significant advances in the fields of nanotechnology, bioengineering , and synthetic biology over the past decade, microscales and nanoscales devices are becoming a reality.
Edit intent: fluency
Original:  At the same time, despite the prevalence of radio communication, there are still areas where traditional electromagnetic waves find it inefficient or expensive to reach.
Revised:  At the same time, despite the prevalence of radio communication, there are still areas where traditional electromagnetic waves find it difficult or expensive to reach.
Edit intent: clarity
Original:  Points of interest in industry, cities, medicine, and military applications often lie in embedded and entrenched areas, accessible only by ventricles at scales too small for conventional wave based communications , or they are structured in such a way that directional high frequency systems are ineffective.
Revised:  Points of interest in industry, cities, and medical applications often lie in embedded and entrenched areas, accessible only by ventricles at scales too small for conventional wave based communications , or they are structured in such a way that directional high frequency systems are ineffective.
Edit intent: clarity
Original:  Points of interest in industry, cities, medicine, and military applications often lie in embedded and entrenched areas, accessible only by ventricles at scales too small for conventional wave based communications , or they are structured in such a way that directional high frequency systems are ineffective.
Revised:  Points of interest in industry, cities, medicine, and military applications often lie in embedded and entrenched areas, accessible only by ventricles at scales too small for conventional radio waves and microwaves , or they are structured in such a way that directional high frequency systems are ineffective.
Edit intent: clarity
Original:  Points of interest in industry, cities, medicine, and military applications often lie in embedded and entrenched areas, accessible only by ventricles at scales too small for conventional wave based communications , or they are structured in such a way that directional high frequency systems are ineffective.
Revised:  Points of interest in industry, cities, medicine, and military applications often lie in embedded and entrenched areas, accessible only by ventricles at scales too small for conventional wave based communications , or they are located in such a way that directional high frequency systems are ineffective.
Edit intent: clarity
Original:  Molecular communication is a biologically inspired communication scheme that could be employed for solving these problems .
Revised:  Inspired by nature, one solution to these problems is molecular communication (MC), where chemical signals are used to transfer information .
Edit intent: clarity
Original:  In this paper, we highlight the recent advancements in the field of molecular communication engineering .
Revised:  In this paper, the recent advancements in the field of molecular communication engineering .
Edit intent: clarity
Original: In order to improve offline map matching of low sampling rate GPSaccuracy, a conditional random field and route preference mining based path matching algorithm is proposed.
Revised: In order to improve offline map matching accuracy of low-sampling-rate GPS, a map matching algorithm based on conditional random fields (CRF) and route preference mining based path matching algorithm is proposed.
Edit intent: clarity
Original: In order to improve offline map matching of low sampling rate GPSaccuracy, a conditional random field and route preference mining based path matching algorithm is proposed.
Revised: In order to improve offline map matching of low sampling rate GPSaccuracy, a conditional random field and route preference mining is proposed.
Edit intent: clarity
Original:  Road deviation and the spatial-temporal relationship between the sampling points were used as features of GPS trajectory for conditional random field model, which can utilize the advantages of integrating the context information into features flexibly.
Revised:  Road deviation and the spatial-temporal relationship between the sampling points are used as features of GPS trajectory for conditional random field model, which can utilize the advantages of integrating the context information into features flexibly.
Edit intent: fluency
Original:  Road deviation and the spatial-temporal relationship between the sampling points were used as features of GPS trajectory for conditional random field model, which can utilize the advantages of integrating the context information into features flexibly.
Revised:  Road deviation and the spatial-temporal relationship between the sampling points were used as features of GPS trajectory in CRF model, which can utilize the advantages of integrating the context information into features flexibly.
Edit intent: clarity
Original:  When the sampling rate is below the threshold value, personal route preference of a driver was used as replenishment to be superposed on the transfer featuresof CRF . The experimental results show that this method can improve the accuracy of the matching, especially in the case of low sampling rate.
Revised:  When the sampling rate is below the threshold value, personal route preference of a driver is used as replenishment to be superposed on the transfer featuresof CRF . The experimental results show that this method can improve the accuracy of the matching, especially in the case of low sampling rate.
Edit intent: fluency
Original:  Extending previous work, we provide a complete overview of the inequalities among them and resolve some open questions.
Revised:  Extending previous work, we provide a complete overview of the inequalities among these reproduction numbers and resolve some open questions.
Edit intent: clarity
Original:  We show that for the vast majority of the models considered in the literature R_r \geq R_0 .\ge \le  We show that, in contrast to models without social structure, random vaccination of a fraction 1-1/R_0 of the population  with a perfect vaccine is usually insufficient to prevent large epidemics.
Revised:  We show that for the vast majority of the models considered in the literature R_r \geq R_0 .\ge \le We show that, in contrast to models without social structure, vaccination of a fraction 1-1/R_0 of the population with a perfect vaccine is usually insufficient to prevent large epidemics.
Edit intent: clarity
Original:  If the network has an extensive core, we estimate the size of minimum dominating sets by a mean-field theory and implement a belief-propagation algorithm to obtain nearly optimal solutions.
Revised:  If the network has an extensive core, we estimate the size of minimum dominating sets by a mean-field theory and implement a belief-propagation algorithm to obtain near-optimal solutions.
Edit intent: clarity
Original: Recurrent Neural Networks (RNNs) with Long-Short Term Memory units (LSTM) are widely used because they are expressive and are easy to train.
Revised: Recurrent Neural Networks (RNNs) with Long Short-Term Memory units (LSTM) are widely used because they are expressive and are easy to train.
Edit intent: fluency
Original:  Our interest lies in empirically evaluating the expressiveness and the learnability of LSTMs  by training them to evaluate short computer programs, a problem that has traditionally been viewed as too complex for neural networks.
Revised:  Our interest lies in empirically evaluating the expressiveness and the learnability of LSTMs by training them to evaluate short computer programs, a domain that has traditionally been viewed as too complex for neural networks.
Edit intent: clarity
Original:  Our interest lies in empirically evaluating the expressiveness and the learnability of LSTMs  by training them to evaluate short computer programs, a problem that has traditionally been viewed as too complex for neural networks.
Revised:  Our interest lies in empirically evaluating the expressiveness and the learnability of LSTMs by training them to evaluate short computer programs, a problem that has traditionally been seen as too complex for neural networks.
Edit intent: fluency
Original:  Notably, it was necessary to use curriculum learning, and while conventional curriculum learning proved ineffective, we developed an new variant of curriculum learning that improved our networks' performance in all experimental conditions  .
Revised:  Notably, it was necessary to use curriculum learning, and while conventional curriculum learning proved ineffective, we developed a new variant of curriculum learning that improved our networks' performance in all experimental conditions .
Edit intent: fluency
Original:  In this connection we uncover the role of plasterable cones and reflexive subspaces .
Revised:  In this connection the role of plasterable cones and reflexive subspaces .
Edit intent: clarity
Original: We consider the relationship between stationary distributions for stochastic models of chemical reaction systems and Lyapunov functions for their deterministic counterparts.
Revised: We consider the relationship between stationary distributions for stochastic models of reaction systems and Lyapunov functions for their deterministic counterparts.
Edit intent: clarity