wanyu/IteraTeR_v2 huggingface dataset:
Original: We present Piko, a design framework for designing efficient programmable graphics pipelines . Piko is built around managing work granularity in a programmable and flexible manner, allowing programmers to build load-balanced parallel pipeline implementations, to exploit spatial and producer-consumer locality in the pipeline , and to explore tradeoffs between these considerations.
Revised: We present Piko, a framework for designing efficient programmable graphics pipelines . Piko is built around managing work granularity in a programmable and flexible manner, allowing programmers to build load-balanced parallel pipeline implementations, to exploit spatial and producer-consumer locality in the pipeline , and to explore tradeoffs between these considerations.
Edit intent: clarity
Original: We present Piko, a design framework for designing efficient programmable graphics pipelines . Piko is built around managing work granularity in a programmable and flexible manner, allowing programmers to build load-balanced parallel pipeline implementations, to exploit spatial and producer-consumer locality in the pipeline , and to explore tradeoffs between these considerations.
Revised: We present Piko, a design framework for designing efficient programmable graphics pipelines . Piko is built around managing work granularity in a programmable and flexible manner, allowing programmers to build load-balanced parallel pipeline implementations, to exploit spatial and producer-consumer locality in a pipeline implementation , and to explore tradeoffs between these considerations.
Edit intent: fluency
Original:  We show that Piko can implement a wide range of pipelines ( rasterization, Reyes, ray tracing, rasterization/ray tracing hybrid, and deferred rendering ), that our implementations are efficient , and that we achieve code reuse across multiple pipelines and across different target architectures.
Revised:  We show that Piko can implement a wide range of pipelines , including rasterization, Reyes, ray tracing, rasterization/ray tracing hybrid, and deferred rendering ), that our implementations are efficient , and that we achieve code reuse across multiple pipelines and across different target architectures.
Edit intent: clarity
Original:  This paper investigates under which circumstances echo state networks can show a power law forgetting , which means traces of earlier events can be found in the reservoir for very long time spans.
Revised:  This paper investigates under which circumstances echo state networks can show a power law forgetting . That means traces of earlier events can be found in the reservoir for very long time spans.
Edit intent: coherence
Original:  However, for general matrices the limit can not be determined exactly from theory.
Revised:  However, for general matrices the limit cannot be determined exactly from theory.
Edit intent: coherence
Original:  In addition, the behaviour of the network is strongly influenced by the input flow.
Revised:  In addition, the behavior of the network is strongly influenced by the input flow.
Edit intent: fluency
Original:  Results are presented , that use certain types of restricted recurrent connectivity and anticipation learning with regard to the input, where indeed power law forgetting can be achieved.
Revised:  Results are presented that use certain types of restricted recurrent connectivity and anticipation learning with regard to the input, where indeed power law forgetting can be achieved.
Edit intent: fluency
Original:  Our notion of robustness is based on the analytic notion of Lipschitz continuity - a transducer is K-(Lipschitz) robust if the perturbation in its output is at most K times the perturbation in its input.
Revised:  Our notion of robustness is based on the analytic notion of Lipschitz continuity --- a transducer is K-(Lipschitz) robust if the perturbation in its output is at most K times the perturbation in its input.
Edit intent: fluency
Original:  We propose new measures of alpha and beta diversity, sensitive to species similarity, that emerge naturally from recent similarity-sensitive gamma diversity measures .
Revised:  We propose a new partitioning that emerges naturally from recent similarity-sensitive gamma diversity measures .
Edit intent: clarity
Original:  c ) to deliver an end-to-end performance that is close to that of a large field size network coding system for high-end receivers while simultaneously catering to low-end ones that can only decode in GF(2).
Revised:  (iii ) to deliver an end-to-end performance that is close to that of a large field size network coding system for high-end receivers while simultaneously catering to low-end ones that can only decode in GF(2).
Edit intent: coherence
Original:  c ) to deliver an end-to-end performance that is close to that of a large field size network coding system for high-end receivers while simultaneously catering to low-end ones that can only decode in GF(2).
Revised:  c ) to deliver an end-to-end performance that is close to that of a high-field network coding system for high-end receivers while simultaneously catering to low-end ones that can only decode in GF(2).
Edit intent: clarity
Original:  c ) to deliver an end-to-end performance that is close to that of a large field size network coding system for high-end receivers while simultaneously catering to low-end ones that can only decode in GF(2).
Revised:  c ) to deliver an end-to-end performance that is close to that of a large field size network coding system for high-end receivers while simultaneously catering to low-end receivers that decode in GF(2).
Edit intent: clarity
Original:  As a consequence of ( b ) and ( c ), Fulcrum codes have a unique trait missing so far in the network coding literature: they provide the network with the flexibility to spread computational complexity over different devices depending on their current load, network conditions, or even energy targets in a simple and decentralized way.
Revised:  As a consequence of ( b ) and ( c ), Fulcrum codes have a unique trait missing so far in the network coding literature: they provide the network with the flexibility to spread computational complexity over different devices depending on their current load, network conditions, or even energy targets in a decentralized way.
Edit intent: clarity
Original:  At the core of our framework lies the idea of precoding at the sources using an expansion field GF( 2^h ) to increase the number of dimensions seen by the network using a linear mapping.
Revised:  At the core of our framework lies the idea of precoding at the sources using an expansion field GF( 2h ) to increase the number of dimensions seen by the network using a linear mapping.
Edit intent: clarity
Original:  Fulcrum network codes can use any high-field size linear code for precoding, e.g., Reed-Solomon, random linear coding, but we show that systematic codes provide the ability to manage heterogeneous receivers while using the same data stream.
Revised:  Fulcrum codes can use any high-field size linear code for precoding, e.g., Reed-Solomon, random linear coding, but we show that systematic codes provide the ability to manage heterogeneous receivers while using the same data stream.
Edit intent: clarity
Original:  Fulcrum network codes can use any high-field size linear code for precoding, e.g., Reed-Solomon, random linear coding, but we show that systematic codes provide the ability to manage heterogeneous receivers while using the same data stream.
Revised:  Fulcrum network codes can use any high-field linear code for precoding, e.g., Reed-Solomon, random linear coding, but we show that systematic codes provide the ability to manage heterogeneous receivers while using the same data stream.
Edit intent: clarity
Original:  Our analysis shows that the number of additional dimensions created during precoding allows us to control the tradeoff between delayperformance , overhead, and complexity.
Revised:  Our analysis shows that the number of additional dimensions created during precoding controls the trade-off between delay , overhead, and complexity.
Edit intent: clarity
Original:  Our implementation and benchmarking results show that Fulcrum can achieve similar decoding performance as high field RLNC approaches but with encoders and decoders that are an order of magnitude faster.
Revised:  Our implementation and benchmarking results show that Fulcrum achieves similar decoding probability as high field RLNC approaches but with encoders and decoders that are an order of magnitude faster.
Edit intent: clarity
Original:  Our implementation and benchmarking results show that Fulcrum can achieve similar decoding performance as high field RLNC approaches but with encoders and decoders that are an order of magnitude faster.
Revised:  Our implementation and benchmarking results show that Fulcrum can achieve similar decoding performance as high field RLNC approaches but with encoders / decoders that are an order of magnitude faster.
Edit intent: fluency
Original: We consider consider a population living in a patchy environment that varies stochastically in space and time.
Revised: We consider a population living in a patchy environment that varies stochastically in space and time.
Edit intent: fluency
Original:  For  healthy individuals and a patient with ankylosing spondylitis, who undergone treatment, we invariably find power law scaling over several decades and for the first time calculate quantitatively meaningful values of decay exponent.
Revised:  For 41 healthy individuals and a patient with ankylosing spondylitis, who undergone treatment, we invariably find power law scaling over several decades and for the first time calculate quantitatively meaningful values of decay exponent.
Edit intent: fluency
Original:  It has proved to be much the same among healthy individuals , significantly different for an autoimmune patient before the therapy, and converging towards a typical value afterwards.
Revised:  It has proved to be much the same among healthy donors , significantly different for an autoimmune patient before the therapy, and converging towards a typical value afterwards.
Edit intent: clarity
Original: Interaction Information can extend pairwise interactions to triplets .
Revised: Neural systems are comprised of interacting units, and relevant information regarding their function or malfunction can be inferred by analyzing the statistical dependencies between the activity of each unit. Whilst correlations and mutual information are commonly used to characterize these dependencies, our objective here is to extend interactions to triplets .
Edit intent: coherence
Original:  In relation with dynamics, redundancy had the biggest contribution at higher frequency bands (14-100Hz) whilst synergy was more expressed at very slow frequencies (1-7Hz).
Revised:  In relation to dynamics, R made the largest contribution to high frequency bands (14-100Hz) whilst synergy was more expressed at very slow frequencies (1-7Hz).
Edit intent: clarity
Original:  In relation with dynamics, redundancy had the biggest contribution at higher frequency bands (14-100Hz) whilst synergy was more expressed at very slow frequencies (1-7Hz).
Revised:  In relation with dynamics, redundancy had the biggest contribution at higher frequency bands (14-100Hz) , whilst S was expressed more strongly at lower frequencies (1-7Hz).
Edit intent: clarity
Original:  Thus, the application of the interaction information to this clinical data unveils new aspects of epileptogenic structure in terms of interaction nature (redundancy vs  synergy) and dynamics (fast vs slow rhythms ).
Revised:  Thus, applying interaction information to this clinical data unveils new aspects of epileptogenic structure in terms of interaction nature (redundancy vs synergy) and dynamics (fast vs slow rhythms ).
Edit intent: fluency
Original:  Thus, the application of the interaction information to this clinical data unveils new aspects of epileptogenic structure in terms of interaction nature (redundancy vs  synergy) and dynamics (fast vs slow rhythms ).
Revised:  Thus, the application of the interaction information to such clinical data reveals new aspects of epileptogenic structure in terms of interaction nature (redundancy vs synergy) and dynamics (fast vs slow rhythms ).
Edit intent: clarity
Original:  Thus, the application of the interaction information to this clinical data unveils new aspects of epileptogenic structure in terms of interaction nature (redundancy vs  synergy) and dynamics (fast vs slow rhythms ).
Revised:  Thus, the application of the interaction information to this clinical data unveils new aspects of epileptogenic structure in terms of the nature (redundancy vs synergy) and dynamics (fast vs slow rhythms ).
Edit intent: fluency
Original:  Thus, the application of the interaction information to this clinical data unveils new aspects of epileptogenic structure in terms of interaction nature (redundancy vs  synergy) and dynamics (fast vs slow rhythms ).
Revised:  Thus, the application of the interaction information to this clinical data unveils new aspects of epileptogenic structure in terms of interaction nature (redundancy vs . synergy) and dynamics (fast vs slow rhythms ).
Edit intent: fluency
Original:  However, enterprise big data processing systems as in Smart Grid applications usually come with more complicated business logics and involve many data manipulation operations like updates and deletes.
Revised:  However, enterprise big data processing systems as in Smart Grid applications usually require complicated business logics and involve many data manipulation operations like updates and deletes.
Edit intent: clarity
Original:  Hive using the Hadoop  File System ( HDFSs ) for storage cannot implement data manipulation efficiently and Hive on HBase suffers from poor query performance even though it can support faster data manipulation  .
Revised:  Hive using the Hadoop File System ( HDFS ) for storage cannot implement data manipulation efficiently and Hive on HBase suffers from poor query performance even though it can support faster data manipulation .
Edit intent: clarity
Original:  The algorithm relies on several new structural lemmas , which decompose the Steiner cut into important separators and minimal s-t cuts , and which only hold for the edge deletion version of the problem . - In contrast, both node deletion versions of Steiner Multicut are W[1]-hard for the parameter k+t on general graphs. - All versions of Steiner Multicut are W[1]-hard for the parameter k, even when p=3 and the graph is a tree plus one node.
Revised:  The algorithm relies on several new structural lemmas that decompose the Steiner cut into important separators and minimal s-t cuts , and which only hold for the edge deletion version of the problem . - In contrast, both node deletion versions of Steiner Multicut are W[1]-hard for the parameter k+t on general graphs. - All versions of Steiner Multicut are W[1]-hard for the parameter k, even when p=3 and the graph is a tree plus one node.
Edit intent: fluency
Original:  The algorithm relies on several new structural lemmas , which decompose the Steiner cut into important separators and minimal s-t cuts , and which only hold for the edge deletion version of the problem . - In contrast, both node deletion versions of Steiner Multicut are W[1]-hard for the parameter k+t on general graphs. - All versions of Steiner Multicut are W[1]-hard for the parameter k, even when p=3 and the graph is a tree plus one node.
Revised:  The algorithm relies on several new structural lemmas , which decompose the Steiner cut into important separators and minimal s-t cuts . - In contrast, both node deletion versions of Steiner Multicut are W[1]-hard for the parameter k+t on general graphs. - All versions of Steiner Multicut are W[1]-hard for the parameter k, even when p=3 and the graph is a tree plus one node.
Edit intent: clarity
Original: Cooperation in one shot anonymous interactions is a widely documented aspect of human behavior .
Revised: Cooperation in one-shot anonymous interactions is a widely documented aspect of human behavior .
Edit intent: fluency
Original: Cooperation in one shot anonymous interactions is a widely documented aspect of human behavior .
Revised: Cooperation in one shot anonymous interactions is a widely documented aspect of human behaviour .
Edit intent: fluency
Original:  Here we explore how the level of cooperation in a one-shot continuous Prisoner's Dilemma (i.e.  two-player Public Goods Game)  varies based on the game payoffs.
Revised:  Here we shed light on the motivations behind this behaviour by experimentally exploring cooperation in a one-shot continuous Prisoner's Dilemma (i.e. two-player Public Goods Game) varies based on the game payoffs.
Edit intent: clarity
Original:  Here we explore how the level of cooperation in a one-shot continuous Prisoner's Dilemma (i.e.  two-player Public Goods Game)  varies based on the game payoffs.
Revised:  Here we explore how the level of cooperation in a one-shot continuous-strategy Prisoner's Dilemma (i.e. two-player Public Goods Game) varies based on the game payoffs.
Edit intent: clarity
Original:  Here we explore how the level of cooperation in a one-shot continuous Prisoner's Dilemma (i.e.  two-player Public Goods Game)  varies based on the game payoffs.
Revised:  Here we explore how the level of cooperation in a one-shot continuous Prisoner's Dilemma (i.e. one-shot two-player Public Goods Game) varies based on the game payoffs.
Edit intent: coherence
Original:  In particular , we find that the fraction of participants engaging in zero cooperation decreases with b/c, while the fraction engaging in maximal cooperation increases with b/c.
Revised:  In particular , we find that the fraction of participants engaging in zero cooperation and increases the fraction engaging in maximal cooperation increases with b/c.
Edit intent: clarity
Original:  We also find that a substantial fraction of subjects engage in 50\% cooperation , and that this fraction remains constant across b/c ratios.
Revised:  We also find that a substantial fraction of participants consistently engage in 50\% cooperation , and that this fraction remains constant across b/c ratios.
Edit intent: clarity
Original:  We also find that a substantial fraction of subjects engage in 50\% cooperation , and that this fraction remains constant across b/c ratios.
Revised:  We also find that a substantial fraction of subjects engage in 50\% cooperation regardless of b/c ratios.
Edit intent: clarity
Original:  Finally, we find a strong correlation between cooperation in the Prisoner's Dilemma and giving in a subsequent Dictator Game .
Revised:  Finally, we find a strong correlation between play in the Prisoner's Dilemma and giving in a subsequent Dictator Game .
Edit intent: clarity
Original:  Finally, we find a strong correlation between cooperation in the Prisoner's Dilemma and giving in a subsequent Dictator Game .
Revised:  Finally, we find a strong correlation between cooperation in the Prisoner's Dilemma and in a subsequent Dictator Game .
Edit intent: clarity
Original:  Furthermore, we show how a robust estimate of the geographic dispersion of each user's ego network can be used as a per-user accuracy measure , allowing us to discard poor location inferences and control the overall error of our approach . Leave-many-out evaluation shows that our method is able to infer location for 101,846,236 Twitter users at a median error of 6.33 km, allowing us to geotag roughly 89 \\% of public tweets.
Revised:  Furthermore, we show how a robust estimate of the geographic dispersion of each user's ego network can be used as a per-user accuracy measure which is effective at removing outlying errors . Leave-many-out evaluation shows that our method is able to infer location for 101,846,236 Twitter users at a median error of 6.33 km, allowing us to geotag roughly 89 \\% of public tweets.
Edit intent: clarity
Original:  We show that, when applied to a toy model and real datasets, temporal stability uncovers structures  persistent over meaningful time-scales as well as important isolated events, making it an effective tool to study both abrupt changes and gradual evolution of  network mesoscopic structures.
Revised:  We show that, when applied to a toy model and real datasets, temporal stability uncovers structures that are persistent over meaningful time-scales as well as important isolated events, making it an effective tool to study both abrupt changes and gradual evolution of network mesoscopic structures.
Edit intent: clarity
Original:  We show that, when applied to a toy model and real datasets, temporal stability uncovers structures  persistent over meaningful time-scales as well as important isolated events, making it an effective tool to study both abrupt changes and gradual evolution of  network mesoscopic structures.
Revised:  We show that, when applied to a toy model and real datasets, temporal stability uncovers structures persistent over meaningful time-scales as well as important isolated events, making it an effective tool to study both abrupt changes and gradual evolution of a network mesoscopic structures.
Edit intent: fluency
Original: Background: Recent research in animal behaviour has contributed to characterise the interaction responses that underlie collective motion of animal groups: how alignment, turning responses, and changes of speed mediate flocking and schooling interactions in different  species.
Revised: Background: Recent research in animal behaviour has contributed to determine how alignment, turning responses, and changes of speed mediate flocking and schooling interactions in different species.
Edit intent: clarity
Original: Background: Recent research in animal behaviour has contributed to characterise the interaction responses that underlie collective motion of animal groups: how alignment, turning responses, and changes of speed mediate flocking and schooling interactions in different  species.
Revised: Background: Recent research in animal behaviour has contributed to characterise the interaction responses that underlie collective motion of animal groups: how alignment, turning responses, and changes of speed mediate flocking and schooling interactions in different animal species.
Edit intent: fluency
Original:  Here, we address specifically the problem of what interaction responses support different nearest neighbour configurations of position and distance.
Revised:  Here, we address specifically the problem of what interaction responses support different nearest neighbour configurations in terms of mutual position and distance.
Edit intent: clarity
Original:  Results: We find that interaction rules similar to those observed in real animal species would be observed also as a simple consequence of the relative position that individuals of those species assume when they move together, and of the noise inherent with the movement of animals, or associated with tracking inaccuracy.
Revised:  Results: We find that the different interaction rules observed in different animal species may be a simple consequence of the relative position that individuals of those species assume when they move together, and of the noise inherent with the movement of animals, or associated with tracking inaccuracy.
Edit intent: clarity
Original:  Results: We find that interaction rules similar to those observed in real animal species would be observed also as a simple consequence of the relative position that individuals of those species assume when they move together, and of the noise inherent with the movement of animals, or associated with tracking inaccuracy.
Revised:  Results: We find that interaction rules similar to those observed in real animal species would be observed also as a simple consequence of the relative positions that individuals assume when they move together, and of the noise inherent with the movement of animals, or associated with tracking inaccuracy.
Edit intent: clarity