wanyu/IteraTeR_v2 huggingface dataset:
Original: This paper presents the scientific body of knowledge behind the Human Biodynamics Engine (HBE), a sophisticated human motion simulator developed on the concept of Euclidean motion group SE(3), with 270 active degrees of freedom, force-velocity-time muscular mechanics and two-level neural control -- formulated in the fashion of nonlinear humanoid robotics at Defence Science Technology Organisation, Australia .
Revised: This paper presents the scientific body of knowledge behind the Human Biodynamics Engine (HBE), a sophisticated human motion simulator developed on the concept of Euclidean motion group SE(3), with 270 active degrees of freedom, force-velocity-time muscular mechanics and two-level neural control -- formulated in the fashion of nonlinear humanoid robotics at Defence Science .
Edit intent: clarity
Original: A non-linear three-compartment model, widely used in pharmacological absorption studies , has been analysed .
Revised: The subject of analysis is a non-linear three-compartment model, widely used in pharmacological absorption studies , has been analysed .
Edit intent: coherence
Original: A non-linear three-compartment model, widely used in pharmacological absorption studies , has been analysed .
Revised: A non-linear three-compartment model, widely used in pharmacological absorption studies .
Edit intent: coherence
Original:  It has been transformed into a general form which leads intuitively to an appropriate approximation.
Revised:  It has been transformed into a general form , thus leading automatically to an appropriate approximation.
Edit intent: clarity
Original:  The absorption profile becomes accessible and expressions for absorption times, apparent permeabilities and equilibrium values are given.
Revised:  This made the absorption profile accessible and expressions for absorption times, apparent permeabilities and equilibrium values are given.
Edit intent: clarity
Original:  The absorption profile becomes accessible and expressions for absorption times, apparent permeabilities and equilibrium values are given.
Revised:  The absorption profile becomes accessible and expressions for absorption times, apparent permeabilities and equilibrium values were given.
Edit intent: fluency
Original:  These findings allow a profound analysis of results from non-linear curve fits and provide the dependencies on the systems' parameters over a wide range of values.
Revised:  These findings allowed a profound analysis of results from non-linear curve fits and provide the dependencies on the systems' parameters over a wide range of values.
Edit intent: fluency
Original:  These findings allow a profound analysis of results from non-linear curve fits and provide the dependencies on the systems' parameters over a wide range of values.
Revised:  These findings allow a profound analysis of results from non-linear curve fits and delivered the dependencies on the systems' parameters over a wide range of values.
Edit intent: fluency
Original:  The results have been applied to an absorption experiment with multidrug transporter affected antibiotic CNV97100 on Caco-2 cell monolayers.
Revised:  The results were applied to an absorption experiment with multidrug transporter affected antibiotic CNV97100 on Caco-2 cell monolayers.
Edit intent: clarity
Original:  The results have been applied to an absorption experiment with multidrug transporter affected antibiotic CNV97100 on Caco-2 cell monolayers.
Revised:  The results have been applied to an absorption experiment with multidrug transporter-affected antibiotic CNV97100 on Caco-2 cell monolayers.
Edit intent: fluency
Original:  We show that networks which are more complex than simple cyclic structures can , in principle, show multiple , qualitatively different symbolic dynamics.
Revised:  Networks which are more complex than simple cyclic structures can , in principle, show multiple , qualitatively different symbolic dynamics.
Edit intent: coherence
Original:  We show that networks which are more complex than simple cyclic structures can , in principle, show multiple , qualitatively different symbolic dynamics.
Revised:  We show that networks which are more complex than simple cyclic structures can exhibit multiple different symbolic dynamics.
Edit intent: clarity
Original:  Nevertheless, we find that the observed symbolic dynamics is usually periodic and very robust to changes in parameters .
Revised:  Nevertheless, we show several examples where the symbolic dynamics is usually periodic and very robust to changes in parameters .
Edit intent: clarity
Original:  Nevertheless, we find that the observed symbolic dynamics is usually periodic and very robust to changes in parameters .
Revised:  Nevertheless, we find that the observed symbolic dynamics is dominated by a single pattern that is very robust to changes in parameters .
Edit intent: clarity
Original:  Further, it is consistent with the dynamics being dominated by a single effective feedback loop.
Revised:  Further, it is consistent with the dynamics being dictated by a single effective feedback loop.
Edit intent: clarity
Original:  Further, it is consistent with the dynamics being dominated by a single effective feedback loop.
Revised:  Further, it is consistent with the dynamics being dominated by a single feedback loop.
Edit intent: clarity
Original:  Our analysis provides a method for extracting these dominant feedback loops from short experimental time series, even if they only show transient trajectories.
Revised:  Our analysis provides a method for extracting these dominant loops from short experimental time series, even if they only show transient trajectories.
Edit intent: clarity
Original:  Our analysis provides a method for extracting these dominant feedback loops from short experimental time series, even if they only show transient trajectories.
Revised:  Our analysis provides a method for extracting these dominant feedback loops from short time series, even if they only show transient trajectories.
Edit intent: clarity
Original: We study the distributions of citations received by a single publication within several disciplines, spanning all fields of science.
Revised: We study the distributions of citations received by a single publication within several disciplines, spanning broad areas of science.
Edit intent: clarity
Original:  We show that the probability that a paper is cited c times has large variations between different disciplines, but all distributions are rescaled on a universal curve when the relative indicator c  /c_0 is considered, where c_0 is the average number of citations per paper for the discipline.
Revised:  We show that the probability that an article is cited c times has large variations between different disciplines, but all distributions are rescaled on a universal curve when the relative indicator c /c_0 is considered, where c_0 is the average number of citations per paper for the discipline.
Edit intent: clarity
Original:  We show that the probability that a paper is cited c times has large variations between different disciplines, but all distributions are rescaled on a universal curve when the relative indicator c  /c_0 is considered, where c_0 is the average number of citations per paper for the discipline.
Revised:  We show that the probability that a paper is cited c times has large variations between different disciplines, but all distributions are rescaled on a universal curve when the relative indicator c /c_0 is considered, where c_0 is the average number of citations per article for the discipline.
Edit intent: clarity
Original:  In addition we show that the same universal behavior occurs when citation distributions of papers published in the same field, but in different years, are compared.
Revised:  In addition we show that the same universal behavior occurs when citation distributions of articles published in the same field, but in different years, are compared.
Edit intent: fluency
Original: In a CNF formula, we say that a pair C, D of clauses constitutes a conflict if there is a variable that occurs positively in one clause and negatively in the other.
Revised: A pair of clauses in a CNF formula constitutes a conflict if there is a variable that occurs positively in one clause and negatively in the other.
Edit intent: clarity
Original: Given a highway defined by a line in the plane , the time distance between a pair of points is the minimum time required to move from one point to the other, using the highway or not.
Revised: A highway H is a line in the plane , the time distance between a pair of points is the minimum time required to move from one point to the other, using the highway or not.
Edit intent: clarity
Original:  Given a set of points S, the highway hull H(S) of that set under the highway time distance is the minimal set containing S as well as the shortest path between any pair of points in H(S) . We provide an optimal Theta(n log n)  time algorithm to find the highway hull under the L_1 metric, as well as an O(n log^2 n)  algorithm for the L_2 Euclidean case, improving on the previous O(n^2) algorithm .
Revised:  Given a set of points S, the highway hull H(S) of that set under the highway time distance is the minimal set containing S as well as the shortest paths between all pairs of points in H(S) . We provide an optimal Theta(n log n) time algorithm to find the highway hull under the L_1 metric, as well as an O(n log^2 n) algorithm for the L_2 Euclidean case, improving on the previous O(n^2) algorithm .
Edit intent: clarity
Original:  Given a set of points S, the highway hull H(S) of that set under the highway time distance is the minimal set containing S as well as the shortest path between any pair of points in H(S) . We provide an optimal Theta(n log n)  time algorithm to find the highway hull under the L_1 metric, as well as an O(n log^2 n)  algorithm for the L_2 Euclidean case, improving on the previous O(n^2) algorithm .
Revised:  Given a set of points S, the highway hull H(S) of that set under the highway time distance is the minimal set containing S as well as the shortest path between any pair of points in H(S) . We provide a Theta(n log n) time algorithm to find the highway hull under the L_1 metric, as well as an O(n log^2 n) algorithm for the L_2 Euclidean case, improving on the previous O(n^2) algorithm .
Edit intent: clarity
Original:  Given a set of points S, the highway hull H(S) of that set under the highway time distance is the minimal set containing S as well as the shortest path between any pair of points in H(S) . We provide an optimal Theta(n log n)  time algorithm to find the highway hull under the L_1 metric, as well as an O(n log^2 n)  algorithm for the L_2 Euclidean case, improving on the previous O(n^2) algorithm .
Revised:  Given a set of points S, the highway hull H(S) of that set under the highway time distance is the minimal set containing S as well as the shortest path between any pair of points in H(S) . We provide an optimal Theta(n log n) time algorithm to find the highway hull under the L_1 metric, as well as an O(n log^2 n) time algorithm for the L_2 Euclidean case, improving on the previous O(n^2) algorithm .
Edit intent: fluency
Original:  Given a set of points S, the highway hull H(S) of that set under the highway time distance is the minimal set containing S as well as the shortest path between any pair of points in H(S) . We provide an optimal Theta(n log n)  time algorithm to find the highway hull under the L_1 metric, as well as an O(n log^2 n)  algorithm for the L_2 Euclidean case, improving on the previous O(n^2) algorithm .
Revised:  Given a set of points S, the highway hull H(S) of that set under the highway time distance is the minimal set containing S as well as the shortest path between any pair of points in H(S) . We provide an optimal Theta(n log n) time algorithm to find the highway hull under the L_1 metric, as well as an O(n log^2 n) algorithm for the L_2 Euclidean case, improving on the previous O(n^2) .
Edit intent: fluency
Original: We calculate the probability of DNA loop formation mediated by regulatory proteins such as lac repressor (LacI)  .
Revised: We calculate the probability of DNA loop formation mediated by regulatory proteins such as Lac repressor (LacI) .
Edit intent: fluency
Original:  Our model is adapted to calculating the quantities directly observable in Tethered Particle Motion (TPM) experiments, and it accounts for all the entropic forces present in such experiments.
Revised:  Our model is adapted to calculating quantities directly observable in Tethered Particle Motion (TPM) experiments, and it accounts for all the entropic forces present in such experiments.
Edit intent: fluency
Original:   We show how to compute both the "looping J factor" (or equivalently, the looping free energy) for various DNA construct geometries and LacI concentrations, as well as the detailed probability density function of bead excursions.
Revised:  ... We show how to compute both the "looping J factor" (or equivalently, the looping free energy) for various DNA construct geometries and LacI concentrations, as well as the detailed probability density function of bead excursions.
Edit intent: fluency
Original:  We also show how to extract these same quantities from recent experimental data on tethered particle motion, and then compare to our model's predictions.
Revised:  We also show how to extract the same quantities from recent experimental data on tethered particle motion, and then compare to our model's predictions.
Edit intent: clarity
Original:   Our model successfully reproduces the detailed distributions of bead excursion, including its surprising three-peak structure, without any fit parameters and without invoking any alternative conformation of the LacI tetramer.
Revised:  ... Our model successfully reproduces the detailed distributions of bead excursion, including its surprising three-peak structure, without any fit parameters and without invoking any alternative conformation of the LacI tetramer.
Edit intent: fluency
Original:   Our model successfully reproduces the detailed distributions of bead excursion, including its surprising three-peak structure, without any fit parameters and without invoking any alternative conformation of the LacI tetramer.
Revised:  Our model successfully reproduces the detailed distributions of bead excursion, including their surprising three-peak structure, without any fit parameters and without invoking any alternative conformation of the LacI tetramer.
Edit intent: fluency
Original:  Because the experiments we study are done in vitro, this anomalously high looping cannot be rationalized as resulting from the presence of other DNA-bending proteins or from non-equilibrium effects .
Revised:  Because the experiments we study are done in vitro, this anomalously high looping cannot be rationalized as resulting from the presence of DNA-bending proteins or from non-equilibrium effects .
Edit intent: clarity
Original:  As a result, the asymmetry between the effects on coordination and anti-coordination games arises as a fundamental property of these evolutionary models.
Revised:  As a result, the asymmetry between the effects on coordination and anti-coordination games arises as a fundamental feature of these evolutionary models.
Edit intent: clarity
Original:  Since Nowak and May's report of a promotion of cooperation in the Prisoner's Dilemma, the most demanding binary game, ] many subsequent studies have supported this conclusion.
Revised:  Since Nowak and May's report of a promotion of cooperation in the Prisoner's Dilemma, the most demanding binary game, ], many subsequent studies have supported this conclusion.
Edit intent: fluency
Original:  We have found that spatial structure , in general, only promotes cooperation on coordination games, like Stag Hunt, and that the positive effect on Prisoner's Dilemma occurs only with a particular non-stochastic  rule.
Revised:  We have found that , in general, only promotes cooperation on coordination games, like Stag Hunt, and that the positive effect on Prisoner's Dilemma occurs only with a particular non-stochastic rule.
Edit intent: clarity
Original:  We have found that spatial structure , in general, only promotes cooperation on coordination games, like Stag Hunt, and that the positive effect on Prisoner's Dilemma occurs only with a particular non-stochastic  rule.
Revised:  We have found that spatial structure , in general, only promotes cooperation on coordination games, like Stag Hunt, and that the positive effect on Prisoner's Dilemma only occur when using a particular non-stochastic rule.
Edit intent: clarity
Original:  As a result , the asymmetry between the effects on coordination and anti-coordination games arises as a fundamental feature of these evolutionary models  .
Revised:  In addition , the asymmetry between the effects on coordination and anti-coordination games arises as a fundamental feature of these evolutionary models .
Edit intent: coherence
Original:  Since Nowak and May's report of a promotion of cooperation in the Prisoner's Dilemma, when players are located on a regular lattice Nature 359 , 1992 , many subsequent studies have supported this conclusion.
Revised:  Since Nowak and May's report of a promotion of cooperation in the Prisoner's Dilemma, when players are located on a regular lattice Nature 359 , , many subsequent studies have supported this conclusion.
Edit intent: clarity
Original:  The main challenges involved include the difficulty of mathematically mapping a mental picture of DNA melting domains to quantitative statistical mechanics models, as well as the absence of 'gold standards' and a need for generality.
Revised:  The main challenges include the difficulty of mathematically mapping a mental picture of DNA melting domains to quantitative statistical mechanics models, as well as the absence of 'gold standards' and a need for generality.
Edit intent: coherence
Original:  The main challenges involved include the difficulty of mathematically mapping a mental picture of DNA melting domains to quantitative statistical mechanics models, as well as the absence of 'gold standards' and a need for generality.
Revised:  The main challenges involved include the difficulty of mathematically mapping a qualitative description of DNA melting domains to quantitative statistical mechanics models, as well as the absence of 'gold standards' and a need for generality.
Edit intent: clarity
Original:  In this paper, we introduce a new approach to identify the twostate regions and melting fork regions along a given DNA sequences . Compared with an ad hoc segmentation used in one of our previous studies, the new algorithm is based on boundary probability profile , rather than standard melting map .
Revised:  In this paper, we introduce a new approach to identify the twostate regions and melting fork regions along a given DNA sequence . Compared with an ad hoc segmentation used in one of our previous studies, the new algorithm is based on boundary probability profile , rather than standard melting map .
Edit intent: fluency
Original:  In this paper, we introduce a new approach to identify the twostate regions and melting fork regions along a given DNA sequences . Compared with an ad hoc segmentation used in one of our previous studies, the new algorithm is based on boundary probability profile , rather than standard melting map .
Revised:  In this paper, we introduce a new approach to identify the twostate regions and melting fork regions along a given DNA sequences . Compared with an ad hoc segmentation used in one of our previous studies, the new algorithm is based on boundary probability profiles , rather than standard melting map .
Edit intent: fluency
Original:  In this paper, we introduce a new approach to identify the twostate regions and melting fork regions along a given DNA sequences . Compared with an ad hoc segmentation used in one of our previous studies, the new algorithm is based on boundary probability profile , rather than standard melting map .
Revised:  In this paper, we introduce a new approach to identify the twostate regions and melting fork regions along a given DNA sequences . Compared with an ad hoc segmentation used in one of our previous studies, the new algorithm is based on boundary probability profile , rather than standard melting maps .
Edit intent: fluency
Original:  We expect this work to drive our understanding of DNA melting domain one step further.
Revised:  We expect this work to drive our understanding of DNA melting domains one step further.
Edit intent: fluency
Original:  We call a theta-cone empty (with respect to G) if it does not contain any point of G. A point p in the plane is called \theta-guarded if every theta-cone with  apex located at p is non-empty.
Revised:  We call a theta-cone empty (with respect to G) if it does not contain any point of G. A point p in the plane is called \theta-guarded if every theta-cone with its apex located at p is non-empty.
Edit intent: clarity
Original:  Moreover , the set of all theta-guarded points is called  theta-region .
Revised:  Furthermore , the set of all theta-guarded points is called theta-region .
Edit intent: fluency
Original:  Moreover , the set of all theta-guarded points is called  theta-region .
Revised:  Moreover , the set of all theta-guarded points is called the theta-guarded region, or the theta-region .
Edit intent: clarity
Original:  As a main result of our work we describe the theta-region with only O(m /theta) circular arcs and show a way to compute it  .
Revised:  As a main result of our work is to describe the theta-region with only O(m /theta) circular arcs and show a way to compute it .
Edit intent: clarity
Original:  As a main result of our work we describe the theta-region with only O(m /theta) circular arcs and show a way to compute it  .
Revised:  As a main result of our work we describe the theta-region with only O(m /theta) circular arcs , and we give an algorithm to compute it .
Edit intent: clarity
Original:  For example, edges may either represent "friendship " ," kinship " , or "collaboration ", but not all of them together.
Revised:  For example, edges may either represent "friendship ," kinship " , or "collaboration ", but not all of them together.
Edit intent: fluency
Original:  For example, edges may either represent "friendship " ," kinship " , or "collaboration ", but not all of them together.
Revised:  For example, edges may either represent "friendship " ," " , or "collaboration ", but not all of them together.
Edit intent: clarity
Original:  For example, edges may either represent "friendship " ," kinship " , or "collaboration ", but not all of them together.
Revised:  For example, edges may either represent "friendship " ," kinship " , or "collaboration ," but not all of them together.
Edit intent: fluency
Original:  While multi-relational networks are more expressive in terms of the number of relationships they can capture, there is a need for a general framework for transferring the many single-relational network analysis algorithms to the multi-relational domain.
Revised:  While multi-relational networks are more expressive in terms of the variety of relationships they can capture, there is a need for a general framework for transferring the many single-relational network analysis algorithms to the multi-relational domain.
Edit intent: clarity
Original:  It is not sufficient to execute a single-relational network analysis algorithm on a multi-relational network simply by ignoring edge labels.
Revised:  It is not sufficient to execute a single-relational network analysis algorithm on a multi-relational network by simply ignoring edge labels.
Edit intent: fluency
Original: Let H be a graph, and let C (H, G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C (H, G).
Revised: Let H be a graph, and let C (H, G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C _H( G).
Edit intent: fluency