wanyu/IteraTeR_v2 huggingface dataset:
Original:  Guided by this analogy we explicitly calculate as a function of the key parameters in a simple model of sexual populations, the probability, Y, that two individuals are genetically identical  .
Revised:  Guided by this analogy we explicitly calculate the probability, Y, that two individuals are genetically identical .
Edit intent: clarity
Original:  We describe a mixed method approach that reveals the complexities of these communities through examination of their publication networks in combination with  ethnographic field studies.
Revised:  We describe a network analytic approach that reveals the complexities of these communities through examination of their publication networks in combination with ethnographic field studies.
Edit intent: clarity
Original:  We describe a mixed method approach that reveals the complexities of these communities through examination of their publication networks in combination with  ethnographic field studies.
Revised:  We describe a mixed method approach that reveals the complexities of these communities through examination of their publication networks in combination with insights from ethnographic field studies.
Edit intent: clarity
Original:  We suggest that the structures revealed indicate overlapping sub-communities within a research specialty and we provide evidence that they differ in disciplinary orientation and research practices.
Revised:  We suggest that the structures revealed indicate overlapping sub- communities within a research specialty and we provide evidence that they differ in disciplinary orientation and research practices.
Edit intent: fluency
Original:  The network analytic components of our approach include methods to optimize the delineation of a bibliographic data set in order to adequately represent a research specialty, and methods to extract community structures from this data.
Revised:  The network analytic methods presented include methods to optimize the delineation of a bibliographic data set in order to adequately represent a research specialty, and methods to extract community structures from this data.
Edit intent: clarity
Original: Isogeometric analysis (IGA) is a fundamental step forward in computational mechanics that offers the possibility of integrating methods for analysis into Computer Aided Design (CAD) tools and vice versa.
Revised: Isogeometric analysis (IGA) represents a recently developed technology in computational mechanics that offers the possibility of integrating methods for analysis into Computer Aided Design (CAD) tools and vice versa.
Edit intent: clarity
Original: Isogeometric analysis (IGA) is a fundamental step forward in computational mechanics that offers the possibility of integrating methods for analysis into Computer Aided Design (CAD) tools and vice versa.
Revised: Isogeometric analysis (IGA) is a fundamental step forward in computational mechanics that offers the possibility of integrating methods for analysis and Computer Aided Design (CAD) tools and vice versa.
Edit intent: fluency
Original:  The benefits of such an approach are evident , since the time taken from design to analysis is greatly reduced leading to large savings in cost and time for industry .
Revised:  The benefits of such an approach are evident , since the time taken from design to analysis is greatly reduced , leading to dramatic gains in efficiency .
Edit intent: clarity
Original:  In this manuscript, through a clear and simple Matlab \textsuperscript{\textregistered{ implementation, we present an introduction to IGA applied to the Finite Element (FE) method and related computer implementation aspects.
Revised:  In this manuscript, through a clear and simple Matlab implementation, we present an introduction to IGA applied to the Finite Element (FE) method and related computer implementation aspects.
Edit intent: clarity
Original:  Furthermore, implementation of the extended IGA which incorporates enrichment functions through the partition of unity method (PUM) is also presented, where several fracture examples are illustrated in both two-dimensions and three-dimensions .
Revised:  Furthermore, implemen- tation of the extended IGA which incorporates enrichment functions through the partition of unity method (PUM) is also presented, where several fracture examples are illustrated in both two-dimensions and three-dimensions .
Edit intent: fluency
Original:  Furthermore, implementation of the extended IGA which incorporates enrichment functions through the partition of unity method (PUM) is also presented, where several fracture examples are illustrated in both two-dimensions and three-dimensions .
Revised:  Furthermore, implementation of the extended IGA which incorporates enrichment functions through the partition of unity method (PUM) is also presented, where several examples for both two-dimensional and three-dimensional fracture are illustrated .
Edit intent: clarity
Original:  The open source Matlab \textsuperscript{\textregistered{ code which accompanies the present paper can be applied to one, two and three-dimensional problems for linear elasticity, linear elastic fracture mechanics and Poisson problems with or without enrichment  .
Revised:  The open source Matlab code which accompanies the present paper can be applied to one, two and three-dimensional problems for linear elasticity, linear elastic fracture mechanics and Poisson problems with or without enrichment .
Edit intent: coherence
Original:  In the ANTS problem, k identical (probabilistic) agents, initially placed at some central location, collectively search for a treasure in the two-dimensional plane.
Revised:  Specifically, we consider a setting in which k identical (probabilistic) agents, initially placed at some central location, collectively search for a treasure in the two-dimensional plane.
Edit intent: clarity
Original:  This is biologically motivated by cooperative, central place foraging , such as performed by ants around their nest.
Revised:  This is biologically motivated by cooperative, central place foraging such as performed by ants around their nest.
Edit intent: fluency
Original:  We focus on trying to find what can be achieved if communication is limited or altogether absent.
Revised:  Our focus is on trying to find what can be achieved if communication is limited or altogether absent.
Edit intent: fluency
Original:  Furthermore, if the agents do not commence the search in synchrony , then even initial communication is problematic.
Revised:  Furthermore, if agents do not commence the search in synchrony , then even initial communication is problematic.
Edit intent: fluency
Original:  Furthermore, if the agents do not commence the search in synchrony , then even initial communication is problematic.
Revised:  Furthermore, if the agents do not commence the search in synchrony then even initial communication is problematic.
Edit intent: fluency
Original:  Indeed, it is a straightforward observation that the time required for finding the treasure is \Omega(D + D ^2 /k), and we show in this paper that this bound can be matched if the agents have knowledge of k up to some constant approximation.
Revised:  Indeed, it is a straightforward observation that the time required for finding the treasure is \Omega(D + D 2 /k), and we show in this paper that this bound can be matched if the agents have knowledge of k up to some constant approximation.
Edit intent: clarity
Original:  We present a tight bound for the competitive penalty that must be paid, in the running time, if the agents have no information about k.
Revised:  We present an almost tight bound for the competitive penalty that must be paid, in the running time, if the agents have no information about k.
Edit intent: clarity
Original:  We present a tight bound for the competitive penalty that must be paid, in the running time, if the agents have no information about k.
Revised:  We present a tight bound for the competitive penalty that must be paid, in the running time, if agents have no information about k.
Edit intent: clarity
Original:  In addition, we give a lower bound for the setting in which the agents are given some estimation of k.
Revised:  In addition, we give a lower bound for the setting in which agents are given some estimation of k.
Edit intent: fluency
Original:  Finally, we propose a uniform algorithm that is both efficient and extremely simple , suggesting its relevance for actual biological scenarios.
Revised:  Finally, we propose a uniform algorithm that is both efficient and extremely simple suggesting its relevance for actual biological scenarios.
Edit intent: fluency
Original:  } We conclude that  the asymmetric phase of the Minority Game with \alpha close to \alpha_c is coherent with options implied volatility market.
Revised:  } We conclude that the asymmetric phase with characteristic parameters close to critical ones is coherent with options implied volatility market.
Edit intent: clarity
Original:  This improves  the previous bound of O( Delta ^5), which was shown for planar partial 3-trees, a superclass of outerplanar graphs.
Revised:  This improves on the previous bound of O( Delta ^5), which was shown for planar partial 3-trees, a superclass of outerplanar graphs.
Edit intent: fluency
Original:  The bound is tight: for every Delta>=\ge 4 there is an outerplanar graph of maximum degree Delta which requires at least Delta-1 distinct edge slopes for an outerplanar straight-line drawing.
Revised:  The bound is tight: for every Delta>=\ge 4 there is an outerplanar graph with maximum degree \Delta that requires at least Delta-1 distinct edge slopes for an outerplanar straight-line drawing.
Edit intent: clarity
Original:  The bound is tight: for every Delta>=\ge 4 there is an outerplanar graph of maximum degree Delta which requires at least Delta-1 distinct edge slopes for an outerplanar straight-line drawing.
Revised:  The bound is tight: for every Delta>=\ge 4 there is an outerplanar graph of maximum degree Delta which requires at least \Delta-1 distinct edge slopes for an outerplanar straight-line drawing.
Edit intent: fluency
Original:  The bound is tight: for every Delta>=\ge 4 there is an outerplanar graph of maximum degree Delta which requires at least Delta-1 distinct edge slopes for an outerplanar straight-line drawing.
Revised:  The bound is tight: for every Delta>=\ge 4 there is an outerplanar graph of maximum degree Delta which requires at least Delta-1 distinct edge slopes in an outerplanar straight-line drawing.
Edit intent: clarity
Original:  We find that , having both modifications is important for the robustness of epigenetic silencing.
Revised:  We find that having both modifications is important for the robustness of epigenetic silencing.
Edit intent: fluency
Original:  The bivalent state  is shown to result in patchy silencing in regions of parameter space and turns out to be pertinent in several perturbations .
Revised:  The bivalent state appears under several perturbations and is shown to result in patchy silencing in regions of parameter space and turns out to be pertinent in several perturbations .
Edit intent: clarity
Original:  The bivalent state  is shown to result in patchy silencing in regions of parameter space and turns out to be pertinent in several perturbations .
Revised:  The bivalent state is shown to result in patchy silencing .
Edit intent: clarity
Original:  The design principles of the silencing system is systematically investigated helping clarify disparate experimental observations in the literature within an unified theoretical frameworkfor the first time and leading to fresh experimental proposals . Specifically,
Revised:  The design principles of the silencing system is systematically investigated and disparate experimental observations in the literature within an unified theoretical frameworkfor the first time and leading to fresh experimental proposals . Specifically,
Edit intent: clarity
Original:  The design principles of the silencing system is systematically investigated helping clarify disparate experimental observations in the literature within an unified theoretical frameworkfor the first time and leading to fresh experimental proposals . Specifically,
Revised:  The design principles of the silencing system is systematically investigated helping clarify disparate experimental observations are assessed within a single theoretical framework . Specifically,
Edit intent: clarity
Original:  we discuss the behavior of Sir protein recruitment, spreading and stability of silenced regions in commonly-studied mutants (e.g., sas2 %DIFDELCMD < \varDelta%%% ,dot1 %DIFDELCMD < \varDelta%%%  ) illuminating the controversial role of Dot1 in the systems biology of yeast silencing.
Revised:  we discuss the behavior of Sir protein recruitment, spreading and stability of silenced regions in commonly-studied mutants (e.g., %DIFDELCMD < \varDelta%%% ,dot1 %DIFDELCMD < \varDelta%%% ) illuminating the controversial role of Dot1 in the systems biology of yeast silencing.
Edit intent: clarity
Original:  we discuss the behavior of Sir protein recruitment, spreading and stability of silenced regions in commonly-studied mutants (e.g., sas2 %DIFDELCMD < \varDelta%%% ,dot1 %DIFDELCMD < \varDelta%%%  ) illuminating the controversial role of Dot1 in the systems biology of yeast silencing.
Revised:  we discuss the behavior of Sir protein recruitment, spreading and stability of silenced regions in commonly-studied mutants (e.g., sas2 %DIFDELCMD < \varDelta%%% dot1 %DIFDELCMD < \varDelta%%% ) illuminating the controversial role of Dot1 in the systems biology of yeast silencing.
Edit intent: fluency
Original:  we discuss the behavior of Sir protein recruitment, spreading and stability of silenced regions in commonly-studied mutants (e.g., sas2 %DIFDELCMD < \varDelta%%% ,dot1 %DIFDELCMD < \varDelta%%%  ) illuminating the controversial role of Dot1 in the systems biology of yeast silencing.
Revised:  we discuss the behavior of Sir protein recruitment, spreading and stability of silenced regions in commonly-studied mutants (e.g., sas2 %DIFDELCMD < \varDelta%%% , %DIFDELCMD < \varDelta%%% ) illuminating the controversial role of Dot1 in the systems biology of yeast silencing.
Edit intent: fluency
Original: The damped Gauss-Newton (dGN) algorithm for CANDECOMP/PARAFAC (CP) decomposition has been successfully applied for difficult tensor factorization such as collinearity of factors , different magnitudes of factors . Nevertheless , for factorization of an N-D tensor of size I_1\times ...\times I_N with rank R, the algorithm is computationally demanding due to construction of large approximate Hessian of size ( (R\sum_n I_n)\times (R\sum_n I_n) ) and its inversion  .
Revised: The damped Gauss-Newton (dGN) algorithm for CANDECOMP/PARAFAC (CP) decomposition can handle the challenges of collinearity of factors , different magnitudes of factors . Nevertheless , for factorization of an N-D tensor of size I_1\times ...\times I_N with rank R, the algorithm is computationally demanding due to construction of large approximate Hessian of size ( (R\sum_n I_n)\times (R\sum_n I_n) ) and its inversion .
Edit intent: clarity
Original: The damped Gauss-Newton (dGN) algorithm for CANDECOMP/PARAFAC (CP) decomposition has been successfully applied for difficult tensor factorization such as collinearity of factors , different magnitudes of factors . Nevertheless , for factorization of an N-D tensor of size I_1\times ...\times I_N with rank R, the algorithm is computationally demanding due to construction of large approximate Hessian of size ( (R\sum_n I_n)\times (R\sum_n I_n) ) and its inversion  .
Revised: The damped Gauss-Newton (dGN) algorithm for CANDECOMP/PARAFAC (CP) decomposition has been successfully applied for difficult tensor factorization such as collinearity of factors and different magnitudes of factors . Nevertheless , for factorization of an N-D tensor of size I_1\times ...\times I_N with rank R, the algorithm is computationally demanding due to construction of large approximate Hessian of size ( (R\sum_n I_n)\times (R\sum_n I_n) ) and its inversion .
Edit intent: fluency
Original: The damped Gauss-Newton (dGN) algorithm for CANDECOMP/PARAFAC (CP) decomposition has been successfully applied for difficult tensor factorization such as collinearity of factors , different magnitudes of factors . Nevertheless , for factorization of an N-D tensor of size I_1\times ...\times I_N with rank R, the algorithm is computationally demanding due to construction of large approximate Hessian of size ( (R\sum_n I_n)\times (R\sum_n I_n) ) and its inversion  .
Revised: The damped Gauss-Newton (dGN) algorithm for CANDECOMP/PARAFAC (CP) decomposition has been successfully applied for difficult tensor factorization such as collinearity of factors , different magnitudes of factors ; nevertheless , for factorization of an N-D tensor of size I_1\times ...\times I_N with rank R, the algorithm is computationally demanding due to construction of large approximate Hessian of size ( (R\sum_n I_n)\times (R\sum_n I_n) ) and its inversion .
Edit intent: fluency
Original: The damped Gauss-Newton (dGN) algorithm for CANDECOMP/PARAFAC (CP) decomposition has been successfully applied for difficult tensor factorization such as collinearity of factors , different magnitudes of factors . Nevertheless , for factorization of an N-D tensor of size I_1\times ...\times I_N with rank R, the algorithm is computationally demanding due to construction of large approximate Hessian of size ( (R\sum_n I_n)\times (R\sum_n I_n) ) and its inversion  .
Revised: The damped Gauss-Newton (dGN) algorithm for CANDECOMP/PARAFAC (CP) decomposition has been successfully applied for difficult tensor factorization such as collinearity of factors , different magnitudes of factors . Nevertheless , for factorization of an N-D tensor of size I_1\times I_N with rank R, the algorithm is computationally demanding due to construction of large approximate Hessian of size ( (R\sum_n I_n)\times (R\sum_n I_n) ) and its inversion .
Edit intent: coherence
Original:  The new implementation has a lower computational complexity, which beside computation of the gradient (this part is common to both methods) involves inversion of a matrix of the size NR^2\times NR^2,  much smaller than the  Hessian, if \sum_n I_n \gg NR.
Revised:  The new implementation has lower computational complexity, which beside computation of the gradient (this part is common to both methods) involves inversion of a matrix of the size NR^2\times NR^2, much smaller than the Hessian, if \sum_n I_n \gg NR.
Edit intent: fluency
Original:  The new implementation has a lower computational complexity, which beside computation of the gradient (this part is common to both methods) involves inversion of a matrix of the size NR^2\times NR^2,  much smaller than the  Hessian, if \sum_n I_n \gg NR.
Revised:  The new implementation has a lower computational complexity, besides computation of the gradient (this part is common to both methods) involves inversion of a matrix of the size NR^2\times NR^2, much smaller than the Hessian, if \sum_n I_n \gg NR.
Edit intent: coherence
Original:  The new implementation has a lower computational complexity, which beside computation of the gradient (this part is common to both methods) involves inversion of a matrix of the size NR^2\times NR^2,  much smaller than the  Hessian, if \sum_n I_n \gg NR.
Revised:  The new implementation has a lower computational complexity, which beside computation of the gradient (this part is common to both methods) , requiring the inversion of a matrix of the size NR^2\times NR^2, much smaller than the Hessian, if \sum_n I_n \gg NR.
Edit intent: clarity
Original:  The new implementation has a lower computational complexity, which beside computation of the gradient (this part is common to both methods) involves inversion of a matrix of the size NR^2\times NR^2,  much smaller than the  Hessian, if \sum_n I_n \gg NR.
Revised:  The new implementation has a lower computational complexity, which beside computation of the gradient (this part is common to both methods) involves inversion of a matrix of size NR^2\times NR^2, much smaller than the Hessian, if \sum_n I_n \gg NR.
Edit intent: fluency
Original:  The new implementation has a lower computational complexity, which beside computation of the gradient (this part is common to both methods) involves inversion of a matrix of the size NR^2\times NR^2,  much smaller than the  Hessian, if \sum_n I_n \gg NR.
Revised:  The new implementation has a lower computational complexity, which beside computation of the gradient (this part is common to both methods) involves inversion of a matrix of the size NR^2\times NR^2, which is much smaller than the Hessian, if \sum_n I_n \gg NR.
Edit intent: coherence
Original:  In addition, the implementation has a lower memory requirements, because neither the Hessian nor its inverse  need to be stored entire in one time .
Revised:  In addition, the implementation has lower memory requirements, because neither the Hessian nor its inverse need to be stored entire in one time .
Edit intent: fluency
Original:  In addition, the implementation has a lower memory requirements, because neither the Hessian nor its inverse  need to be stored entire in one time .
Revised:  In addition, the implementation has a lower memory requirements, because neither the Hessian nor its inverse never need to be stored entire in one time .
Edit intent: clarity
Original:  In addition, the implementation has a lower memory requirements, because neither the Hessian nor its inverse  need to be stored entire in one time .
Revised:  In addition, the implementation has a lower memory requirements, because neither the Hessian nor its inverse need to be stored in their entirety .
Edit intent: clarity
Original:  Complexity and performance of the proposed algorithm is compared with those of dGN and ALS with line search on examples with difficult benchmark tensors.
Revised:  Complexity and performance of the proposed algorithm is compared with those of dGN and ALS with line search on examples of difficult benchmark tensors.
Edit intent: fluency
Original:  We show that similar reductions hold for the corresponding criteria for many other types of graphs, including bipartite r-multigraphs, bipartite graphs with structural edges, directed graphs, (non-bipartite) r-multigraphs, and tournaments.
Revised:  We show that similar reductions hold for the corresponding criteria for many other types of graphs, including bipartite r-multigraphs, bipartite graphs with structural edges, directed graphs, r-multigraphs, and tournaments.
Edit intent: clarity
Original:  First, players often show ingroup favoritism (i.e., cooperation only within the group) rather than full cooperation (i.e., cooperation within and across groups)  even though the latter is Pareto efficient.
Revised:  First, players often show ingroup favoritism (i.e., cooperation only within the group) rather than full cooperation (i.e., cooperation within and across groups) , even though the latter is Pareto efficient.
Edit intent: fluency
Original: Algal swimming is often biased by environmental cues, e. g. gravitational and viscous torques drive cells towards downwelling fluid (gyrotaxis).
Revised: Shear flow significantly affects the transport of swimming algae in suspension. For example, viscous and gravitational torques bias bottom-heavy cells to swim towards regions of downwelling fluid (gyrotaxis).
Edit intent: clarity
Original:  In view of biotechnological applications, it is important to understand how such biased swimming affects cell dispersion in a flow.
Revised:  It is necessary to understand how such biased swimming affects cell dispersion in a flow.
Edit intent: clarity