wanyu/IteraTeR_v2 huggingface dataset:
Original: We present a mechanistic model for the adherence of two spherical flocs in quiescent flow conditions .
Revised: We consider the attachment of spherical particles in quiescent flow conditions .
Edit intent: clarity
Original:  The reversible binding kinetics are assumed to follow the standard model for linear springs \mbox{ Dembo1988 that large floc aggregates are possible with more tensile ligands due to efficient inter-floc collisions ( measured via the collision factor).
Revised:  The reversible binding kinetics are assumed to follow the standard model for linear springs \mbox{ Dembo1988 that large floc aggregates are possible with more stretchable ligands due to efficient inter-floc collisions ( measured via the collision factor).
Edit intent: clarity
Original:  The reversible binding kinetics are assumed to follow the standard model for linear springs \mbox{ Dembo1988 that large floc aggregates are possible with more tensile ligands due to efficient inter-floc collisions ( measured via the collision factor).
Revised:  The reversible binding kinetics are assumed to follow the standard model for linear springs \mbox{ Dembo1988 that large floc aggregates are possible with more tensile ligands due to efficient inter-floc collisions ( or a large, non-zero collision factor).
Edit intent: clarity
Original:  Our results quantify how fluid drag and strong electrolytic composition of the surrounding fluid favor floc formation as well.
Revised:  Strong electrolytic composition of the surrounding fluid favor floc formation as well.
Edit intent: coherence
Original:  Our results quantify how fluid drag and strong electrolytic composition of the surrounding fluid favor floc formation as well.
Revised:  Our results quantify how fluid drag and strong electrolytic composition of the surrounding fluid favors large floc formation as well.
Edit intent: clarity
Original: We consider the attachment of spherical particles in quiescent flow conditions with their surface coated with binding ligands , a model for fluid-immersed adhesion in many biological and artificial settings.
Revised: We consider rigid spherical particles coated with binding ligands , a model for fluid-immersed adhesion in many biological and artificial settings.
Edit intent: clarity
Original: We consider rigid spherical particles coated with binding ligands and study their attachment in quiescent flow .
Revised: We consider rigid spherical particles coated with binding ligands and in equilibrium with the surrounding, quiescent fluid medium .
Edit intent: clarity
Original:  Our results suggest that the elastic ligands allow large floc aggregates by inducing efficient inter-floc collisions (i.e., a large, non-zero collision factor).
Revised:  Our results suggest that the presence of elastic ligands on the particle surface allow large floc aggregates by inducing efficient inter-floc collisions (i.e., a large, non-zero collision factor).
Edit intent: clarity
Original: The concept of " Science 2.0 " was introduced almost a decade ago to describe the new generation of online-based tools for researchers allowing easier data sharing, collaboration and publishing.
Revised: The concept of Science 2.0 " was introduced almost a decade ago to describe the new generation of online-based tools for researchers allowing easier data sharing, collaboration and publishing.
Edit intent: fluency
Original: The concept of " Science 2.0 " was introduced almost a decade ago to describe the new generation of online-based tools for researchers allowing easier data sharing, collaboration and publishing.
Revised: The concept of " Science 2.0 was introduced almost a decade ago to describe the new generation of online-based tools for researchers allowing easier data sharing, collaboration and publishing.
Edit intent: fluency
Original:  As discussed elsewhere, we reiterate that the monopoly of such publishing models increases biases and inequalities in the representation of scientific ideas based on the author's income.
Revised:  As discussed elsewhere, we show that the monopoly of such publishing models increases biases and inequalities in the representation of scientific ideas based on the author's income.
Edit intent: clarity
Original:  We further analyze the reasons of the failure of the current post-publication peer-review models and suggest what needs to be changed in " Science 3.0 " to convert Internet into a large "journal club" .
Revised:  We further analyze the reasons of the failure of the current post-publication peer-review models and suggest what needs to be changed in Science 3.0 " to convert Internet into a large "journal club" .
Edit intent: fluency
Original:  We further analyze the reasons of the failure of the current post-publication peer-review models and suggest what needs to be changed in " Science 3.0 " to convert Internet into a large "journal club" .
Revised:  We further analyze the reasons of the failure of the current post-publication peer-review models and suggest what needs to be changed in " Science 3.0 to convert Internet into a large "journal club" .
Edit intent: fluency
Original:  We further analyze the reasons of the failure of the current post-publication peer-review models and suggest what needs to be changed in " Science 3.0 " to convert Internet into a large "journal club" .
Revised:  We further analyze the reasons of the failure of the current post-publication peer-review models and suggest what needs to be changed in " Science 3.0 " to convert Internet into a large journal club .
Edit intent: fluency
Original:  Rope parasites have been discovered as a result of cleansing enemas.
Revised:  Rope worms have been discovered as a result of cleansing enemas.
Edit intent: clarity
Original:  It takes tens of years for them to fully develop into mature species (fifth stage ) .
Revised:  The development stages were identified based on their morphology. The fifth stage looks like a tough string of mucus about a meter long .
Edit intent: coherence
Original:  As in multiscale finite element methods (MsFEMs), the main idea of the proposed approach is to construct a small dimensional local solution space that can be used to generate  efficient and accurate approximation to the multiscale solution with a potentially high dimensional input parameter space.
Revised:  As in multiscale finite element methods (MsFEMs), the main idea of the proposed approach is to construct a small dimensional local solution space that can be used to generate an efficient and accurate approximation to the multiscale solution with a potentially high dimensional input parameter space.
Edit intent: fluency
Original:  The enrichment in the online stage is performed based on a spectral decomposition of the snapshot space consisting of all plausible functions in the space.
Revised:  The enrichment in the online stage is performed based on a spectral decomposition of the offline space.
Edit intent: clarity
Original: We consider the problem of reliably broadcasting information in a multihop asynchronous network in the presence of Byzantine failures: some nodes have an unpredictable malicious behavior.
Revised: We consider the problem of reliably broadcasting information in a multihop asynchronous network in the presence of Byzantine failures: some nodes may exhibit unpredictable malicious behavior.
Edit intent: clarity
Original:  We focus on totally decentralized solutions.
Revised:  We focus on completely decentralized solutions.
Edit intent: fluency
Original:  Very few Byzantine-robust algorithms exist for loosely connected networks.
Revised:  Few Byzantine-robust algorithms exist for loosely connected networks.
Edit intent: coherence
Original:  A recent algorithm guarantees reliable broadcast on a torus when D > 4, D being the minimal distance between two Byzantine nodes.
Revised:  A recent solution guarantees reliable broadcast on a torus when D > 4, D being the minimal distance between two Byzantine nodes.
Edit intent: clarity
Original:  We show that reliable broadcast is guaranteed when D > Z, Z being the maximal number of edges per polygon.
Revised:  We show that reliable broadcast can be guaranteed when D > Z, Z being the maximal number of edges per polygon.
Edit intent: clarity
Original:  This is also the first solution where the memory required increases linearly  with the size of informations, and not exponentially .
Revised:  This is also the first solution where the memory required increases linearly (instead of exponentially) with the size of informations, and not exponentially .
Edit intent: clarity
Original:  This is also the first solution where the memory required increases linearly  with the size of informations, and not exponentially .
Revised:  This is also the first solution where the memory required increases linearly with the size of transmitted information .
Edit intent: clarity
Original:  The Bolthausen-Sznitman n-coalescent is a Markov process taking states in the set of partitions of \{ \left\{ 1, ...,n\right\} , where 1, ... ,n are referred to as individuals.
Revised:  The Bolthausen-Sznitman n-coalescent is a Markov process taking states in the set of partitions of \left\{ 1, ...,n\right\} , where 1, ... ,n are referred to as individuals.
Edit intent: fluency
Original:  We show that \\ 0pt ).
Revised:  \\ 0pt ).
Edit intent: coherence
Original: }\\  (\log n)^{-1}\log X_n converges in distribution to the uniform distribution on [0,1] and\to\\  that \frac{\log n}{n^k}E(X_n^k)\to 1{k} for n\to\infty .
Revised: }\\ (\log n)^{-1}\log X_n converges in distribution to the uniform distribution on [0,1] for n\to\\ that \frac{\log n}{n^k}E(X_n^k)\to 1{k} for n\to\infty .
Edit intent: coherence
Original: }\\  (\log n)^{-1}\log X_n converges in distribution to the uniform distribution on [0,1] and\to\\  that \frac{\log n}{n^k}E(X_n^k)\to 1{k} for n\to\infty .
Revised: }\\ (\log n)^{-1}\log X_n converges in distribution to the uniform distribution on [0,1] and\to\infty.\\ that \frac{\log n}{n^k}E(X_n^k)\to 1{k} for n\to\infty .
Edit intent: fluency
Original: T}EB_{\tau-\eps}, where }%DIFDELCMD < \eps %%% }E[i=1^n (\tau-\eps^i)^+^i], where T>0 } is a fixed strictly positive constant, B is a Brownian motion, is progressively measurable with respect to the Brownian filtration, }\eps and T_{\eps,T} is the set of Brownian stopping times that lie between  \eps and a fixed horizon T>%DIFDELCMD < \eps%%%  . We solve this problem by conditioning and then using the theory of reflected backward stochastic differential equations (RBSDEs).
Revised: T}EB_{\tau-\eps}, where }%DIFDELCMD < \eps %%% }E[i=1^n (\tau-\eps^i)^+^i], where T>0 } is a fixed strictly positive constant, B is a Brownian motion, is progressively measurable with respect to the Brownian filtration, }\eps and T_{\eps,T} is the set of stopping times that lie between \eps and a fixed horizon T>%DIFDELCMD < \eps%%% . We solve this problem by conditioning and then using the theory of reflected backward stochastic differential equations (RBSDEs).
Edit intent: fluency
Original: T}EB_{\tau-\eps}, where }%DIFDELCMD < \eps %%% }E[i=1^n (\tau-\eps^i)^+^i], where T>0 } is a fixed strictly positive constant, B is a Brownian motion, is progressively measurable with respect to the Brownian filtration, }\eps and T_{\eps,T} is the set of Brownian stopping times that lie between  \eps and a fixed horizon T>%DIFDELCMD < \eps%%%  . We solve this problem by conditioning and then using the theory of reflected backward stochastic differential equations (RBSDEs).
Revised: T}EB_{\tau-\eps}, where }%DIFDELCMD < \eps %%% }E[i=1^n (\tau-\eps^i)^+^i], where T>0 } is a fixed strictly positive constant, B is a Brownian motion, is progressively measurable with respect to the Brownian filtration, }\eps and T_{\eps,T} is the set of Brownian stopping times that lie between a constant \eps and a fixed horizon T>%DIFDELCMD < \eps%%% . We solve this problem by conditioning and then using the theory of reflected backward stochastic differential equations (RBSDEs).
Edit intent: clarity
Original: T}EB_{\tau-\eps}, where }%DIFDELCMD < \eps %%% }E[i=1^n (\tau-\eps^i)^+^i], where T>0 } is a fixed strictly positive constant, B is a Brownian motion, is progressively measurable with respect to the Brownian filtration, }\eps and T_{\eps,T} is the set of Brownian stopping times that lie between  \eps and a fixed horizon T>%DIFDELCMD < \eps%%%  . We solve this problem by conditioning and then using the theory of reflected backward stochastic differential equations (RBSDEs).
Revised: T}EB_{\tau-\eps}, where }%DIFDELCMD < \eps %%% }E[i=1^n (\tau-\eps^i)^+^i], where T>0 } is a fixed strictly positive constant, B is a Brownian motion, is progressively measurable with respect to the Brownian filtration, }\eps and T_{\eps,T} is the set of Brownian stopping times that lie between \eps %DIFDELCMD < \eps%%% . We solve this problem by conditioning and then using the theory of reflected backward stochastic differential equations (RBSDEs).
Edit intent: clarity
Original: We consider the optimal problem \sup:=\sup} _{\tau\inT _{\eps,T } \mathbb{E[i=1^n (\tau-\eps^i)^+^i], where } B_{(\tau-\eps)^+} posed by Shiryaev at the International Conference on Advanced Stochastic Optimization Problems organized by the Steklov Institute of Mathematics in September 2012.
Revised: We consider the optimal problem \sup:=\sup} _{\tau\inT _{\eps,T } [i=1^n (\tau-\eps^i)^+^i], where } B_{(\tau-\eps)^+} posed by Shiryaev at the International Conference on Advanced Stochastic Optimization Problems organized by the Steklov Institute of Mathematics in September 2012.
Edit intent: coherence
Original: We consider the optimal problem \sup:=\sup} _{\tau\inT _{\eps,T } \mathbb{E[i=1^n (\tau-\eps^i)^+^i], where } B_{(\tau-\eps)^+} posed by Shiryaev at the International Conference on Advanced Stochastic Optimization Problems organized by the Steklov Institute of Mathematics in September 2012.
Revised: We consider the optimal problem \sup:=\sup} _{\tau\inT _{\eps,T } \mathbb{E[i=1^n (\tau-\eps^i)^+^i], where } \mathbb{EB_{(\tau-\eps)^+} posed by Shiryaev at the International Conference on Advanced Stochastic Optimization Problems organized by the Steklov Institute of Mathematics in September 2012.
Edit intent: style
Original: The psycho-visual perception of distorted natural scenes and the structured nature of video data motivate introducing content-aware decisions that utilize this structure for improved video transmission over wireless networks.
Revised: The structured nature of video data motivate introducing content-aware decisions that utilize this structure for improved video transmission over wireless networks.
Edit intent: coherence
Original: The psycho-visual perception of distorted natural scenes and the structured nature of video data motivate introducing content-aware decisions that utilize this structure for improved video transmission over wireless networks.
Revised: The psycho-visual perception of distorted natural scenes and the structured nature of video data motivates introducing video-aware decisions that make use of this structure for improved video transmission over wireless networks.
Edit intent: clarity
Original:  The perceptual importance of a packet is quantified through the packet loss visibility and the video content is characterized by the loss visibility distribution which we propose to estimate online .
Revised:  We quantify the perceptual importance of a packet is quantified through the packet loss visibility and the video content is characterized by the loss visibility distribution which we propose to estimate online .
Edit intent: clarity
Original:  The perceptual importance of a packet is quantified through the packet loss visibility and the video content is characterized by the loss visibility distribution which we propose to estimate online .
Revised:  The perceptual importance of a packet through the packet loss visibility and the video content is characterized by the loss visibility distribution which we propose to estimate online .
Edit intent: clarity
Original:  The perceptual importance of a packet is quantified through the packet loss visibility and the video content is characterized by the loss visibility distribution which we propose to estimate online .
Revised:  The perceptual importance of a packet is quantified through the packet loss visibility and use the loss visibility distribution which we propose to estimate online .
Edit intent: clarity
Original:  To jointly capture video quality and network throughput , we define the optimization objective  as the throughput weighted by the loss visibility of each packet, a metric coined perceived throughput.
Revised:  To jointly achieve video quality and network throughput , we define the optimization objective as the throughput weighted by the loss visibility of each packet, a metric coined perceived throughput.
Edit intent: clarity
Original:  We further prove that the proposed architecture enables a multiplicative quality gain due to packet prioritization and a throughput gain due to the load balancing property of the thresholding policy.
Edit intent: coherence
Original:  We implemented a  Deep Belief Network (DBN)  to identify the artist by audio signal.
Revised:  We implemented a Deep Belief Network (DBN) to identify the artist from audio signal.
Edit intent: clarity
Original:  We also found some interesting phenomena in our model, such "the Three Bs" gathered together in our model and samples from different classes become farther away from each other when transformed by more layers in our model.
Revised:  We also found some interesting phenomena in our model, like "the Three Bs" gathered together in our model and samples from different classes become farther away from each other when transformed by more layers in our model.
Edit intent: fluency
Original: Audio Artist Identification (AAI ) is an important problem in Music Information Retrieval (MIR)  . The famous annual competition, Music Information Retrieval Evaluation eXchange (MIREX), also takes AAI task as one of the four training&testing tasks.
Revised: Audio Artist Identification (AAI ) is an important problem in Music Information Retrieval (MIR) . The famous annual competition, Music Information Retrieval Evaluation eXchange (MIREX), also takes it as one of the four training&testing tasks.
Edit intent: clarity
Original:  We built a hybrid model based on Deep Belief Network (DBN) and Stacked Denoising Autoencoder (SDA) to identify the artist from audio signal.
Revised:  We built a hybrid model based on Deep Belief Network (DBN) and Stacked Denoising Autoencoder (SDA) to identify the composer from audio signal.
Edit intent: clarity
Original:  As a matter of copyright, sponsors of MIREX can not publish their data set.
Revised:  As a matter of copyright, sponsors of MIREX cannot publish their data set.
Edit intent: fluency
Original:  We also found some interesting phenomena in our model, like "the Three Bs" gathered together in our model and samples from different classes become farther away from each other when transformed by more layers in our model .
Revised:  We also found that samples from different classes become farther away from each other when transformed by more layers in our model .
Edit intent: coherence
Original:  its proof crucially relies on medial limits.
Revised:  its proof relies on medial limits.
Edit intent: clarity
Original: In this work, we study a problem of supporting real time traffic with hard delay constraints in an unreliable wireless data communication channel.
Revised: We study a problem of supporting real time traffic with hard delay constraints in an unreliable wireless data communication channel.
Edit intent: clarity
Original: In this work, we study a problem of supporting real time traffic with hard delay constraints in an unreliable wireless data communication channel.
Revised: In this work, we study a problem of scheduling real-time traffic with hard delay constraints in an unreliable wireless data communication channel.
Edit intent: clarity
Original:  A fixed number of nodes N share a common wireless channelusing a centralized scheduler at the access point or the base station.
Revised:  A fixed number of slots in a fading wireless channel. For an infrastructure mode of traffic with a centralized scheduler at the access point or the base station.
Edit intent: clarity
Original:  In this scenario, we are interested in the long time average rates achievable for the real time traffic in the wireless network .
Revised:  In this scenario, we are interested in the long time average throughput achievable for the real time traffic in the wireless network .
Edit intent: clarity
Original:  In this scenario, we are interested in the long time average rates achievable for the real time traffic in the wireless network .
Revised:  In this scenario, we are interested in the long time average rates achievable for the real time traffic .
Edit intent: clarity
Original:  In [1], the authors have characterized the rate region of such a network by identifying the feasible rate vectors.
Revised:  In [1], the authors have stud- ied the feasible throughput vectors by identifying the feasible rate vectors.
Edit intent: clarity
Original:  Finally, we report performance analysis of the proposed scheduling strategy and discuss its advantages.
Revised:  Finally, we report performance analysis of the proposed strategy and discuss its advantages.
Edit intent: clarity
Original: In the iconic game, standard Rock-Paper-Scissors (RPS) game , cyclic trajectory is predicted by evolutionary game theorybut not by classical game theory .
Revised: The Rock-Paper-Scissors (RPS) game , cyclic trajectory is predicted by evolutionary game theorybut not by classical game theory .
Edit intent: clarity
Original:  Using the general theory of exponential family distributions, we prove  existence and uniqueness of the maximum likelihood estimator (MLE) of the vertex parameters.
Revised:  Using the general theory of exponential family distributions, we prove the existence and uniqueness of the maximum likelihood estimator (MLE) of the vertex parameters.
Edit intent: fluency
Original:  We also prove in several cases the surprising consistency of the MLE from a single graph sample, extending  results of Chatterjee, Diaconis, and Sly for unweighted (binary) graphs.
Revised:  We also prove the consistency of the MLE from a single graph sample, extending results of Chatterjee, Diaconis, and Sly for unweighted (binary) graphs.
Edit intent: clarity
Original:  We also prove in several cases the surprising consistency of the MLE from a single graph sample, extending  results of Chatterjee, Diaconis, and Sly for unweighted (binary) graphs.
Revised:  We also prove in several cases the surprising consistency of the MLE from a single graph sample, extending the results of Chatterjee, Diaconis, and Sly for unweighted (binary) graphs.
Edit intent: fluency
Original: Inspired by the problem of sensory coding in neuroscience , we study the maximum entropy distribution on weighted graphs with a given expected degree sequence.
Revised: Inspired by the problem of sensory coding in neuroscience , we study maximum entropy distributions on weighted graphs with a given expected degree sequence.
Edit intent: fluency
Original:  This distribution on graphs is characterized by independent edge weights parameterized by vertex potentials at each node . Using the general theory of exponential family distributions, we prove the existence and uniqueness of the maximum likelihood estimator (MLE) of the vertex parameters.
Revised:  These distributions are characterized by independent edge weights parameterized by vertex potentials at each node . Using the general theory of exponential family distributions, we prove the existence and uniqueness of the maximum likelihood estimator (MLE) of the vertex parameters.
Edit intent: clarity