wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our results show that depending on the group size and the ZD-strategist's initial probability to cooperate , forfinitely repeated n-player social dilemmas, it is possible for extortionate, generous and equalizer ZD-strategies to exist .
Revised:  Our results show that depending on the group size and the ZD-strategist's initial probability to cooperate finitely repeated n-player social dilemmas, it is possible for extortionate, generous and equalizer ZD-strategies to exist .
Edit intent: fluency
Original:  Our results show that depending on the group size and the ZD-strategist's initial probability to cooperate , forfinitely repeated n-player social dilemmas, it is possible for extortionate, generous and equalizer ZD-strategies to exist .
Revised:  Our results show that depending on the group size and the ZD-strategist's initial probability to cooperate , for repeated n-player social dilemmas, it is possible for extortionate, generous and equalizer ZD-strategies to exist .
Edit intent: fluency
Original:  Our results show that depending on the group size and the ZD-strategist's initial probability to cooperate , forfinitely repeated n-player social dilemmas, it is possible for extortionate, generous and equalizer ZD-strategies to exist .
Revised:  Our results show that depending on the group size and the ZD-strategist's initial probability to cooperate , forfinitely there exist extortionate, generous and equalizer ZD-strategies to exist .
Edit intent: clarity
Original:  Our results show that depending on the group size and the ZD-strategist's initial probability to cooperate , forfinitely repeated n-player social dilemmas, it is possible for extortionate, generous and equalizer ZD-strategies to exist .
Revised:  Our results show that depending on the group size and the ZD-strategist's initial probability to cooperate , forfinitely repeated n-player social dilemmas, it is possible for extortionate, generous and equalizer ZD-strategies .
Edit intent: clarity
Original:  The threshold discount factors rely on the slope and baseline payoff of the desired linear relation and the variation in the "one-shot" payoffsof the n-player game .
Revised:  The threshold discount factors rely on the desired payoff relation and the variation in the "one-shot" payoffsof the n-player game .
Edit intent: clarity
Original:  The threshold discount factors rely on the slope and baseline payoff of the desired linear relation and the variation in the "one-shot" payoffsof the n-player game .
Revised:  The threshold discount factors rely on the slope and baseline payoff of the desired linear relation and the variation in the single-round payoffs .
Edit intent: clarity
Original:  To show the utility of our general results, we apply them to a linear n-player public goods game .
Revised:  To show the utility of our results, we apply them to a linear n-player public goods game .
Edit intent: clarity
Original: Accurate simulation of fluid flow in the presence of complex geometries with mesh-free  methods requires that the geometry surfaces be captured accurately with particles.
Revised: Accurate simulation of fluid flow in the presence of complex geometries with mesh-free methods requires that the geometry be captured accurately with particles.
Edit intent: clarity
Original:  In this paper we propose a simple SPH-based algorithm to produce homogeneous particle distributions that capture the geometry surfaces accurately in two and three dimensions.
Revised:  In this paper we propose a simple SPH-based algorithm is proposed which produces better particle distributions in both two and three dimensions.
Edit intent: clarity
Original:  Several benchmark problems are solved to demonstrate the accuracy of the new algorithm.
Revised:  Some challenging geometries are constructed to demonstrate the accuracy of the new algorithm.
Edit intent: clarity
Original:  The  algorithm is open source and our manuscript is fully reproducible.
Revised:  The algorithm is open source and the manuscript is fully reproducible.
Edit intent: fluency
Original: Computer simulation of fluid flow in the presence of complex geometries with mesh-free particle methods requires that the geometry be captured accurately .
Revised: Accurate mesh-free simulation of fluid flow in the presence of complex geometries with mesh-free particle methods requires that the geometry be captured accurately .
Edit intent: clarity
Original: Computer simulation of fluid flow in the presence of complex geometries with mesh-free particle methods requires that the geometry be captured accurately .
Revised: Computer simulation of fluid flows involving complex boundaries requires that the geometry be captured accurately .
Edit intent: clarity
Original: Computer simulation of fluid flow in the presence of complex geometries with mesh-free particle methods requires that the geometry be captured accurately .
Revised: Computer simulation of fluid flow in the presence of complex geometries with mesh-free particle methods requires that the boundaries be captured accurately .
Edit intent: clarity
Original:  Methods like weakly-compressible and incompressiblesmoothed particle hydrodynamics (SPH ) perform better when the particle distribution is uniform.
Revised:  Methods like weakly-compressible fluid flow, the SPH method is more accurate when the particle distribution is uniform.
Edit intent: clarity
Original:  In this paper, various particle packing algorithms present in  literature are implemented and compared with the intention of capturing the boundaries accurately while maintaining a uniform particle distribution of both the fictitious boundary and fluid particles .
Revised:  In this paper, various particle packing algorithms present in the literature are implemented and compared with the intention of capturing the boundaries accurately while maintaining a uniform particle distribution of both the fictitious boundary and fluid particles .
Edit intent: fluency
Original:  In this paper, various particle packing algorithms present in  literature are implemented and compared with the intention of capturing the boundaries accurately while maintaining a uniform particle distribution of both the fictitious boundary and fluid particles .
Revised:  In this paper, various particle packing algorithms present in literature are implemented and compared .
Edit intent: coherence
Original:  We further identify semirings of generalized absorptive polynomials and prove universality properties that make them the most general appropriate semirings for LFP.
Revised:  We further identify semirings of generalized absorptive polynomials and prove universal properties that make them the most general appropriate semirings for LFP.
Edit intent: clarity
Original: The diffusion MRI signal arising from neurons can be numerically simulated by solving the Bloch-Torrey partial differential equation.
Edit intent: coherence
Original:  In this paper , we present the Neuron Module that we implemented within the Matlab-based diffusion MRI simulation toolbox SpinDoctor.
Revised:  In this paper we present the Neuron Module that we implemented within the Matlab-based diffusion MRI simulation toolbox SpinDoctor.
Edit intent: fluency
Original: Org. These finite elements meshes range from having 15163 nodes to 622553 nodes.
Revised: Org. 
Edit intent: coherence
Original:  We also broke the neurons into the soma and dendrite branches and created finite element meshes for these cell components.
Revised:  We also broke the neurons into the soma and dendrite branches and created finite elements meshes for these cell components.
Edit intent: fluency
Original:  Org. We also broke the neurons into the soma and dendrite branches and created finite elements meshes for these cell components.
Revised:  We also broke the neurons into the soma and dendrite branches and created finite elements meshes for these cell components.
Edit intent: fluency
Original:  Configuration is time intensive and largely static until a major new vulnerabilityforces change .
Revised:  Upon publication of a vulnerability, administrators scramble to manually mitigate risk before a patch is available .
Edit intent: clarity
Original:  However, these tools are not designed to fashion configurations that simultaneously satisfy multiple properties.
Revised:  These tools are not designed to fashion configurations that simultaneously satisfy multiple properties.
Edit intent: coherence
Original:  We introduce FASHION: a linear optimizer that fashions network configurations that  balance functionality and security requirements.
Revised:  We introduce FASHION: a linear optimizer that fashions balance functionality and security requirements.
Edit intent: clarity
Original:  We introduce FASHION: a linear optimizer that fashions network configurations that  balance functionality and security requirements.
Revised:  We introduce FASHION: a linear optimizer that fashions network configurations that network configurations to balance functionality and security requirements.
Edit intent: fluency
Original:  We use this algorithm to obtain deterministic algorithms for dynamic connectivity and minimum spanning forest, whose worse-case update time on an n-vertex graph is n^{o(1)}, thus resolving a major open problem in the area of dynamic graph algorithms.
Revised:  We use this algorithm to obtain deterministic algorithms for dynamic connectivity and minimum spanning forest, whose worst-case update time on an n-vertex graph is n^{o(1)}, thus resolving a major open problem in the area of dynamic graph algorithms.
Edit intent: fluency
Original:  The second method , based on a compression method that exploits the single-file motion of hard core particles, does not have the limitation of a small occupied fraction but requires constant tumbling rates.
Revised:  The second approach , based on a compression method that exploits the single-file motion of hard core particles, does not have the limitation of a small occupied fraction but requires constant tumbling rates.
Edit intent: clarity
Original:  We validate our nonlinear model with numerical simulations, comparing its solutions with the corresponding non-interacting linear model as well as stochastic simulations of the underlying particle system.
Revised:  We validate our nonlinear model with numerical simulations, comparing its solutions with the corresponding noninteracting linear model as well as stochastic simulations of the underlying particle system.
Edit intent: fluency
Original:  However, the flexibility of such systems does not come without a cost .
Revised:  However, the flexibility of such systems does not free .
Edit intent: clarity
Original:  The large amount of redundancy in the stored records can introduce an unnecessary storage overhead and impact query performance.
Revised:  The large amount of redundancy in the records can introduce an unnecessary storage overhead and impact query performance.
Edit intent: clarity
Original:  Our focus in this paper is to address the storage overhead issue by introducing a tuple compactor framework that infers and extracts the schema from self-describing  records during the data ingestion process .
Revised:  Our focus in this paper is to address the storage overhead issue by introducing a tuple compactor framework that infers and extracts the schema from self-describing records during the data ingestion .
Edit intent: clarity
Original:  As many prominent document store systems , such as MongoDB and Couchbase, adopt Log Structured Merge (LSM) trees in their storage engines, our framework exploits LSM lifecycle events to piggyback the schema inference and extraction operations.
Revised:  As many prominent document stores , such as MongoDB and Couchbase, adopt Log Structured Merge (LSM) trees in their storage engines, our framework exploits LSM lifecycle events to piggyback the schema inference and extraction operations.
Edit intent: clarity
Original:  We focus on this important topic of entity summarization, and  present the first comprehensive survey of existing research.
Revised:  We focus on this prominent topic of entity summarization, and present the first comprehensive survey of existing research.
Edit intent: clarity
Original:  We focus on this important topic of entity summarization, and  present the first comprehensive survey of existing research.
Revised:  We focus on this important topic of entity summarization, and our research objective is to present the first comprehensive survey of existing research.
Edit intent: clarity
Original: In this paper, a linearized conservative semi-implicit finite difference scheme is proposed for  the two-dimensional (2D) space fractional nonlinear Schr\"{o}dinger equation (SFNSE).
Revised: In this paper, a linearized semi-implicit finite difference scheme is proposed for the two-dimensional (2D) space fractional nonlinear Schr\"{o}dinger equation (SFNSE).
Edit intent: clarity
Original: In this paper, a linearized conservative semi-implicit finite difference scheme is proposed for  the two-dimensional (2D) space fractional nonlinear Schr\"{o}dinger equation (SFNSE).
Revised: In this paper, a linearized conservative semi-implicit finite difference scheme is proposed for solving the two-dimensional (2D) space fractional nonlinear Schr\"{o}dinger equation (SFNSE).
Edit intent: clarity
Original:  The main contribution of this paper is that an optimal pointwise error estimate is first time obtained for the 2D SFNSE. Numerical results are presented to confirm the theoretical findings.
Revised:  The main contribution of this paper is an optimal pointwise error estimate is first time obtained for the 2D SFNSE. Numerical results are presented to confirm the theoretical findings.
Edit intent: fluency
Original:  The main contribution of this paper is that an optimal pointwise error estimate is first time obtained for the 2D SFNSE. Numerical results are presented to confirm the theoretical findings.
Revised:  The main contribution of this paper is that an optimal pointwise error estimate for the 2D SFNSE. Numerical results are presented to confirm the theoretical findings.
Edit intent: clarity
Original: This work defines a new framework for performance evaluation of polyphonic sound event detection (SED) systems, which overcomes the limitations of the conventional collar-based event decisions, event F-scores and event error rates (ERs) .
Revised: This work defines a new framework for performance evaluation of polyphonic sound event detection (SED) systems, which overcomes the limitations of the conventional collar-based event decisions, event F-scores and event error rates .
Edit intent: clarity
Original:  It also resorts to polyphonic receiver operating characteristic (ROC) curves to deliver more global insight into system performance than F1-scores, and proposes a reduction of these curves into a single polyphonic sound detection score (PSDS), which allows system comparison independently from their operating point .
Revised:  It also resorts to polyphonic receiver operating characteristic (ROC) curves to deliver more global insight into system performance than F1-scores, and proposes a reduction of these curves into a single polyphonic sound detection score (PSDS), which allows system comparison independently from operating points (OPs) .
Edit intent: clarity
Original:  The benefits of the proposed approach are demonstrated by re-evaluating  baseline and two of the top-performing systems from DCASE 2019 Task 4.
Revised:  The benefits of the proposed approach are demonstrated by re-evaluating the baseline and two of the top-performing systems from DCASE 2019 Task 4.
Edit intent: fluency
Original:  Conventional intuition suggests that when solving a sequence of related optimization problems of this form, it should be possible to initialize using the solution of the previous iterate---to "warm start" the optimization rather than initialize from scratch---and see reductions in wall-clock time.
Revised:  Conventional intuition suggests that when solving a sequence of related optimization problems of this form, it should be possible to initialize using the solution of the previous iterate -- to "warm start" the optimization rather than initialize from scratch---and see reductions in wall-clock time.
Edit intent: fluency
Original:  Conventional intuition suggests that when solving a sequence of related optimization problems of this form, it should be possible to initialize using the solution of the previous iterate---to "warm start" the optimization rather than initialize from scratch---and see reductions in wall-clock time.
Revised:  Conventional intuition suggests that when solving a sequence of related optimization problems of this form, it should be possible to initialize using the solution of the previous iterate---to "warm start" the optimization rather than initialize from scratch -- and see reductions in wall-clock time.
Edit intent: fluency
Original: We focus on  finite element method computations .
Revised: We focus on the finite element method computations .
Edit intent: fluency
Original:  We show that test functions that fulfill the partition of unity can be eliminated from the  system of linear equations .
Revised:  We show that the system of linear equations .
Edit intent: clarity
Original:  The test functions in higher continuity IGA can be set to piece-wise constants without losing any accuracy.
Revised:  Thus, the test functions in higher continuity IGA can be set to piece-wise constants without losing any accuracy.
Edit intent: coherence
Original:  In particular, this observation works for any computational problem that can be solved using the Galerkin method with isogeometric analysis with higher continuity test functions.
Revised:  This summation of test functions can be performed for an arbitrary linear differential operator resulting from the Galerkin method with isogeometric analysis with higher continuity test functions.
Edit intent: clarity
Original:  The Galerkin approximation with C1 continuity is equivalent to linear combinations of the collocations at points and with weights resulting from applied quadrature , over the spans defined by supports of  test functions.
Revised:  The resulting method is equivalent to linear combinations of the collocations at points and with weights resulting from applied quadrature , over the spans defined by supports of test functions.
Edit intent: clarity
Original:  The Galerkin approximation with C1 continuity is equivalent to linear combinations of the collocations at points and with weights resulting from applied quadrature , over the spans defined by supports of  test functions.
Revised:  The Galerkin approximation with C1 continuity is equivalent to a linear combination of the collocations at points and with weights resulting from applied quadrature , over the spans defined by supports of test functions.
Edit intent: fluency
Original:  The Galerkin approximation with C1 continuity is equivalent to linear combinations of the collocations at points and with weights resulting from applied quadrature , over the spans defined by supports of  test functions.
Revised:  The Galerkin approximation with C1 continuity is equivalent to linear combinations of the collocations at points and with weights resulting from applied quadrature over the spans defined by supports of test functions.
Edit intent: fluency
Original:   However, the correctness (and security ) of compiler-inserted Spectre countermeasures has not been ascertained yet .
Revised:  However, the security of these countermeasures has not been ascertained yet .
Edit intent: clarity
Original:  Even worse, while some of the existing countermeasures seem to be secure, others are known to be insecure and still leave vulnerabilities to Spectre.
Revised:  Even worse, while some of them are believed to be secure, others are known to be insecure and still leave vulnerabilities to Spectre.
Edit intent: clarity
Original:  To mitigate theses attacks, major compilers deployed a wide range of countermeasures.
Revised:  To mitigate theses attacks, popular compilers deployed a wide range of countermeasures.
Edit intent: clarity
Original:  However, the security of these countermeasures  has not been ascertained yet : while some of them are believed to be secure, others are known to be insecure and result in vulnerable programs.
Revised:  The security of these countermeasures has not been ascertained yet : while some of them are believed to be secure, others are known to be insecure and result in vulnerable programs.
Edit intent: coherence
Original:  However, the security of these countermeasures  has not been ascertained yet : while some of them are believed to be secure, others are known to be insecure and result in vulnerable programs.
Revised:  However, the security of these countermeasures , however, has not been ascertained yet : while some of them are believed to be secure, others are known to be insecure and result in vulnerable programs.
Edit intent: coherence
Original:  However, the security of these countermeasures  has not been ascertained yet : while some of them are believed to be secure, others are known to be insecure and result in vulnerable programs.
Revised:  However, the security of these countermeasures has not been ascertained : while some of them are believed to be secure, others are known to be insecure and result in vulnerable programs.
Edit intent: coherence
Original:  With these criteria, we formally prove that some countermeasures , such as speculative load hardening (SLH), are vulnerable to Spectre attacks and others (like speculation-barriers-insertion and variations of SLH) are secure .
Revised:  With this framework, we perform a comprehensive security analysis of compiler-level countermeasures against Spectre attacks implemented in major compilers .
Edit intent: clarity
Original: Motivated by the recent advancements in deep Reinforcement Learning (RL), we develop an RL agent to manage the operation of storage devices in a household  designed to maximize demand-side cost savings.
Revised: Motivated by recent advancements in deep Reinforcement Learning (RL), we develop an RL agent to manage the operation of storage devices in a household designed to maximize demand-side cost savings.
Edit intent: fluency
Original: Motivated by the recent advancements in deep Reinforcement Learning (RL), we develop an RL agent to manage the operation of storage devices in a household  designed to maximize demand-side cost savings.
Revised: Motivated by the recent advancements in Deep Reinforcement Learning (RL), we develop an RL agent to manage the operation of storage devices in a household designed to maximize demand-side cost savings.
Edit intent: fluency
Original: Motivated by the recent advancements in deep Reinforcement Learning (RL), we develop an RL agent to manage the operation of storage devices in a household  designed to maximize demand-side cost savings.
Revised: Motivated by the recent advancements in deep Reinforcement Learning (RL), we have developed an RL agent to manage the operation of storage devices in a household designed to maximize demand-side cost savings.
Edit intent: fluency
Original: Motivated by the recent advancements in deep Reinforcement Learning (RL), we develop an RL agent to manage the operation of storage devices in a household  designed to maximize demand-side cost savings.
Revised: Motivated by the recent advancements in deep Reinforcement Learning (RL), we develop an RL agent to manage the operation of storage devices in a household and is designed to maximize demand-side cost savings.
Edit intent: coherence
Original:  The proposed technique is data-driven, and the RL agent learns from scratch on how to efficiently use the energy storage device under variable tariff-structures Contracting the concept of the "black box" where the techniques learned by the agent are ignored.
Revised:  The proposed technique is data-driven, and the RL agent learns from scratch how to efficiently use the energy storage device under variable tariff-structures Contracting the concept of the "black box" where the techniques learned by the agent are ignored.
Edit intent: clarity