wanyu/IteraTeR_v2 huggingface dataset:
Original:  As SneakySnake does not replace sequence alignment, users can still configure the aligner of their choice for different scoring functions, surpassing most existing efforts that aim to accelerate sequence alignment .
Revised:  As SneakySnake does not replace sequence alignment, users can still configure the aligner of their choice , unlike existing acceleration efforts that sacrifice some aligner capabilities .
Edit intent: clarity
Original: Regular Model Checking (RMC) is a symbolic model checking technique where the set of system states are expressed as regular languages over strings and the transition relation is expressed using rational string-to-string relations . RMC permits verification of non-trivial properties in systems with infinite state spaces.
Revised: Regular model checking is an exploration technique for infinite state systems where state spaces are represented as regular languages over strings and the transition relation is expressed using rational string-to-string relations . RMC permits verification of non-trivial properties in systems with infinite state spaces.
Edit intent: clarity
Original: Regular Model Checking (RMC) is a symbolic model checking technique where the set of system states are expressed as regular languages over strings and the transition relation is expressed using rational string-to-string relations . RMC permits verification of non-trivial properties in systems with infinite state spaces.
Revised: Regular Model Checking (RMC) is a symbolic model checking technique where the set of system states are expressed as regular languages and transition relations are expressed using rational string-to-string relations . RMC permits verification of non-trivial properties in systems with infinite state spaces.
Edit intent: clarity
Original:  Since MSO-definable relations are closed under composition, this result implies decidability of the bounded model checking in MSO-RMC .
Revised:  Since MSO-definable relations are closed under composition, which, together with our decidability result, provides a foundation for regular model checking with regular relations .
Edit intent: clarity
Original:  The environment may appear differently to different users, i.e. , the mean rewards as seen by different users for a particular channel may be different.
Revised:  The environment may appear differently to different users, i.e. , the mean rewards as seen by different users for a particular channel may be different.
Edit intent: fluency
Original: In this paper, we study the uncoordinated spectrum access problem using the multi-player multi-armed bandits framework.
Edit intent: coherence
Original:  Additionally, in case of a collision  , we allow for the colliding users to receive non-zero rewards.
Revised:  Additionally, ini.e. case of a collision , we allow for the colliding users to receive non-zero rewards.
Edit intent: clarity
Original:  Additionally, in case of a collision  , we allow for the colliding users to receive non-zero rewards.
Revised:  Additionally, in case of a collision , we allow for the colliding players to receive non-zero rewards.
Edit intent: clarity
Original:  With  this setup,  we present a policy that achieves  expected regret of order O(\log ^{2+\delta T  }  ) for some \delta > 0.
Revised:  Withnot this setup, we present a policy that achieves expected regret of order O(\log ^{2+\delta T } ) for some \delta > 0.
Edit intent: fluency
Original:  There is excellent qualitative agreement between all forcefields  which suggests that the molecular nature of water does not play a significant role.
Revised:  There is qualitative agreement between all forcefields which suggests that the molecular nature of water does not play a significant role.
Edit intent: clarity
Original:  This is an important finding, that suggests that the entropy of complexation is dominated by the counterions , although we see no evidence of counterion condensation .
Revised:  This suggests that the entropy of complexation is dominated by the counterions , although we see no evidence of counterion condensation .
Edit intent: clarity
Original:  The simulations shed insight into the mechanism of complex coacervation and question several of the approximations currently used in theoretical studies of the phenomena .
Revised:  The simulations shed insight into the mechanism of complex coacervation and the phenomena .
Edit intent: clarity
Original:  As a result , cosine similarity using tf-idf vectors performed best among three in finding similarities between short news texts  .
Revised:  Among these three , cosine similarity using tf-idf vectors performed best among three in finding similarities between short news texts .
Edit intent: clarity
Original:  As a result , cosine similarity using tf-idf vectors performed best among three in finding similarities between short news texts  .
Revised:  As a result , cosine similarity using tf-idf vectors performed best in finding similarities between short news texts .
Edit intent: clarity
Original:  Therefore, we propose another novel mechanism to reward more related participants with fairer rewards, and the seller's revenue is even improved compared to the previous solution .
Revised:  Therefore, we propose another novel mechanism to reward more related participants with fairer rewards, and the seller's revenue is not reduced .
Edit intent: clarity
Original: A new cybersecurity attack (cryptojacking) is emerging,in both the literature and in the wild, where an adversary illicitly runs Crypto-clients software over the devices of unaware users  .
Revised: A new cybersecurity attack , where an adversary illicitly runs Crypto-clients software over the devices of unaware users .
Edit intent: clarity
Original:  This attack has been proved to be very effective given the simplicity of running a Crypto-client into a target device , e. g., by means of web-based Java scripting .
Revised:  This attack has been proved to be very effective given the simplicity of running a crypto-client into a target device , e. g., by means of web-based Java scripting .
Edit intent: fluency
Original:  This attack has been proved to be very effective given the simplicity of running a Crypto-client into a target device , e. g., by means of web-based Java scripting .
Revised:  This attack has been proved to be very effective given the simplicity of running a Crypto-client into a target device .
Edit intent: coherence
Original:   In this scenario , we propose Crypto-Aegis, a solution to detect and identify Crypto-clients network traffic--even when it is VPN-ed.
Revised:  In this paper , we propose Crypto-Aegis, a solution to detect and identify Crypto-clients network traffic--even when it is VPN-ed.
Edit intent: clarity
Original:   In this scenario , we propose Crypto-Aegis, a solution to detect and identify Crypto-clients network traffic--even when it is VPN-ed.
Revised:  In this scenario , we propose a network-based approach to detect and identify Crypto-clients network traffic--even when it is VPN-ed.
Edit intent: clarity
Original:  Evidence from of our experimental campaign show the exceptional quality and viability of our solution--Crypto-Aegis achieves an F1-score of  0.96 and an AUC of 0.99  . Given the extent and novelty of the addressed threat we believe that our approach and our results, other than being interesting on their own, also pave the way for further research in this area.
Revised:  Evidence from of our experimental campaign show the exceptional quality and viability of our solution--Crypto-Aegis achieves an F1-score of 0.96 of F1-score and 0.99 . Given the extent and novelty of the addressed threat we believe that our approach and our results, other than being interesting on their own, also pave the way for further research in this area.
Edit intent: clarity
Original:  Evidence from of our experimental campaign show the exceptional quality and viability of our solution--Crypto-Aegis achieves an F1-score of  0.96 and an AUC of 0.99  . Given the extent and novelty of the addressed threat we believe that our approach and our results, other than being interesting on their own, also pave the way for further research in this area.
Revised:  Evidence from of our experimental campaign show the exceptional quality and viability of our solution--Crypto-Aegis achieves an F1-score of 0.96 and an AUC of 0.99 . Given the extent and novelty of the addressed threat we believe that our approach , supported by its excellent results, pave the way for further research in this area.
Edit intent: clarity
Original:  Finally, numerical examples are given to illustrate the effectiveness of the proposed preconditioners for the Ohta-Kawasaki equation.
Revised:  Finally, numerical examples are given to illustrate the effectiveness of the proposed numerical methods for the mass-conserved Ohta-Kawasaki equation.
Edit intent: clarity
Original:  Recently, we introduced OPTL , based on the class of Operator Precedence Languages (OPL), more powerful than Nested Words.
Revised:  Recently, the logic OPTL was introduced , based on the class of Operator Precedence Languages (OPL), more powerful than Nested Words.
Edit intent: clarity
Original:  In this paper, we introduce the new OPL-based logic POTL, prove its FO-completeness over finite words , and provide a model checking procedure for it.
Revised:  We define the new OPL-based logic POTL, prove its FO-completeness over finite words , and provide a model checking procedure for it.
Edit intent: clarity
Original:  In this paper, we introduce the new OPL-based logic POTL, prove its FO-completeness over finite words , and provide a model checking procedure for it.
Revised:  In this paper, we introduce the new OPL-based logic POTL, prove its FO-completeness , and provide a model checking procedure for it.
Edit intent: clarity
Original:  We consider redistribution mechanism design for the first time in a setting where participants are connected and the resource owner is only aware of her neighbours .
Revised:  We consider redistribution mechanism design in a setting where participants are connected and the resource owner is only aware of her neighbours .
Edit intent: clarity
Original:  We consider redistribution mechanism design for the first time in a setting where participants are connected and the resource owner is only aware of her neighbours .
Revised:  We consider redistribution mechanism design for the first time in a setting where participants are connected and the resource owner is only connected to some of them .
Edit intent: clarity
Original:  Then we propose a novel network-based redistribution mechanism such that all participants in the network are invited, the allocation is more efficient and the resource owner has no deficit.
Revised:  Then we propose a novel network-based redistribution mechanism such that all participants on the network are invited, the allocation is more efficient and the resource owner has no deficit.
Edit intent: clarity
Original: In modern e-commerce and advertising recommender systems, ongoing research works attempt to optimize conversion rate (CVR) estimation , and increase the gross merchandise volume.
Revised: Post-click conversion rate (CVR) estimation , and increase the gross merchandise volume.
Edit intent: clarity
Original:  In addition, empirical study shows that our methods are cost-effective with large scale dataset .
Revised:  In addition, our methods are cost-effective with large scale dataset .
Edit intent: clarity
Original:  this fact means that traditional finite-state automata, rather than omega-automata  such as those developed by Buchi and others, suffice for recognizing models of  formulas.
Revised:  this fact means that traditional finite-state automata, rather than \omega such as those developed by Buchi and others, suffice for recognizing models of formulas.
Edit intent: fluency
Original:  this fact means that traditional finite-state automata, rather than omega-automata  such as those developed by Buchi and others, suffice for recognizing models of  formulas.
Revised:  this fact means that traditional finite-state automata, rather than omega-automata -automata such as those developed by Buchi and others, suffice for recognizing models of formulas.
Edit intent: fluency
Original:  this fact means that traditional finite-state automata, rather than omega-automata  such as those developed by Buchi and others, suffice for recognizing models of  formulas.
Revised:  this fact means that traditional finite-state automata, rather than omega-automata such as those developed by B\"uchi and others, suffice for recognizing models of formulas.
Edit intent: fluency
Original:  this fact means that traditional finite-state automata, rather than omega-automata  such as those developed by Buchi and others, suffice for recognizing models of  formulas.
Revised:  this fact means that traditional finite-state automata, rather than omega-automata such as those developed by Buchi and others, suffice for recognizing models of such formulas.
Edit intent: clarity
Original:  The resulting automata may be used as a basis for model checking, satisfiability testing, and property monitoring of systems .
Revised:  The resulting automata may be used as a basis for model checking, satisfiability testing, and model synthesis .
Edit intent: clarity
Original:  Drawing on data from tens of millions of research papers, patents, and researchers, we construct models that predict more than 95\% of next year's content and context combinations with  embeddings constructed from high-dimensional stochastic block models, where the improbability of new combinations itself predicts up to half of the likelihood that they will gain outsized citations and major awards.
Revised:  Drawing on data from tens of millions of research papers, patents, and researchers, we construct models that predict next year's content and context combinations with embeddings constructed from high-dimensional stochastic block models, where the improbability of new combinations itself predicts up to half of the likelihood that they will gain outsized citations and major awards.
Edit intent: clarity
Original:  Drawing on data from tens of millions of research papers, patents, and researchers, we construct models that predict more than 95\% of next year's content and context combinations with  embeddings constructed from high-dimensional stochastic block models, where the improbability of new combinations itself predicts up to half of the likelihood that they will gain outsized citations and major awards.
Revised:  Drawing on data from tens of millions of research papers, patents, and researchers, we construct models that predict more than 95\% of next year's content and context combinations with embeddings constructed from high-dimensional stochastic block models, where the improbability of new combinations itself predicts up to 50\% of the likelihood that they will gain outsized citations and major awards.
Edit intent: clarity
Original:  In this paper, we study the use of time-to-digital converters in wireless sensors, which provides clock synchronization and ranging at negligible communication overhead through a sawtooth signal model for round trip times  .
Revised:  In this paper, we study the use of time-to-digital converters in wireless sensors, which provides clock synchronization and ranging at negligible communication overhead through a sawtooth signal model for round trip times between two nodes .
Edit intent: clarity
Original: An outer-1-planar graph is a graph admitting a drawing in the plane for which all vertices belong to the outer face of the drawing and there is at most one crossing on each edge.
Revised: An outer-1-planar graph is a graph admitting a drawing in the plane so that all vertices appear in the outer region of the drawing and there is at most one crossing on each edge.
Edit intent: clarity
Original: An outer-1-planar graph is a graph admitting a drawing in the plane for which all vertices belong to the outer face of the drawing and there is at most one crossing on each edge.
Revised: An outer-1-planar graph is a graph admitting a drawing in the plane for which all vertices belong to the outer face of the drawing and every edge crosses at most one crossing on each edge.
Edit intent: clarity
Original: An outer-1-planar graph is a graph admitting a drawing in the plane for which all vertices belong to the outer face of the drawing and there is at most one crossing on each edge.
Revised: An outer-1-planar graph is a graph admitting a drawing in the plane for which all vertices belong to the outer face of the drawing and there is at most one other edge.
Edit intent: clarity
Original:  This paper describes the local structure of outer-1-planar graphs by proving that each outer-1-planar graph contains one of the seventeen fixed configurations, and the list of those configurations is minimal in the sense that for each fixed configuration there exist outer-1-planar graphs containing this configuration that do not contain any of the other sixteen configurations.
Revised:  This paper establishes the local structure of outer-1-planar graphs by proving that each outer-1-planar graph contains one of the seventeen fixed configurations, and the list of those configurations is minimal in the sense that for each fixed configuration there exist outer-1-planar graphs containing this configuration that do not contain any of the other sixteen configurations.
Edit intent: clarity
Original:  This paper describes the local structure of outer-1-planar graphs by proving that each outer-1-planar graph contains one of the seventeen fixed configurations, and the list of those configurations is minimal in the sense that for each fixed configuration there exist outer-1-planar graphs containing this configuration that do not contain any of the other sixteen configurations.
Revised:  This paper describes the local structure of outer-1-planar graphs by proving that each outer-1-planar graph contains one of the seventeen fixed configurations, and the list of those configurations is minimal in the sense that for each fixed configuration there exist outer-1-planar graphs containing this configuration that do not contain any of another sixteen configurations.
Edit intent: fluency
Original:  First of all, we conclude that every (resp.maximal) outer-1-planar graph with minimum degree at least 2 has an edge with the sum of the degrees of its two end-vertices being at most 9 (resp.7), and this upper bound is sharp.
Revised:  First of all, we conclude that every (resp.maximal) outer-1-planar graph of minimum degree at least 2 has an edge with the sum of the degrees of its two end-vertices being at most 9 (resp.7), and this upper bound is sharp.
Edit intent: fluency
Original:  First of all, we conclude that every (resp. maximal) outer-1-planar graph of minimum degree at least 2 has an edge with the sum of the degrees of its two end-vertices being at most 9 (resp .7 ), and this upper bound is sharp.
Revised:  First of all, we conclude that every (resp. maximal) outer-1-planar graph of minimum degree at least 2 has an edge with the sum of the degrees of its two end-vertices being at most 9 (resp . 7 ), and this upper bound is sharp.
Edit intent: fluency
Original: We propose a new supervised learning rule for multilayer spiking neural networks ( SNN ) that use a form of temporal coding known as rank-order-coding.
Revised: We propose a new supervised learning rule for multilayer spiking neural networks ( SNNs ) that use a form of temporal coding known as rank-order-coding.
Edit intent: clarity
Original:  We derive a new learning rule for this sort of network, termed S4NN, akin to traditional error backpropagation, yet based on latencies.
Revised:  We derive a new learning rule for this sort of network, named S4NN, akin to traditional error backpropagation, yet based on latencies.
Edit intent: fluency
Original:  We show how approximate error gradients can be computed backward in a feedforward network with an arbitrary number of layers.
Revised:  We show how approximated error gradients can be computed backward in a feedforward network with an arbitrary number of layers.
Edit intent: fluency
Original:  We show how approximate error gradients can be computed backward in a feedforward network with an arbitrary number of layers.
Revised:  We show how approximate error gradients can be computed backward in a feedforward network with any number of layers.
Edit intent: clarity
Original:  Yet  the neuron model  we use, non-leaky integrate-and-fire, are simpler and more hardware friendly than the one used in all previous similar proposals.
Revised:  Yet , the neuron model we use, non-leaky integrate-and-fire, are simpler and more hardware friendly than the one used in all previous similar proposals.
Edit intent: fluency
Original:  Yet  the neuron model  we use, non-leaky integrate-and-fire, are simpler and more hardware friendly than the one used in all previous similar proposals.
Revised:  Yet the neuron model that we use, non-leaky integrate-and-fire, are simpler and more hardware friendly than the one used in all previous similar proposals.
Edit intent: fluency
Original:  Yet  the neuron model  we use, non-leaky integrate-and-fire, are simpler and more hardware friendly than the one used in all previous similar proposals.
Revised:  Yet the neuron model we use, non-leaky integrate-and-fire, is much simpler than the one used in all previous similar proposals.
Edit intent: clarity
Original:  By following these rules, you get a method adaptive to the local geometry, with convergence guarantees depending only on  smoothness in a neighborhood of a solution.
Revised:  By following these rules, you get a method adaptive to the local geometry, with convergence guarantees depending only on the smoothness in a neighborhood of a solution.
Edit intent: fluency
Original:  Given that the problem is convex, our method will converge even if the global smoothness constant is infinity.
Revised:  Given that the problem is convex, our method converges even if the global smoothness constant is infinity.
Edit intent: clarity
Original: Gene interaction graphs aim to capture various relationships between genes and can represent decades of biology research.
Revised: Gene interaction graphs aim to capture various relationships between genes and represent decades of biology research.
Edit intent: coherence
Original:  When trying to make predictions from genomic data, those graphs could be used to overcome the curse of dimensionality by making machine learning models sparser and more biased with biological common knowledge.
Revised:  When trying to make predictions from genomic data, those graphs could be used to overcome the curse of dimensionality by making machine learning models sparser and more consistent with biological common knowledge.
Edit intent: clarity
Original:  We formulate a condition that graphs should satisfy to provide a good bias and propose to test it using a ' Single Gene Inference' (SGI) task.
Revised:  We formulate a condition that graphs should satisfy to provide a good prior knowledge and propose to test it using a ' Single Gene Inference' (SGI) task.
Edit intent: clarity
Original:  We formulate a condition that graphs should satisfy to provide a good bias and propose to test it using a ' Single Gene Inference' (SGI) task.
Revised:  We formulate a condition that graphs should satisfy to provide a good bias and propose to test it using a ` Single Gene Inference' (SGI) task.
Edit intent: fluency
Original: In this paper we consider the analysis and design of a feedback controller to regulate queueing delay in a next generation edge transport architecture for 802.11ac WLANs . We begin by developing a simplified system model suited to control analysis and design , validated against both simulation and experimental measurements.
Revised: In this paper we consider a next generation edge transport architecture for 802.11ac WLANs . We begin by developing a simplified system model suited to control analysis and design , validated against both simulation and experimental measurements.
Edit intent: coherence