wanyu/IteraTeR_v2 huggingface dataset:
Original:  The dynamics is governed by a rule where the degree number increases under a scheme similar to the Malthus-Verhulst model in the context of population growth.
Revised:  The dynamics are governed by a rule where the degree number increases under a scheme similar to the Malthus-Verhulst model in the context of population growth.
Edit intent: fluency
Original:  The dynamics is governed by a rule where the degree number increases under a scheme similar to the Malthus-Verhulst model in the context of population growth.
Revised:  The dynamics is governed by a rule where the degree increases under a scheme similar to the Malthus-Verhulst model in the context of population growth.
Edit intent: clarity
Original:  One notices that the second moment of degree is closely related to the linking probability of this growing network.
Edit intent: coherence
Original:  The degree distribution is analyzed in both stationary and time-dependent regimes through some exact results and simulations, and a scaling behaviour is found in asymptotically large time  .
Revised:  The degree distribution is analysed in both stationary and time-dependent regimes through some exact results and simulations, and a scaling behaviour is found in asymptotically large time .
Edit intent: fluency
Original: This report explores the feasibility, advantages, and challenges of an ICN-based approach in the Internet of Things.
Revised: This paper explores the feasibility, advantages, and challenges of an ICN-based approach in the Internet of Things.
Edit intent: clarity
Original:  Based on the insights gained with these experiments, the report analyses the shortcomings of CCN applied to IoT.
Revised:  Based on the insights gained with these experiments, the paper analyses the shortcomings of CCN applied to IoT.
Edit intent: clarity
Original:  This report also provides the first experimental comparison of CCN with the common IoT standards 6LoWPAN/RPL/UDP.
Revised:  This paper also provides the first experimental comparison of CCN with the common IoT standards 6LoWPAN/RPL/UDP.
Edit intent: clarity
Original: Cluster-based descriptions of biological networks have received much attention in recent years , fostered by accumulated evidence of the existence of meaningful correlations between topological network clusters and biological functional modules.
Revised: Cluster-based descriptions of biological networks have received much attention in recent years fostered by accumulated evidence of the existence of meaningful correlations between topological network clusters and biological functional modules.
Edit intent: fluency
Original:  However, due to respective technical idiosyncrasies , they might produce modular descriptions that provide networkpictures at different resolution levels.
Revised:  However, due to respective technical idiosyncrasies they might produce modular descriptions that provide networkpictures at different resolution levels.
Edit intent: fluency
Original:  We aimed to analyze how these alternative modular descriptions could condition the outcome of follow-up network biology analysis.
Revised:  We aimed to analyze how alternative modular descriptions could condition the outcome of follow-up network biology analysis.
Edit intent: clarity
Original:  We analyzed at what extent both procedures yielded different results in terms of cluster sizes, their biological congruencyand displayed meso-scale connectivity patterns.
Revised:  We analyzed at what extent both methodologies yielded different results in terms of cluster sizes, their biological congruencyand displayed meso-scale connectivity patterns.
Edit intent: clarity
Original:  Besides reporting novel biological insights that could be gained from the discovered associations, our results warns against possible technical concerns that might affect the tools used to mine for interaction patterns in network biology studies  .
Revised:  Besides reporting novel biological insights that could be gained from the discovered associations, our contribution warns against possible technical concerns that might affect the tools used to mine for interaction patterns in network biology studies .
Edit intent: clarity
Original:  However, there seems to be no satisfactory answer, in conventional economic theories and models, to the fundamental question of what kind of pay distribution we ought to see in a free market environment , at least under ideal conditions  .
Revised:  However, there seems to be no satisfactory answer, in conventional economic theories and models, to the fundamental question of what kind of pay distribution we ought to see , at least under ideal conditions .
Edit intent: clarity
Original:  We propose a novel game theoretic framework that addresses this question and shows that the lognormal distribution is the fairest inequality of pay in an organization  , achieved at equilibrium, under ideal free market conditions  .
Revised:  We propose a game theoretic framework that addresses this question and shows that the lognormal distribution is the fairest inequality of pay in an organization , achieved at equilibrium, under ideal free market conditions .
Edit intent: clarity
Original:  We propose a novel game theoretic framework that addresses this question and shows that the lognormal distribution is the fairest inequality of pay in an organization  , achieved at equilibrium, under ideal free market conditions  .
Revised:  We propose a novel game theoretic framework that addresses these questions and show that the lognormal distribution is the fairest inequality of pay in an organization , achieved at equilibrium, under ideal free market conditions .
Edit intent: fluency
Original:  As the graph size N grows and the graph becomes sparser according to q=N^{-\alpha}, here exists a critical value of \alpha = 2{3}, below which there exists a computationally intensive procedure that can detect far smaller communities than any computationally efficient procedure, and above which a linear-time procedure is statistically optimal.
Revised:  As the graph size N grows and the graph becomes sparser according to q=N^{-\alpha}, there exists a critical value of \alpha = 2{3}, below which there exists a computationally intensive procedure that can detect far smaller communities than any computationally efficient procedure, and above which a linear-time procedure is statistically optimal.
Edit intent: coherence
Original:  Youtube , for example, reported that the percentage of its traffic streaming to mobile devices has soared from 6\% to more than 40\% for the past two years.
Revised:  YouTube , for example, reported that the percentage of its traffic streaming to mobile devices has soared from 6\% to more than 40\% for the past two years.
Edit intent: fluency
Original:  Youtube , for example, reported that the percentage of its traffic streaming to mobile devices has soared from 6\% to more than 40\% for the past two years.
Revised:  Youtube , for example, reported that the percentage of its traffic streaming to mobile devices has soared from 6\% to more than 40\% over the past two years.
Edit intent: clarity
Original:  Moreover, people are constantly seeking to stream high quality videos for better experience while often suffering from limited bandwidth.
Revised:  Moreover, people are constantly seeking to stream high quality video for better experience while often suffering from limited bandwidth.
Edit intent: fluency
Original:  Thanks to the rapid deployment of content delivery networks (CDNs), popular videos now have multiple replicas at different sites, and users can stream videos from a close-by location with low latency .
Revised:  Thanks to the rapid deployment of content delivery networks (CDNs), popular videos are now replicated at different sites, and users can stream videos from a close-by location with low latency .
Edit intent: clarity
Original:  Thanks to the rapid deployment of content delivery networks (CDNs), popular videos now have multiple replicas at different sites, and users can stream videos from a close-by location with low latency .
Revised:  Thanks to the rapid deployment of content delivery networks (CDNs), popular videos now have multiple replicas at different sites, and users can stream videos from close-by location with low latency .
Edit intent: fluency
Original:  Thanks to the rapid deployment of content delivery networks (CDNs), popular videos now have multiple replicas at different sites, and users can stream videos from a close-by location with low latency .
Revised:  Thanks to the rapid deployment of content delivery networks (CDNs), popular videos now have multiple replicas at different sites, and users can stream videos from a close-by locations with low latencies .
Edit intent: fluency
Original:  We propose a client-based video streaming solution, called MSPlayer, that takes advantage of multiple video sources as well as  network paths through different interfaces.
Revised:  We propose a client-based video streaming solution, MSPlayer, that takes advantage of multiple video sources as well as network paths through different interfaces.
Edit intent: fluency
Original:  We propose a client-based video streaming solution, called MSPlayer, that takes advantage of multiple video sources as well as  network paths through different interfaces.
Revised:  We propose a client-based video streaming solution, called MSPlayer, that takes advantage of multiple video sources as well as multiple network paths through different interfaces.
Edit intent: fluency
Original:  MSPlayer reduces start-up latency , and aims to provide high quality video streaming and robust data transport in mobile scenarios.
Revised:  MSPlayer reduces start-up latency and provides high quality video streaming and robust data transport in mobile scenarios.
Edit intent: coherence
Original:  We experimentally demonstrate our solution on a testbed and through the Youtube video service.
Revised:  We experimentally demonstrate our solution on a testbed and through the YouTube video service.
Edit intent: fluency
Original:  We present numerical results for the model where the fitness differences can be large, and find that the walk length behavior differs from that in the former model in the Fr \'e%DIFDELCMD < }%%% chet domain of extreme value theory.
Revised:  We present numerical results for the model where the fitness differences can be large, and find that the walk length behavior differs from that in the former model in the \'e%DIFDELCMD < }%%% chet domain of extreme value theory.
Edit intent: fluency
Original:  We present numerical results for the model where the fitness differences can be large, and find that the walk length behavior differs from that in the former model in the Fr \'e%DIFDELCMD < }%%% chet domain of extreme value theory.
Revised:  We present numerical results for the model where the fitness differences can be large, and find that the walk length behavior differs from that in the former model in the Fr %DIFDELCMD < }%%% chet domain of extreme value theory.
Edit intent: fluency
Original:  We present numerical results for the model where the fitness differences can be large, and find that the walk length behavior differs from that in the former model in the Fr \'e%DIFDELCMD < }%%% chet domain of extreme value theory.
Revised:  We present numerical results for the model where the fitness differences can be large, and find that the walk length behavior differs from that in the former model in the Fr \'e%DIFDELCMD < }%%% Fr\'echet domain of extreme value theory.
Edit intent: fluency
Original:  This feature contrasts with the general cooperative model, where it can be required that tiles match on several of their sides in order to bind.
Revised:  This feature contrasts with the general cooperative model, where it can be required that tiles match on several of their sides in order to bind.
Edit intent: fluency
Original:  In order to describe our algorithms, we also introduce a generalization of regular expressions called baggins expression .
Revised:  In order to describe our algorithms, we also introduce a generalization of regular expressions called Baggins expressions .
Edit intent: fluency
Original: Current methods for training convolutional neural networks depend on large amounts of labeled samples for supervised training.
Revised: Deep convolutional networks have proven to be very successful in learning task specific features that allow for unprecedented performance on various computer vision tasks. Training of such networks follows mostly the supervised learning paradigm, where sufficiently many input-output pairs are required for training. Acquisition of large training sets is one of the key challenges, when approaching a new task.
Edit intent: coherence
Original:  In this paper we present an approach for training a convolutional neural network using only unlabeled data.
Revised:  In this paper we present an approach for training a convolutional network using only unlabeled data.
Edit intent: clarity
Original:  We train the network to discriminate between a set of surrogate classes.
Revised:  To this end, we train the network to discriminate between a set of surrogate classes.
Edit intent: clarity
Original: The StronglyStableIdeals package for Macaulay2 provides a method to compute all the saturated strongly stable ideals in a given polynomial ring defining schemes with a fixed Hilbert polynomial.
Revised: The StronglyStableIdeals package for Macaulay2 provides a method to compute all the saturated strongly stable ideals in a given polynomial ring defining schemes with a fixed Hilbert polynomial.
Edit intent: fluency
Original: The StronglyStableIdeals package for Macaulay2 provides a method to compute all the saturated strongly stable ideals in a given polynomial ring defining schemes with a fixed Hilbert polynomial.
Revised: The StronglyStableIdeals package for Macaulay2 provides a method to compute all saturated strongly stable ideals in a given polynomial ring defining schemes with a fixed Hilbert polynomial.
Edit intent: fluency
Original: The StronglyStableIdeals package for Macaulay2 provides a method to compute all the saturated strongly stable ideals in a given polynomial ring defining schemes with a fixed Hilbert polynomial.
Revised: The StronglyStableIdeals package for Macaulay2 provides a method to compute all the saturated strongly stable ideals in a given polynomial ring with a fixed Hilbert polynomial.
Edit intent: clarity
Original:  A description of the main method and the auxiliary tools is given.
Revised:  A description of the main method and auxiliary tools is given.
Edit intent: fluency
Original:  More precisely, we  revisit the optimal transport plans constructed in \mbox{ BrenierMartingale0pt , following the construction of \mbox{ BrenierMartingale}0pt , as well as the one in } HobsonKlimmek2013 in the case of positive martingales and a single maximizer for the difference between the c.d.f.'s of the two marginals.
Revised:  More precisely, we first revisit the optimal transport plans constructed in \mbox{ BrenierMartingale0pt , following the construction of \mbox{ BrenierMartingale}0pt , as well as the one in } HobsonKlimmek2013 in the case of positive martingales and a single maximizer for the difference between the c.d.f.'s of the two marginals.
Edit intent: coherence
Original:  These characterizations allow us to study the effect of the change of numeraire on the corresponding superhedging and subhedging model-free prices.
Revised:  These characterizations allow us to study the effect of the change of numeraire on the corresponding super and subhedging model-free prices.
Edit intent: fluency
Original: In this paper we consider the optimal transport approach for computing the model-free prices of a given path-dependent contingent claim in a two periods model.
Revised: In this paper we consider the optimal transport approach for computing model-free prices of a given path-dependent contingent claim in a two periods model.
Edit intent: fluency
Original:  More precisely, we first specialize the optimal transport plan introduced in \mbox{ BeiglJuil0pt , following the construction of \mbox{ BrenierMartingale}0pt , }  as well as the one 0pt and further studied in \mbox{ BrenierMartingale}0pt .
Revised:  In particular, we consider the optimal transport plan introduced in \mbox{ BeiglJuil0pt , following the construction of \mbox{ BrenierMartingale}0pt , } as well as the one 0pt and further studied in \mbox{ BrenierMartingale}0pt .
Edit intent: coherence
Original:  More precisely, we first specialize the optimal transport plan introduced in \mbox{ BeiglJuil0pt , following the construction of \mbox{ BrenierMartingale}0pt , }  as well as the one 0pt and further studied in \mbox{ BrenierMartingale}0pt .
Revised:  More precisely, we first specialize the optimal transport plan 0pt , following the construction of \mbox{ BrenierMartingale}0pt , } as well as the one 0pt and further studied in \mbox{ BrenierMartingale}0pt .
Edit intent: clarity
Original:  More precisely, we first specialize the optimal transport plan introduced in \mbox{ BeiglJuil0pt , following the construction of \mbox{ BrenierMartingale}0pt , }  as well as the one 0pt and further studied in \mbox{ BrenierMartingale}0pt .
Revised:  More precisely, we first specialize the optimal transport plan introduced in \mbox{ BeiglJuil0pt , following the construction of \mbox{ BrenierMartingale}0pt , } as well as the one introduced in \mbox{ BeiglJuil0pt and further studied in \mbox{ BrenierMartingale}0pt .
Edit intent: fluency
Original:  We show that, } in \mbox{ \cite{HobsonKlimmek2013}\hspace{0pt} , to } the case of positive martingales and a single maximizer for the difference between the c.d.f.'s of the two marginals.
Revised:  We show that, } in }\hspace{0pt} , to } the case of positive martingales and a single maximizer for the difference between the c.d.f.'s of the two marginals.
Edit intent: coherence
Original:  It turns out that, for \mbox{ \cite{BrenierMartingale}\hspace{0pt} 's construction, the change of numeraire can be viewed as a mirror coupling for positive martingales, while for \mbox{ \cite{HobsonKlimmek2013} }\hspace{0pt} it }  }\hspace{0pt} } exchanges forward start straddles of type I and type II giving also that the optimal transport plan in the subhedging problems is the same for both types of options.
Revised:  It turns out that, for \mbox{ \cite{BrenierMartingale}\hspace{0pt} 's construction, the change of numeraire can be viewed as a mirror coupling for positive martingales, while for \mbox{ \cite{HobsonKlimmek2013} }\hspace{0pt} it } }\hspace{0pt} } exchanges forward start straddles of type I and type II , so that the optimal transport plan in the subhedging problems is the same for both types of options.
Edit intent: coherence
Original:  While the short range correlations in the eigenvalues exhibiting universality provide an evidence of importance of random connections in the underlying networks, the long range correlations along with the localization properties reveal insightful structural patterns involving functionally important proteins.
Revised:  While the short range correlations in the eigenvalues exhibiting universality provide an evidence towards the importance of random connections in the underlying networks, the long range correlations along with the localization properties reveal insightful structural patterns involving functionally important proteins.
Edit intent: clarity
Original: We propose an analytical approach to solving the diffusion-convection equations governing oxygen transfer in the human placenta.
Revised: We propose an analytical approach to solving the diffusion-convection equations governing oxygen transport in the human placenta.
Edit intent: clarity
Original:  We show that in a placental cross-section only two geometrical characteristics  , villi density and the effective villi radius, are needed to predict fetal oxygen uptake.
Revised:  We show that only two geometrical characteristics , villi density and the effective villi radius, are needed to predict fetal oxygen uptake.
Edit intent: clarity
Original:  We show that in a placental cross-section only two geometrical characteristics  , villi density and the effective villi radius, are needed to predict fetal oxygen uptake.
Revised:  We show that in a placental cross-section only two geometrical characteristics of a placental cross-section , villi density and the effective villi radius, are needed to predict fetal oxygen uptake.
Edit intent: clarity
Original:  We also identify two combinations of physiological parameters that determine oxygen uptake in a given placenta: (i) the maximal possible oxygen inflow of one placentone , and (ii) the dimensionless ratio of the transit time of the maternal blood through the placenta over the oxygen extraction time.
Revised:  We also identify two combinations of physiological parameters that determine oxygen uptake in a given placenta: (i) the maximal oxygen inflow of one placentone , and (ii) the dimensionless ratio of the transit time of the maternal blood through the placenta over the oxygen extraction time.
Edit intent: clarity
Original:  We also identify two combinations of physiological parameters that determine oxygen uptake in a given placenta: (i) the maximal possible oxygen inflow of one placentone , and (ii) the dimensionless ratio of the transit time of the maternal blood through the placenta over the oxygen extraction time.
Revised:  We also identify two combinations of physiological parameters that determine oxygen uptake in a given placenta: (i) the maximal possible oxygen inflow of one placentone , and (ii) the ratio of transit time of the maternal blood through the placenta over the oxygen extraction time.
Edit intent: clarity
Original:  We also identify two combinations of physiological parameters that determine oxygen uptake in a given placenta: (i) the maximal possible oxygen inflow of one placentone , and (ii) the dimensionless ratio of the transit time of the maternal blood through the placenta over the oxygen extraction time.
Revised:  We also identify two combinations of physiological parameters that determine oxygen uptake in a given placenta: (i) the maximal possible oxygen inflow of one placentone , and (ii) the dimensionless ratio of the transit time of maternal blood through the placenta over the oxygen extraction time.
Edit intent: fluency
Original:  We also identify two combinations of physiological parameters that determine oxygen uptake in a given placenta: (i) the maximal possible oxygen inflow of one placentone , and (ii) the dimensionless ratio of the transit time of the maternal blood through the placenta over the oxygen extraction time.
Revised:  We also identify two combinations of physiological parameters that determine oxygen uptake in a given placenta: (i) the maximal possible oxygen inflow of one placentone , and (ii) the dimensionless ratio of the transit time of the maternal blood through the intervillous space to oxygen extraction time.
Edit intent: clarity
Original:  We derive analytical formulas for a fast and simple calculation of oxygen uptake and provide two diagrams of the efficiency of oxygen transfer in a given placental cross-section.
Revised:  We derive analytical formulas for fast and simple calculation of oxygen uptake and provide two diagrams of the efficiency of oxygen transfer in a given placental cross-section.
Edit intent: fluency
Original:  We derive analytical formulas for a fast and simple calculation of oxygen uptake and provide two diagrams of the efficiency of oxygen transfer in a given placental cross-section.
Revised:  We derive analytical formulas for a fast and simple calculation of oxygen uptake and provide two diagrams of efficiency of oxygen transfer in a given placental cross-section.
Edit intent: fluency
Original:  We derive analytical formulas for a fast and simple calculation of oxygen uptake and provide two diagrams of the efficiency of oxygen transfer in a given placental cross-section.
Revised:  We derive analytical formulas for a fast and simple calculation of oxygen uptake and provide two diagrams of the efficiency of oxygen transport in an arbitrary placental cross-section.
Edit intent: clarity