wanyu/IteraTeR_v2 huggingface dataset:
Original:  We test this hypothesis using an individual-based simulation where social grooming costs are assumed to increase linearly with the strength of social relationships ;
Revised:  We test this hypothesis using an individual-based simulation where social grooming costs are assumed to increase linearly with the social relationship strength ;
Edit intent: clarity
Original:  The results  of this simulation suggest that the gradient of social grooming costs increases the width and shallowness of social relationships  .
Revised:  The results of this simulation suggested that the gradient of social grooming costs increases the width and shallowness of social relationships .
Edit intent: fluency
Original:  The recognition problem for simple-triangle graphs was a longstanding open problem, and recently a polynomial-time algorithm has been given by Mertzios [G. B. Mertzios, The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial, SIAM J. Discrete Math., 29(3):1150--1185, 2015].
Revised:  The recognition problem for simple-triangle graphs was a longstanding open problem, and recently a polynomial-time algorithm has been given [G. B. Mertzios, The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial, SIAM J. Discrete Math., 29(3):1150--1185, 2015].
Edit intent: clarity
Original:  This papershows a simpler recognition algorithm for simple-triangle graphs.
Revised:  Along with the approach of this paper, we show a simpler recognition algorithm for simple-triangle graphs.
Edit intent: coherence
Original:  To do this, we provide a polynomial-time algorithm to solve the following restricted 2-chain subgraph cover problem: Given a bipartite graph G and a set of edges F of G, find a 2-chain subgraph cover of G such that one of two chain subgraphs has no edges in F.
Revised:  To do this, we provide a polynomial-time algorithm to solve the following problem: Given a bipartite graph G and a set of edges F of G, find a 2-chain subgraph cover of G such that one of two chain subgraphs has no edges in F.
Edit intent: clarity
Original:  To do this, we provide a polynomial-time algorithm to solve the following restricted 2-chain subgraph cover problem: Given a bipartite graph G and a set of edges F of G, find a 2-chain subgraph cover of G such that one of two chain subgraphs has no edges in F.
Revised:  To do this, we provide a polynomial-time algorithm to solve the following restricted 2-chain subgraph cover problem: Given a bipartite graph G and a set F of edges of G, find a 2-chain subgraph cover of G such that one of two chain subgraphs has no edges in F.
Edit intent: fluency
Original: The recent research effort towards defining new communication solutions  to guarantee high availability level with limited cabling costs and complexity  has renewed the interest in ring-based networks.
Revised: The recent research effort towards defining new communication solutions to guarantee high availability level with limited cabling costs and complexity , has renewed the interest in ring-based networks.
Edit intent: fluency
Original:  A relevant issue for such networks is handling cyclic dependencies to prove timing predictability, a key requirement for safety-critical systems , e. g., avionics and automotive.
Revised:  A relevant issue for such networks is to prove timing predictability, a key requirement for safety-critical systems , e. g., avionics and automotive.
Edit intent: clarity
Original:  An extensive analysis of such a proposal has been conducted regarding the tightness of delay bounds and its impact on the system performance, in terms of system scalability and resource-efficiency .
Revised:  An extensive analysis of such a proposal is conducted herein regarding the accuracy of delay bounds and its impact on the system performance, in terms of system scalability and resource-efficiency .
Edit intent: clarity
Original:  An extensive analysis of such a proposal has been conducted regarding the tightness of delay bounds and its impact on the system performance, in terms of system scalability and resource-efficiency .
Revised:  An extensive analysis of such a proposal has been conducted regarding the tightness of delay bounds and its impact on the system performance, i.e., scalability and resource-efficiency .
Edit intent: coherence
Original:  Results highlight the proposed approach efficiency to compute tight delay bounds , in comparison with conventional timing analysis and in reference with a worst-case delay lower bound .
Revised:  Results highlight the proposed approach efficiency to compute tight delay bounds , in comparison to conventional methods .
Edit intent: clarity
Original:  These models outperform the standard affine default intensity models in terms of analytical tractability.
Edit intent: coherence
Original:  The prices of defaultable bonds and credit default swaps (CDS) are linear in the factors.
Revised:  The prices of defaultable bonds and credit default swaps (CDS) are linear-rational in the factors.
Edit intent: clarity
Original: Bitcoin is without a doubt the most successful cryptocurrency in circulation today, making it an extremely valuable target for attackers.
Revised: As the most successful cryptocurrency in circulation today, making it an extremely valuable target for attackers.
Edit intent: clarity
Original: Bitcoin is without a doubt the most successful cryptocurrency in circulation today, making it an extremely valuable target for attackers.
Revised: Bitcoin is without a doubt the most successful cryptocurrency to date, Bitcoin constitutes a target of choice for attackers.
Edit intent: clarity
Original:  We demonstrate the feasibility of large-scale attacks in practice against the deployed Bitcoin software and quantify their disruptive network-wide impact .
Revised:  We demonstrate the feasibility of each attack against the deployed Bitcoin software and quantify their disruptive network-wide impact .
Edit intent: clarity
Original:  The potential damage to Bitcoin is severe .
Revised:  The potential damage to Bitcoin is worrying .
Edit intent: clarity
Original:  By isolating a part of the network or delaying the propagationof blocks, network-level attackers can cause a significant amount of mining power to be wasted, leading to revenue losses and enabling a wide range of attacks such as double spending.
Revised:  By isolating parts of the network or delaying the propagationof blocks, network-level attackers can cause a significant amount of mining power to be wasted, leading to revenue losses and enabling a wide range of attacks such as double spending.
Edit intent: fluency
Original:  By isolating a part of the network or delaying the propagationof blocks, network-level attackers can cause a significant amount of mining power to be wasted, leading to revenue losses and enabling a wide range of attacks such as double spending.
Revised:  By isolating a part of the network or delaying block propagation, attackers can cause a significant amount of mining power to be wasted, leading to revenue losses and enabling a wide range of attacks such as double spending.
Edit intent: clarity
Original:  By isolating a part of the network or delaying the propagationof blocks, network-level attackers can cause a significant amount of mining power to be wasted, leading to revenue losses and enabling a wide range of attacks such as double spending.
Revised:  By isolating a part of the network or delaying the propagationof blocks, network-level attackers can cause a significant amount of mining power to be wasted, leading to revenue losses and enabling a wide range of exploits such as double spending.
Edit intent: clarity
Original:  We provide several suggestions on approaches to mitigate such attacks employing both short-term and long-term measures .
Revised:  To prevent such effects in practice, we provide both short and long-term measures .
Edit intent: clarity
Original:  Computing the observed information is computationally expensive , therefore, the expected information matrix---the Fisher information matrix---is often preferred due to its simplicity.
Revised:  Computing the observed information is computationally prohibitive for high-throughput biological data , therefore, the expected information matrix---the Fisher information matrix---is often preferred due to its simplicity.
Edit intent: clarity
Original:  In this paper, we prove that the average of the observed and  Fisher information of the restricted/residual log-likelihood function for the linear mixed model can be split into two matrices.
Revised:  In this paper, we prove that the average of the observed and the Fisher information of the restricted/residual log-likelihood function for the linear mixed model can be split into two matrices.
Edit intent: fluency
Original:  In this paper, we prove that the average of the observed and  Fisher information of the restricted/residual log-likelihood function for the linear mixed model can be split into two matrices.
Revised:  In this paper, we prove that the average of the observed and Fisher information of restricted/residual log-likelihood function for the linear mixed model can be split into two matrices.
Edit intent: fluency
Original:  In this paper, we prove that the average of the observed and  Fisher information of the restricted/residual log-likelihood function for the linear mixed model can be split into two matrices.
Revised:  In this paper, we prove that the average of the observed and Fisher information of the restricted/residual log-likelihood functions for linear mixed models can be split into two matrices.
Edit intent: fluency
Original:  The expectation of one part is the Fisher information matrix but has a simper form than the Fisher information matrix.
Revised:  The expectation of one part is the Fisher information matrix but enjoys a simper formula than the Fisher information matrix.
Edit intent: clarity
Original:  The other part which involves a lot of computations is a zero random matrix and thus is negligible.
Revised:  The other part which involves a lot of computations is a random zero matrix and thus is negligible.
Edit intent: clarity
Original:  In this paper, we prove that the average of the observed  and the Fisher information of restricted/residual log-likelihood functions for linear mixed models can be split into two matrices.
Revised:  In this paper, we prove that the average of the observed information and the Fisher information of restricted/residual log-likelihood functions for linear mixed models can be split into two matrices.
Edit intent: fluency
Original:  In this paper, we prove that the average of the observed  and the Fisher information of restricted/residual log-likelihood functions for linear mixed models can be split into two matrices.
Revised:  In this paper, we prove that the average of the observed and the Fisher information can be split into two matrices.
Edit intent: coherence
Original:  These requirements were developed within a working group of the Electrophysiology Task Force in the INCF Program on Standards for Data Sharing  .
Revised:  These requirements are being developed within a working group of the Electrophysiology Task Force in the INCF Program on Standards for Data Sharing .
Edit intent: clarity
Original:  ChinaCache (one of the largest CDN providers in China) and Youku (a video provider using smartrouters to assist video delivery) announced their cooperation in 2015, to create a new paradigm of content delivery based on householders' network resources \mbox{ youkuchinacache .
Revised:  ChinaCache (one of the largest CDN providers in China) and Youku (a video provider using smartrouters to assist video delivery) announced their cooperation in 2015, to create a new paradigm of content delivery based on householders' network resources .
Edit intent: coherence
Original:  However, learning people's food preferences and making healthy recommendations that appeal to their palate is challenging.
Revised:  However, learning people's food preferences and making recommendations that simultaneously appeal to their palate is challenging.
Edit intent: clarity
Original:  We propose Yum-me, a personalized healthy meal recommender system designed to meet individuals' health goals , dietary restrictions, and fine-grained food preferences.
Revised:  We propose Yum-me, a personalized healthy meal recommender system designed to meet individuals' nutritional expectations , dietary restrictions, and fine-grained food preferences.
Edit intent: clarity
Original:  Marrying ideas from user preference learning and healthy eating promotion, Yum-me enables a simple and accurate food preference profiling procedure via an image-based online learning framework , and projects the learned profile into the domain of healthy food options to find ones that will appeal to the user.
Revised:  Yum-me enables a simple and accurate food preference profiling procedure via an image-based online learning framework , and projects the learned profile into the domain of healthy food options to find ones that will appeal to the user.
Edit intent: coherence
Original:  Marrying ideas from user preference learning and healthy eating promotion, Yum-me enables a simple and accurate food preference profiling procedure via an image-based online learning framework , and projects the learned profile into the domain of healthy food options to find ones that will appeal to the user.
Revised:  Marrying ideas from user preference learning and healthy eating promotion, Yum-me enables a simple and accurate food preference profiling procedure via a visual quiz-based user interface , and projects the learned profile into the domain of healthy food options to find ones that will appeal to the user.
Edit intent: clarity
Original:  We present the design and implementation of Yum-me, and further discuss the most critical component of it: FoodDist, a state-of-the-art food image analysis model  .
Revised:  We present the design and implementation of Yum-me, and further discuss the most critical component of it: FoodDist, a state-of-the-art food image analysis model , named FoodDist .
Edit intent: clarity
Original:  We validate the feasibility and effectiveness of Yum-me through a 60-person user study, in which Yum-me improves the recommendation acceptance rate by 42.63\% over the traditional food preference survey .
Revised:  We validate the feasibility and effectiveness of Yum-me through a 60-person user study, in which Yum-me improves the recommendation acceptance rate by 42.63\% .
Edit intent: clarity
Original:  We demonstrate FoodDist's superior performance through careful benchmarking , and discuss its applicability across a wide array of dietary applications.
Revised:  We demonstrate FoodDist's superior performance through careful benchmarking and discuss its applicability across a wide array of dietary applications.
Edit intent: fluency
Original:  2) A novel online learning framework that learns food preference from itemwise and pairwise image comparisons.
Revised:  The second contribution is a novel online learning framework that learns food preference from itemwise and pairwise image comparisons.
Edit intent: clarity
Original:  2) A novel online learning framework that learns food preference from itemwise and pairwise image comparisons.
Revised:  2) A novel online learning framework that learns food preference from item-wise and pairwise image comparisons.
Edit intent: fluency
Original:  Finally, we conduct an end-to-end validation of the feasibility and effectiveness of Yum-me through a 60-person user study, in which Yum-me improves the recommendation acceptance rate by 42.63\%.
Revised:  We further conducted an end-to-end validation of the feasibility and effectiveness of Yum-me through a 60-person user study, in which Yum-me improves the recommendation acceptance rate by 42.63\%.
Edit intent: clarity
Original:  We introduce three algorithms for solving this problem: (1) the PTAP algorithm, which transforms a set of input-output traces into an incomplete Moore machine and then completes that machine with self-loops;
Revised:  We develop three algorithms for solving this problem: (1) the PTAP algorithm, which transforms a set of input-output traces into an incomplete Moore machine and then completes that machine with self-loops;
Edit intent: clarity
Original:  We introduce three algorithms for solving this problem: (1) the PTAP algorithm, which transforms a set of input-output traces into an incomplete Moore machine and then completes that machine with self-loops;
Revised:  We introduce three algorithms for solving this problem: (1) the PTAP algorithm, which transforms a set of input-output traces into an incomplete Moore machine and then completes the machine with self-loops;
Edit intent: clarity
Original: This paper develops a class of meshless methods that are well-suited to statistical inverse problems involving partial differential equations (PDEs) .
Revised: This paper develops a probabilistic numerical method for solution of partial differential equations (PDEs) .
Edit intent: clarity
Original:  This construction enables the solution of challenging inverse problems while accounting, in a rigorous way, for the impact of the discretisation of the forward problem .
Revised:  This construction enables the solution of challenging inverse problems whilst accounting, in a rigorous way, for the impact of the discretisation of the forward problem .
Edit intent: fluency
Original:  This construction enables the solution of challenging inverse problems while accounting, in a rigorous way, for the impact of the discretisation of the forward problem .
Revised:  This construction enables the solution of challenging inverse problems while accounting, in a statistically principled way, for the impact of the discretisation of the forward problem .
Edit intent: clarity
Original:  In particular, this confers robustness to failure of meshless methods , with statistical inferences driven to be more conservative in the presence of significant solver error.
Revised:  In particular, the approach confers robustness to failure of meshless methods , with statistical inferences driven to be more conservative in the presence of significant solver error.
Edit intent: clarity
Original:  In addition, (i) a principled learning-theoretic approach to minimise the impact of solver error is developed, and (ii) the challenging setting of inverse problems with a non-linear forward model is considered.
Revised:  In addition, (i) a principled learning-theoretic approach to minimise the impact of solver error on statistical inferences; here the challenge of non-linear forward model is considered.
Edit intent: clarity
Original:  In addition, (i) a principled learning-theoretic approach to minimise the impact of solver error is developed, and (ii) the challenging setting of inverse problems with a non-linear forward model is considered.
Revised:  In addition, (i) a principled learning-theoretic approach to minimise the impact of solver error is developed, and (ii) the challenging setting of inverse problems with a non-linear PDEs is also considered.
Edit intent: clarity
Original:  The method is applied to parameter inference problems in which  non-negligible solver error must be accounted for in order to draw valid statistical conclusions .
Revised:  The method is applied to parameter inference problems in which non-negligible and must be accounted for in order to draw valid statistical conclusions .
Edit intent: clarity
Original:  The method is applied to parameter inference problems in which  non-negligible solver error must be accounted for in order to draw valid statistical conclusions .
Revised:  The method is applied to parameter inference problems in which non-negligible solver error must be accounted for in order to reach conclusions that are statistically valid .
Edit intent: clarity
Original: Taking advantage of top-ranked documents in response to a query for improving quality of query translation has been shown to be an effective approach for cross-language information retrieval.
Revised: Using top-ranked documents in response to a query for improving quality of query translation has been shown to be an effective approach for cross-language information retrieval.
Edit intent: clarity
Original: Taking advantage of top-ranked documents in response to a query for improving quality of query translation has been shown to be an effective approach for cross-language information retrieval.
Revised: Taking advantage of top-ranked documents in response to a query has been shown to be an effective approach for cross-language information retrieval.
Edit intent: coherence
Original:  To this end, first we learn low-dimensional representations of the words in the pseudo-relevant collections separately and then aim at finding a query-dependent transformation matrix between the vectors of translation pairs  .
Revised:  To this end, first we learn low-dimensional vectors of the words in the pseudo-relevant collections separately and then aim at finding a query-dependent transformation matrix between the vectors of translation pairs .
Edit intent: clarity
Original:  To this end, first we learn low-dimensional representations of the words in the pseudo-relevant collections separately and then aim at finding a query-dependent transformation matrix between the vectors of translation pairs  .
Revised:  To this end, first we learn low-dimensional representations of the words in the pseudo-relevant collections separately and then aim to find a query-dependent transformation matrix between the vectors of translation pairs .
Edit intent: fluency
Original:  Stemming is a common strategy to this end.
Revised:  Stemming is a common approach to this end.
Edit intent: clarity
Original:  Among many approaches for stemming, statistical stemming has  shown to be effective in a few number of languages, particularly those highly inflected ones.
Revised:  Among many techniques for stemming, statistical stemming has shown to be effective in a few number of languages, particularly those highly inflected ones.
Edit intent: clarity
Original:  Among many approaches for stemming, statistical stemming has  shown to be effective in a few number of languages, particularly those highly inflected ones.
Revised:  Among many approaches for stemming, statistical stemming has been shown to be effective in a few number of languages, particularly those highly inflected ones.
Edit intent: fluency
Original:  Among many approaches for stemming, statistical stemming has  shown to be effective in a few number of languages, particularly those highly inflected ones.
Revised:  Among many approaches for stemming, statistical stemming has shown to be effective in a number of languages, particularly those highly inflected ones.
Edit intent: clarity
Original: The classical discrete time model of  transaction costs relies on the assumption that the increments of the feasible portfolio process belong to the solvency set at each step.
Revised: The classical discrete time model of transaction costs relies on the assumption that a feasible portfolio process belong to the solvency set at each step.
Edit intent: clarity
Original: The classical discrete time model of  transaction costs relies on the assumption that the increments of the feasible portfolio process belong to the solvency set at each step.
Revised: The classical discrete time model of transaction costs relies on the assumption that the increments of the feasible portfolio process has solvent increments at each step.
Edit intent: clarity
Original:  We extend this setting by assuming that any such increment belongs to the sum of an element of the solvency set and the family of acceptable positions, e.g. with respect to a dynamic risk measure.
Revised:  We extend this setting by assuming that any such increment belongs to the sum of a solvency set and the family of acceptable positions, e.g. with respect to a dynamic risk measure.
Edit intent: clarity
Original:  We describe the sets of superhedging prices, formulate several no risk arbitrage conditions and explore connections between them.
Revised:  We describe the sets of superhedging prices, formulate several no (risk) arbitrage conditions and explore connections between them.
Edit intent: fluency