wanyu/IteraTeR_v2 huggingface dataset:
Original:  Here we show, using a hybrid Cellular Potts and finite-element computational model, that a single set of biologically plausible rules describing (a) the contractile forces that endothelial cells exert on the ECM, (b) the resulting strains in the extracellular matrix, and (c) the cellular response to the strains, suffices for reproducing the behavior of individual endothelial cells and the interactions of endothelial cell pairs in compliant matrices.
Revised:  Here we show, using a hybrid cellular Potts and finite element computational model, that a single set of biologically plausible rules describing (a) the contractile forces that endothelial cells exert on the ECM, (b) the resulting strains in the extracellular matrix, and (c) the cellular response to the strains, suffices for reproducing the behavior of individual endothelial cells and the interactions of endothelial cell pairs in compliant matrices.
Edit intent: fluency
Original:  With the same set of rules, the model also reproduces network formation  and sprouting from epithelial spheroids.
Revised:  With the same set of rules, the model also reproduces network formation and sprouting from endothelial spheroids.
Edit intent: fluency
Original:  Combining the present , mechanical model with aspects of previously proposed mechanical and chemical models may lead to a more complete understanding of in vitro angiogenesis.
Revised:  Combining the present mechanical model with aspects of previously proposed mechanical and chemical models may lead to a more complete understanding of in vitro angiogenesis.
Edit intent: fluency
Original:  Nivasch (2010) proved that if u has r distinct letters and length t, then there is a subsequence isomorphic to u in every (r, t-r+1)-formation.
Edit intent: coherence
Original: }\alpha} ( 1/(t-2)!) alpha( n)^{t-2} \pm O( alpha (n)^{t-3})} for every l \geq 2 and t \geq 3, such that alpha (n) denotes the inverse Ackermann function.
Revised: }\alpha} ( 1/(t-2)!) alpha( n)^{t-2} \pm O( \alpha (n)^{t-3})} for every l \geq 2 and t \geq 3, such that alpha (n) denotes the inverse Ackermann function.
Edit intent: fluency
Original: }\alpha} ( 1/(t-2)!) alpha( n)^{t-2} \pm O( alpha (n)^{t-3})} for every l \geq 2 and t \geq 3, such that alpha (n) denotes the inverse Ackermann function.
Revised: }\alpha} ( 1/(t-2)!) alpha( n)^{t-2} \pm O( alpha (n)^{t-3})} for every l \geq 2 and t \geq 3, such that \alpha (n) denotes the inverse Ackermann function.
Edit intent: fluency
Original:  We bound fw(u) within a factor of 2 for every binary formation u.
Revised:  We use fw(u) within a factor of 2 for every binary formation u.
Edit intent: clarity
Original:  } If u is any sequence of the form a v a v' a such that a is a letter, v is a nonempty sequence of distinct letters excluding a and v' is obtained from v by only moving the first letter of v  , then we show that  \mathit{Ex}(u, n) = \theta (n\alpha(n)).
Revised:  } If u is any sequence of the form a v a v' a such that a is a letter, v is a nonempty sequence of distinct letters excluding a and v' is obtained from v by only moving the first letter of v , then we show that \mathit{Ex}(u, n) = \Theta (n\alpha(n)).
Edit intent: fluency
Original:  We also show that if t is 3 or 4 and z is any sequence of the form a x_{1 a x_{2} \ldots a x_{t} such that a is a letter and x_{i} is a sequence equal to either b c or c b for each 1 \leq i \leq t, then \mathit{Ex}(z, n) = n 2^{\frac{1}{(t-2)!
Revised:  a x_{2} \ldots a x_{t} such that a is a letter and x_{i} is a sequence equal to either b c or c b for each 1 \leq i \leq t, then \mathit{Ex}(z, n) = n 2^{\frac{1}{(t-2)!
Edit intent: clarity
Original:  } Furthermore we prove that \mathit{Ex )  ^{t}, n) = n 2 ^{\frac{1}{(t-1)!
Revised:  } Furthermore we prove that \mathit{Ex ) ^{t}, n) = n2 ^{\frac{1}{(t-1)!
Edit intent: fluency
Original: Recent studies on the practice of shaping subscribers' traffic by Internet service providers (ISPs ) give a new insight into the actual performance of broadband access networks at a packet level.
Revised: Recent studies on the practice of shaping subscribers' traffic by ISPs give a new insight into the actual performance of broadband access networks at a packet level.
Edit intent: clarity
Original:  Unlike metro and backbone networks, however, access networks directly interface with end-users, so it is important to base the study and design of access networks on the behaviors of and the actual performances perceived by end-users.
Revised:  Unlike metro and backbone networks, however, access networks directly interface with end-users, so it is important to base the study and design of access networks on the behaviors of and the actual performance perceived by end-users.
Edit intent: fluency
Original:  In this paper we study the effect of ISP traffic shaping using traffic models based on user behaviors and application/session-layer metrics providing quantifiable measures of user-perceived performances for HTTP, FTP, and streaming video traffic.
Revised:  In this paper we study the effect of ISP traffic shaping using traffic models based on user behaviors and application/session-layer metrics providing quantifiable measures of user-perceived performance for HTTP, FTP, and streaming video traffic.
Edit intent: fluency
Original:  To compare the user-perceived performances of shaped traffic flows with those of unshaped ones in an integrated way, we use a multivariate non-inferiority testing procedure.
Revised:  To compare the user-perceived performance of shaped traffic flows with those of unshaped ones in an integrated way, we use a multivariate non-inferiority testing procedure.
Edit intent: fluency
Original:  We first investigate the effect of the token generation rate and the token bucket size of a token bucket filter (TBF) on user-perceived performances at a subscriber level with a single subscriber.
Revised:  We first investigate the effect of the token generation rate and the token bucket size of a token bucket filter on user-perceived performances at a subscriber level with a single subscriber.
Edit intent: clarity
Original:  We first investigate the effect of the token generation rate and the token bucket size of a token bucket filter (TBF) on user-perceived performances at a subscriber level with a single subscriber.
Revised:  We first investigate the effect of the token generation rate and the token bucket size of a token bucket filter (TBF) on user-perceived performance at a subscriber level with a single subscriber.
Edit intent: fluency
Original:  Then we investigate their effect at a network level where shaped traffic flows from multiple subscribers interact  one another in a common shared access network.
Revised:  Then we investigate their effect at an access level where shaped traffic flows from multiple subscribers interact one another in a common shared access network.
Edit intent: fluency
Original:  Then we investigate their effect at a network level where shaped traffic flows from multiple subscribers interact  one another in a common shared access network.
Revised:  Then we investigate their effect at a network level where shaped traffic flows from multiple subscribers interact with one another in a common shared access network.
Edit intent: fluency
Original:  The simulation results show that for a given token generation rate,  larger token bucket sizes provide better user-perceived performances at both the subscriber and the network levels.
Revised:  The simulation results show that for a given token generation rate, a larger token bucket sizes provide better user-perceived performances at both the subscriber and the network levels.
Edit intent: fluency
Original:  The simulation results show that for a given token generation rate,  larger token bucket sizes provide better user-perceived performances at both the subscriber and the network levels.
Revised:  The simulation results show that for a given token generation rate, larger token bucket provides better user-perceived performances at both the subscriber and the network levels.
Edit intent: clarity
Original:  The simulation results show that for a given token generation rate,  larger token bucket sizes provide better user-perceived performances at both the subscriber and the network levels.
Revised:  The simulation results show that for a given token generation rate, larger token bucket sizes provide better user-perceived performance at both subscriber and access levels.
Edit intent: clarity
Original:  It is also shown that the loose burst control resulting from the large token bucket size does not negatively affect user-perceived performances with multiple subscribers even in the presence of non-conformant subscribers  .
Revised:  It is also shown that the loose burst control resulting from the large token bucket size does not negatively affect user-perceived performance with multiple subscribers even in the presence of non-conformant subscribers .
Edit intent: fluency
Original: The collective mechanical behavior of biological tissues strongly influences morphogenesis, cancer growth and wound healing.
Edit intent: clarity
Original:  Recent observations demonstrate that confluent tissues exhibit features of glassy dynamics, such as caging behavior and dynamical heterogeneities, although it has remained unclear how single-cell properties govern this behavior.
Revised:  Recent observations demonstrate that densely packed tissues exhibit features of glassy dynamics, such as caging behavior and dynamical heterogeneities, although it has remained unclear how single-cell properties govern this behavior.
Edit intent: clarity
Original:  Recent observations demonstrate that confluent tissues exhibit features of glassy dynamics, such as caging behavior and dynamical heterogeneities, although it has remained unclear how single-cell properties govern this behavior.
Revised:  Recent observations demonstrate that confluent tissues exhibit features of glassy dynamics, such as caging behavior and dynamical heterogeneities, although it has remained unclear how single-cell properties control this behavior.
Edit intent: clarity
Original:  Here we develop numerical and theoretical models , based on the statistics of energy barriers to cell rearrangements, that make testable predictions about cell migration in cell monolayers.
Revised:  Here we develop numerical and theoretical models to calculate energy barriers to cell rearrangements, that make testable predictions about cell migration in cell monolayers.
Edit intent: clarity
Original:  Here we develop numerical and theoretical models , based on the statistics of energy barriers to cell rearrangements, that make testable predictions about cell migration in cell monolayers.
Revised:  Here we develop numerical and theoretical models , based on the statistics of energy barriers to cell rearrangements, which help govern cell migration in cell monolayers.
Edit intent: clarity
Original:  In particular , we find a surprising dependence of cell migration rates on a cell's number of nearest neighbors, and we predict a glassy two-time correlation function for cell motion, with a waiting time that increases rapidly as cell activity decreases  .
Revised:  In particular , we find a surprising dependence of cell migration rates on a cell's number of neighbors. Based on these results, we predict glassy two-time correlation function for cell motion, with a waiting time that increases rapidly as cell activity decreases .
Edit intent: clarity
Original:  In particular , we find a surprising dependence of cell migration rates on a cell's number of nearest neighbors, and we predict a glassy two-time correlation function for cell motion, with a waiting time that increases rapidly as cell activity decreases  .
Revised:  In particular , we find a surprising dependence of cell migration rates on a cell's number of nearest neighbors, and we predict a glassy two-time correlation functions for cell motion, with a waiting time that increases rapidly as cell activity decreases .
Edit intent: fluency
Original:  In particular , we find a surprising dependence of cell migration rates on a cell's number of nearest neighbors, and we predict a glassy two-time correlation function for cell motion, with a waiting time that increases rapidly as cell activity decreases  .
Revised:  In particular , we find a surprising dependence of cell migration rates on a cell's number of nearest neighbors, and we predict a glassy two-time correlation function for cell motion, with a timescale that increases rapidly as cell activity decreases .
Edit intent: clarity
Original:  We also show that the dependency between \delta and s is linear if s-s'=\Omega(s) and if G obeys a slightly stronger condition.
Revised:  We also show that the dependency between \delta and s is linear if s-s'=\Omega(s) and G obeys a slightly stronger condition.
Edit intent: coherence
Original:  Math. 25 (2011) 333--359 ).
Revised:  Math. 25 (2011) 333-359 ).
Edit intent: fluency
Original:  The stacking interactions of the methyl groups are observed to globally inhibit CG:CG step overtwisting while simultaneously softening the modes locally via potential energy modulations that create metastable states  .
Revised:  The stacking interactions of the methyl groups globally inhibit CG:CG step overtwisting while simultaneously softening the modes locally via potential energy modulations that create metastable states .
Edit intent: clarity
Original:  It reviews standard approaches and explores new ones based on polynomial and rational approximation filtering combined with  stochastic procedure.
Revised:  It reviews standard approaches and explores new ones based on polynomial and rational approximation filtering combined with a stochastic procedure.
Edit intent: fluency
Original: We explore the relationship between the transition semigroup of the minimal deterministic finite automaton (DFA) of a regular language, and the state/quotient complexities of the language's atoms.
Edit intent: coherence
Original:  We introduce a new class of regular languages called themaximally atomic languages -- languageswith the maximal number of atoms, for which every atom has the maximal possible quotient complexity .
Revised:  We introduce a new class of regular languages maximally atomic languages -- languageswith the maximal number of atoms, for which every atom has the maximal possible quotient complexity .
Edit intent: clarity
Original:  We introduce a new class of regular languages called themaximally atomic languages -- languageswith the maximal number of atoms, for which every atom has the maximal possible quotient complexity .
Revised:  We introduce a new class of regular languages called the -- languageswith the maximal number of atoms, for which every atom has the maximal possible quotient complexity .
Edit intent: clarity
Original:  This statement is of the form choose (G_1,...,G_n) where each G_i is a statement.
Revised:  This statement is of the form schoose (G_1,...,G_n) where each G_i is a statement.
Edit intent: clarity
Original: Evolution of RNA viruses such as HIV, Hepatitis C and Influenza virus occurs so rapidly that the viruses' genomes contain information on past ecological dynamics.
Revised: The evolution of RNA viruses such as HIV, Hepatitis C and Influenza virus occurs so rapidly that the viruses' genomes contain information on past ecological dynamics.
Edit intent: fluency
Original:  We apply our Birth-Death SIR method (BDSIR) to  five human immunodeficiency virus type 1 clusters sampled in the United Kingdom (UK) between 1999 and 2003.
Revised:  We apply our Birth-Death SIR method (BDSIR) to five human immunodeficiency virus type 1 clusters sampled in the United Kingdom between 1999 and 2003.
Edit intent: clarity
Original:  The estimated basic reproduction ratio ranges from 1.9 to 3.2 among the clusters.
Revised:  The estimated basic reproduction ratios range from 1.9 to 3.2 among the clusters.
Edit intent: fluency
Original:  Our results imply that these local epidemics arose from introduction of infected individuals into populations of between 900 and 3000 effectively susceptible individuals, albeit with wide margins of uncertainty.
Edit intent: clarity
Original: We confirm a conjecture of Littlewood: there exist seven infinite circular cylinders of unit radius which mutually touch each other.
Revised: We solve a problem of Littlewood: there exist seven infinite circular cylinders of unit radius which mutually touch each other.
Edit intent: clarity
Original:  In here we introduce a new metric for quantifying publication output, called R-Index for reputation-based index , which can be used in support to the ranking of research groups or programs.
Revised:  In here we introduce a new metric for quantifying publication output, called R-Index for reputation-based score , which can be used in support to the ranking of research groups or programs.
Edit intent: clarity
Original:  This paper thus provides an overview of GPON, WDM PON and its differences 
Revised:  This paper thus provides an overview of GPON, WDM PON and its differences .
Edit intent: fluency
Original: This paper discusses the key principles of Gigabit Passive Optical Network (GPON) which is based on Time Division Multiplexing Passive Optical Network (TDM PON) and also, Wavelength Division Multiplexing Passive Optical Network (WDM PON), which is considered to be next generation (tech- nology) .
Revised: This paper discusses the key principles of Gigabit Passive Optical Network (GPON) which is based on Time Division Multiplexing Passive Optical Network (TDM PON) and Wavelength Division Multiplexing Passive Optical Network (WDM PON), which is considered to be next generation (tech- nology) .
Edit intent: coherence
Original: This paper discusses the key principles of Gigabit Passive Optical Network (GPON) which is based on Time Division Multiplexing Passive Optical Network (TDM PON) and also, Wavelength Division Multiplexing Passive Optical Network (WDM PON), which is considered to be next generation (tech- nology) .
Revised: This paper discusses the key principles of Gigabit Passive Optical Network (GPON) which is based on Time Division Multiplexing Passive Optical Network (TDM PON) and also, Wavelength Division Multiplexing Passive Optical Network (WDM PON), which is considered to be next generation passive optical network .
Edit intent: clarity
Original:  In the present day scenario, the broadband access is increasing rapidly .
Revised:  In the present day scenario, access to broad- band is increasing at a rapid pace .
Edit intent: clarity
Original:  Because of the advantages of fibre access in terms of capacity and cost, most of the countries have started deploying GPON access as an important part of national strategy.
Revised:  Because of the advantages of fiber access in terms of capacity and cost, most of the countries have started deploying GPON access as an important part of national strategy.
Edit intent: fluency
Original:  Whereas WDM PON, a next generation network, is quite promising . Unlike GPON, it is  scalable and interoperable with different vendors.
Revised:  Whereas WDM PON, a next generation network, is quite promising unlike GPON, it is scalable and interoperable with different vendors.
Edit intent: fluency
Original:  Whereas WDM PON, a next generation network, is quite promising . Unlike GPON, it is  scalable and interoperable with different vendors.
Revised:  Whereas WDM PON, a next generation network, is quite promising . Unlike GPON, it is easily scalable and interoperable with different vendors.
Edit intent: clarity
Original:  This paper thus provides an overview of GPON, WDM PON and its differences .
Revised:  This paper provides an overview of GPON, WDM PON and its differences .
Edit intent: coherence
Original:  This paper extends a behavioral heuristics based pedestrian model to an adaptive agent-based model, which explicitly considers the crowding effect of neighboring individuals and perception anisotropy on the representation of a pedestrian visual information.
Revised:  This paper extends a behavioral heuristics-based pedestrian model to an adaptive agent-based model, which explicitly considers the crowding effect of neighboring individuals and perception anisotropy on the representation of a pedestrian visual information.
Edit intent: fluency
Original:  This paper extends a behavioral heuristics based pedestrian model to an adaptive agent-based model, which explicitly considers the crowding effect of neighboring individuals and perception anisotropy on the representation of a pedestrian visual information.
Revised:  This paper extends a behavioral heuristics based pedestrian model to an adaptive agent-based model, which explicitly considers the crowding effect of neighboring individuals and perception anisotropy on the representation of a pedestrians visual information.
Edit intent: fluency
Original:  The adaptive agents with crowding perception are constructed to investigate complex, self organized collective dynamics of pedestrian motion for bidirectional and unidirectional flows . Simulation results show that the emergence of lane formation in pedestrian counter flow can be well reproduced.
Revised:  The adaptive agents with crowding perception are constructed to investigate complex, self organized collective dynamics of pedestrian motion for bidirectional and unidirectional flows . Simulation results show that the emergence of lane formation in bidirectional flow can be well reproduced.
Edit intent: clarity
Original:  To investigate this further, increasing view distance has a significant effect on reducing the number of lanes, increasing lane width, and stabilizing the self organized lanes.
Revised:  To investigate this further, increasing view distance has a significant effect on reducing the number of lanes, increasing lane width, and stabilizing the self-organized lanes.
Edit intent: fluency
Original:  It is found that the heterogeneity of crowding perception in the population has a remarkable impact on the flow quality, which results in the buildup of congestion and rapidly decreases the efficiency of pedestrian flows.
Revised:  It is found that the heterogeneity of how pedestrians perceive crowding in the population has a remarkable impact on the flow quality, which results in the buildup of congestion and rapidly decreases the efficiency of pedestrian flows.
Edit intent: clarity
Original: This paper identifies a formal connection between physical problems related to entanglement detection and complexity classes in theoretical computer science.
Revised: We identify a formal connection between physical problems related to entanglement detection and complexity classes in theoretical computer science.
Edit intent: clarity
Original:  In particular, we show that to nearly every quantum interactive proof complexity class (including BQP, QMA, QMA(2), QSZK, and QIP ), there corresponds a natural entanglement or correlation detection problem that is complete for that class.
Revised:  In particular, we show that to nearly every quantum interactive proof complexity class (including BQP, QMA, QMA(2), and QSZK ), there corresponds a natural entanglement or correlation detection problem that is complete for that class.
Edit intent: clarity
Original:  We also show that the difficulty of entanglement detection depends on whether the distance measure used is the trace distance or the one-way  LOCC distance .
Revised:  We also show that the difficulty of entanglement detection depends on whether the distance between quantum states is measured by the one-way LOCC distance .
Edit intent: clarity
Original:  These are the first examples of neighborly Delaunay triangulations that cannot be obtained via a stereographic projection of an inscribed cyclic polytope , and provide the current best lower bound for the number of combinatorial types of Delaunay triangulations.
Revised:  These are the first examples of inscribable neighborly polytopes that are not cyclic polytopes , and provide the current best lower bound for the number of combinatorial types of Delaunay triangulations.
Edit intent: clarity