wanyu/IteraTeR_v2 huggingface dataset:
Original:  Finally, we provide a numerical recipe for obtaining the algorithmic parameters of the method , using semidefinite programming, and illustrate that it can be used for developing other methods as well.
Revised:  Finally, we provide a numerical recipe for obtaining the algorithmic parameters of the method and illustrate that it can be used for developing other methods as well.
Edit intent: coherence
Original: Speed fluctuations of individual birds within natural flocks are moderate, as it is natural to expect given the aerodynamic, energetic and biomechanical constraints of flight.
Revised: Speed fluctuations of individual birds within natural flocks are moderate, due to the aerodynamic, energetic and biomechanical constraints of flight.
Edit intent: coherence
Original: We study fair resource allocation under a connectedness constraint wherein a set of indivisible items are arranged on a path and only connected subsets of items may be allocated to the agents.
Revised: We study fair resource allocation under a connectedness constraint wherein a set of indivisible items are arranged on a path and only connected subsets of items may be allocated to the agents.
Edit intent: fluency
Original:  An allocation is deemed fair if it satisfies equitability up to one good (EQ1), which requires that agents' utilities are approximately equal.
Revised:  An allocation is deemed fair if it satisfies equitability up to one good (EQ1), which requires that agents' utilities are approximately equal.
Edit intent: fluency
Original:  We show that achieving EQ1 in conjunction with well-studied measures of economic efficiency (such as Pareto optimality, non-wastefulness, maximum egalitarian or utilitarian welfare) is computationally hard even for binary additive valuations.
Revised:  We show that achieving EQ1 in conjunction with well-studied measures of economic efficiency (such as Pareto optimality, non-wastefulness, maximum egalitarian or utilitarian welfare) is computationally hard even for binary additive valuations.
Edit intent: fluency
Original:  On the algorithmic side, we show that by relaxing the efficiency requirement, a connected EQ1 allocation can be computed in polynomial time for any given ordering of agents, even for general monotone valuations.
Revised:  On the algorithmic side, we show that by relaxing the efficiency requirement, a connected EQ1 allocation can be computed in polynomial time for any given ordering of agents, even for general monotone valuations.
Edit intent: fluency
Original:  On the other hand, if efficiency is required, then tractability can still be achieved for binary additive valuations with interval structure .
Revised:  On the other hand, if efficiency is required, then tractability can still be achieved for binary additive valuations with interval structure .
Edit intent: fluency
Original:  On our way, we strengthen some of the existing results in the literature for other fairness notions such as envy-freeness up to one good (EF1), and also provide novel results for negatively-valued items or chores .
Revised:  On our way, we strengthen some of the existing results in the literature for other fairness notions such as envy-freeness up to one good (EF1), and also provide novel results for negatively-valued items or chores .
Edit intent: fluency
Original: Wormlike micelles are self-assemblies of polymer chains that can break and reform reversibly.
Revised: Wormlike micelles are self-assemblies of polymer chains that can break and recombine reversibly.
Edit intent: clarity
Original:  The model incorporates a breaking and reforming process of polymer chains into the classical micro-macro dumbbell model for polymeric fluids in a unified variational framework.
Revised:  The model incorporates a breakage and combination process of polymer chains into the classical micro-macro dumbbell model for polymeric fluids in a unified variational framework.
Edit intent: clarity
Original:  We investigate whether the stance of userswith respect to contentious subjects is influenced by the online discussions that they are exposed to , and by the interactions with users supporting different stances.
Revised:  We investigate whether users' stance concerning contentious subjects is influenced by the online discussions that they are exposed to , and by the interactions with users supporting different stances.
Edit intent: clarity
Original:  We investigate whether the stance of userswith respect to contentious subjects is influenced by the online discussions that they are exposed to , and by the interactions with users supporting different stances.
Revised:  We investigate whether the stance of userswith respect to contentious subjects is influenced by the online discussions they are exposed to , and by the interactions with users supporting different stances.
Edit intent: clarity
Original:  We investigate whether the stance of userswith respect to contentious subjects is influenced by the online discussions that they are exposed to , and by the interactions with users supporting different stances.
Revised:  We investigate whether the stance of userswith respect to contentious subjects is influenced by the online discussions that they are exposed to and interactions with users supporting different stances.
Edit intent: fluency
Original:  Given the user description at the presenttime , the purpose is to predict his stance in the future.
Revised:  Given the user description at present , the purpose is to predict his stance in the future.
Edit intent: clarity
Original:  Given the user description at the presenttime , the purpose is to predict his stance in the future.
Revised:  Given the user description at the presenttime , the purpose is to predict their stance in the future.
Edit intent: fluency
Original:  On a dataset of discussions about Brexit on the Reddit platform, we show that the activity features constantly outperform the textual baseline, confirming the link between exposure to discussion and opinion.
Revised:  Using a dataset of discussions about Brexit on the Reddit platform, we show that the activity features constantly outperform the textual baseline, confirming the link between exposure to discussion and opinion.
Edit intent: fluency
Original:  On a dataset of discussions about Brexit on the Reddit platform, we show that the activity features constantly outperform the textual baseline, confirming the link between exposure to discussion and opinion.
Revised:  On a dataset of Brexit discussions on the Reddit platform, we show that the activity features constantly outperform the textual baseline, confirming the link between exposure to discussion and opinion.
Edit intent: fluency
Original:  On a dataset of discussions about Brexit on the Reddit platform, we show that the activity features constantly outperform the textual baseline, confirming the link between exposure to discussion and opinion.
Revised:  On a dataset of discussions about Brexit on the Reddit platform, we show that the activity features regularly outperform the textual baseline, confirming the link between exposure to discussion and opinion.
Edit intent: clarity
Original:  We find that the most informative features relay to the stance composition of the discussion that users prefer to engage into .
Revised:  We find that the most informative features relate to the stance composition of the discussion that users prefer to engage into .
Edit intent: fluency
Original:  We find that the most informative features relay to the stance composition of the discussion that users prefer to engage into .
Revised:  We find that the most informative features relay to the stance composition of the discussion in which users prefer to engage into .
Edit intent: clarity
Original:  We find that the most informative features relay to the stance composition of the discussion that users prefer to engage into .
Revised:  We find that the most informative features relay to the stance composition of the discussion that users prefer to engage .
Edit intent: clarity
Original:  Then, we apply a Deep BSDE solver with a new control variate method to solve those PDEs, where approximations based on an asymptotic expansion technique are effectively applied to the linear part and also used as control variates for the nonlinear part.
Revised:  Then, we employ a Deep BSDE solver with a new control variate method to solve those PDEs, where approximations based on an asymptotic expansion technique are effectively applied to the linear part and also used as control variates for the nonlinear part.
Edit intent: fluency
Original:  The asymptotic analysis implies that the effects of the transaction costs are more pronounced in the market with less search frictions .
Revised:  The asymptotic analysis implies that the effects of the transaction costs are more pronounced .
Edit intent: clarity
Original:  We compare our software with some of the most popular ABM packages in other programming languages.
Revised:  We compare our software with some of the most popular ABM software in other programming languages.
Edit intent: clarity
Original: Agent based modelling is a simulation method in which autonomous agents react to their environment , given a predefined set of rules.
Revised: Agent based modelling is a simulation method in which autonomous agents interact with their environment and one another , given a predefined set of rules.
Edit intent: clarity
Original:  This removes any "extensions library" requirement from Agents.jl, which is paramount in many other tools.
Revised:  This removes any ``extensions library'' requirement from Agents.jl, which is paramount in many other tools.
Edit intent: fluency
Original: Recently, the selection-recombination equation with a single selected site and an arbitrary number of neutral sites was solved by Selrek via the ancestral selection-recombination graph.
Revised: Recently, the selection-recombination equation with a single selected site and an arbitrary number of neutral sites was solved by Selrek by means of the ancestral selection-recombination graph.
Edit intent: clarity
Original:  Here, we introduce a more accessible approach, namely the ancestral initiation graph , in the special case where the fitness of an individual is determined by the leading site .
Revised:  Here, we introduce a more accessible approach, namely the ancestral initiation graph .
Edit intent: clarity
Original: Recently, the selection-recombination equation with a single selected site and an arbitrary number of neutral sites was solved by \mbox{ Selrek means of the ancestral selection-recombination graph.
Revised: Recently, the selection-recombination equation with a single selected site and an arbitrary number of neutral sites was solved by means of the ancestral selection-recombination graph.
Edit intent: coherence
Original:  The main components of the JuTrack platform and example of data being collected using JuTrack are presented here.
Revised:  The main components of the JuTrack platform and examples of data being collected using JuTrack are presented here.
Edit intent: fluency
Original:  Here we introduce the JuTrack platform as a secure, reliable and extendable open-source solution for remote monitoring in daily-life and digital phenotyping.
Revised:  Here we introduce the JTrack platform as a secure, reliable and extendable open-source solution for remote monitoring in daily-life and digital phenotyping.
Edit intent: fluency
Original:  Method: JuTrack consists of an Android-based smartphone application and a web-based project management dashboard.
Revised:  Method: JTrack consists of an Android-based smartphone application and a web-based project management dashboard.
Edit intent: fluency
Original:  JuTrack was developed to comply with security, privacy and the General Data Protection Regulation (GDPR) requirements.
Revised:  JTrack was developed to comply with security, privacy and the General Data Protection Regulation (GDPR) requirements.
Edit intent: fluency
Original:  Results: JuTrack is an open-source (released under open-source Apache 2.0 licenses) platform for remote assessment of digital biomarkers (DB) in neurological, psychiatric and other indications.
Revised:  Results: JTrack is an open-source (released under open-source Apache 2.0 licenses) platform for remote assessment of digital biomarkers (DB) in neurological, psychiatric and other indications.
Edit intent: fluency
Original:  The main components of the JuTrack platform and examples of data being collected using JuTrack are presented here.
Revised:  The main components of the JTrack platform and examples of data being collected using JuTrack are presented here.
Edit intent: fluency
Original:  The main components of the JuTrack platform and examples of data being collected using JuTrack are presented here.
Revised:  The main components of the JuTrack platform and examples of data being collected using JTrack are presented here.
Edit intent: fluency
Original:  JuTrack provides an easy and reliable open-source solution for collection of such data.
Revised:  JTrack provides an easy and reliable open-source solution for collection of such data.
Edit intent: fluency
Original: Defensive deception is a promising approach for cyberdefense .
Revised: Defensive deception is a promising approach for cyber defense. Via defensive deception, the defender can anticipate attacker actions; it can mislead or lure attacker, or hide real resources .
Edit intent: coherence
Original: The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) we developed to formalize the foundations of universal algebra in Martin-L\"of dependent type theory using the Agda programming language and proof assistant.
Revised: The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) we developed to formalize the foundations of universal algebra in dependent type theory using the Agda programming language and proof assistant.
Edit intent: fluency
Original:  This paper describes the UALib and demonstrates how it makes Agda more accessible to working mathematicians ( like ourselves) as a tool for formally verifying "known" results in general algebra and related fields , as well as for discovering new theorems in these areas .
Revised:  This paper describes the UALib and demonstrates that Agda is accessible to working mathematicians ( like ourselves) as a tool for formally verifying "known" results in general algebra and related fields , as well as for discovering new theorems in these areas .
Edit intent: clarity
Original:  This paper describes the UALib and demonstrates how it makes Agda more accessible to working mathematicians ( like ourselves) as a tool for formally verifying "known" results in general algebra and related fields , as well as for discovering new theorems in these areas .
Revised:  This paper describes the UALib and demonstrates how it makes Agda more accessible to working mathematicians ( such as ourselves) as a tool for formally verifying "known" results in general algebra and related fields , as well as for discovering new theorems in these areas .
Edit intent: fluency
Original:  This paper describes the UALib and demonstrates how it makes Agda more accessible to working mathematicians ( like ourselves) as a tool for formally verifying "known" results in general algebra and related fields , as well as for discovering new theorems in these areas .
Revised:  This paper describes the UALib and demonstrates how it makes Agda more accessible to working mathematicians ( like ourselves) as a tool for formally verifying "known" results in general algebra and related fields .
Edit intent: clarity
Original:  The library already includes a substantial collection of definitions, theorems, and proofs from universal algebra and  as such provides many examples that exhibit the power of inductive and dependent types for representing and reasoning about  algebraic and relational structures.
Revised:  The library includes a substantial collection of definitions, theorems, and proofs from universal algebra and as such provides many examples that exhibit the power of inductive and dependent types for representing and reasoning about algebraic and relational structures.
Edit intent: coherence
Original:  The first major milestone of the UALib project is a complete proof of Birkhoff's HSP Theorem .
Revised:  The first major milestone of the UALib project is a complete proof of Birkhoff's HSP theorem .
Edit intent: fluency
Original:  To the best of our knowledge, this is the first time Birkhoff's Theorem has been formulated and proved in dependent type theory , and verified with a proof assistant .
Revised:  To the best of our knowledge, this is the first time Birkhoff's theorem has been formulated and proved in dependent type theory , and verified with a proof assistant .
Edit intent: fluency
Original:  To the best of our knowledge, this is the first time Birkhoff's Theorem has been formulated and proved in dependent type theory , and verified with a proof assistant .
Revised:  To the best of our knowledge, this is the first time Birkhoff's Theorem has been formulated and proved in dependent type theory and verified with a proof assistant .
Edit intent: fluency
Original:  The library includes a substantial collection of definitions, theorems, and proofs from universal algebra and equational logic and as such provides many examples that exhibit the power of inductive and dependent types for representing and reasoning about general algebraic and relational structures .
Revised:  The library includes a substantial collection of definitions, theorems, and proofs from universal algebra , illustrating the expressive power of inductive and dependent types for representing and reasoning about general algebraic and relational structures .
Edit intent: clarity
Original:  Additionally, the model includes ECM erosion , interstitial flow, and coupled flow in  vessels and tissue.
Revised:  Additionally, the model includes erosion of the extracellular matrix , interstitial flow, and coupled flow in vessels and tissue.
Edit intent: clarity
Original:  Additionally, the model includes ECM erosion , interstitial flow, and coupled flow in  vessels and tissue.
Revised:  Additionally, the model includes ECM erosion , interstitial flow, and coupled flow in blood vessels and tissue.
Edit intent: clarity
Original:  The process is not deterministic, allowing random growth of blood vessels and, therefore, due to the coupling of nutrients in tissue and vessels, stochastic tumor growth .
Revised:  The process is not deterministic, allowing random growth of blood vessels and, therefore, due to the coupling of nutrients in tissue and vessels, makes the growth of tumors stochastic .
Edit intent: clarity
Original:  furthermore, we present numerical results for a heat-transfer problem in an annular domain and for a potential flow past a rotating airfoil to demonstrate the effectiveness of our method.
Revised:  furthermore, we present numerical results for a heat-transfer problem in an annular domain , a potential flow past a rotating airfoil to demonstrate the effectiveness of our method.
Edit intent: fluency
Original: The function of most protein molecules involves structural flexibility and/or dynamic interactions with other molecules  . CryoEM provides direct visualization of individual macromolecules in different conformational and compositional states.
Revised: Structural flexibility and/or dynamic interactions with other molecules . CryoEM provides direct visualization of individual macromolecules in different conformational and compositional states.
Edit intent: clarity
Original: The function of most protein molecules involves structural flexibility and/or dynamic interactions with other molecules  . CryoEM provides direct visualization of individual macromolecules in different conformational and compositional states.
Revised: The function of most protein molecules involves structural flexibility and/or dynamic interactions with other molecules . CryoEM provides direct visualization of individual macromolecules sampling different conformational and compositional states.
Edit intent: fluency
Original:  While many methods are available for  classification of discrete states, characterization of continuous conformational changes or large numbers of discrete state without human supervision remains challenging.
Revised:  While numerous methods are available for classification of discrete states, characterization of continuous conformational changes or large numbers of discrete state without human supervision remains challenging.
Edit intent: fluency
Original:  Monte Carlo simulation is employed to verify the results obtained in the analytical model and to compare the results between the two discussed algorithms.
Revised:  Monte Carlo simulation is utilized to verify the results obtained in the analytical model and to compare the results between the two discussed algorithms.
Edit intent: fluency
Original: Ultra-reliable low-latency communication (URLLC) is defined in 5G New Radio to support the applications such as Industry 4.0, remote surgery, etc. URLLC features have initially been defined for licensed spectrum.
Revised: Ultra-reliable low-latency communication (URLLC) in 5G New Radio to support the applications such as Industry 4.0, remote surgery, etc. URLLC features have initially been defined for licensed spectrum.
Edit intent: coherence
Original: Ultra-reliable low-latency communication (URLLC) is defined in 5G New Radio to support the applications such as Industry 4.0, remote surgery, etc. URLLC features have initially been defined for licensed spectrum.
Revised: Ultra-reliable low-latency communication (URLLC) is defined in 5G New Radio has been originally defined only for licensed spectrum.
Edit intent: clarity
Original:  The operation of FBE in the controlled unlicensed environment is analyzed through a Markov chain to show that URLLC latency requirement limits the FBE performance causing a decrease of URLLC transmission's reliability .
Revised:  The operation of FBE in an unlicensed controlled environment through a Markov chain to show that URLLC latency requirement limits the FBE performance causing a decrease of URLLC transmission's reliability .
Edit intent: clarity
Original:  The operation of FBE in the controlled unlicensed environment is analyzed through a Markov chain to show that URLLC latency requirement limits the FBE performance causing a decrease of URLLC transmission's reliability .
Revised:  The operation of FBE in the controlled unlicensed environment is analyzed through a Markov chain .
Edit intent: coherence
Original:  Based on the analysis, two schemes are proposed to improve the URLLC performance in FBE .
Revised:  Based on this analysis, we propose two schemes to improve the URLLC performance in FBE .
Edit intent: clarity
Original:  Based on the analysis, two schemes are proposed to improve the URLLC performance in FBE .
Revised:  Based on the analysis, two schemes are proposed to improve the URLLC performance in FBE :
Edit intent: fluency
Original:  The second scheme configures the FFP's starting point of each transmitter based on its priority so that a high priority transmitter's transmission is not blocked by a low priority transmitter's transmission in all cases .
Revised:  The second scheme configures the FFP's starting point of each transmitter based on its priority .
Edit intent: clarity
Original:  The simulations show the benefits of these schemes to URLLC transmission compared to the conventional scheme .
Revised:  The simulations show the benefits of these schemes compared to the conventional scheme .
Edit intent: clarity
Original:  The simulations show the benefits of these schemes to URLLC transmission compared to the conventional scheme .
Revised:  The simulations show the benefits of these schemes to URLLC transmission compared to the URLLC transmission of existing schemes .
Edit intent: clarity
Original:  They are closely connected to some methods and schemesconstructed recently by several authors .
Revised:  We also show that some already known methods can be converted into such schemes .
Edit intent: coherence