wanyu/IteraTeR_v2 huggingface dataset:
Original:  We examined community structure in the concept network to group ideas into a set of important concepts , which we refined further through extensive discussion into seven essential concepts.
Revised:  We examined community structure in the concept network to group ideas into a set of important concepts , which we refined through discussion into seven essential concepts.
Edit intent: clarity
Original:  We demonstrate the feasibility of the approach } through three application case studies: a course manager, a health record system, and a conference management system that we have deployed to run a workshop.
Revised:  We demonstrate the feasibility of the approach } through three application case studies: a course manager, a health record system, and a conference management system used to run an academic workshop.
Edit intent: clarity
Original:  We compare to code written with hand-implemented policies, showing that not only does Jacqueline reduce lines of policy code, but also that the Jacqueline runtime has reasonable, and  often negligible,  overheads.
Revised:  We compare to code written with hand-implemented policies, showing that not only does Jacqueline reduce lines of policy code, and often negligible, overheads.
Edit intent: clarity
Original:  These conditions cover an abundant class of evolution models that includes all binary models, the Jukes-Cantor model and the Felsenstein 1981 model.
Revised:  These conditions are satisfied by common simple models including all binary models, the Jukes-Cantor model and the Felsenstein 1981 model.
Edit intent: clarity
Original:  In this regard, diffusion modeling of response times (RTs) from correct and erroneous responses using the Wiener distribution has become popular because it provides a set of  interpretable parameters.
Revised:  In this regard, diffusion modeling of response times (RTs) from correct and erroneous responses using the Wiener distribution has become a popular measurement tool because it provides a set of interpretable parameters.
Edit intent: clarity
Original:  An important precondition to estimate these parameters, however, is a sufficient number of RTs from erroneous responses.
Revised:  However, an important precondition to estimate these parameters, however, is a sufficient number of RTs from erroneous responses.
Edit intent: coherence
Original:  An important precondition to estimate these parameters, however, is a sufficient number of RTs from erroneous responses.
Revised:  An important precondition to identify all of these parameters, however, is a sufficient number of RTs from erroneous responses.
Edit intent: clarity
Original:  An important precondition to estimate these parameters, however, is a sufficient number of RTs from erroneous responses.
Revised:  An important precondition to estimate these parameters, is a sufficient number of RTs from erroneous responses.
Edit intent: coherence
Original:  In the present article, we show by simulation that the parameters of the Wiener distribution can even be recovered from tasks yielding very high or even perfect response accuracies using the shifted Wald distribution.
Revised:  In the present article, we show by simulation that the parameters of the Wiener distribution can be recovered even from tasks yielding very high or even perfect response accuracies using the shifted Wald distribution.
Edit intent: fluency
Original:  Specifically, we argue that error RTs can be considered as correct RTs that have undergone informative censoring .
Revised:  Specifically, we argue that error RTs can be modeled as correct RTs that have undergone informative censoring .
Edit intent: clarity
Original:  We illustrate our reasoning by fitting the Wiener and censored shifted Wald distribution to RTs from 101 participants who completed a Go/No-go task.
Revised:  We illustrate our reasoning by fitting the Wiener and (censored) shifted Wald distribution to RTs from 101 participants who completed a Go/No-go task.
Edit intent: coherence
Original:  Particularly  diffusion modeling of response times (RTs) from correct and erroneous responses using the Wiener distribution has become a popular measurement tool because it provides a set of psychologically interpretable parameters.
Revised:  Particularly , diffusion modeling of response times (RTs) from correct and erroneous responses using the Wiener distribution has become a popular measurement tool because it provides a set of psychologically interpretable parameters.
Edit intent: fluency
Original:  However, an important precondition to identify all of these parameters , is a sufficient number of RTs from erroneous responses.
Revised:  However, an important precondition to identify all of these parameters is a sufficient number of RTs from erroneous responses.
Edit intent: fluency
Original:  In the present article, we show by simulation that the parameters of the Wiener distribution can be recovered even from tasks yielding very high or even perfect response accuracies using the shifted Wald distribution.
Revised:  In the present article, we show by simulation that the parameters of the Wiener distribution can be recovered from tasks yielding very high or even perfect response accuracies using the shifted Wald distribution.
Edit intent: coherence
Original:  Specifically, we argue that error RTs can be modeled as correct RTs that have undergone censoring  using techniques from parametric survival analysis.
Revised:  Specifically, we argue that error RTs can be modeled as correct RTs that have undergone censoring by using techniques from parametric survival analysis.
Edit intent: fluency
Original:  We illustrate our reasoning by fitting the Wiener and (censored) shifted Wald distribution to RTs from 6 participants who completed a Go/No-go task.
Revised:  We illustrate our reasoning by fitting the Wiener and (censored) shifted Wald distribution to RTs from six participants who completed a Go/No-go task.
Edit intent: fluency
Original:  We discuss implications for our understanding of the informational architecture of the fission yeast cell cycle network and for illuminating any distinctive physics  operative in life.
Revised:  We discuss implications for our understanding of the informational architecture of the fission yeast cell cycle network and for illuminating any distinctive physics that may be operative in life.
Edit intent: clarity
Original:  We analyze the performance of two classes of estimators : \ell_1-regularized maximum likelihood and greedy estimation for a discrete version of the Hawkes process and characterize the sampling tradeoffs required for stable recovery in the non-asymptotic regime.
Revised:  We analyze the performance of two classes of estimators , namely the \ell_1-regularized maximum likelihood and greedy estimation for a discrete version of the Hawkes process and characterize the sampling tradeoffs required for stable recovery in the non-asymptotic regime.
Edit intent: clarity
Original: We consider the problem of estimating discrete self-exciting point process models from limited binary observations, where the history of the process serves as the covariate.
Revised: We consider the problem of estimating self-exciting point process models from limited binary observations, where the history of the process serves as the covariate.
Edit intent: clarity
Original:  We analyze the performance of two classes of estimators, namely the \ell_1-regularized maximum likelihood and greedy estimators, for a canonical self-exciting point process and characterize the sampling tradeoffs required for stable recovery in the non-asymptotic regime.
Revised:  We analyze the performance of two classes of estimators, namely the \ell_1-regularized maximum likelihood and greedy estimators, for a canonical self-exciting process and characterize the sampling tradeoffs required for stable recovery in the non-asymptotic regime.
Edit intent: clarity
Original:  Our results extend those of compressed sensing for linear and generalized linear models with i.i.d. covariates to point processes with highly inter-dependent covariates.
Revised:  Our results extend those of compressed sensing for linear and generalized linear models with i.i.d. covariates to those with highly inter-dependent covariates.
Edit intent: clarity
Original:  We further provide simulation studies as well as application to real spiking data from  mouse's lateral geniculate nucleus and  ferret's retinal ganglion cells which agree with our theoretical predictions.
Revised:  We further provide simulation studies as well as application to real spiking data from the mouse's lateral geniculate nucleus and ferret's retinal ganglion cells which agree with our theoretical predictions.
Edit intent: fluency
Original:  We further provide simulation studies as well as application to real spiking data from  mouse's lateral geniculate nucleus and  ferret's retinal ganglion cells which agree with our theoretical predictions.
Revised:  We further provide simulation studies as well as application to real spiking data from mouse's lateral geniculate nucleus and the ferret's retinal ganglion cells which agree with our theoretical predictions.
Edit intent: fluency
Original:  We developed a spectral analytical method and algorithm based on high-order orthogonal expansions using the Chebyshev polynomials of the first kind with the subsequent Fej\'er summation.
Revised:  We developed a spectral analytical method and algorithm based on high-order orthogonal expansions using the Chebyshev polynomials of the first kind with the subsequent Fejer summation.
Edit intent: fluency
Original:  Using our model, we can also compute the ex ante social welfare given an arbitrary initial network, which allows us to characterize the socially optimal network structures for different sets of agents.
Revised:  Using our model, we can also compute the ex ante social welfare given an arbitrary initial network, which allows us to characterize the socially optimal network structures for different sets of agents.
Edit intent: fluency
Original: In many real world networks agents are initially unsure of each other's qualities and  learn about each other over time via repeated interactions.
Revised: In many real world networks agents are initially unsure of each other's qualities and must learn about each other over time via repeated interactions.
Edit intent: clarity
Original:  This paper is the first to provide a methodology for studying the formation of such networks, taking into account that agents differ from each other, that they begin with incomplete information, and that they must learn through observations which connections/links to form and which to break.
Revised:  This paper is the first to provide a methodology for studying the dynamics of such networks, taking into account that agents differ from each other, that they begin with incomplete information, and that they must learn through observations which connections/links to form and which to break.
Edit intent: clarity
Original:  This paper is the first to provide a methodology for studying the formation of such networks, taking into account that agents differ from each other, that they begin with incomplete information, and that they must learn through observations which connections/links to form and which to break.
Revised:  This paper is the first to provide a methodology for studying the formation of such networks, taking into account that agents differ from each other, that they begin with incomplete information, and that they must learn through past experiences which connections/links to form and which to break.
Edit intent: clarity
Original:  The network dynamics in our model vary drastically from the dynamics emerging in models of complete information.
Revised:  The network dynamics in our model vary drastically from the dynamics in models of complete information.
Edit intent: clarity
Original:  We show, among many other things, that the information to which agents have access and the speed at which they learn and act can have  tremendous impact on the resulting network dynamics.
Revised:  We show, among many other things, that the information to which agents have access and the speed at which they learn and act can have a tremendous impact on the resulting network dynamics.
Edit intent: fluency
Original:  We also introduce affine de Casteljau algorithm for Lupas type (p,q) -Bernstein Bezier curves .
Revised:  We also introduce affine de Casteljau algorithm for Lupas type (p,q) -Bezier Bernstein functions .
Edit intent: clarity
Original:  Furthermore, some fundamental properties for (p,q)-Bernstein Bezier curves and Lupas type (p,q)-Bernstein Bezier curves are discussed.
Revised:  Furthermore, some fundamental properties for (p,q)-Bernstein Bezier curves are discussed.
Edit intent: coherence
Original:  We get q-Bezier curves and surfaces for (u, v) \in [0, 1] x [0, 1] when we set the parameter p_1 = p_2 = 1. In Comparison to q-Bezier curves and surfaces based on Phillips q-Bernstein polynomials, our generalizations show more flexibility in choosing the value of p_1, p_2 and q_1, q_2 and superiority in shape control of curves and surfaces.
Revised:  We get q-Bezier curves and surfaces for (u, v) \in [0, 1] \times [0, 1] when we set the parameter p_1 = p_2 = 1. In Comparison to q-Bezier curves and surfaces based on Phillips q-Bernstein polynomials, our generalizations show more flexibility in choosing the value of p_1, p_2 and q_1, q_2 and superiority in shape control of curves and surfaces.
Edit intent: clarity
Original:  We get q-Bezier curves and surfaces for (u, v) \in [0, 1] x [0, 1] when we set the parameter p_1 = p_2 = 1. In Comparison to q-Bezier curves and surfaces based on Phillips q-Bernstein polynomials, our generalizations show more flexibility in choosing the value of p_1, p_2 and q_1, q_2 and superiority in shape control of curves and surfaces.
Revised:  We get q-Bezier curves and surfaces for (u, v) \in [0, 1] x [0, 1] when we set the parameter p1 = p_2 = 1. In Comparison to q-Bezier curves and surfaces based on Phillips q-Bernstein polynomials, our generalizations show more flexibility in choosing the value of p_1, p_2 and q_1, q_2 and superiority in shape control of curves and surfaces.
Edit intent: fluency
Original:  We get q-Bezier curves and surfaces for (u, v) \in [0, 1] x [0, 1] when we set the parameter p_1 = p_2 = 1. In Comparison to q-Bezier curves and surfaces based on Phillips q-Bernstein polynomials, our generalizations show more flexibility in choosing the value of p_1, p_2 and q_1, q_2 and superiority in shape control of curves and surfaces.
Revised:  We get q-Bezier curves and surfaces for (u, v) \in [0, 1] x [0, 1] when we set the parameter p_1 = p2 = 1. In Comparison to q-Bezier curves and surfaces based on Phillips q-Bernstein polynomials, our generalizations show more flexibility in choosing the value of p_1, p_2 and q_1, q_2 and superiority in shape control of curves and surfaces.
Edit intent: fluency
Original: Recent work has considered the use of densely-sampled genetic data to reconstruct the transmission trees linking infectors and infectees in outbreaks.
Revised: Recent work has attempted to use whole-genome sequence data from pathogens to reconstruct the transmission trees linking infectors and infectees in outbreaks.
Edit intent: clarity
Original:  Because transmission trees from one outbreak do not generalize to future outbreaks , scientific insights that can inform public health policy are more likely to be obtained by using genetic sequence data to estimate transmissionparameters more precisely (e. g., covariate effects on infectiousness and susceptibility).
Revised:  However, transmission trees from one outbreak do not generalize to future outbreaks , scientific insights that can inform public health policy are more likely to be obtained by using genetic sequence data to estimate transmissionparameters more precisely (e. g., covariate effects on infectiousness and susceptibility).
Edit intent: coherence
Original:  Because transmission trees from one outbreak do not generalize to future outbreaks , scientific insights that can inform public health policy are more likely to be obtained by using genetic sequence data to estimate transmissionparameters more precisely (e. g., covariate effects on infectiousness and susceptibility).
Revised:  Because transmission trees from one outbreak do not generalize to future outbreaks . Reconstruction of transmission trees is most useful to public health if it leads to generalizable scientific insights about disease transmission.
Edit intent: clarity
Original:  In a survival analysis framework, transmission parameter estimation is based on sums or averages over  possible transmission trees.
Revised:  In a survival analysis framework, estimation of transmission parameters is based on sums or averages over possible transmission trees.
Edit intent: clarity
Original:  In a survival analysis framework, transmission parameter estimation is based on sums or averages over  possible transmission trees.
Revised:  In a survival analysis framework, transmission parameter estimation is based on sums or averages over the possible transmission trees.
Edit intent: fluency
Original:  By providing partial information about who-infected-whom, a phylogeny can increase the efficiency of these estimates  .
Revised:  A phylogeny can increase the efficiency of these estimates .
Edit intent: clarity
Original:  By providing partial information about who-infected-whom, a phylogeny can increase the efficiency of these estimates  .
Revised:  By providing partial information about who-infected-whom, a phylogeny can increase the precision of these estimates .
Edit intent: clarity
Original:  By providing partial information about who-infected-whom, a phylogeny can increase the efficiency of these estimates  .
Revised:  By providing partial information about who-infected-whom, a phylogeny can increase the efficiency of these estimates by providing partial information about who infected whom .
Edit intent: clarity
Original:  We show that there is a one-to-one relationship between the possible assignments of interior node hosts and the transmission trees simultaneously consistent with the phylogeny and the epidemiologic data on person, place, and time.
Revised:  We show that there is a one-to-one correspondence between the possible assignments of interior node hosts and the transmission trees simultaneously consistent with the phylogeny and the epidemiologic data on person, place, and time.
Edit intent: clarity
Original:  A simulation study confirms that a phylogeny substantially increases the efficiency of estimated hazard ratios for infectiousness and susceptibility.
Revised:  A simulation study confirms that this leads to more efficient estimates of hazard ratios for infectiousness and susceptibility.
Edit intent: clarity
Original:  We use these methods to analyze data from  foot-and-mouth disease virus outbreaks in the United Kingdom in 2001 and 2007.
Revised:  We use these methods to analyze data from a foot-and-mouth disease virus outbreaks in the United Kingdom in 2001 and 2007.
Edit intent: fluency
Original:  We use these methods to analyze data from  foot-and-mouth disease virus outbreaks in the United Kingdom in 2001 and 2007.
Revised:  We use these methods to analyze data from foot-and-mouth disease virus outbreak in the United Kingdom in 2001 and 2007.
Edit intent: fluency
Original:  We also consider a slightly different family of problems in which, each input of a set , X, is required to meet each input of another set , Y, in at least one reducer.
Revised:  We also consider a slightly different family of problems in which, each input of a set , X, is required to meet each input of another list , Y, in at least one reducer.
Edit intent: clarity
Original:  Moreover, while detecting the different sub-communities of the OpenStack community, we found out that the expected social tendency of developers to work with developers from same firm (i.e., homophony ) did not hold within the OpenStack ecosystem.
Revised:  Moreover, while detecting the different sub-communities of the OpenStack community, we found out that the expected social tendency of developers to work with developers from same firm (i.e., homophily ) did not hold within the OpenStack ecosystem.
Edit intent: clarity
Original:  The novelty of LDQL is that it enables a user to express separately (i) patterns that describe the expected query result, and (ii) Web navigation paths that select the data sources to be used for computing the result.
Revised:  The novelty of LDQL is that it expresses separately (i) patterns that describe the expected query result, and (ii) Web navigation paths that select the data sources to be used for computing the result.
Edit intent: clarity
Original:  We  show that LDQL is strictly more expressive than other query formalisms and languages that have been proposed  for Linked Data on the Web.
Revised:  We show that LDQL is strictly more expressive than the query formalisms that have been proposed for Linked Data on the Web.
Edit intent: clarity
Original:  As a downside of this expressiveness , we find that for some LDQL queries, a complete execution is not possible in practice.
Revised:  The high expressiveness allows LDQL to define queries for which a complete execution is not possible in practice.
Edit intent: clarity
Original: The  National Scientific Qualification (ASN) has been introduced as a prerequisite for applying for a tenured associate or full professor position at state-recognized Italian universities.
Revised: The Italian National Scientific Qualification (ASN) has been introduced as a prerequisite for applying for a tenured associate or full professor position at state-recognized Italian universities.
Edit intent: fluency
Original: The  National Scientific Qualification (ASN) has been introduced as a prerequisite for applying for a tenured associate or full professor position at state-recognized Italian universities.
Revised: The National Scientific Qualification (ASN) was introduced as a prerequisite for applying for a tenured associate or full professor position at state-recognized Italian universities.
Edit intent: coherence
Original: The  National Scientific Qualification (ASN) has been introduced as a prerequisite for applying for a tenured associate or full professor position at state-recognized Italian universities.
Revised: The National Scientific Qualification (ASN) has been introduced as a prerequisite for applying for tenured associate or full professor position at state-recognized Italian universities.
Edit intent: fluency
Original: The  National Scientific Qualification (ASN) has been introduced as a prerequisite for applying for a tenured associate or full professor position at state-recognized Italian universities.
Revised: The National Scientific Qualification (ASN) has been introduced as a prerequisite for applying for a tenured associate or full professor positions at state-recognized Italian universities.
Edit intent: fluency
Original: The  National Scientific Qualification (ASN) has been introduced as a prerequisite for applying for a tenured associate or full professor position at state-recognized Italian universities.
Revised: The National Scientific Qualification (ASN) has been introduced as a prerequisite for applying for a tenured associate or full professor position at state-recognized universities.
Edit intent: clarity
Original:  In the final part of this work we contrast the methodology used in the National Scientific Qualification (ASN ) with the best practices that are recommended for assessment of individual researchers.
Revised:  We argue that the ASN is not fully compliant with the best practices that are recommended for assessment of individual researchers.
Edit intent: clarity
Original:  It extends the recent work of Csikv\'ari done for regular and bi-regular bipartite graphs.
Revised:  It extends the recent work of Csikvari done for regular and bi-regular bipartite graphs.
Edit intent: fluency
Original:  We then extend our results to permaments and subpermanents sums.
Revised:  We then extend our results to permanents and subpermanents sums.
Edit intent: fluency