wanyu/IteraTeR_v2 huggingface dataset:
Original:  The paper then suggests that the concepts are neuron-based and firing neurons are concept instances .
Revised:  The paper then suggests that concepts are neuron groups that link features and concept instances are the signals from those groups .
Edit intent: clarity
Original:  Therefore, features become the static framework of the interconnected neural system and concepts are combinations of these, as determined by an external stimulus and the neural associations .
Revised:  Therefore, features become the static framework of the interconnected neural system and concepts are combinations of these, as determined by the external stimulus and the neural associations .
Edit intent: fluency
Original:  Therefore, features become the static framework of the interconnected neural system and concepts are combinations of these, as determined by an external stimulus and the neural associations .
Revised:  Therefore, features become the static framework of the interconnected neural system and concepts are combinations of these, as determined by an external stimulus and the neural synaptic strengths .
Edit intent: clarity
Original: For mmWave networks, this paper proposes an image-to-decision proactive handover framework, which directly maps camera images to a handover decision .
Revised: For millimeter-wave networks, this paper proposes an image-to-decision proactive handover framework, which directly maps camera images to a handover decision .
Edit intent: clarity
Original:  The evaluations based on experimentally obtained camera images and received powers indicate that the learned handover policy in the proposed framework outperforms the learned policy in a received power-based handover framework .
Revised:  The evaluations performed based on the experimentally obtained camera images and received powers indicate that the learned handover policy in the proposed framework outperforms the learned policy in a received power-based handover framework .
Edit intent: clarity
Original:  We, finally, simulate the loop dynamics at room temperature, and show that the twist waves are robust against thermal fluctuations , and perform a normal diffusive motion, whose origin is briefly discussed.
Revised:  We, finally, analyze the loop dynamics at room temperature, and show that the twist waves are robust against thermal fluctuations , and perform a normal diffusive motion, whose origin is briefly discussed.
Edit intent: clarity
Original:  We, finally, simulate the loop dynamics at room temperature, and show that the twist waves are robust against thermal fluctuations , and perform a normal diffusive motion, whose origin is briefly discussed.
Revised:  We, finally, simulate the loop dynamics at room temperature, and show that the twist waves are robust against thermal fluctuations . They perform a normal diffusive motion, whose origin is briefly discussed.
Edit intent: coherence
Original:  The key to the proof is a new structural tool called layered H-partitions , and the result that every planar graph has such a partition of bounded layered width in which H has bounded treewidth.
Revised:  The key to the proof is a new structural tool called layered partitions , and the result that every planar graph has such a partition of bounded layered width in which H has bounded treewidth.
Edit intent: clarity
Original:  The key to the proof is a new structural tool called layered H-partitions , and the result that every planar graph has such a partition of bounded layered width in which H has bounded treewidth.
Revised:  The key to the proof is a new structural tool called layered H-partitions , and the result that every planar graph has a partition of bounded layered width in which H has bounded treewidth.
Edit intent: clarity
Original:  These results generalise for graphs of bounded Euler genus  .
Revised:  This result generalises for graphs of bounded Euler genus .
Edit intent: fluency
Original:  In this paper, we evaluate the performance of Event-Driven Random Backpropagation (eRBP) at learning representations from event streams provided by a Dynamic Vision Sensor (DVS).
Revised:  In this paper, we evaluate the performance of Event-Driven Random Back-Propagation (eRBP) at learning representations from event streams provided by a Dynamic Vision Sensor (DVS).
Edit intent: fluency
Original:  First, we show that eRBP matches state-of-the-art performance on DvsGesture with the addition of a simple covert attention mechanism.
Revised:  First, we show that eRBP matches state-of-the-art performance on the DvsGesture dataset with the addition of a simple covert attention mechanism.
Edit intent: clarity
Original:  Second, we successfully integrate eRBP in a real robotic setup, where a robotic arm grasps objects with respect to detected visual affordances.
Revised:  Second, we successfully integrate eRBP in a real robotic setup, where a robotic arm grasps objects according to detected visual affordances.
Edit intent: clarity
Original:  We show that our method quickly classifies affordances within 100ms after microsaccade onset,  comparable to human performance reported in behavioral study.
Revised:  We show that our method classifies affordances within 100ms after microsaccade onset, comparable to human performance reported in behavioral study.
Edit intent: clarity
Original:  We show that our method quickly classifies affordances within 100ms after microsaccade onset,  comparable to human performance reported in behavioral study.
Revised:  We show that our method quickly classifies affordances within 100ms after microsaccade onset, which is comparable to human performance reported in behavioral study.
Edit intent: coherence
Original:  Our results suggest that advances in neuromorphic technology and plasticity rules enable the development of autonomous robots operating at high speed and low energy budget .
Revised:  Our results suggest that advances in neuromorphic technology and plasticity rules enable the development of autonomous robots operating at high speed and low energy consumption .
Edit intent: clarity
Original:  We then illustrate this approach on a realistic model wireless network of 34 nodes and 104 links and identify a critical bottleneck .
Revised:  We illustrate the technique by identifying a critical bottleneck in a realistic model wireless network of 34 nodes and 104 links and identify a critical bottleneck .
Edit intent: clarity
Original:  We then illustrate this approach on a realistic model wireless network of 34 nodes and 104 links and identify a critical bottleneck .
Revised:  We then illustrate this approach on a realistic model wireless network .
Edit intent: coherence
Original:  We compare FMNs to conventional communication topologies, and find that FMNs offer favorable communication performance in addition to their intrinsic advantages for mobility.
Revised:  We compare FMNs to conventional communication topologies, and find that FMNs offer competitive communication performance in addition to their intrinsic advantages for mobility.
Edit intent: clarity
Original: Two fundamental prerequisites for robotic multiagent systems are mobility and communication.
Revised: Two prerequisites for robotic multiagent systems are mobility and communication.
Edit intent: clarity
Original:  We proposefast multipole networks (FMNs) to achieve both ends within a unified framework.
Revised:  fast multipole networks (FMNs) to achieve both ends within a unified framework.
Edit intent: clarity
Original:  We proposefast multipole networks (FMNs) to achieve both ends within a unified framework.
Revised:  We proposeFast multipole networks (FMNs) to achieve both ends within a unified framework.
Edit intent: fluency
Original:  We proposefast multipole networks (FMNs) to achieve both ends within a unified framework.
Revised:  We proposefast multipole networks (FMNs) enable both ends within a unified framework.
Edit intent: clarity
Original:  We compare FMNs to conventional communication topologies, and find that FMNs offer competitive communication performance  in addition to their intrinsic advantages for mobility.
Revised:  We compare FMNs to conventional communication topologies, and find that FMNs offer competitive communication performance in addition to advantages for mobility.
Edit intent: clarity
Original:  We have developed Unwind in collaboration with a team of marine biologists .
Revised:  We have developed Unwind in collaboration with a team of marine biologists :
Edit intent: fluency
Original: Monte Carlo Simulations of agent-based models in science and especially in the economic literature have become a widely used modeling approach.
Revised: In science and especially in the economic literature have become a widely used modeling approach.
Edit intent: clarity
Original: Monte Carlo Simulations of agent-based models in science and especially in the economic literature have become a widely used modeling approach.
Revised: Monte Carlo Simulations of agent-based models in science and especially in the economic literature , agent-based modeling has become a widely used modeling approach.
Edit intent: clarity
Original:  In many applications the number of agents is huge and the models are formulated as a large system of difference equations.
Revised:  These models are often formulated as a large system of difference equations.
Edit intent: clarity
Original:  In this study we discuss four numerical aspects which we present exemplified by two agent-based computational economic market models ;
Revised:  In this study , we discuss two aspects of numerical modeling for two agent-based computational economic market models ;
Edit intent: clarity
Original:  In this study we discuss four numerical aspects which we present exemplified by two agent-based computational economic market models ;
Revised:  In this study we discuss four numerical aspects which we present exemplified by two agent-based computational economic market models :
Edit intent: fluency
Original: In science and especially in the economic literature , agent-based modeling has become a widely used modeling approach.
Revised: In science and especially in economics , agent-based modeling has become a widely used modeling approach.
Edit intent: clarity
Original:  We derive time-continuous formulations of both models and, for the Levy-Levy-Solomon model, we discuss the impact of the time-scaling on the model behavior  .
Revised:  We derive time-continuous formulations of both models , and in particular we discuss the impact of the time-scaling on the model behavior .
Edit intent: clarity
Original: We modified the Lotka-Volterra Equations with the assumption that two of the original four constant parameters in the traditional equations are time dependent .
Revised: We modified the Lotka-Volterra Equations with the assumption that two of the original four constant parameters in the traditional equations are time-dependent .
Edit intent: fluency
Original:  Although we could still calculate the time-dependent lethal function, the idea of treating the lethal factors as the prey was too general to recognize the meaning of the lethal factors .
Revised:  Although we could still calculate the time-dependent lethal function, the idea of treating the lethal factors as the prey was too general to recognize the meaning of them .
Edit intent: clarity
Original:  After carefully choosing appropriate parameters to match the maximum carrying capability with the saturated number of  human population predicted by the T-Function, we successfully calculated the natural resources as a function of time.
Revised:  After carefully choosing appropriate parameters to match the maximum carrying capacity with the saturated number of human population predicted by the T-Function, we successfully calculated the natural resources as a function of time.
Edit intent: fluency
Original:  After carefully choosing appropriate parameters to match the maximum carrying capability with the saturated number of  human population predicted by the T-Function, we successfully calculated the natural resources as a function of time.
Revised:  After carefully choosing appropriate parameters to match the maximum carrying capability with the saturated number of the human population predicted by the T-Function, we successfully calculated the natural resources as a function of time.
Edit intent: fluency
Original:  Contrary to our intuition, the carrying capacity is constant over time rather than a time-varing function, with the constant value of 10.2 billion people.
Revised:  Contrary to our intuition, the carrying capacity is constant over time rather than a time-varying function, with the constant value of 10.2 billion people.
Edit intent: clarity
Original:  Examples include call dropping in cellular networks, difficulties with task migration in mobile cloud computing, and depleted stock points in spare parts supply chains.
Revised:  Examples include call dropping in cellular networks, difficulties with task migration in mobile cloud computing, and spare parts supply chains.
Edit intent: clarity
Original:  Although this works well for small instances,  the associated computational costs are prohibitive for networks of real-life size.
Revised:  Although this works well for small instances, but the associated computational costs are prohibitive for networks of real-life size.
Edit intent: fluency
Original:  In this paper we propose a hybrid functional-form based approach that combines the strengths of the analytical and simulation-based approaches into a novel iterative algorithm.
Revised:  In this paper we propose a hybrid functional-form based approach for finding the optimal resource allocation, combining the speed of an analytical approach with the accuracy of simulation-based approaches into a novel iterative algorithm.
Edit intent: clarity
Original: The main objective of this paper is to introduce and study a notion of perfectness for discrete gradient vector fields with respect to ( multi-parameter ) persistent homology .
Revised: The main objective of this paper is to introduce and study a notion of perfectness for discrete gradient vector fields with respect to multi-parameter ) persistent homology .
Edit intent: fluency
Original:  The former also implies a Herbrand-style conclusion that e.g. a given formula S=%DIFDELCMD < \left\langle %%% P^{\ast}%DIFDELCMD < \right\rangle %%% \!
Revised:  The former also implies standard Herbrand-style conclusion that e.g. a given formula S=%DIFDELCMD < \left\langle %%% P^{\ast}%DIFDELCMD < \right\rangle %%% \!
Edit intent: clarity
Original:  The former also implies a Herbrand-style conclusion that e.g. a given formula S=%DIFDELCMD < \left\langle %%% P^{\ast}%DIFDELCMD < \right\rangle %%% \!
Revised:  The former also implies a Herbrand-style %DIFDELCMD < \left\langle %%% P^{\ast}%DIFDELCMD < \right\rangle %%% \!
Edit intent: clarity
Original: A\vee Z for star-free A and Z\ is valid in PDL iff there is a k\geq 0 and a cut- and omega-rule-free derivation of sequent A,%DIFDELCMD < \left\langle %%% P%DIFDELCMD < \right\rangle %DIFDELCMD < %%% ^{1\!\!
Revised: A\vee Z for star-free A and Z\ is valid in PDL iff there is a k\geq 0 and a cut- and omega-rule-free derivation of sequent A,%DIFDELCMD < \left\langle %%% %DIFDELCMD < \right\rangle %DIFDELCMD < %%% ^{1\!\!
Edit intent: coherence
Original: A\vee Z for star-free A and Z\ is valid in PDL iff there is a k\geq 0 and a cut- and omega-rule-free derivation of sequent A,%DIFDELCMD < \left\langle %%% P%DIFDELCMD < \right\rangle %DIFDELCMD < %%% ^{1\!\!
Revised: A\vee Z for star-free A and Z\ is valid in PDL iff there is a k\geq 0 and a cut- and omega-rule-free derivation of sequent A,%DIFDELCMD < \left\langle %%% P%DIFDELCMD < \right\rangle %DIFDELCMD < %%% \!\!
Edit intent: coherence
Original: A,\cdots,}%DIFDELCMD < \left\langle %%% P%DIFDELCMD < \right\rangle %%% ^{k\!\!
Revised: A,\cdots,}%DIFDELCMD < \left\langle %%% %DIFDELCMD < \right\rangle %%% ^{k\!\!
Edit intent: fluency
Original: A,B where }%DIFDELCMD < \left\langle %DIFDELCMD < %%% P%DIFDELCMD < \right\rangle%%% ^{i\!
Revised: A,B where }%DIFDELCMD < \left\langle %DIFDELCMD < %%% %DIFDELCMD < \right\rangle%%% ^{i\!
Edit intent: coherence
Original: A,B where }%DIFDELCMD < \left\langle %DIFDELCMD < %%% P%DIFDELCMD < \right\rangle%%% ^{i\!
Revised: A,B where }%DIFDELCMD < \left\langle %DIFDELCMD < %%% P%DIFDELCMD < \right\rangle%%% \!
Edit intent: coherence
Original: A is an abbreviation for }%DIFDELCMD < \underset{i\ %DIFDELCMD < times}{\underbrace{\left\langle P\right\rangle \cdots \left\langle %DIFDELCMD < P\right\rangle }}%%% A. This eventually leads to PSPACE-decidability of PDL-validity of S, provided that P is atomic and A is in a suitable basic conjunctive normal form.
Revised: A is an abbreviation for }%DIFDELCMD < \underset{i\ %DIFDELCMD < times}{\underbrace{\left\langle P\right\rangle \cdots \left\langle %DIFDELCMD < P\right\rangle }}%%% conclusions, which eventually leads to PSPACE-decidability of PDL-validity of S, provided that P is atomic and A is in a suitable basic conjunctive normal form.
Edit intent: fluency
Original:  We show that cutfree-derivability in Seq_\omega^{pdl} (hence PDL-validity) of such S\ is equivalent to plain validity of a suitable ``transparent'' quantified boolean formula \widehat{S} . Hence EXPTIME = PSPACE holds true iff the validity problem for any%DIFDELCMD < \widehat{S} %%% involved is solvable by a polynomial-space deterministic TM.
Revised:  We show that cutfree-derivability in Seq_\omega^{pdl} (hence PDL-validity) of such S\ is equivalent to plain validity of a suitable "transparent" quantified boolean formula \widehat{S} . Hence EXPTIME = PSPACE holds true iff the validity problem for any%DIFDELCMD < \widehat{S} %%% involved is solvable by a polynomial-space deterministic TM.
Edit intent: fluency
Original:  We show that cutfree-derivability in Seq_\omega^{pdl} (hence PDL-validity) of such S\ is equivalent to plain validity of a suitable ``transparent'' quantified boolean formula \widehat{S} . Hence EXPTIME = PSPACE holds true iff the validity problem for any%DIFDELCMD < \widehat{S} %%% involved is solvable by a polynomial-space deterministic TM.
Revised:  We show that cutfree-derivability in Seq_\omega^{pdl} (hence PDL-validity) of such S\ is equivalent to plain validity of a suitable ``transparent'' quantified boolean formula \widehat{S} %DIFDELCMD < \widehat{S} %%% involved is solvable by a polynomial-space deterministic TM.
Edit intent: clarity
Original:  These are examples that have undergone a small, carefully crafted perturbation , and which can easily fool a DNN into making misclassifications at test time.
Revised:  These are examples that have undergone small, carefully crafted perturbation , and which can easily fool a DNN into making misclassifications at test time.
Edit intent: fluency
Original:  These are examples that have undergone a small, carefully crafted perturbation , and which can easily fool a DNN into making misclassifications at test time.
Revised:  These are examples that have undergone a small, carefully crafted perturbations , and which can easily fool a DNN into making misclassifications at test time.
Edit intent: fluency
Original:  In particular, V-BAD utilizestentative perturbations transferred from image models, and partition-based rectifications found by the NES on partitions (patches) of tentative perturbations, to obtain good adversarial gradient estimates with fewer queries to the target model.
Revised:  In particular, V-BAD utilizesutilizes tentative perturbations transferred from image models, and partition-based rectifications found by the NES on partitions (patches) of tentative perturbations, to obtain good adversarial gradient estimates with fewer queries to the target model.
Edit intent: clarity
Original:  In particular, V-BAD utilizestentative perturbations transferred from image models, and partition-based rectifications found by the NES on partitions (patches) of tentative perturbations, to obtain good adversarial gradient estimates with fewer queries to the target model.
Revised:  In particular, V-BAD utilizestentative perturbations transferred from image models, and partition-based rectifications found by the NES on partitions (patches) of tentative perturbations, to obtain good adversarial gradient estimates with fewer queries to the target model.
Edit intent: fluency
Original:  We give an O(n^2) algorithm for one dimensional MMDC problem 
Revised:  We give an O(n^2) algorithm for one dimensional MMDC problem .
Edit intent: fluency
Original:  We give an O(n^2) time algorithm for the minimum cost one dimensional MMDC  problem.
Revised:  We give an O(n^2) time algorithm for the minimum-cost one dimensional MMDC problem.
Edit intent: fluency
Original:  We propose a novel and very efficient algorithm for the preference re-ranking considering the uncertainty regarding the payoffs of the items.
Revised:  We propose a novel and very efficient algorithm for the preference ranking considering the uncertainty regarding the payoffs of the items.
Edit intent: clarity
Original:  Once the preference scores for the users are obtained using any preference learning algorithm, we show that re-ranking the items using a risk seeking utility function results in the best ranking performance.
Revised:  Once the preference scores for the users are obtained using any preference learning algorithm, we show that ranking the items using a risk seeking utility function results in the best ranking performance.
Edit intent: clarity
Original: In this work, we explore the effects of flavour on the quality of recommendations.
Revised: We propose a mechanism to use the features of flavour to enhance the quality of recommendations.
Edit intent: clarity
Original:  We attempt to build an empirical method to determine the flavour of food and incorporate them into a recommendation engine .
Revised:  We attempt to build an empirical method to determine the flavour of food is incorporated into a recommendation engine .
Edit intent: clarity
Original:  Such a system will have the dual advantage of suggesting food items that the user is more likely to consume while also achieving the goal of ensuring the food intake leans more towards healthier alternatives.
Revised:  Such a system has advantages of suggesting food items that the user is more likely to consume while also achieving the goal of ensuring the food intake leans more towards healthier alternatives.
Edit intent: clarity
Original:  Pooled imaging data from multiple sources is subject to variation between the sources.
Revised:  Pooled imaging data from multiple sources are subject to variation between the sources.
Edit intent: fluency
Original:  Correcting for these biases has become incredibly important as the size of imaging studies increases and the multi-site case becomes more common.
Revised:  Correcting for these biases has become very important as imaging studies increase in size and multi-site case becomes more common.
Edit intent: clarity
Original:  Correcting for these biases has become incredibly important as the size of imaging studies increases and the multi-site case becomes more common.
Revised:  Correcting for these biases has become incredibly important as the size of imaging studies increases and the multi-site cases become more common.
Edit intent: fluency
Original:  by leveraging the data processing inequality, such a representation can then be used to create an image reconstruction that is uninformative of its original source, yet still faithful to the underlying structure .
Revised:  by leveraging the data processing inequality, such a representation can then be used to create an image reconstruction that is uninformative of its original source, yet still faithful to underlying structures .
Edit intent: fluency
Original:   To evaluate our method, we use training data from the 2018 CDMRI Challenge Harmonization dataset.
Revised:  Results: To evaluate our method, we use training data from the 2018 CDMRI Challenge Harmonization dataset.
Edit intent: fluency