wanyu/IteraTeR_v2 huggingface dataset:
Original:  The geometry and physical parameters of this system are described by a finite number of scaling parameters which allows for system to have self-reproducing solutions , solutions which are determined by theirs values on a certain finite piece of the fractal graph and are continued on the remaining part by using these scaling factors.
Revised:  The geometry and physical parameters of this system are described by a finite number of scaling factors which allow the system to have self-reproducing solutions , solutions which are determined by theirs values on a certain finite piece of the fractal graph and are continued on the remaining part by using these scaling factors.
Edit intent: clarity
Original:  The geometry and physical parameters of this system are described by a finite number of scaling parameters which allows for system to have self-reproducing solutions , solutions which are determined by theirs values on a certain finite piece of the fractal graph and are continued on the remaining part by using these scaling factors.
Revised:  The geometry and physical parameters of this system are described by a finite number of scaling parameters which allows for system to have self-reproducing solutions . Namely, these solutions are determined by theirs values on a certain finite piece of the fractal graph and are continued on the remaining part by using these scaling factors.
Edit intent: coherence
Original:  The geometry and physical parameters of this system are described by a finite number of scaling parameters which allows for system to have self-reproducing solutions , solutions which are determined by theirs values on a certain finite piece of the fractal graph and are continued on the remaining part by using these scaling factors.
Revised:  The geometry and physical parameters of this system are described by a finite number of scaling parameters which allows for system to have self-reproducing solutions , solutions which are determined by the factors' values on a certain finite piece of the fractal graph and are continued on the remaining part by using these scaling factors.
Edit intent: clarity
Original:  The geometry and physical parameters of this system are described by a finite number of scaling parameters which allows for system to have self-reproducing solutions , solutions which are determined by theirs values on a certain finite piece of the fractal graph and are continued on the remaining part by using these scaling factors.
Revised:  The geometry and physical parameters of this system are described by a finite number of scaling parameters which allows for system to have self-reproducing solutions , solutions which are determined by theirs values on a certain fragment of the fractal graph and are continued on the remaining part by using these scaling factors.
Edit intent: clarity
Original:  The geometry and physical parameters of this system are described by a finite number of scaling parameters which allows for system to have self-reproducing solutions , solutions which are determined by theirs values on a certain finite piece of the fractal graph and are continued on the remaining part by using these scaling factors.
Revised:  The geometry and physical parameters of this system are described by a finite number of scaling parameters which allows for system to have self-reproducing solutions , solutions which are determined by theirs values on a certain finite piece of the fractal graph and are extended to its rest part by virtue of these scaling factors.
Edit intent: clarity
Original:  We describe all self-reproducing solutions and, as a result we obtain a connection between the pressure and the flux at the junction point between the capillary system and blood vessel.
Revised:  The main result is the existence and uniqueness of self-reproducing solutions and, as a result we obtain a connection between the pressure and the flux at the junction point between the capillary system and blood vessel.
Edit intent: coherence
Original:  We describe all self-reproducing solutions and, as a result we obtain a connection between the pressure and the flux at the junction point between the capillary system and blood vessel.
Revised:  We describe all self-reproducing solutions and, as a result we obtain a relation between the pressure and the flux at the junction point between the capillary system and blood vessel.
Edit intent: clarity
Original:  We describe all self-reproducing solutions and, as a result we obtain a connection between the pressure and the flux at the junction point between the capillary system and blood vessel.
Revised:  We describe all self-reproducing solutions and, as a result we obtain a connection between the pressure and flux at the junction point between the capillary system and blood vessel.
Edit intent: fluency
Original:  We describe all self-reproducing solutions and, as a result we obtain a connection between the pressure and the flux at the junction point between the capillary system and blood vessel.
Revised:  We describe all self-reproducing solutions and, as a result we obtain a connection between the pressure and the flux at the junction , where the capillary system and blood vessel.
Edit intent: clarity
Original:  This connection gives an artificial boundary condition at the junction in the blood vessel and allows to solve the problem for the flow in the blood vessel without solving it in the capillary system.
Revised:  This relation leads to the Robin boundary condition at the junction in the blood vessel and allows to solve the problem for the flow in the blood vessel without solving it in the capillary system.
Edit intent: clarity
Original:  This connection gives an artificial boundary condition at the junction in the blood vessel and allows to solve the problem for the flow in the blood vessel without solving it in the capillary system.
Revised:  This connection gives an artificial boundary condition at the junction and this condition allows us to solve the problem for the flow in the blood vessel without solving it in the capillary system.
Edit intent: clarity
Original:  This connection gives an artificial boundary condition at the junction in the blood vessel and allows to solve the problem for the flow in the blood vessel without solving it in the capillary system.
Revised:  This connection gives an artificial boundary condition at the junction in the blood vessel and allows to solve the problem for the flow in the blood vessel without solving it for the attached capillary system.
Edit intent: clarity
Original: The pervasive interstellar dust grains provide significant insights to help us understand the formation and evolution of the stars, planetary systems, and the galaxies, and could potentially lead us to the secret of the origin of life.
Revised: The pervasive interstellar dust grains provide significant insights to understand the formation and evolution of the stars, planetary systems, and the galaxies, and could potentially lead us to the secret of the origin of life.
Edit intent: clarity
Original: The pervasive interstellar dust grains provide significant insights to help us understand the formation and evolution of the stars, planetary systems, and the galaxies, and could potentially lead us to the secret of the origin of life.
Revised: The pervasive interstellar dust grains provide significant insights to help us understand the formation and evolution of the stars, planetary systems, and the galaxies, and may harbor the building blocks of life.
Edit intent: clarity
Original:  One of the most effective way to analyze the dusts is via their interaction and interference on observable background light .
Revised:  One of the most effective way to analyze the dust is via their interaction and interference on observable background light .
Edit intent: fluency
Original:  One of the most effective way to analyze the dusts is via their interaction and interference on observable background light .
Revised:  One of the most effective way to analyze the dusts is via their interaction with the light from background sources .
Edit intent: clarity
Original:  The observed extinction curves and spectral features carry the information of the size and composition of dusts.
Revised:  The observed extinction curves and spectral features carry the size and composition of dusts.
Edit intent: clarity
Original:  Among the features, the broad 2175 Angstrom absorption bump is one of the most significant spectroscopic interstellar extinction feature .
Revised:  Among the features, the broad 2175 Angstrom is the most prominent feature in the extinction curves .
Edit intent: clarity
Original:  Traditionally, statistical methods are applied to detect the existence of  absorption bump.
Revised:  Traditionally, statistical methods are applied to detect the existence of the absorption bump.
Edit intent: fluency
Original:  In this paper, we apply deep learning techniques to detect the broad absorption bump.
Revised:  In this paper, we apply Deep Learning techniques to detect the broad absorption bump.
Edit intent: fluency
Original:  The success of deep learning based method inspires us to generalize a common methodology for the broader science discovery problems.
Revised:  The success of Deep Learning based method inspires us to generalize a common methodology for the broader science discovery problems.
Edit intent: fluency
Original:  The success of deep learning based method inspires us to generalize a common methodology for the broader science discovery problems.
Revised:  The success of deep learning based method inspires us to generalize a common methodology for broader science discovery problems.
Edit intent: fluency
Original:  We present a simple biophysical model , where chromosomes are described in terms of folding of a chromatin sequence with alternating blocks of fibers with different thickness.
Revised:  We present a simple biophysical model , where chromosomes are described in terms of the folding of chromatin sequences composed of alternating blocks of fibers with different thickness.
Edit intent: clarity
Original:  The size of the real world complex networks, such as online social networks, WWW networks , collaboration networks, is exponentially increasing with time.
Revised:  The size of real-world complex networks, such as online social networks, WWW networks , collaboration networks, is exponentially increasing with time.
Edit intent: fluency
Original:  The size of the real world complex networks, such as online social networks, WWW networks , collaboration networks, is exponentially increasing with time.
Revised:  The size of the real world complex networks, such as online social networks, WWW network , collaboration networks, is exponentially increasing with time.
Edit intent: fluency
Original:  The size of the real world complex networks, such as online social networks, WWW networks , collaboration networks, is exponentially increasing with time.
Revised:  The size of the real world complex networks, such as online social networks, WWW networks , collaboration networks, is increasing exponentially with time.
Edit intent: fluency
Original:  It is not feasible to completely collect , store and process these networks .
Revised:  It is not feasible to collect the complete data and store and process these networks .
Edit intent: clarity
Original:  It is not feasible to completely collect , store and process these networks .
Revised:  It is not feasible to completely collect , store and process it .
Edit intent: clarity
Original:  In the present work, we propose a method to estimate the degree centrality ranking of a node without having  complete structure of the graph.
Revised:  In the present work, we propose a method to estimate the degree centrality rank of a node without having complete structure of the graph.
Edit intent: fluency
Original:  In the present work, we propose a method to estimate the degree centrality ranking of a node without having  complete structure of the graph.
Revised:  In the present work, we propose a method to estimate the degree centrality ranking of a node without having the complete structure of the graph.
Edit intent: fluency
Original:  The proposed algorithm uses  degree of a node and power law exponent of the degree distribution to calculate the ranking.
Revised:  The proposed algorithm uses the degree of a node and power law exponent of the degree distribution to calculate the ranking.
Edit intent: fluency
Original:  The proposed algorithm uses  degree of a node and power law exponent of the degree distribution to calculate the ranking.
Revised:  The proposed algorithm uses degree of a node and power-law exponent of the degree distribution to calculate the ranking.
Edit intent: fluency
Original:  We also study simulation results on Barabasi-Albert model.
Revised:  Simulation results on the Barabasi-Albert model.
Edit intent: clarity
Original:  Performance of the proposed optimization framework is then investigated in a LTE-A eMBMS network multicasting H.264/SVC video services.
Revised:  The performance of the proposed optimization framework is then investigated in a LTE-A eMBMS network multicasting H.264/SVC video services.
Edit intent: clarity
Original:  We analyze the TT ranks for hierarchically low rank matrices and discuss its relationship to commonly used hierarchical compression techniques such as FMM , HSS, and wavelets .
Revised:  We analyze the TT ranks for hierarchically low rank matrices and discuss its relationship to commonly used hierarchical compression techniques such as FMM and HSS .
Edit intent: clarity
Original:  By this example and other analysis in this paper, ADMM is a much better choice than ALM for nonconvex nonsmooth problems;
Revised:  Indicated from this example and other analysis in this paper, ADMM is a much better choice than ALM for nonconvex nonsmooth problems;
Edit intent: clarity
Original:  By this example and other analysis in this paper, ADMM is a much better choice than ALM for nonconvex nonsmooth problems;
Revised:  By this example and other analysis in this paper, ADMM might be a better choice than ALM for nonconvex nonsmooth problems;
Edit intent: clarity
Original:  Our ADMM sequentially updates the primal variables in the order x_1,\ldots,x_p,y, followed by updating the dual variable.
Revised:  Our ADMM updates each of the primal variables in the order x_1,\ldots,x_p,y, followed by updating the dual variable.
Edit intent: clarity
Original:  Our ADMM sequentially updates the primal variables in the order x_1,\ldots,x_p,y, followed by updating the dual variable.
Revised:  Our ADMM sequentially updates the primal variables x_1,\ldots,x_p,y, followed by updating the dual variable.
Edit intent: clarity
Original:  Indicated from this example and other analysis in this paper, ADMM might be a better choice than ALM for  nonconvex nonsmooth problems, because ADMM is not only easier to implement, it is also more likely to converge  .
Revised:  Indicated from this example and other analysis in this paper, ADMM might be a better choice than ALM for some nonconvex nonsmooth problems, because ADMM is not only easier to implement, it is also more likely to converge .
Edit intent: coherence
Original:  The developed convergence guarantee covers a variety of nonconvex functions such as piecewise linear functions, \ell_q quasi-norm, Schatten-q quasi-norm (0<q<1) and SCAD, as well as the indicator functions of compact smooth manifolds (e.g., spherical, Stiefel, and Grassman manifolds) .
Revised:  The developed convergence guarantee covers a variety of nonconvex functions such as piecewise linear functions, \ell_q quasi-norm, Schatten-q quasi-norm (0<q<1) , and SCAD. It also allows nonconvex constraints such as compact manifolds (e.g., spherical, Stiefel, and Grassman manifolds) .
Edit intent: clarity
Original:  By applying our analysis, we show, for the first time, that several ADMM algorithms applied to solve nonconvex models in statistical learning, optimization on manifold , optimization over complementarity constraints , and matrix decomposition are guaranteed to converge.
Revised:  By applying our analysis, we show, for the first time, that several ADMM algorithms applied to solve nonconvex models in statistical learning, optimization on manifold , and matrix decomposition are guaranteed to converge.
Edit intent: clarity
Original:  We then train on clips of out-of-the-plane rotations of computer-generated faces, using both mean-squared error and a generative adversarial loss (Goodfellow et al., 2014), extending the latter to a recurrent, conditional setting.
Revised:  Using a weighted mean-squared error and a generative adversarial loss (Goodfellow et al., 2014), extending the latter to a recurrent, conditional setting.
Edit intent: clarity
Original:  We then train on clips of out-of-the-plane rotations of computer-generated faces, using both mean-squared error and a generative adversarial loss (Goodfellow et al., 2014), extending the latter to a recurrent, conditional setting.
Revised:  We then train on clips of out-of-the-plane rotations of computer-generated faces, using both mean-squared error and adversarial loss (Goodfellow et al., 2014), extending the latter to a recurrent, conditional setting.
Edit intent: clarity
Original:  Despite being trained end-to-end to predict only pixel-level information, our Predictive Generative Networks learn a representation of the latent variables of the underlying generative process .
Revised:  Despite being trained end-to-end to predict only pixel-level information, our Predictive Generative Networks learn a representation of the latent structure of the underlying generative process .
Edit intent: clarity
Original:  Despite being trained end-to-end to predict only pixel-level information, our Predictive Generative Networks learn a representation of the latent variables of the underlying generative process .
Revised:  Despite being trained end-to-end to predict only pixel-level information, our Predictive Generative Networks learn a representation of the latent variables of the underlying three-dimensional objects themselves .
Edit intent: clarity
Original:  For lexicographic orders, when the discarded fraction is less than (1 /4-\epsilon) , for \epsilon>0, we prove that this problem cannot be solved in polynomial time, even when the original polynomial system has maximum degree 3 and each polynomial contains at most 3 variables . Qualitatively, even for sparse systems composed of low-degree polynomials, we show that Gr\"obner basis computation is robustly hard: even producing a Gr\"obner basis for a large subset of the generators is NP-hard .
Revised:  For lexicographic orders, when the discarded fraction is less than (1 - \epsilon) fraction of the generators, and likewise when the algorithm is allowed to discard variables (and the generators containing them). Our results shows that computation of Gr\"obner bases is robustly hard even for simple polynomial systems (e.g. maximum degree 2, with at most 3 variables . Qualitatively, even for sparse systems composed of low-degree polynomials, we show that Gr\"obner basis computation is robustly hard: even producing a Gr\"obner basis for a large subset of the generators is NP-hard .
Edit intent: clarity
Original: Bond graphs can be used to build thermodynamically-compliant hierarchical models of biomolec- ular systems.
Revised: Bond graphs can be used to build thermodynamically-compliant hierarchical models of biomolecular systems.
Edit intent: fluency
Original:  As bond graphs have been widely used to model, analyse and synthesise engineering systems, this paper suggests that they can play the same role in the modelling, analysis and syn- thesis of biomolecular systems.
Revised:  As bond graphs have been widely used to model, analyse and synthesise engineering systems, this paper suggests that they can play the same role in the modelling, analysis and synthesis of biomolecular systems.
Edit intent: fluency
Original:  Block diagram representations of the dynamics implied by these bond graphs are used to reveal implicit feedback structures and are linearised to allow the application of control- theoretical methods.
Revised:  Block diagram representations of the dynamics implied by these bond graphs are used to reveal implicit feedback structures and are linearised to allow the application of control-theoretical methods.
Edit intent: fluency
Original:  Two concepts of modularity are examined: computational modularity where physical correct- ness is retained and behavioural modularity where module behaviour (such as ultrasensitivity) is retained.
Revised:  Two concepts of modularity are examined: computational modularity where physical correctness is retained and behavioural modularity where module behaviour (such as ultrasensitivity) is retained.
Edit intent: fluency
Original:  As well as providing computational modularity, bond graphs provide a natural formula- tion of behavioural modularity and reveal the sources of retroactivity.
Revised:  As well as providing computational modularity, bond graphs provide a natural formulation of behavioural modularity and reveal the sources of retroactivity.
Edit intent: fluency
Original:  A bond graph approach to reducing retroactivity, and thus inter-module interaction, is shown to require a power supply such as that provided by the AT P = ADP + P i reaction.
Revised:  A bond graph approach to reducing retroactivity, and thus inter-module interaction, is shown to require a power supply such as that provided by the ATP = ADP + P i reaction.
Edit intent: clarity
Original:  A bond graph approach to reducing retroactivity, and thus inter-module interaction, is shown to require a power supply such as that provided by the AT P = ADP + P i reaction.
Revised:  A bond graph approach to reducing retroactivity, and thus inter-module interaction, is shown to require a power supply such as that provided by the AT P = ADP + Pi reaction.
Edit intent: clarity
Original:  We construct the variational Gaussian process (VGP), a Bayesian nonparametric model which adapts its shape to match complex posterior distributions.
Revised:  We construct the variational Gaussian process (VGP), a Bayesian nonparametric variational family, which adapts its shape to match complex posterior distributions.
Edit intent: clarity
Original:  For inference we present a variational objective inspired by autoencoders and perform black box inference over a wide class of models.
Revised:  For inference we present a variational objective inspired by auto-encoders and perform black box inference over a wide class of models.
Edit intent: fluency
Original:  Using advanced Bayesian statistical modelling and computation techniques we introduce a novel method for bacterial identification that is shown to outperform the currently leading pipeline for this purpose.
Revised:  Using advanced Bayesian statistical modelling and computation techniques we introduce a novel pipeline for bacterial identification that is shown to outperform the currently leading pipeline for this purpose.
Edit intent: clarity
Original:  Our approach enables fast and accurate sequence based identification of bacterial strains while using only modest computational resources.
Revised:  Our approach enables fast and accurate sequence-based identification of bacterial strains while using only modest computational resources.
Edit intent: fluency
Original:  Consequently, our algorithm enables accurate recognitions and classifications of point clouds.
Revised:  Consequently, our algorithm enables accurate recognition and classification of point clouds.
Edit intent: fluency
Original: The prerequisite for our understanding of many complex networked systems lies in the reconstruction of network structure from measurable data.
Revised: To understand, predict, and control complex networked systems lies in the reconstruction of network structure from measurable data.
Edit intent: clarity
Original: The prerequisite for our understanding of many complex networked systems lies in the reconstruction of network structure from measurable data.
Revised: The prerequisite for our understanding of many complex networked systems , a prerequisite is to reconstruct the network structure from measurable data.
Edit intent: clarity