wanyu/IteraTeR_v2 huggingface dataset:
Original:  The two reputation assignment rules called simple standing and stern judging yield ingroup favoritism.
Revised:  Two reputation assignment rules called simple standing and stern judging yield ingroup favoritism.
Edit intent: clarity
Original:  In particular, stern judging induces much stronger ingroup favoritism than  simple standing.
Revised:  Stern judging induces much stronger ingroup favoritism than simple standing.
Edit intent: coherence
Original:  In particular, stern judging induces much stronger ingroup favoritism than  simple standing.
Revised:  In particular, stern judging induces much stronger ingroup favoritism than does simple standing.
Edit intent: clarity
Original:   In addition, we analytically showed as a limiting case that pure populations of cooperators that use reputations are unstable when individuals independently infer reputations about individuals, which is consistent with previously reported numerical results . Conclusions: Our results suggest that ingroup favoritism can be promoted in indirect reciprocity by the groupwise information sharing and that individuals can show ingroup favoritism even without noticing it;
Revised:  In addition, we analytically show as a limiting case that pure populations of cooperators that use reputations are unstable when individuals independently infer reputations about individuals, which is consistent with previously reported numerical results . Conclusions: Our results suggest that ingroup favoritism can be promoted in indirect reciprocity by the groupwise information sharing and that individuals can show ingroup favoritism even without noticing it;
Edit intent: fluency
Original:   In addition, we analytically showed as a limiting case that pure populations of cooperators that use reputations are unstable when individuals independently infer reputations about individuals, which is consistent with previously reported numerical results . Conclusions: Our results suggest that ingroup favoritism can be promoted in indirect reciprocity by the groupwise information sharing and that individuals can show ingroup favoritism even without noticing it;
Revised:  In addition, we analytically showed as a limiting case that homogeneous populations of reciprocators that use reputations are unstable when individuals independently infer reputations about individuals, which is consistent with previously reported numerical results . Conclusions: Our results suggest that ingroup favoritism can be promoted in indirect reciprocity by the groupwise information sharing and that individuals can show ingroup favoritism even without noticing it;
Edit intent: clarity
Original:   In addition, we analytically showed as a limiting case that pure populations of cooperators that use reputations are unstable when individuals independently infer reputations about individuals, which is consistent with previously reported numerical results . Conclusions: Our results suggest that ingroup favoritism can be promoted in indirect reciprocity by the groupwise information sharing and that individuals can show ingroup favoritism even without noticing it;
Revised:  In addition, we analytically showed as a limiting case that pure populations of cooperators that use reputations are unstable when individuals independently infer reputations of individuals, which is consistent with previously reported numerical results . Conclusions: Our results suggest that ingroup favoritism can be promoted in indirect reciprocity by the groupwise information sharing and that individuals can show ingroup favoritism even without noticing it;
Edit intent: clarity
Original: Zinc uptake in roots is believed to be mediated by ZIP (ZRT-, IRT- like Proteins) transporters.
Revised: Zinc uptake in roots is believed to be mediated by ZIP (ZRT-, IRT-like Proteins) transporters.
Edit intent: fluency
Original:  Here, mathematical modelling was employed to study the importance of ZIP regulation, HMA level and symplastic transport in creation of the radial pattern of zinc in primary roots of Arabidopsis thaliana.
Revised:  Here, mathematical modelling was employed to study the importance of ZIP regulation, HMA abundance and symplastic transport in creation of the radial pattern of zinc in primary roots of Arabidopsis thaliana.
Edit intent: clarity
Original:  A comprehensive one-dimensional dynamical model of radial zinc transport in roots was developed and used to conduct simulations.
Revised:  A comprehensive one-dimensional dynamic model of radial zinc transport in roots was developed and used to conduct simulations.
Edit intent: clarity
Original:  Steady state patterns were calculated for varying medium concentrations , water influx and HMA levels .
Revised:  Steady state patterns were calculated for varying medium concentrations , water influx and HMA abundance .
Edit intent: clarity
Original:  The experimentally shown zinc gradient was reproduced very well.
Revised:  The experimentally observed zinc gradient was reproduced very well.
Edit intent: clarity
Original:  Increase of HMA or decrease in water influx lead to loss of the gradient.
Revised:  Increase of HMA or decrease in water influx led to loss of the gradient.
Edit intent: fluency
Original:  The dynamic behaviour for a change in medium concentration and water influx was also determined showing short adaptation times in the range of seconds to minutes.
Revised:  The dynamic behaviour for a change in medium concentration and water influx was also simulated showing short adaptation times in the range of seconds to minutes.
Edit intent: clarity
Original:  Slowing down regulation lead to oscillations in expression levels, suggesting the need for a fast regulation and existence of buffering agents.
Revised:  Slowing down regulation led to oscillations in expression levels, suggesting the need for a fast regulation and existence of buffering agents.
Edit intent: fluency
Original:  Slowing down regulation lead to oscillations in expression levels, suggesting the need for a fast regulation and existence of buffering agents.
Revised:  Slowing down regulation lead to oscillations in expression levels, suggesting the need for rapid regulation and existence of buffering agents.
Edit intent: clarity
Original:  The model captures the experimental findings very well and confirms the hypothesis that low levels of HMA4 produce a radial gradient in zinc concentration.
Revised:  The model captures the experimental findings very well and confirms the hypothesis that low abundance of HMA4 produce a radial gradient in zinc concentration.
Edit intent: clarity
Original:  The model captures the experimental findings very well and confirms the hypothesis that low levels of HMA4 produce a radial gradient in zinc concentration.
Revised:  The model captures the experimental findings very well and confirms the hypothesis that low levels of HMA4 produces a radial gradient in zinc concentration.
Edit intent: fluency
Original: Measurements of protein motion in living cells and membranes consistently report transient anomalous subdiffusion which converges back to a Brownian motion with reduced diffusion constant at long times, after the subdiffusion regime.
Revised: Measurements of protein motion in living cells and membranes consistently report transient anomalous diffusion (subdiffusion) which converges back to a Brownian motion with reduced diffusion constant at long times, after the subdiffusion regime.
Edit intent: clarity
Original: Measurements of protein motion in living cells and membranes consistently report transient anomalous subdiffusion which converges back to a Brownian motion with reduced diffusion constant at long times, after the subdiffusion regime.
Revised: Measurements of protein motion in living cells and membranes consistently report transient anomalous subdiffusion which converges back to a Brownian motion with reduced diffusion coefficient at long times, after the subdiffusion regime.
Edit intent: clarity
Original:  On the other hand, membranes are also non-homogeneous media in which Brownian motion may be locally slowed-down due to variations in lipid composition.
Revised:  On the other hand, membranes are also heterogeneous media in which Brownian motion may be locally slowed-down due to variations in lipid composition.
Edit intent: clarity
Original:  We show that both processes increase the apparent affinity of the reaction.
Revised:  Using theoretical arguments and Monte-Carlo simulations, we show that those three scenarios have distinctive effects on the apparent affinity of the reaction.
Edit intent: clarity
Original:  Hence, these two processes are different : size matters for slowed-down Brownian motion, not for transient anomalous subdiffusion .
Revised:  Hence, these two processes are different and exhibit irreconcilable behaviors when the area fraction of reduced mobility changes .
Edit intent: clarity
Original:  The purpose of this article is to introduce a new approach of training Kanerva's SDM that can handle efficiently  non-random data has the capability to recognize inverted patterns.
Revised:  The purpose of this article is to introduce a new approach of training Kanerva's SDM that can handle efficiently non-random data , and to provide it the capability to recognize inverted patterns.
Edit intent: clarity
Original:  The purpose of this article is to introduce a new approach of training Kanerva's SDM that can handle efficiently only non-random data, and to provide it the capability to recognize inverted patterns.
Revised:  The purpose of this article is to introduce a new approach of training Kanerva's SDM that can handle efficiently non-random data, and to provide it the capability to recognize inverted patterns.
Edit intent: clarity
Original:  Moreover, we obtain new sufficient conditions for establishing multistationarity of certain fully open networks  beyond the one-reaction setting.
Revised:  Moreover, we obtain new sufficient conditions for establishing multistationarity of fully open networks beyond the one-reaction setting.
Edit intent: clarity
Original:  This generalization retains some very desirable properties, e.g. stabilization is independent of firings chosen and each chip-firing equivalence class contains a unique recurrent state.
Revised:  This generalization retains some desirable properties, e.g. stabilization is independent of firings chosen and each chip-firing equivalence class contains a unique recurrent state.
Edit intent: clarity
Original:  Whereas C's may adopt the opinions A and B with respective rates 1+delta_A and 1+delta_B (with delta_A>=delta_B>0), Cz  are committed individuals that always remain centrists.
Revised:  Whereas C's may adopt the opinions A and B with respective rates 1+delta_A and 1+delta_B (with delta_A>=delta_B>0), Cz 's are committed individuals that always remain centrists.
Edit intent: fluency
Original:  In fact, when zeta<Delta_c and there is an initial minority of centrists, the mean consensus time asymptotically grows as tau \sim N \simN ^{-1/2} e^{N gamma}, where gamma is determined.
Revised:  In fact, when zeta<Delta_c and there is an initial minority of centrists, the mean consensus time asymptotically grows as tau \simN ^{-1/2} e^{N gamma}, where gamma is determined.
Edit intent: fluency
Original:  The relevance of this new parameter is shown both theoretically and numerically .
Revised:  The relevance of this new parameter is shown both empirically and theoretically .
Edit intent: clarity
Original:  The model is based on a network represented by a directed graph with n nodes , where nodes are locations, and links are outgoing or incoming movement flow between nodes.
Revised:  The model is based on a network represented by a directed graph with n nodes , where nodes are locations, and links reflect outgoing or incoming movement flow between nodes.
Edit intent: clarity
Original:  The reproduction number is shown to be a function of both vertical and horizontal transmission parameters  .
Revised:  The reproduction number is shown to be a function of vertical and horizontal transmission parameters .
Edit intent: clarity
Original:  As an example, we determine bounds of the reproductive number for a Rift Valley fever (RVF) virus transmission meta-population model.
Revised:  As an application, the reproduction number and its bounds for the Rift Valley fever (RVF) virus transmission meta-population model.
Edit intent: clarity
Original:  However, it is often necessary to impose a biasing potential on the system so that high energy states are sampled with a reasonable frequency.
Revised:  However, it is often necessary to impose a biasing potential on the system so that high energy states are sampled with sufficient frequency.
Edit intent: clarity
Original:  DESA is used to analyze extension vs. time data taken as an optical trap is used to unfold a DNA hairpin under a harmonic constraint .
Revised:  DESA is demonstrated by analyzing data from a simulated system as well as data from a single-molecule unfolding experiment in which the end-to-end distance of a DNA hairpin is measured .
Edit intent: clarity
Original: We define a new descriptor for persistent homology, which we call the persistence landscape , for the purpose of facilitating statistical inference.
Revised: We define a new topological summary for data that we call the persistence landscape , for the purpose of facilitating statistical inference.
Edit intent: clarity
Original:  We also show that this summary is stable and gives lower bounds for the bottleneck distance and the Wasserstein distance .
Revised:  We also show that this summary is stable and that it can be used to provide lower bounds for the bottleneck distance and the Wasserstein distance .
Edit intent: clarity
Original:  We also show that this summary is stable and gives lower bounds for the bottleneck distance and the Wasserstein distance .
Revised:  We also show that this summary is stable and gives lower bounds for the bottleneck and Wasserstein distances .
Edit intent: fluency
Original:  Viewed as a random variable with values in a Banach space, this summary obeys a Strong Law of Large Numbers and a Central Limit Theorem .
Revised:  Viewed as a random variable with values in a Banach space, this summary obeys a strong law of large numbers and a central limit theorem .
Edit intent: fluency
Original:  The trait value is assumed to evolve along a lineage as an Ornstein--Uhlenbeck process characterized by the adaptation rate \alpha>0, the optimal trait value \theta and the noise size \sigma>0.
Revised:  The trait value is assumed to evolve along a lineage as an Ornstein-Uhlenbeck process characterized by the adaptation rate \alpha>0, the optimal trait value \theta and the noise size \sigma>0.
Edit intent: fluency
Original: We consider a model for adaptive evolution of a phenotype within a family of related species with unknown phylogeny.
Revised: We consider a stochastic evolutionary model for a phenotype developing amongst n related species with unknown phylogeny.
Edit intent: clarity
Original:  The trait value is assumed to evolve along a lineage as an Ornstein-Uhlenbeck process characterized by the adaptation rate \alpha>0 , the optimal trait value \theta  and the noise size \sigma>0.
Revised:  The trait value is assumed to evolve along any given lineage as an Ornstein-Uhlenbeck process characterized by the adaptation rate \alpha>0 , the optimal trait value \theta and the noise size \sigma>0.
Edit intent: clarity
Original:  The trait value is assumed to evolve along a lineage as an Ornstein-Uhlenbeck process characterized by the adaptation rate \alpha>0 , the optimal trait value \theta  and the noise size \sigma>0.
Revised:  The trait value is assumed to evolve along a lineage as an Ornstein--Uhlenbeck process characterized by the adaptation rate \alpha>0 , the optimal trait value \theta and the noise size \sigma>0.
Edit intent: fluency
Original:  The trait value is assumed to evolve along a lineage as an Ornstein-Uhlenbeck process characterized by the adaptation rate \alpha>0 , the optimal trait value \theta  and the noise size \sigma>0.
Revised:  The trait value is assumed to evolve along a lineage as an Ornstein-Uhlenbeck process characterized by the adaptation rate \alpha>0 , the optimal trait value \theta , the adaptation rate \alpha>0, and the noise size \sigma>0.
Edit intent: fluency
Original:  The unknown species tree is modelled by a Yule process with unit speciation rate conditioned on n contemporary nodes.
Revised:  The unknown tree is modelled by a Yule process with unit speciation rate conditioned on n contemporary nodes.
Edit intent: clarity
Original:  The unknown species tree is modelled by a Yule process with unit speciation rate conditioned on n contemporary nodes.
Revised:  The unknown species tree is modelled by a Yule process conditioned on n contemporary nodes.
Edit intent: clarity
Original:  The trait value is assumed to evolve along any given lineage as an Ornstein--Uhlenbeck processcharacterized by the ancestral value X_{0, the optimal trait value \theta, the adaptation rate \alpha>0, and the noise size \sigma>0.
Revised:  The trait value is assumed to evolve along , the optimal trait value \theta, the adaptation rate \alpha>0, and the noise size \sigma>0.
Edit intent: clarity
Original:  For the sample mean }%DIFDELCMD < X%%% _{n establish three limit theorems depending on whether \alpha<0.5, \alpha=0.5, or \alpha>0.5 . In the case of fast adaptation, \alpha%DIFDELCMD < \ge0%%% .5, we show that for large n the normalized sample mean c_{n _{n-\theta) } is approximately normally distributed.
Revised:  For the sample mean }%DIFDELCMD < X%%% _{n establish three limit theorems for the sample mean corresponding to three domains for the adaptation rate . In the case of fast adaptation, \alpha%DIFDELCMD < \ge0%%% .5, we show that for large n the normalized sample mean c_{n _{n-\theta) } is approximately normally distributed.
Edit intent: clarity
Original:  For the sample mean }%DIFDELCMD < X%%% _{n establish three limit theorems depending on whether \alpha<0.5, \alpha=0.5, or \alpha>0.5 . In the case of fast adaptation, \alpha%DIFDELCMD < \ge0%%% .5, we show that for large n the normalized sample mean c_{n _{n-\theta) } is approximately normally distributed.
Revised:  For the sample mean }%DIFDELCMD < X%%% _{n establish three limit theorems depending on whether \alpha<0.5, \alpha=0.5, or \alpha>0.5 . In the case of fast adaptation, %DIFDELCMD < \ge0%%% .5, we show that for large n the normalized sample mean c_{n _{n-\theta) } is approximately normally distributed.
Edit intent: coherence
Original:  For the sample mean }%DIFDELCMD < X%%% _{n establish three limit theorems depending on whether \alpha<0.5, \alpha=0.5, or \alpha>0.5 . In the case of fast adaptation, \alpha%DIFDELCMD < \ge0%%% .5, we show that for large n the normalized sample mean c_{n _{n-\theta) } is approximately normally distributed.
Revised:  For the sample mean }%DIFDELCMD < X%%% _{n establish three limit theorems depending on whether \alpha<0.5, \alpha=0.5, or \alpha>0.5 . In the case of fast adaptation, \alpha%DIFDELCMD < \ge0%%% we show that for large n the normalized sample mean c_{n _{n-\theta) } is approximately normally distributed.
Edit intent: coherence
Original:  For the sample mean }%DIFDELCMD < X%%% _{n establish three limit theorems depending on whether \alpha<0.5, \alpha=0.5, or \alpha>0.5 . In the case of fast adaptation, \alpha%DIFDELCMD < \ge0%%% .5, we show that for large n the normalized sample mean c_{n _{n-\theta) } is approximately normally distributed.
Revised:  For the sample mean }%DIFDELCMD < X%%% _{n establish three limit theorems depending on whether \alpha<0.5, \alpha=0.5, or \alpha>0.5 . In the case of fast adaptation, \alpha%DIFDELCMD < \ge0%%% .5, we show that for large n the normalized sample mean _{n-\theta) } is approximately normally distributed.
Edit intent: clarity
Original:  For the sample mean }%DIFDELCMD < X%%% _{n establish three limit theorems depending on whether \alpha<0.5, \alpha=0.5, or \alpha>0.5 . In the case of fast adaptation, \alpha%DIFDELCMD < \ge0%%% .5, we show that for large n the normalized sample mean c_{n _{n-\theta) } is approximately normally distributed.
Revised:  For the sample mean }%DIFDELCMD < X%%% _{n establish three limit theorems depending on whether \alpha<0.5, \alpha=0.5, or \alpha>0.5 . In the case of fast adaptation, \alpha%DIFDELCMD < \ge0%%% .5, we show that for large n the normalized sample mean c_{n -\theta) } is approximately normally distributed.
Edit intent: fluency
Original:  Here the normalizing sequence is c_{n=n for \alpha>0.5 and c_{n}=n/\ln n for \alpha=0.5.
Revised:  =n for \alpha>0.5 and c_{n}=n/\ln n for \alpha=0.5.
Edit intent: clarity
Original:  These limit theoremslead to three }  novel confidence interval formulae for the optimal trait value \theta .
Revised:  These limit theoremslead to three } novel confidence interval formulae for the optimal trait value .
Edit intent: clarity
Original: Multimedia streaming applications with stringent QoS requirements in 60GHz mmWave wireless personal area networks (WPANs) demand high data rate and low latency data transfer as well as low service disruption.
Revised: Multimedia streaming applications with stringent QoS requirements in 60GHz mmWave wireless personal area networks (WPANs) demand high rate and low latency data transfer as well as low service disruption.
Edit intent: fluency
Original:  In this paper, we consider the problem of robust reflector placement in 60GHz WPANs. Reflectors relay traffic from transmitter devices to receiver devices facilitating i) the primary communication path for non-line-of-sight (NLOS) transceiver pairs, and ii) secondary (backup) communication path for line-of-sight (LOS) or NLOS transceiver pairs.
Revised:  In this paper, we consider the problem of robust relay placement in 60GHz WPANs. Reflectors relay traffic from transmitter devices to receiver devices facilitating i) the primary communication path for non-line-of-sight (NLOS) transceiver pairs, and ii) secondary (backup) communication path for line-of-sight (LOS) or NLOS transceiver pairs.
Edit intent: clarity
Original:  In this paper, we consider the problem of robust reflector placement in 60GHz WPANs. Reflectors relay traffic from transmitter devices to receiver devices facilitating i) the primary communication path for non-line-of-sight (NLOS) transceiver pairs, and ii) secondary (backup) communication path for line-of-sight (LOS) or NLOS transceiver pairs.
Revised:  In this paper, we consider the problem of robust reflector placement in 60GHz WPANs. Relays forward traffic from transmitter devices to receiver devices facilitating i) the primary communication path for non-line-of-sight (NLOS) transceiver pairs, and ii) secondary (backup) communication path for line-of-sight (LOS) or NLOS transceiver pairs.
Edit intent: clarity
Original:  In this paper, we consider the problem of robust reflector placement in 60GHz WPANs. Reflectors relay traffic from transmitter devices to receiver devices facilitating i) the primary communication path for non-line-of-sight (NLOS) transceiver pairs, and ii) secondary (backup) communication path for line-of-sight (LOS) or NLOS transceiver pairs.
Revised:  In this paper, we consider the problem of robust reflector placement in 60GHz WPANs. Reflectors relay traffic from transmitter devices to receiver devices facilitating i) the primary communication path for non-line-of-sight (NLOS) transceiver pairs, and ii) secondary (backup) communication path for line-of-sight (LOS) transceiver pairs.
Edit intent: clarity
Original:  We formulate the robust minimum reflector placement problem and the robust maximum utility reflector placement problem with the objective to minimize the number of reflectors deployed and maximize the network utility, respectively.
Revised:  We formulate the robust minimum relay placement problem and the robust maximum utility reflector placement problem with the objective to minimize the number of reflectors deployed and maximize the network utility, respectively.
Edit intent: fluency