wanyu/IteraTeR_v2 huggingface dataset:
Original:  The statistics of the HV behaviors were modified to generate more intense interactions between HVs and AVs to accelerate the evaluation procedure.
Revised:  The statistics of the HV behaviors are then modified to generate more intense interactions between HVs and AVs to accelerate the evaluation procedure.
Edit intent: coherence
Original:  Results show that the test duration is reduced by a factor of 300 to 100,000 compared with the non-accelerated (naturalistic) evaluation.
Revised:  Results show that test duration is reduced by a factor of 300 to 100,000 compared with the non-accelerated (naturalistic) evaluation.
Edit intent: fluency
Original:  In other words, the proposed techniques have great potential to accelerate the AV evaluation process.
Revised:  In other words, the proposed techniques have great potential for accelerating the AV evaluation process.
Edit intent: fluency
Original:  Online vmoBCI experiments are conducted in an oddball  paradigm allowing for  aha-responses  decoding in EEG brainwaves.
Revised:  Online vmoBCI experiments are conducted in an oddball paradigm allowing for " aha-responses decoding in EEG brainwaves.
Edit intent: fluency
Original:  Online vmoBCI experiments are conducted in an oddball  paradigm allowing for  aha-responses  decoding in EEG brainwaves.
Revised:  Online vmoBCI experiments are conducted in an oddball paradigm allowing for aha-responses " decoding in EEG brainwaves.
Edit intent: fluency
Original:  A subsequent stepwise linear discriminant analysis classification (swLDA) classification accuracies comparison is discussed based on two inter-stimulus-interval (ISI) settings of 700 and 150 ms in two online vmoBCI applications with six and eight command settings.
Revised:  A subsequent stepwise linear discriminant analysis classification (swLDA) classification accuracy comparison is discussed based on two inter-stimulus-interval (ISI) settings of 700 and 150 ms in two online vmoBCI applications with six and eight command settings.
Edit intent: fluency
Original:  A research hypothesis of classification accuracies nonsignificant differences with various ISIs is confirmed based on the two settings of 700 ms and 150 ms, as well as with various numbers of ERP response averaging scenarios.
Revised:  A research hypothesis of classification accuracy non-significant differences with various ISIs is confirmed based on the two settings of 700 ms and 150 ms, as well as with various numbers of ERP response averaging scenarios.
Edit intent: fluency
Original:  The efferent in respect to display center visual motion patterns allowed for  faster interfacing and thus they are recommended as more suitable for the BCI .
Revised:  The efferent in respect to display center visual motion patterns allowed for a faster interfacing and thus they are recommended as more suitable for the BCI .
Edit intent: fluency
Original:  We investigate an interrelations between violator spaces and closure spaces and show that violator spaces may be defined by a week version of closure operators.
Revised:  We investigate an interrelations between violator spaces and closure spaces and show that violator mapping may be defined by a week version of closure operators.
Edit intent: clarity
Original:  Here, we have examined this significance in filling-in  of bar stimuli (expanding bar, misaligned bar and rotating bar in cardinal configuration) in a model network in the framework of Hierarchical Predictive Coding scheme.
Revised:  Here, we have examined this significance in filling-in of bar stimuli on a Hierarchical Predictive Coding scheme.
Edit intent: clarity
Original:  For example, receiving more citations is granted in 90 %DIFDELCMD < \\%%% %DIF < of the cases only if the IF ratio is greater than %DIFDELCMD < \sim6%%% , while targeting a journal with an IF 2\times higher than another brings in marginal citation benefit .
Revised:  For example, receiving more citations is granted in 90 %DIFDELCMD < \\%%% %DIF < of \% only if the IF ratio is greater than %DIFDELCMD < \sim6%%% , while targeting a journal with an IF 2\times higher than another brings in marginal citation benefit .
Edit intent: clarity
Original:  For example, receiving more citations is granted in 90 %DIFDELCMD < \\%%% %DIF < of the cases only if the IF ratio is greater than %DIFDELCMD < \sim6%%% , while targeting a journal with an IF 2\times higher than another brings in marginal citation benefit .
Revised:  For example, receiving more citations is granted in 90 %DIFDELCMD < \\%%% %DIF < of the cases only if the ratio of their IFs is greater than %DIFDELCMD < \sim6%%% , while targeting a journal with an IF 2\times higher than another brings in marginal citation benefit .
Edit intent: clarity
Original: In this paper we present a new measure, "citation benefit ", which quantifies the probability that a random paper in journal A has more citations than a random paper in journal B (50\% means no benefit), and therefore provides an intuitive way to compare journals ' citation capacity.
Revised: In this paper we present "citation benefit ", which quantifies the probability that a random paper in journal A has more citations than a random paper in journal B (50\% means no benefit), and therefore provides an intuitive way to compare journals ' citation capacity.
Edit intent: clarity
Original: In this paper we present a new measure, "citation benefit ", which quantifies the probability that a random paper in journal A has more citations than a random paper in journal B (50\% means no benefit), and therefore provides an intuitive way to compare journals ' citation capacity.
Revised: In this paper we present a new measure, "citation benefit ", which quantifies the probability that a random paper in one journal has more citations than a random paper in journal B (50\% means no benefit), and therefore provides an intuitive way to compare journals ' citation capacity.
Edit intent: clarity
Original: In this paper we present a new measure, "citation benefit ", which quantifies the probability that a random paper in journal A has more citations than a random paper in journal B (50\% means no benefit), and therefore provides an intuitive way to compare journals ' citation capacity.
Revised: In this paper we present a new measure, "citation benefit ", which quantifies the probability that a random paper in journal A has more citations than a random paper in another journal (50\% means no benefit), and therefore provides an intuitive way to compare journals ' citation capacity.
Edit intent: clarity
Original:  We calculated the citation benefit for 16,000 journals containing ~ 2.5 million articlesand showed that the citation benefit is a tight, universal function of the ratio of the IFs of the journals being compared .
Revised:  We calculated the citation benefit for 16,000 journals containing ~ 2.5 million articlesand showed that the citation success index is a relatively tight function of the ratio of the IFs of the journals being compared .
Edit intent: clarity
Original:  We calculated the citation benefit for 16,000 journals containing ~ 2.5 million articlesand showed that the citation benefit is a tight, universal function of the ratio of the IFs of the journals being compared .
Revised:  We calculated the citation benefit for 16,000 journals containing ~ 2.5 million articlesand showed that the citation benefit is a tight, universal function of the ratio of IFs of journals being compared .
Edit intent: fluency
Original:  The tightness of the correlation is a consequence of the fact that journals having the same IF have very similar citation distributions.
Revised:  The tightness of the correlation is a consequence of the fact that journals with same IF have very similar citation distributions.
Edit intent: fluency
Original:  The citation benefit grows slowly as a function of the ratio of their IF values.
Revised:  The citation success index grows slowly as a function of the ratio of their IF values.
Edit intent: clarity
Original:  For example, the citation benefit of one journal over another is more than 90\% only if the ratio of their IFs is greater than ~6, while the factor of two difference in IF values translates into a modest citation benefit ( ~70\%).
Revised:  For example, the citation benefit of one journal over another is more than 90\% ) only when the ratio of their IFs is greater than ~6, while the factor of two difference in IF values translates into a modest citation benefit ( ~70\%).
Edit intent: clarity
Original:  For example, the citation benefit of one journal over another is more than 90\% only if the ratio of their IFs is greater than ~6, while the factor of two difference in IF values translates into a modest citation benefit ( ~70\%).
Revised:  For example, the citation benefit of one journal over another is more than 90\% only if the ratio of IFs exceeds ~6, while the factor of two difference in IF values translates into a modest citation benefit ( ~70\%).
Edit intent: clarity
Original:  For example, the citation benefit of one journal over another is more than 90\% only if the ratio of their IFs is greater than ~6, while the factor of two difference in IF values translates into a modest citation benefit ( ~70\%).
Revised:  For example, the citation benefit of one journal over another is more than 90\% only if the ratio of their IFs is greater than ~6, whereas a factor of two difference in IF values translates into a modest citation benefit ( ~70\%).
Edit intent: coherence
Original:  For example, the citation benefit of one journal over another is more than 90\% only if the ratio of their IFs is greater than ~6, while the factor of two difference in IF values translates into a modest citation benefit ( ~70\%).
Revised:  For example, the citation benefit of one journal over another is more than 90\% only if the ratio of their IFs is greater than ~6, while the factor of two difference in IF values translates into a modest advantage for the journal with higher IF (index of ~70\%).
Edit intent: clarity
Original:  We present a formula to calculate the citation benefit from IFs alone, and implement it in an online calculator  .
Revised:  We facilitate the wider adoption of this metric by providing an online calculator .
Edit intent: clarity
Original: We propose a hydrodynamic theory to describe shear flows in developing epithelial tissues.
Revised: We present a hydrodynamic theory to describe shear flows in developing epithelial tissues.
Edit intent: fluency
Original:  We show that anisotropic deformation of tissue and cells can arise from two distinct active cellular processes: generation of active stress in the tissue, and actively driven cellular rearrangements.
Revised:  We identify two distinct active cellular processes: generation of active stress in the tissue, and actively driven cellular rearrangements.
Edit intent: clarity
Original:  These two active processes result in distinct cellular and tissue shape changes, depending on boundary conditions applied on the tissue.
Revised:  These two active processes can produce distinct cellular and tissue shape changes, depending on boundary conditions applied on the tissue.
Edit intent: clarity
Original: In this paper we study the construction of minimum cost geometric spanning graphs on a rooted point set P where we insist that the sought graphs satisfy a given property.
Revised: We study the construction of minimum cost geometric spanning graphs on a rooted point set P where we insist that the sought graphs satisfy a given property.
Edit intent: clarity
Original: In this paper we study the construction of minimum cost geometric spanning graphs on a rooted point set P where we insist that the sought graphs satisfy a given property.
Revised: In this paper we study the construction of the minimum cost spanning geometric graph of a given rooted point set P where we insist that the sought graphs satisfy a given property.
Edit intent: clarity
Original: In this paper we study the construction of minimum cost geometric spanning graphs on a rooted point set P where we insist that the sought graphs satisfy a given property.
Revised: In this paper we study the construction of minimum cost geometric spanning graphs on a rooted point set P where each point of P is connected to the root by a path that satisfies a given property.
Edit intent: clarity
Original:  A rooted point set is a point set having one of its points, say r, designated as its root.
Edit intent: clarity
Original:  We focus on the property of monotonicity w.r.t. a single direction (y-monotonicity) , or w.r.t. a  pair of orthogonal directions (xy-monotonicity).
Revised:  We focus on the property of monotonicity w.r.t. a single direction (y-monotonicity) and the monotonicity w.r.t. a pair of orthogonal directions (xy-monotonicity).
Edit intent: clarity
Original:  We focus on the property of monotonicity w.r.t. a single direction (y-monotonicity) , or w.r.t. a  pair of orthogonal directions (xy-monotonicity).
Revised:  We focus on the property of monotonicity w.r.t. a single direction (y-monotonicity) , or w.r.t. a single pair of orthogonal directions (xy-monotonicity).
Edit intent: fluency
Original:  We present algorithms that , given a rooted point set P, compute the rooted y-monotone and rooted xy-monotone  minimum spanning tree  in O(|P| ^2) time when the directions of monotonicity are given, and in O(|P|^2\log|P|) time when the optimum directions have to be determined.
Revised:  We present algorithms that , given a rooted point set P, compute the rooted y-monotone ( xy-monotone minimum spanning tree in O(|P| ^2) time when the directions of monotonicity are given, and in O(|P|^2\log|P|) time when the optimum directions have to be determined.
Edit intent: coherence
Original:  We present algorithms that , given a rooted point set P, compute the rooted y-monotone and rooted xy-monotone  minimum spanning tree  in O(|P| ^2) time when the directions of monotonicity are given, and in O(|P|^2\log|P|) time when the optimum directions have to be determined.
Revised:  We present algorithms that , given a rooted point set P, compute the rooted y-monotone and rooted xy-monotone ) minimum spanning tree in O(|P| ^2) time when the directions of monotonicity are given, and in O(|P|^2\log|P|) time when the optimum directions have to be determined.
Edit intent: fluency
Original:  We present algorithms that , given a rooted point set P, compute the rooted y-monotone and rooted xy-monotone  minimum spanning tree  in O(|P| ^2) time when the directions of monotonicity are given, and in O(|P|^2\log|P|) time when the optimum directions have to be determined.
Revised:  We present algorithms that , given a rooted point set P, compute the rooted y-monotone and rooted xy-monotone minimum spanning tree of P in O(|P| ^2) time when the directions of monotonicity are given, and in O(|P|^2\log|P|) time when the optimum directions have to be determined.
Edit intent: clarity
Original:  We also present simple algorithms that decide whether a given geometric graph on a rooted point set is rooted y-monotone or rooted xy-monotone .
Revised:  We also give simple algorithms which, given a rooted y-monotone or rooted xy-monotone .
Edit intent: clarity
Original:  In this work, we measure the inter-site bias in connectivity and its impact on our ability to detect individual and group differences.
Revised:  In this work, we measure the inter-site effect in connectivity and its impact on our ability to detect individual and group differences.
Edit intent: clarity
Original:  We first empirically show that typical functional networks were reliably found at the group level in all sites, and that the amplitude of the inter-site bias was small to moderate, with a Cohen's effect size below 0.5 on average across brain connections.
Revised:  We first empirically show that typical functional networks were reliably found at the group level in all sites, and that the amplitude of the inter-site effects was small to moderate, with a Cohen's effect size below 0.5 on average across brain connections.
Edit intent: clarity
Original:  We then implemented a series of Monte-Carlo simulations, based on real data, to evaluate the impact of the multisite bias on detection power in statistical tests comparing two groups (with and without the effect) using a general linear model, as well as on the prediction of group labels with a support-vector machine.
Revised:  We then implemented a series of Monte-Carlo simulations, based on real data, to evaluate the impact of the multisite effects on detection power in statistical tests comparing two groups (with and without the effect) using a general linear model, as well as on the prediction of group labels with a support-vector machine.
Edit intent: clarity
Original:  Simulations revealed that using data from heterogeneous sites only slightly decreased our ability to detect changes compared to a monosite study with the GLM, and had a more serious impact on prediction accuracy.
Revised:  Simulations revealed that using data from heterogeneous sites only slightly decreased our ability to detect changes compared to a monosite study with the GLM, and had a greater impact on prediction accuracy.
Edit intent: clarity
Original:  However, the deleterious effect of multisite data pooling tended to decrease as the total sample size increased, to a point where differences between monosite and multisite simulations were small with N=120 subjects.
Edit intent: coherence
Original:  Taken together, our results support the feasibility of multisite studies in rs-fMRI provided  sample size is large enough.
Revised:  Taken together, our results support the feasibility of multisite studies in rs-fMRI provided the sample size is large enough.
Edit intent: fluency
Original: We present Lifty, a language that uses type-driven program repair to enforce information flow policies.
Revised: We present a technique for static enforcement of high-level, declarative information flow policies.
Edit intent: clarity
Original:  Our experience using Lifty to implement a conference management system shows that it decreases policy burden and is able to efficiently synthesize all necessary access checks, including those required to prevent a set of reported real-world information leaks.
Revised:  Our experience using Lifty to implement a conference management system shows that it decreases policy burden and is able to efficiently synthesize all necessary policy-enforcing code, including the code required to prevent a set of reported real-world information leaks.
Edit intent: clarity
Original:  Our experience using Lifty to implement a conference management system shows that it decreases policy burden and is able to efficiently synthesize all necessary access checks, including those required to prevent a set of reported real-world information leaks.
Revised:  Our experience using Lifty to implement a conference management system shows that it decreases policy burden and is able to efficiently synthesize all necessary access checks, including those required to prevent several reported real-world information leaks.
Edit intent: clarity
Original:  Our experience using the DSL to implement three case studies  shows that (1) Lifty's centralized, declarative policy definitions make it easier to write secure data-centric applications, and (2) the Lifty compiler is able to efficiently synthesize all necessary policy-enforcing code, including the code required to prevent several reported real-world information leaks .
Revised:  Our experience using Lifty to implement three case studies shows that (1) Lifty's centralized, declarative policy definitions make it easier to write secure data-centric applications, and (2) the Lifty compiler is able to efficiently synthesize all necessary policy-enforcing code, including the code required to prevent several reported real-world information leaks .
Edit intent: clarity
Original: We study k-SVD that is to obtain the first k singular vectors of a matrix A approximately .
Revised: We study k-SVD that is to obtain the first k singular vectors of a matrix A .
Edit intent: clarity
Original:  Recently, a few breakthroughs have been discovered on k-SVD: Musco and Musco [1] provided the first gap-free theorem for the block Krylov method, Shamir [2] discovered the first variance-reduction stochastic method, and Bhojanapalli et al.
Revised:  Recently, a few breakthroughs have been discovered on k-SVD: Musco and Musco [1] proved the first gap-free theorem for the block Krylov method, Shamir [2] discovered the first variance-reduction stochastic method, and Bhojanapalli et al.
Edit intent: clarity
Original:  [3] provided the fastest O(nnz(A) + poly(1/\varepsilon)) -type of algorithm using alternating minimization.
Revised:  [3] provided the fastest O(nnz(A) + poly(1/\varepsilon)) -time algorithm using alternating minimization.
Edit intent: clarity
Original:  In this paper,  put forward a new framework for SVD and improve the above breakthroughs.
Revised:  In this paper, we put forward a new framework for SVD and improve the above breakthroughs.
Edit intent: fluency
Original:  We obtain faster gap-free convergence rate outperforming [1], we obtain the first accelerated AND stochastic method outperforming [2].
Revised:  We obtain faster gap-free method outperforming [1], we obtain the first accelerated AND stochastic method outperforming [2].
Edit intent: clarity
Original:  We obtain faster gap-free convergence rate outperforming [1], we obtain the first accelerated AND stochastic method outperforming [2].
Revised:  We obtain faster gap-free convergence rate outperforming [1], and the first accelerated AND stochastic method outperforming [2].
Edit intent: coherence
Original:  We obtain faster gap-free convergence rate outperforming [1], we obtain the first accelerated AND stochastic method outperforming [2].
Revised:  We obtain faster gap-free convergence rate outperforming [1], we obtain the first accelerated and stochastic method outperforming [2].
Edit intent: fluency
Original: The game of cops and robber is a two-player game , played on a  graph, between a cop and a robber.
Revised: We investigate the game of cops and robber is a two-player game , played on a graph, between a cop and a robber.
Edit intent: coherence
Original: The game of cops and robber is a two-player game , played on a  graph, between a cop and a robber.
Revised: The game of cops and robber , played on a graph, between a cop and a robber.
Edit intent: clarity
Original:  Roughly speaking, in a Lower Way strategy, the cop pushes the robber down to lower ranked vertices, while in a Higher Way strategy, the robber moves to a highest rank vertex that is ``safe.'' While interesting in their own right, the strategies are themselves tools in our proofs.
Revised:  Roughly speaking, in a Lower Way strategy, the cop pushes the robber down to lower ranked vertices, while in a Higher Way strategy, the robber moves to a highest rank vertex that is "safe." While interesting in their own right, the strategies are themselves tools in our proofs.
Edit intent: fluency
Original:  Based on this analysis we propose Recurrent Highway Networks (RHN) , which are long not only in time but also in space, generalizing LSTMs to larger step-to-step depths.
Revised:  Based on this analysis we propose Recurrent Highway Networks , which are long not only in time but also in space, generalizing LSTMs to larger step-to-step depths.
Edit intent: clarity
Original:  However, recurrent neural networks with such 'deep' transition functions remain difficult to train, even when using Long Short-Term Memory  networks.
Revised:  However, recurrent neural networks with 'deep' transition functions remain difficult to train, even when using Long Short-Term Memory networks.
Edit intent: clarity
Original:  However, recurrent neural networks with such 'deep' transition functions remain difficult to train, even when using Long Short-Term Memory  networks.
Revised:  However, recurrent neural networks with such 'deep' transition functions remain difficult to train, even when using Long Short-Term Memory (LSTM) networks.
Edit intent: clarity