wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this paper, the information about the noise-to-signal ratio is used to control such a substances' production and storage and to drive the neuron's synaptic pressures towards the state with the best signal-to-noise ratio.
Revised:  In this paper, the information about the noise-to-signal ratio is used to control such a substances' production and storage and drives the neuron's synaptic pressures towards the state with the best signal-to-noise ratio.
Edit intent: fluency
Original:  Several experiments with different input signal regimes are considered to understand the functioning of the proposed approach.
Revised:  We consider several experiments with different input signal regimes are considered to understand the functioning of the proposed approach.
Edit intent: clarity
Original:  Several experiments with different input signal regimes are considered to understand the functioning of the proposed approach.
Revised:  Several experiments with different input signal regimes to understand the functioning of the proposed approach.
Edit intent: clarity
Original:  In particular, it integrates the Online Random Forests (ORF) ~ saffari2009line method, which inherently has the abilities of fast and multi-class learning.
Revised:  In particular, it integrates the Online Random Forests (ORF) saffari2009line method, which inherently has the abilities of fast and multi-class learning.
Edit intent: fluency
Original: Because LFPs arise from multiple sources in different spatial locations, they do not easily reveal coordinated activity across neural populations on a trial-to-trial basis.
Revised: Because local field potentials (LFPs) arise from multiple sources in different spatial locations, they do not easily reveal coordinated activity across neural populations on a trial-to-trial basis.
Edit intent: clarity
Original: The core of personalized news recommendation is accurate matching between candidate news and user interest.
Revised: The most important task in personalized news recommendation is accurate matching between candidate news and user interest.
Edit intent: clarity
Original:  Most  existing news recommendation methods usually model candidate news from its textual content and model users' interest from their clicked news , independently .
Revised:  Most of existing news recommendation methods usually model candidate news from its textual content and model users' interest from their clicked news , independently .
Edit intent: clarity
Original:  Most  existing news recommendation methods usually model candidate news from its textual content and model users' interest from their clicked news , independently .
Revised:  Most existing news recommendation methods model candidate news from its textual content and model users' interest from their clicked news , independently .
Edit intent: clarity
Original:  Most  existing news recommendation methods usually model candidate news from its textual content and model users' interest from their clicked news , independently .
Revised:  Most existing news recommendation methods usually model candidate news from its textual content and user interest from their clicked news , independently .
Edit intent: clarity
Original:  Most  existing news recommendation methods usually model candidate news from its textual content and model users' interest from their clicked news , independently .
Revised:  Most existing news recommendation methods usually model candidate news from its textual content and model users' interest from their clicked news in an independent way .
Edit intent: clarity
Original:  However, a news article may cover multiple aspects and entities, and a user may have multiple interests .
Revised:  However, a news article may cover multiple aspects and entities, and a user usually has different kinds of interest .
Edit intent: clarity
Original:  In this paper, we propose a knowledge-aware interactive matching framework for personalized news recommendation.
Revised:  In this paper, we propose a knowledge-aware interactive matching method for news recommendation.
Edit intent: clarity
Original:  Our method can interactively model candidate news and user interest to learn user-aware candidate news representation and candidate news-aware user interest representation, which can facilitate the accurate matchingbetween user interest and candidate news.
Revised:  Our method interactively models candidate news and user interest to learn user-aware candidate news representation and candidate news-aware user interest representation, which can facilitate the accurate matchingbetween user interest and candidate news.
Edit intent: clarity
Original:  More specifically, we propose a knowledge co-encoder to interactively learn knowledge-based news representations for both clicked news and candidate news by capturing their relatedness in  entities with the help of knowledge graphs.
Revised:  More specifically, we propose a knowledge co-encoder to interactively learn representations for both clicked news and candidate news by capturing their relatedness in entities with the help of knowledge graphs.
Edit intent: clarity
Original:  Besides, we propose a user-news co-encoder to learn candidate news-aware user interest representation and user-aware candidate news representation from the knowledge- and text-based representations of candidate news and clicked news for better interest matching.
Revised:  Besides, we propose a user-news co-encoder to learn candidate news-aware user interest representation and user-aware candidate news representation for better interest matching.
Edit intent: coherence
Original:  Through extensive experiments on two real-world datasets , we demonstrate our method can effectively improve the performance of news recommendation.
Revised:  Experiments on two real-world datasets , we demonstrate our method can effectively improve the performance of news recommendation.
Edit intent: clarity
Original:  Through extensive experiments on two real-world datasets , we demonstrate our method can effectively improve the performance of news recommendation.
Revised:  Through extensive experiments on two real-world datasets validate that our method can effectively improve the performance of news recommendation.
Edit intent: clarity
Original: We analyze a semi-explicit time discretization scheme of first order for poroelasticity with nonlinear permeability provided that the elasticity model and the flow equation are only weakly coupled.
Revised: We analyze a semi-explicit time discretization scheme of first order for poro\-elasticity with nonlinear permeability provided that the elasticity model and the flow equation are only weakly coupled.
Edit intent: fluency
Original:  Our harvester performs the challenging task of autonomous navigation and tree grabbing in a confined, GPS denied forest environment.
Revised:  Our harvester performs a challenging task of autonomous navigation and tree grabbing in a confined, GPS denied forest environment.
Edit intent: fluency
Original:  The mission starts with a human or a mobile robot mapping the area of interest using a custom-made sensor module.
Revised:  The mission starts with a human mapping the area of interest using a custom-made sensor module.
Edit intent: clarity
Original:  Subsequently, a human expert or a data-supported algorithm selects the trees for harvesting.
Revised:  Subsequently, a human expert selects the trees for harvesting.
Edit intent: clarity
Original:  This process repeats for all the trees selected by the operator (algorithm) .
Revised:  This process repeats for all the trees selected by the operator .
Edit intent: clarity
Original: We consider a max-min variation of the classical problem of maximizing a linear function over the base of a polymatroid.
Revised: We consider the problem of maximizing a linear function over the base of a polymatroid.
Edit intent: clarity
Original:  Wicked problems reflect our incomplete understanding of interdependent global systems and the hyper-risk they pose;
Revised:  Wicked problems reflect our incomplete understanding of interdependent global systems and the systemic risk they pose;
Edit intent: clarity
Original:  such problems escape solutions because they are often ill-defined  and thus mis-identified and under-appreciated by problem-solvers and the communities they constitute.
Revised:  such problems escape solutions because they are often ill-defined , and thus mis-identified and under-appreciated by problem-solvers and the communities they constitute.
Edit intent: fluency
Original:  Because cross-boundary problems can be dissected from various viewpoints, such diversity can nevertheless contribute confusion to the collective understanding of the problem.
Revised:  Because cross-boundary problems can be dissected from various viewpoints, the integration of diverse approaches can nevertheless contribute confusion to the collective understanding of the problem.
Edit intent: clarity
Original:  Because cross-boundary problems can be dissected from various viewpoints, such diversity can nevertheless contribute confusion to the collective understanding of the problem.
Revised:  Because cross-boundary problems can be dissected from various viewpoints, such diversity can nevertheless contribute confusion around the collective understanding of the problem.
Edit intent: clarity
Original:  Notably , our results indicate that wildlife trade may become a neglected wicked problem due to high uncertainty, research paucity, and delayed knowledge consolidation .
Revised:  Notably , our results identify wildlife trade as a wicked problem that may be difficult to address given recent instability in its knowledge trajectory .
Edit intent: clarity
Original: This paper presents an online walking gait synthesis and a feedback control methodology to enable  stable walking on constrained footholds for  bipedal robots.
Revised: This paper presents an online walking synthesis methodology to enable stable walking on constrained footholds for bipedal robots.
Edit intent: clarity
Original:  As a result, this paper takes a different approach to modulate the change of the angular momentum about the foot-ground contact pivot at the discrete impact with vertical center of mass (COM) velocity.
Revised:  As a result, this paper takes a different approach to modulate the change of angular momentum about the foot-ground contact pivot at the discrete impact with vertical center of mass (COM) velocity.
Edit intent: fluency
Original:  We utilize the underactuated Linear Inverted Pendulum (LIP) model for approximating the underactuated walking dynamics to provide the desired post-impact angular momentum for each step.
Revised:  To this end, we utilize the underactuated Linear Inverted Pendulum (LIP) model for approximating the underactuated walking dynamics to provide the desired post-impact angular momentum for each step.
Edit intent: coherence
Original:  Outputs are constructed via online optimization combined with closed-form polynomials and then tracked via a quadratic program  based controller.
Revised:  Desired outputs are constructed via online optimization combined with closed-form polynomials and then tracked via a quadratic program based controller.
Edit intent: clarity
Original:  Outputs are constructed via online optimization combined with closed-form polynomials and then tracked via a quadratic program  based controller.
Revised:  Outputs are constructed via online optimization combined with closed-form polynomials and tracked via a quadratic program based controller.
Edit intent: coherence
Original:  Outputs are constructed via online optimization combined with closed-form polynomials and then tracked via a quadratic program  based controller.
Revised:  Outputs are constructed via online optimization combined with closed-form polynomials and then tracked via a quadratic program (QP) based controller.
Edit intent: clarity
Original:  This method is implemented online on two robot models , AMBER and  Cassie, for which stable walking behaviors with constrained footholds are realized on flat ground, stairs, and randomly located stepping stones.
Revised:  This method is demonstrated on two robots , AMBER and Cassie, for which stable walking behaviors with constrained footholds are realized on flat ground, stairs, and randomly located stepping stones.
Edit intent: clarity
Original:  The motion of  circular front of the infected cluster shows  linear behaviour in time.
Revised:  The motion of the circular front of the infected cluster shows linear behaviour in time.
Edit intent: fluency
Original:  The motion of  circular front of the infected cluster shows  linear behaviour in time.
Revised:  The motion of circular front of an infected cluster shows linear behaviour in time.
Edit intent: fluency
Original:  The motion of  circular front of the infected cluster shows  linear behaviour in time.
Revised:  The motion of circular front of the infected cluster shows a linear behaviour in time.
Edit intent: fluency
Original:  The size dependence of the growth of infectedcluster is also analysed .
Revised:  The correlation of a particular site to be infected, with respect to the central site is also studied .
Edit intent: clarity
Original:  The results of vaccination has been incorporated also in the CA algorithm with a satisfactory degree of success.
Revised:  The results of vaccination have been also incorporated in the CA algorithm with a satisfactory degree of success.
Edit intent: fluency
Original:  The advantage of the present model can be used to analyse the growth of correlations as function of length .
Revised:  The advantage of the present model is that it can shed considerable amount of light to the physical properties of the spread of a typical epidemic in a simple, yet robust way .
Edit intent: coherence
Original:  FIERY learns to model the inherent stochastic nature of the future directly from camera driving data in an end-to-end manner, without relying on HD maps, and predicts multimodal future trajectories.
Revised:  FIERY learns to model the inherent stochastic nature of the future solely from camera driving data in an end-to-end manner, without relying on HD maps, and predicts multimodal future trajectories.
Edit intent: clarity
Original:  Code is available at URL
Revised:  The code and trained models are available at URL
Edit intent: clarity
Original:  More precisely, consider M a d-dimensional square matrix  whose entries are rational functions in one or more real variables.
Revised:  More precisely, consider a d-dimensional square matrix whose entries are rational functions in one or more real variables.
Edit intent: clarity
Original:  Given initial and target vectors u,v\in Q^d, the parametrised point-to-point reachability problem asks whether there exist values of the parameters giving rise to a concrete matrix N \in R^{d\times d}, and a positive integer n  , such that N^nu = v. We show decidability in the case where M depends only upon a single parameter, and we exhibit a reduction from the well-known Skolem problem for linear recurrence sequences, indicating intractability in the case of four or more parameters.
Revised:  Given initial and target vectors u,v\in Q^d, the parametric point-to-point reachability problem asks whether there exist values of the parameters giving rise to a concrete matrix N \in R^{d\times d}, and a positive integer n , such that N^nu = v. We show decidability in the case where M depends only upon a single parameter, and we exhibit a reduction from the well-known Skolem problem for linear recurrence sequences, indicating intractability in the case of four or more parameters.
Edit intent: fluency
Original:  Given initial and target vectors u,v\in Q^d, the parametrised point-to-point reachability problem asks whether there exist values of the parameters giving rise to a concrete matrix N \in R^{d\times d}, and a positive integer n  , such that N^nu = v. We show decidability in the case where M depends only upon a single parameter, and we exhibit a reduction from the well-known Skolem problem for linear recurrence sequences, indicating intractability in the case of four or more parameters.
Revised:  Given initial and target vectors u,v\in Q^d, the parametrised point-to-point orbit problem asks whether there exist values of the parameters giving rise to a concrete matrix N \in R^{d\times d}, and a positive integer n , such that N^nu = v. We show decidability in the case where M depends only upon a single parameter, and we exhibit a reduction from the well-known Skolem problem for linear recurrence sequences, indicating intractability in the case of four or more parameters.
Edit intent: clarity
Original:  Given initial and target vectors u,v\in Q^d, the parametrised point-to-point reachability problem asks whether there exist values of the parameters giving rise to a concrete matrix N \in R^{d\times d}, and a positive integer n  , such that N^nu = v. We show decidability in the case where M depends only upon a single parameter, and we exhibit a reduction from the well-known Skolem problem for linear recurrence sequences, indicating intractability in the case of four or more parameters.
Revised:  Given initial and target vectors u,v\in Q^d, the parametrised point-to-point reachability problem asks whether there exist values of the parameters giving rise to a concrete matrix N \in R^{d\times d}, and a positive integer n , such that N^nu = v. We show decidability for the case in which M depends only upon a single parameter, and we exhibit a reduction from the well-known Skolem problem for linear recurrence sequences, indicating intractability in the case of four or more parameters.
Edit intent: fluency
Original:  Given initial and target vectors u,v\in Q^d, the parametrised point-to-point reachability problem asks whether there exist values of the parameters giving rise to a concrete matrix N \in R^{d\times d}, and a positive integer n  , such that N^nu = v. We show decidability in the case where M depends only upon a single parameter, and we exhibit a reduction from the well-known Skolem problem for linear recurrence sequences, indicating intractability in the case of four or more parameters.
Revised:  Given initial and target vectors u,v\in Q^d, the parametrised point-to-point reachability problem asks whether there exist values of the parameters giving rise to a concrete matrix N \in R^{d\times d}, and a positive integer n , such that N^nu = v. We show decidability in the case where M depends only upon a single parameter, and we exhibit a reduction from the well-known Skolem Problem for linear recurrence sequences, indicating intractability in the case of four or more parameters.
Edit intent: fluency
Original:  Given initial and target vectors u,v\in Q^d, the parametrised point-to-point reachability problem asks whether there exist values of the parameters giving rise to a concrete matrix N \in R^{d\times d}, and a positive integer n  , such that N^nu = v. We show decidability in the case where M depends only upon a single parameter, and we exhibit a reduction from the well-known Skolem problem for linear recurrence sequences, indicating intractability in the case of four or more parameters.
Revised:  Given initial and target vectors u,v\in Q^d, the parametrised point-to-point reachability problem asks whether there exist values of the parameters giving rise to a concrete matrix N \in R^{d\times d}, and a positive integer n , such that N^nu = v. We show decidability in the case where M depends only upon a single parameter, and we exhibit a reduction from the well-known Skolem problem for linear recurrence sequences, suggesting intractability in the case of four or more parameters.
Edit intent: fluency
Original:  In this paper, we present an Attention-based ST-GCN (AST-GCN) for predicting the number of available bikes in bike-sharing systems in cities, where the attention-based mechanism is introduced to further improve the performance of a ST-GCN.
Revised:  In this paper, we present an Attention-based ST-GCN (AST-GCN) for predicting the number of available bikes in bike-sharing systems in cities, where the attention-based mechanism is introduced to further improve the performance of an ST-GCN.
Edit intent: fluency
Original: Social scientists and psychologists take interest in understanding how people express emotions or sentiments when dealing with catastrophic events such as natural disasters, political unrest, and terrorism.
Revised: Social scientists and psychologists take interest in understanding how people express emotions and sentiments when dealing with catastrophic events such as natural disasters, political unrest, and terrorism.
Edit intent: fluency
Original:   During the rise of COVID-19 cases with stricter lock downs , people have been expressing their sentiments in social media which can provide a deep understanding of how people physiologically react to catastrophic events.
Revised:  During the rise of COVID-19 cases with stricter lock-downs , people have been expressing their sentiments in social media which can provide a deep understanding of how people physiologically react to catastrophic events.
Edit intent: fluency
Original:   During the rise of COVID-19 cases with stricter lock downs , people have been expressing their sentiments in social media which can provide a deep understanding of how people physiologically react to catastrophic events.
Revised:  During the rise of COVID-19 cases with stricter lock downs , people have been expressing their sentiments in social media . This can provide a deep understanding of how people physiologically react to catastrophic events.
Edit intent: coherence
Original:   During the rise of COVID-19 cases with stricter lock downs , people have been expressing their sentiments in social media which can provide a deep understanding of how people physiologically react to catastrophic events.
Revised:  During the rise of COVID-19 cases with stricter lock downs , people have been expressing their sentiments in social media which can provide a deep understanding of human psychology during catastrophic events.
Edit intent: clarity
Original:  In this paper, we use deep learning based language models via long short-term memory (LSTM) recurrent neural networks for sentiment analysis on Twitter with a focus of rise of novel  cases in India.
Revised:  In this paper, we present a framework that employs deep learning-based language models via long short-term memory (LSTM) recurrent neural networks for sentiment analysis on Twitter with a focus of rise of novel cases in India.
Edit intent: clarity
Original:  In this paper, we use deep learning based language models via long short-term memory (LSTM) recurrent neural networks for sentiment analysis on Twitter with a focus of rise of novel  cases in India.
Revised:  In this paper, we use deep learning based language models via long short-term memory (LSTM) recurrent neural networks for sentiment analysis during the rise of novel cases in India.
Edit intent: clarity
Original:  We use the LSTM model with a global vector (GloVe) for word representation in building a language model.
Revised:  The framework features LSTM language model with a global vector (GloVe) for word representation in building a language model.
Edit intent: clarity
Original:  We present a framework that focuses on multi-label sentiment classification using LSTM model and GloVe embedding, where more than one sentiment can be expressed at once.
Revised:  We present a framework that focuses on multi-label sentiment classification where more than one sentiment can be expressed at once.
Edit intent: coherence
Original:  Our results show that the majority of the tweets have been positive with high levels of optimism during the rise of the  COVID-19 cases in India.
Revised:  Our results indicate that the majority of the tweets have been positive with high levels of optimism during the rise of the COVID-19 cases in India.
Edit intent: fluency
Original:  This could imply that the majority were generally positive and some annoyed towards the way the pandemic was handled by the authorities as their peak was reached .
Revised:  This could imply that the majority were generally positive and some annoyed towards the way the pandemic was handled by the authorities .
Edit intent: clarity