wanyu/IteraTeR_v2 huggingface dataset:
Original:  The difference between the two models, however, is of great importance to  our understanding of the metastatic process , both for the sake of shedding light on this poorly understood process, and also for the sake of designing methods of intervention , and it is therefore of great use to distinguish between the two.
Revised:  The difference between the two models, however, is of great importance to our understanding of the metastatic process , both for the sake of shedding light on this poorly understood process, and also for designing methods of intervention , and it is therefore of great use to distinguish between the two.
Edit intent: fluency
Original:  To accomplish this, we propose a mathematical model , which can capture both the primary and secondary scenario to test the  likelihood of these two phenomena .
Revised:  To accomplish this, we propose a mathematical model to test the likelihood of these two phenomena .
Edit intent: clarity
Original:  With our theoretical construct, we show that the phenomenon we call Secondary Seeding is significantly ( several orders of magnitude ) more likely than Primary seeding and we suggest how this difference effects tumor evolutionand progression .
Revised:  With our theoretical construct, we show that the phenomenon we call Secondary Seeding is several orders of magnitude ) more likely than Primary seeding and we suggest how this difference effects tumor evolutionand progression .
Edit intent: clarity
Original:  With our theoretical construct, we show that the phenomenon we call Secondary Seeding is significantly ( several orders of magnitude ) more likely than Primary seeding and we suggest how this difference effects tumor evolutionand progression .
Revised:  With our theoretical construct, we show that the phenomenon we call Secondary Seeding is significantly ( several orders of magnitude more likely than Primary seeding and we suggest how this difference effects tumor evolutionand progression .
Edit intent: fluency
Original:  With our theoretical construct, we show that the phenomenon we call Secondary Seeding is significantly ( several orders of magnitude ) more likely than Primary seeding and we suggest how this difference effects tumor evolutionand progression .
Revised:  With our theoretical construct, we show that the phenomenon we call Secondary Seeding is significantly ( several orders of magnitude ) more likely than Primary seeding . We suggest how this difference effects tumor evolutionand progression .
Edit intent: coherence
Original:  and Secondary Seeding, where cells from the primary first colonize a secondary tissue which then sheds cells into the vasculature returning to the primary.
Revised:  and Secondary Seeding, where cells from the primary first metastasize in a secondary tissue which then sheds cells into the vasculature returning to the primary.
Edit intent: clarity
Original:  We suggest how this difference could effect tumor evolution, progression and therapy and several possible methods of experimental validation.
Revised:  We suggest how this difference could affect tumour evolution, progression and therapy and several possible methods of experimental validation.
Edit intent: fluency
Original:  We suggest how this difference could effect tumor evolution, progression and therapy and several possible methods of experimental validation.
Revised:  We suggest how this difference could effect tumor evolution, progression and therapy , and propose several possible methods of experimental validation.
Edit intent: coherence
Original:   To reduce decoding complexity, sparse encoding vectors are preferred , since the sparsity  can be exploited when solving systems of linear equations.
Revised:  To reduce decoding time, we propose the use of sparse linear network code , since the sparsity can be exploited when solving systems of linear equations.
Edit intent: clarity
Original:   To reduce decoding complexity, sparse encoding vectors are preferred , since the sparsity  can be exploited when solving systems of linear equations.
Revised:  To reduce decoding complexity, sparse encoding vectors are preferred , since the sparsity property of encoding vectors can be exploited when solving systems of linear equations.
Edit intent: clarity
Original:  The result is an elegant unification of communication channels and their session types, distributed OO programming, and a form of typestate supporting non-uniform objects, i.e. objects that dynamically change the set of available methods.
Revised:  The result is an elegant unification of communication channels and their session types, distributed object-oriented programming, and a form of typestate supporting non-uniform objects, i.e. objects that dynamically change the set of available methods.
Edit intent: fluency
Original:  We define syntax, operational semantics , a sound type system, and a sound and complete type checking algorithm for a small distributed OO language with structural subtyping.
Revised:  We define syntax, operational se-mantics , a sound type system, and a sound and complete type checking algorithm for a small distributed OO language with structural subtyping.
Edit intent: fluency
Original:  The language includes expected features of session types, such as delegation, and of OO programming, such as encapsulation of local state .
Revised:  The language includes expected features of session types, such as delegation, and expected features of object-oriented programming, such as encapsulation of local state .
Edit intent: fluency
Original:  The implementation is exact, complete, and general ;
Revised:  The implementation is exact, complete, and general ,
Edit intent: fluency
Original:  We give a concrete solution, albeit in expected O(n log^2 n) preprocessing time, that explicitly verifies the length L of the longest query path  .
Revised:  We describe an efficient preprocessing algorithm, which explicitly verifies the length L of the longest query path .
Edit intent: clarity
Original:  However, instead of using L, the implemented solution is based on the depth D of G. Although we prove that the worst case ratio of D and L is \Theta (n/log n), we conjecture, based on our experimental results, that the implemented solution achieves expected O(n log n) preprocessing time.
Revised:  However, instead of using L, our implementation is based on the depth D of G. Although we prove that the worst case ratio of D and L is \Theta (n/log n), we conjecture, based on our experimental results, that the implemented solution achieves expected O(n log n) preprocessing time.
Edit intent: clarity
Original:  However, instead of using L, the implemented solution is based on the depth D of G. Although we prove that the worst case ratio of D and L is \Theta (n/log n), we conjecture, based on our experimental results, that the implemented solution achieves expected O(n log n) preprocessing time.
Revised:  However, instead of using L, the implemented solution is based on the depth D of G. Although we prove that the worst case ratio of D and L is Theta (n/log n), we conjecture, based on our experimental results, that the implemented solution achieves expected O(n log n) preprocessing time.
Edit intent: fluency
Original:  However, instead of using L, the implemented solution is based on the depth D of G. Although we prove that the worst case ratio of D and L is \Theta (n/log n), we conjecture, based on our experimental results, that the implemented solution achieves expected O(n log n) preprocessing time.
Revised:  However, instead of using L, the implemented solution is based on the depth D of G. Although we prove that the worst case ratio of D and L is \Theta (n/log n), we conjecture, based on our experimental results, that this solution achieves expected O(n log n) preprocessing time.
Edit intent: coherence
Original:  Our results suggest that the short-term growth of G+ during its first 10 months far outpaced other OSNs. However, we do not observe a bandwagon effect (characteristic of other popular OSNs) in the growth of active users who represent 10.3\% of the whole population.
Revised:  Our results suggest that the short-term growth of G+ during its first 10 months far outpaced other OSNs. However, we do not observe a bandwagon effect (characteristic of other popular OSNs) in the growth of active users who represent 10.3\% of the whole population.
Edit intent: fluency
Original:  Furthermore, only 43.5\% of G+ users form the largest connected component that has connectivity features similar to other popular OSNs. Finally, despite the small fraction of users that frequently visit G+, the aggregate daily activity has increased over 50\% due to the dramatic growth in the total population of users.
Revised:  Furthermore, only 43.5\% of G+ users form the largest connected component that has connectivity features similar to other popular OSNs. Finally, despite the small fraction of users that frequently visit G+, the aggregate daily activity has increased over 50\% due to the dramatic growth in the total population of users.
Edit intent: fluency
Original: In an era when Facebook and Twitter dominate the market for social media, Google has made another attempt to become a player by introducing Google+ (G+)  .
Revised: In the era when Facebook and Twitter dominate the market for social media, Google has made another attempt to become a player by introducing Google+ (G+) .
Edit intent: fluency
Original: In an era when Facebook and Twitter dominate the market for social media, Google has made another attempt to become a player by introducing Google+ (G+)  .
Revised: In an era when Facebook and Twitter dominate the market for social media, Google has introduced Google+ (G+) .
Edit intent: clarity
Original:  This begs the question that "whether G+ can sustain a meaningful growth to become a relevant player in this market despite the dominance of Facebook and Twitter?".
Revised:  This begs the question that "whether G+ can really attract a significant number of connected and active users despite the dominance of Facebook and Twitter?".
Edit intent: clarity
Original: We obtain threshold conditions for eradication and permanenceof the disease for a nonautonomous SIRQ model with time-dependent incidence rates, given by functions of all compartments in some general family.
Revised: We obtain conditions for eradication and permanenceof the disease for a nonautonomous SIRQ model with time-dependent incidence rates, given by functions of all compartments in some general family.
Edit intent: clarity
Original: We obtain threshold conditions for eradication and permanenceof the disease for a nonautonomous SIRQ model with time-dependent incidence rates, given by functions of all compartments in some general family.
Revised: We obtain threshold conditions for eradication and permanence of the infectives for a nonautonomous SIRQ model with time-dependent incidence rates, given by functions of all compartments in some general family.
Edit intent: clarity
Original: We obtain threshold conditions for eradication and permanenceof the disease for a nonautonomous SIRQ model with time-dependent incidence rates, given by functions of all compartments in some general family.
Revised: We obtain threshold conditions for eradication and permanenceof the disease for a nonautonomous SIQR model with time-dependent incidence rates, given by functions of all compartments in some general family.
Edit intent: clarity
Original:  Additionally, we obtain simple threshold conditions in the  asymptotically autonomous and periodic settings and show that our thresholds coincide with the basic reproduction number in some common autonomous examples .
Revised:  We obtain simple threshold conditions in the asymptotically autonomous and periodic settings and show that our thresholds coincide with the basic reproduction number in some common autonomous examples .
Edit intent: coherence
Original: We obtain conditions for eradication and permanence of the infectives for a nonautonomous SIQR model with time-dependent parameters, that are not assumed to be periodic.
Revised: We obtain conditions for eradication and permanence of infection for a nonautonomous SIQR model with time-dependent parameters, that are not assumed to be periodic.
Edit intent: fluency
Original:  To aid in reproducibility, we provide all of the code used to generate the results of this paper, at URL 
Revised:  To aid in reproducibility, we provide all of the code used to generate the results of this paper, at URL .
Edit intent: fluency
Original:  The trajectories are excluded from parts of the cell, consistent with nucleoid exclusion, and display isotropic diffusion with nearly identical apparent diffusion coefficients (0.05 + -0.01 um2s-1) in x, y and z.
Revised:  The trajectories are excluded from parts of the cell, consistent with nucleoid exclusion, and display isotropic diffusion with nearly identical apparent diffusion coefficients (0.05 + - 0.01 um2s-1) in x, y and z.
Edit intent: fluency
Original:  The tracking data fits well to a two-state di?usion model where 54\% of the molecules are diffusing at 0.02 um2s-1 and 46\% are diffusing at 0.13 um2s-1 . These states could correspond to translating 70S ribosomes and free 30S subunits.
Revised:  The tracking data fits well to a two-state diffusion model where 54\% of the molecules are diffusing at 0.02 um2s-1 and 46\% are diffusing at 0.13 um2s-1 . These states could correspond to translating 70S ribosomes and free 30S subunits.
Edit intent: fluency
Original:  The tracking data fits well to a two-state di?usion model where 54\% of the molecules are diffusing at 0.02 um2s-1 and 46\% are diffusing at 0.13 um2s-1 . These states could correspond to translating 70S ribosomes and free 30S subunits.
Revised:  The tracking data fits well to a two-state di?usion model where 54\% of the molecules are diffusing at 0.02 um2 s-1 and 46\% are diffusing at 0.13 um2s-1 . These states could correspond to translating 70S ribosomes and free 30S subunits.
Edit intent: fluency
Original:  The tracking data fits well to a two-state di?usion model where 54\% of the molecules are diffusing at 0.02 um2s-1 and 46\% are diffusing at 0.13 um2s-1 . These states could correspond to translating 70S ribosomes and free 30S subunits.
Revised:  The tracking data fits well to a two-state di?usion model where 54\% of the molecules are diffusing at 0.02 um2s-1 and 46\% are diffusing at 0.13 um2 s-1 . These states could correspond to translating 70S ribosomes and free 30S subunits.
Edit intent: fluency
Original:  The trajectories are excluded from parts of the cell, consistent with nucleoid exclusion, and display isotropic diffusion with nearly identical apparent diffusion coefficients (0.05 +  - 0.01 um2s-1 ) in x, y and z.
Revised:  The trajectories are excluded from parts of the cell, consistent with nucleoid exclusion, and display isotropic diffusion with nearly identical apparent diffusion coefficients (0.05 + / - 0.01 um2s-1 ) in x, y and z.
Edit intent: clarity
Original: We investigate the population dynamics in  Rock-Paper-Scissors type models with an arbitrary number of species N.
Revised: We investigate the population dynamics in Rock-Paper-Scissors models with an arbitrary number of species N.
Edit intent: clarity
Original:  We explicitly demonstrate the connection between interface junctions and spiral patters in these models and compute the corresponding scaling laws.
Revised:  We explicitly demonstrate the connection between interface junctions and spiral patterns in these models and compute the corresponding scaling laws.
Edit intent: fluency
Original: We present a phenomenological dynamical model able to describe the stretching features of a lengthvs applied forceDNA curve.
Revised: We present a phenomenological dynamical model able to describe the stretching features of vs applied forceDNA curve.
Edit intent: clarity
Original: We present a phenomenological dynamical model able to describe the stretching features of a lengthvs applied forceDNA curve.
Revised: We present a phenomenological dynamical model able to describe the stretching features of a length applied forceDNA curve.
Edit intent: fluency
Original:  As concerning the chain, the model grounds on the discrete worm-like chain model with the elastic modifications, which properly describes the elongation features at low and intermediate forces.
Revised:  As concerning the chain, the model is based on the discrete worm-like chain model with the elastic modifications, which properly describes the elongation features at low and intermediate forces.
Edit intent: clarity
Original:  As concerning the chain, the model grounds on the discrete worm-like chain model with the elastic modifications, which properly describes the elongation features at low and intermediate forces.
Revised:  As concerning the chain, the model grounds on the discrete wormlike chain model with the elastic modifications, which properly describes the elongation features at low and intermediate forces.
Edit intent: fluency
Original:  As concerning the chain, the model grounds on the discrete worm-like chain model with the elastic modifications, which properly describes the elongation features at low and intermediate forces.
Revised:  As concerning the chain, the model grounds on the discrete worm-like chain model with elastic modifications, which properly describes the elongation features at low and intermediate forces.
Edit intent: fluency
Original:  At high forces the dynamics , developed under a double well potential with a cubic term, accounts for the narrow transition present in the DNA elongation (overstretching).
Revised:  The dynamics is developed under a double well potential with a cubic term, accounts for the narrow transition present in the DNA elongation (overstretching).
Edit intent: clarity
Original:  At high forces the dynamics , developed under a double well potential with a cubic term, accounts for the narrow transition present in the DNA elongation (overstretching).
Revised:  At high forces the dynamics , developed under a double-well potential with a cubic term, accounts for the narrow transition present in the DNA elongation (overstretching).
Edit intent: fluency
Original:  An good agreement between simulation and experiment is obtained.
Revised:  A quite good agreement between simulation and experiment is obtained.
Edit intent: clarity
Original:  However a full characterization for this class is still an open question.
Revised:  However a necessary and sufficient criterion for this class is still an open question.
Edit intent: clarity
Original:  In this paper , we settle this problem by giving  a full condition for this class.
Revised:  In this paper we settle this problem by giving a full condition for this class.
Edit intent: fluency
Original:  Going further , we solve the same problem on two other classes of lattices which are generated by CFGs on the classes of undirected graphs and directed acyclic graphs.
Revised:  Going further we solve the same problem on two other classes of lattices which are generated by CFGs on the classes of undirected graphs and directed acyclic graphs.
Edit intent: fluency
Original:  We consider here a generalization with four species, the minimum number of species that allows other interactions beyond the single loop (one predator, one prey).
Revised:  We consider here a generalization with four species, the minimum number of species allowing other interactions beyond the single loop (one predator, one prey).
Edit intent: clarity
Original:  Convergence analysis is also discussed about the algorithm based on random search method .
Revised:  Convergence analysis is also discussed about the algorithm based on random search theory .
Edit intent: clarity
Original: Protocols developed during the last years for Wireless Sensor Networks (WSNs) are mainly focused on energy-consumption optimization and autonomous mechanisms (e.g. self-organization, self-configuration, etc).
Revised: Protocols developed during the last years for Wireless Sensor Networks (WSNs) are mainly focused on energy efficiency and autonomous mechanisms (e.g. self-organization, self-configuration, etc).
Edit intent: clarity
Original:  Nevertheless  with new WSN applications  appear new QoS requirements such as time constraints.
Revised:  Nevertheless , with new WSN applications appear new QoS requirements such as time constraints.
Edit intent: coherence
Original:  Nevertheless  with new WSN applications  appear new QoS requirements such as time constraints.
Revised:  Nevertheless with new WSN applications , appear new QoS requirements such as time constraints.
Edit intent: coherence
Original:  We particularly focus on applications which consist in alarms that are sent to the sink node.
Revised:  We particularly focus on applications which consist in alarms sent to the sink node.
Edit intent: clarity
Original:  We propose Real-Time X-layer Protocol (RTXP)  a real-time communication protocol.
Revised:  We propose Real-Time X-layer Protocol (RTXP) , a real-time communication protocol.
Edit intent: fluency
Original:  For this purpose the protocol relies on a hop-count-based Virtual Coordinate System (VCS) which classifies nodes having the same hop-count from the sink, allows forwarder selection, and gives to the nodes an unique identifier in a 2-hop neighborhood allowing deterministic medium access  .
Revised:  For this purpose the protocol relies on a hop-count-based Virtual Coordinate System which allows deterministic medium access .
Edit intent: coherence
Original:  For this purpose the protocol relies on a hop-count-based Virtual Coordinate System (VCS) which classifies nodes having the same hop-count from the sink, allows forwarder selection, and gives to the nodes an unique identifier in a 2-hop neighborhood allowing deterministic medium access  .
Revised:  For this purpose the protocol relies on a hop-count-based Virtual Coordinate System (VCS) which classifies nodes having the same hop-count from the sink, allows forwarder selection, and gives to the nodes an unique identifier in a 2-hop neighborhood allowing deterministic medium access and forwarder selection .
Edit intent: clarity
Original:  In this document we describe the protocol mechanisms and properties.
Revised:  In this paper we describe the protocol mechanisms and properties.
Edit intent: clarity
Original:  Here we addressed this question by inferring a distance measure on the stimulus space directly from the recorded activity of 100 neurons in the salamander retina.
Revised:  Here we infer a distance measure on the stimulus space directly from the recorded activity of 100 neurons in the salamander retina.
Edit intent: clarity
Original:  In contrast to previously used measures of stimulus similarity, the " retinal distance " tells us precisely how distinguishable , given the noise in population neural responses, a pair of stimulus clips is to the retina .
Revised:  In contrast to previously used measures of stimulus similarity, this " retinal distance " tells us precisely how distinguishable , given the noise in population neural responses, a pair of stimulus clips is to the retina .
Edit intent: fluency
Original:  In contrast to previously used measures of stimulus similarity, the " retinal distance " tells us precisely how distinguishable , given the noise in population neural responses, a pair of stimulus clips is to the retina .
Revised:  In contrast to previously used measures of stimulus similarity, the " neural metric " tells us precisely how distinguishable , given the noise in population neural responses, a pair of stimulus clips is to the retina .
Edit intent: clarity
Original:  In contrast to previously used measures of stimulus similarity, the " retinal distance " tells us precisely how distinguishable , given the noise in population neural responses, a pair of stimulus clips is to the retina .
Revised:  In contrast to previously used measures of stimulus similarity, the " retinal distance " tells us how distinguishable a pair of stimulus clips is to the retina .
Edit intent: clarity