wanyu/IteraTeR_v2 huggingface dataset:
Original: Currently existing neural network models lack an important computational capability of networks of neurons in the brain: the capability to reason on an abstract level , and to structure information according to abstract categories.
Revised: Currently existing neural network models lack an important computational capability of networks of neurons in the brain: the capability to reason at an abstract level , and to structure information according to abstract categories.
Edit intent: fluency
Original: Currently existing neural network models lack an important computational capability of networks of neurons in the brain: the capability to reason on an abstract level , and to structure information according to abstract categories.
Revised: Currently existing neural network models lack an important computational capability of networks of neurons in the brain: the capability to reason on an abstract level and to structure information according to abstract categories.
Edit intent: fluency
Original:  While hardly anything is known about the processes underlying these capabilities in the human brain, experimental evidence for the organization of an important prerequisite for abstract reasoninghas recently been found : for assigning words to thematic roles , such as subject or object.
Revised:  While hardly anything is known about the processes underlying these capabilities in the human brain, experimental evidence for the organization of an important aspect of abstract reasoning : for assigning words to thematic roles , such as subject or object.
Edit intent: clarity
Original:  It enables structured information retrieval and copying of information without routing, and provides a basis for the emulation of more demanding cognitive computations in networks of spiking neurons.
Revised:  It enables structured information retrieval , copying data, and comparisons. It thus provides a basis for the emulation of more demanding cognitive computations in networks of spiking neurons.
Edit intent: clarity
Original:  It enables structured information retrieval and copying of information without routing, and provides a basis for the emulation of more demanding cognitive computations in networks of spiking neurons.
Revised:  It enables structured information retrieval and copying of information without routing, and provides a basis for the implementation of more demanding cognitive computations in networks of spiking neurons.
Edit intent: clarity
Original:  It enables structured information retrieval and copying of information without routing, and provides a basis for the emulation of more demanding cognitive computations in networks of spiking neurons.
Revised:  It enables structured information retrieval and copying of information without routing, and provides a basis for the emulation of more demanding cognitive computations by networks of spiking neurons.
Edit intent: clarity
Original: Kernelization -- the mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems -- plays a central role in parameterized complexity and has triggered an extensive line of research.
Revised: Kernelization---the mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems -- plays a central role in parameterized complexity and has triggered an extensive line of research.
Edit intent: fluency
Original: Kernelization -- the mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems -- plays a central role in parameterized complexity and has triggered an extensive line of research.
Revised: Kernelization -- the mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems---plays a central role in parameterized complexity and has triggered an extensive line of research.
Edit intent: fluency
Original:  This is in part due to a lower bounds framework that allows to exclude polynomial-size kernels under the assumption that NP is not a subset of\not coNP/poly.
Revised:  This is in part due to a lower bounds framework that allows to exclude polynomial-size kernels under the assumption of NP\not coNP/poly.
Edit intent: clarity
Original:  In this paper we consider a stronger yet very natural variant of kernelization, namely strict kernelization, where one is not allowed to increase the parameter of the reduced instance (the kernel) by more than an additive constant.
Revised:  In this paper we consider a restricted yet natural variant of kernelization, namely strict kernelization, where one is not allowed to increase the parameter of the reduced instance (the kernel) by more than an additive constant.
Edit intent: clarity
Original:  Syst. 2011] and developing a general  framework, we show that a wide variety of FPT problems does not admit strict polynomial kernels under the much weaker assumption that P is not equal to NP.
Revised:  Syst. 2011] and developing a general framework, we show that a variety of FPT problems does not admit strict polynomial kernels under the much weaker assumption that P is not equal to NP.
Edit intent: clarity
Original:  In particular, we show that various (multicolored) graph problems , set covering problems, and Turing machine computation problems do not admit strict polynomial kernels unless P = NP.
Revised:  In particular, we show that various (multicolored) graph problems and Turing machine computation problems do not admit strict polynomial kernels unless P = NP.
Edit intent: clarity
Original:  Finally, we find that relaxing the concept of strict kernels to kernels with a constant-factor increase of the parameter leads to a scenario in which we can show for a number of problems that the framework is not applicable assuming that the (Strong) Exponential Time Hypothesis holds.
Revised:  Finally, we show that relaxing the concept of strict kernels to kernels with a constant-factor increase of the parameter leads to a scenario in which we can show for a number of problems that the framework is not applicable assuming that the (Strong) Exponential Time Hypothesis holds.
Edit intent: coherence
Original:  Finally, we find that relaxing the concept of strict kernels to kernels with a constant-factor increase of the parameter leads to a scenario in which we can show for a number of problems that the framework is not applicable assuming that the (Strong) Exponential Time Hypothesis holds.
Revised:  Finally, we find that relaxing the concept of strict kernels to kernels with a constant-factor increase of the parameter leads to a scenario in which we can prove for a number of problems that the framework is not applicable assuming that the (Strong) Exponential Time Hypothesis holds.
Edit intent: clarity
Original: Kernelization---the mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems---plays a central role in parameterized complexity and has triggered an extensive line of research.
Revised: Kernelization---a mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems---plays a central role in parameterized complexity and has triggered an extensive line of research.
Edit intent: fluency
Original:  This is in part due to a lower bounds framework that allows to exclude polynomial-size kernels under the assumption of NP %DIFDELCMD < \not%%% \subseteq \nsubseteq coNP/poly.
Revised:  This is in part due to a lower bounds framework that allows to exclude polynomial-size kernels under the assumption of NP %DIFDELCMD < \not%%% \nsubseteq coNP/poly.
Edit intent: fluency
Original:  Finally, we show that relaxing the concept of strict kernels to kernels with a constant-factor increase of the parameter leads to a scenario in which we can prove for a number of problems that the framework is not applicable assuming that the (Strong) Exponential Time Hypothesis holds .
Revised:  Finally, we study a relaxation of the notion of strict kernels and reveal its limitations .
Edit intent: clarity
Original:  We open-source our implementation on URL
Revised:  The source code of our experiments can be download at: URL .
Edit intent: clarity
Original:  Using geographical locations as units of experimentation is desirable because this does not require tracking  individual users or browser cookies.
Revised:  Using geographical locations as units of experimentation , since this does not require tracking individual users or browser cookies.
Edit intent: coherence
Original:  Using geographical locations as units of experimentation is desirable because this does not require tracking  individual users or browser cookies.
Revised:  Using geographical locations as units of experimentation is desirable because this does not require tracking of individual users or browser cookies.
Edit intent: fluency
Original:  With the popularity of mobile devices, a user may issue queries from multiple geographical locations .
Revised:  Since users may issue queries from multiple geographical locations .
Edit intent: clarity
Original:  In this paper, we  present GeoCUTS, an algorithm that forms geographical clusters to minimize movement between clusters while preserving rough balance in cluster size.
Revised:  In this paper, we present GeoCUTS, a novel algorithm that forms geographical clusters to minimize movement between clusters while preserving rough balance in cluster size.
Edit intent: clarity
Original:  In this paper, we  present GeoCUTS, an algorithm that forms geographical clusters to minimize movement between clusters while preserving rough balance in cluster size.
Revised:  In this paper, we present GeoCUTS, an algorithm that forms geographical clusters to minimize interference while preserving balance in cluster size.
Edit intent: clarity
Original:  We propose a statistical framework to measure the effectiveness of clusterings and perform empirical evaluations showing that the performance of GeoCUTS is comparable to hand-crafted DMAs with respect to both novel and existing metrics . GeoCUTS offers a general and flexible framework for conducting geo-based experiments in any part of the world .
Revised:  We propose a statistical framework to measure the effectiveness of clusterings . Furthermore, we perform empirical evaluations showing that the performance of GeoCUTS is comparable to hand-crafted DMAs with respect to both novel and existing metrics . GeoCUTS offers a general and flexible framework for conducting geo-based experiments in any part of the world .
Edit intent: coherence
Original:  We propose a statistical framework to measure the effectiveness of clusterings and perform empirical evaluations showing that the performance of GeoCUTS is comparable to hand-crafted DMAs with respect to both novel and existing metrics . GeoCUTS offers a general and flexible framework for conducting geo-based experiments in any part of the world .
Revised:  We propose a statistical framework to measure the effectiveness of clusterings and perform empirical evaluations showing that the performance of GeoCUTS is comparable to hand-crafted geo-regions with respect to both novel and existing metrics . GeoCUTS offers a general and flexible framework for conducting geo-based experiments in any part of the world .
Edit intent: clarity
Original:  We propose a statistical framework to measure the effectiveness of clusterings and perform empirical evaluations showing that the performance of GeoCUTS is comparable to hand-crafted DMAs with respect to both novel and existing metrics . GeoCUTS offers a general and flexible framework for conducting geo-based experiments in any part of the world .
Revised:  We propose a statistical framework to measure the effectiveness of clusterings and perform empirical evaluations showing that the performance of GeoCUTS is comparable to hand-crafted DMAs with respect to both novel and existing metrics .
Edit intent: clarity
Original: Device-to-device (D2D) computation offloading has recently been proposed to enhance mobile edge computing (MEC) performance by exploiting spare computing resources in proximity user devices, thereby alleviating computation burdens from the network infrastructure and enabling truly pervasive edge computing.
Revised: Computation offloading via device-to-device (D2D) computation offloading has recently been proposed to enhance mobile edge computing (MEC) performance by exploiting spare computing resources in proximity user devices, thereby alleviating computation burdens from the network infrastructure and enabling truly pervasive edge computing.
Edit intent: clarity
Original: Device-to-device (D2D) computation offloading has recently been proposed to enhance mobile edge computing (MEC) performance by exploiting spare computing resources in proximity user devices, thereby alleviating computation burdens from the network infrastructure and enabling truly pervasive edge computing.
Revised: Device-to-device (D2D) communication, or D2D offloading, has recently been proposed to enhance mobile edge computing (MEC) performance by exploiting spare computing resources in proximity user devices, thereby alleviating computation burdens from the network infrastructure and enabling truly pervasive edge computing.
Edit intent: clarity
Original: Device-to-device (D2D) computation offloading has recently been proposed to enhance mobile edge computing (MEC) performance by exploiting spare computing resources in proximity user devices, thereby alleviating computation burdens from the network infrastructure and enabling truly pervasive edge computing.
Revised: Device-to-device (D2D) computation offloading has recently been proposed to enhance mobile computing performance by exploiting spare computing resources in proximity user devices, thereby alleviating computation burdens from the network infrastructure and enabling truly pervasive edge computing.
Edit intent: clarity
Original:  Although incentive mechanism design has been intensively studied in the literature, this paper considers a much more challenging yet much under-investigated problem in which user incentives are complexly coupled with security risks, which is extremely important since D2D-enhanced MEC systems are vulnerable to distributed attacks, such as distributed denial of service (DDoS) attacks, due to its autonomous nature .
Revised:  Although incentive mechanism design has been intensively studied in the literature, this paper considers a much more challenging yet less investigated problem in which user incentives are complexly coupled with security risks, which is extremely important since D2D-enhanced MEC systems are vulnerable to distributed attacks, such as distributed denial of service (DDoS) attacks, due to its autonomous nature .
Edit intent: clarity
Original:  Although incentive mechanism design has been intensively studied in the literature, this paper considers a much more challenging yet much under-investigated problem in which user incentives are complexly coupled with security risks, which is extremely important since D2D-enhanced MEC systems are vulnerable to distributed attacks, such as distributed denial of service (DDoS) attacks, due to its autonomous nature .
Revised:  Although incentive mechanism design has been intensively studied in the literature, this paper considers a much more challenging yet much under-investigated problem in which selfish users are also facing interdependent security risks, which is extremely important since D2D-enhanced MEC systems are vulnerable to distributed attacks, such as distributed denial of service (DDoS) attacks, due to its autonomous nature .
Edit intent: clarity
Original:  In this paper , we build a novel mathematical framework incorporating game theory and classic epidemic models to investigate the interplay between user incentives and  security risks in D2D-enhanced MEC systems under infectious DDoS attacks.
Revised:  In this paper , we build a novel mathematical framework by leveraging the combined power of game theory and classic epidemic models to investigate the interplay between user incentives and security risks in D2D-enhanced MEC systems under infectious DDoS attacks.
Edit intent: clarity
Original:  In this paper , we build a novel mathematical framework incorporating game theory and classic epidemic models to investigate the interplay between user incentives and  security risks in D2D-enhanced MEC systems under infectious DDoS attacks.
Revised:  In this paper , we build a novel mathematical framework incorporating game theory and epidemic theory to investigate the interplay between user incentives and security risks in D2D-enhanced MEC systems under infectious DDoS attacks.
Edit intent: clarity
Original:  The optimal solution exhibits an interesting " Less is More " effect : although giving users a higher reward promote more participation, it may harm the  operator's utility.
Revised:  The optimal solution exhibits an interesting " less is more " effect : although giving users a higher reward promote more participation, it may harm the operator's utility.
Edit intent: fluency
Original:  The optimal solution exhibits an interesting " Less is More " effect : although giving users a higher reward promote more participation, it may harm the  operator's utility.
Revised:  The optimal solution exhibits an interesting " Less is More " phenomenon : although giving users a higher reward promote more participation, it may harm the operator's utility.
Edit intent: clarity
Original:  The optimal solution exhibits an interesting " Less is More " effect : although giving users a higher reward promote more participation, it may harm the  operator's utility.
Revised:  The optimal solution exhibits an interesting " Less is More " effect : although giving users more incentives promotes more participation, it may harm the operator's utility.
Edit intent: clarity
Original:  The optimal solution exhibits an interesting " Less is More " effect : although giving users a higher reward promote more participation, it may harm the  operator's utility.
Revised:  The optimal solution exhibits an interesting " Less is More " effect : although giving users a higher reward promote more participation, it may harm the network operator's utility.
Edit intent: clarity
Original:  This is because too much participation fosters persistent DDoS attack and as a result, the \textit{effective participation level does not improve.
Revised:  This is because too much participation fosters persistent DDoS attack and as a result, the \textit{effective participation level does not improve.
Edit intent: fluency
Original:   Extensive simulations are carried out to verify the analytic conclusions.
Revised:  Extensive simulations are carried out to verify our analytical conclusions.
Edit intent: clarity
Original: Bias in perceptual decisions comes to pass when the advance knowledge colluded with the current sensory evidence in support of the final choice.
Revised: Bias in perceptual decisions comes to pass when the advance knowledge colludes with the current sensory evidence in support of the final choice.
Edit intent: fluency
Original:  Beside these hypotheses, a credible hypothesis proposed by this study to explain the cause of decision biasing, suggests that the decision maker neuron can make use of the residual information of the previous decisions for the current decision.
Revised:  Beside these hypotheses, a credible hypothesis proposed by this study to explain the cause of decision biasing, suggests that the decision-related neuron can make use of the residual information of the previous decisions for the current decision.
Edit intent: clarity
Original:  Beside these hypotheses, a credible hypothesis proposed by this study to explain the cause of decision biasing, suggests that the decision maker neuron can make use of the residual information of the previous decisions for the current decision.
Revised:  Beside these hypotheses, a credible hypothesis proposed by this study to explain the cause of decision biasing, suggests that the decision maker neuron can make use of the residual information of the previous decision for the current decision.
Edit intent: fluency
Original:  We demonstrate the validity of this assumption, first by performing behavioral experiments based on the two alternative forced-choice  discrimination of motion direction paradigms .
Revised:  We demonstrate the validity of this assumption, first by performing behavioral experiments based on the two-alternative forced-choice discrimination of motion direction paradigms .
Edit intent: fluency
Original:  In both cases, previous trial's trace can be seen on the current decision.
Revised:  In both cases, the trace of the previous trial influences the current decision.
Edit intent: clarity
Original:  Results indicated the probability of being correct in  current decision increases if the previous decision is towards the current decision.
Revised:  Results indicate that the probability of being correct in current decision increases if the previous decision is towards the current decision.
Edit intent: fluency
Original:  Results indicated the probability of being correct in  current decision increases if the previous decision is towards the current decision.
Revised:  Results indicated the probability of being correct in a current decision increases if the previous decision is towards the current decision.
Edit intent: fluency
Original:  Results indicated the probability of being correct in  current decision increases if the previous decision is towards the current decision.
Revised:  Results indicated the probability of being correct in current decision increases if it is in line with the previously made decision.
Edit intent: clarity
Original:  Also, the model  keeps the previous decision information , provides a better fit to the behavioral data.
Revised:  Also, the model that keeps the previous decision information , provides a better fit to the behavioral data.
Edit intent: fluency
Original:  Also, the model  keeps the previous decision information , provides a better fit to the behavioral data.
Revised:  Also, the model keeps the previous decision information provides a better fit to the behavioral data.
Edit intent: fluency
Original:  Our findings suggest that the state of  decision variable which is represented in the activity of decision maker neurons after crossing the bound (in the previous decision) can accumulate with the decision variable for the current decision in consecutive trials.
Revised:  Our findings suggest that the state of a decision variable which is represented in the activity of decision maker neurons after crossing the bound (in the previous decision) can accumulate with the decision variable for the current decision in consecutive trials.
Edit intent: fluency
Original:  Our findings suggest that the state of  decision variable which is represented in the activity of decision maker neurons after crossing the bound (in the previous decision) can accumulate with the decision variable for the current decision in consecutive trials.
Revised:  Our findings suggest that the state of decision variable which is represented in the activity of decision-related neurons after crossing the bound (in the previous decision) can accumulate with the decision variable for the current decision in consecutive trials.
Edit intent: clarity
Original:  Riemannian optimization methods have shown to be both fast and accurate in recovering a large-scale tensor from its incomplete observation .
Revised:  Riemannian optimization methods prove to be both fast and accurate in recovering a large-scale tensor from its incomplete observation .
Edit intent: clarity
Original:  Riemannian optimization methods have shown to be both fast and accurate in recovering a large-scale tensor from its incomplete observation .
Revised:  Riemannian optimization methods have shown to be both efficient and effective in low rank tensor completion problems .
Edit intent: clarity
Original:  For such a Riemannian optimization, a particular metric can be constructed based on the curvature of the objective , which leads to a novel Riemannian conjugate gradient descent solver .
Revised:  For such a Riemannian optimization, a particular metric can be constructed based on the curvature of the objective .
Edit intent: coherence