wanyu/IteraTeR_v2 huggingface dataset:
Original:  Both full- and non-reference image quality assessment (IQA) metrics evaluate interpolation image quality objectively to extract the number of achieved occurrences over targeted occurrences .
Revised:  Both full- and non-reference image quality assessment (IQA) metrics evaluate interpolation image quality . The concept of achieved occurrences over targeted occurrences .
Edit intent: clarity
Original:  Inferential statistical analysis concept is applied to deduce from a small number of images and draw a conclusion of the behavior of each rounding function on a bigger number of images.
Revised:  Inferential statistical analysis is applied to deduce from a small number of images and draw a conclusion of the behavior of each rounding function on a bigger number of images.
Edit intent: clarity
Original:  Considering the number of images bigger than five, inferential analysis demonstrated that, at 95\% of confidence level, the ceil function could also achieve 83.75\% of targeted occurrences with 8 to 11\%margin of error while the floor and round functions could only achieve 22.5\% and 32.5\% of targeted occurrences , respectively, with the same margin of error .
Revised:  Under the normal distribution and at the level of confidence equals to 95\%, the maximum and minimum achievable occurrences by each evaluated rounding function are both provided based on the inferential analysis-based experiments .
Edit intent: clarity
Original: Short answer: not much, and only with an overly cautious approach .
Revised: Short answer: not much, and only with lots of caution .
Edit intent: clarity
Original:  We also proposed multiple job-assignment heuristics to generate low-total-cost solutions and determined the best performing method amongst them.
Revised:  We also proposed multiple job-assignment heuristics to generate low-total-cost solutions and determine the best performing method amongst them.
Edit intent: fluency
Original:   Our proposed mechanism incentivizes strategic social media to efficiently filter misleading information  and thus indirectly prevent the ever-emergent phenomenon of fake news.
Revised:  Our proposed mechanism incentivizes social media to efficiently filter misleading information and thus indirectly prevent the ever-emergent phenomenon of fake news.
Edit intent: clarity
Original:   Our proposed mechanism incentivizes strategic social media to efficiently filter misleading information  and thus indirectly prevent the ever-emergent phenomenon of fake news.
Revised:  Our proposed mechanism incentivizes strategic social media to filter misleading information and thus indirectly prevent the ever-emergent phenomenon of fake news.
Edit intent: clarity
Original:  In particular, we consider an economically inspired mechanism that designs an implementable Nash equilibrium of efficient filtering of misleading information in a game of selfish social mediaplatforms.
Revised:  In particular, we design an economically inspired mechanism that designs an implementable Nash equilibrium of efficient filtering of misleading information in a game of selfish social mediaplatforms.
Edit intent: clarity
Original: In this paper, we present a resource allocation mechanism for the problem of filtering incentivization among a finite number of strategic social media  .
Revised: In this paper, we present a resource allocation mechanism for the problem of incentivizing filtering among a finite number of strategic social media .
Edit intent: fluency
Original:  A social planner, e.g., a mediator, is assigned by the government to maximize the social welfare of all social media and the government.
Edit intent: coherence
Original:  Our proposed mechanism incentivizes social media  to filter misleading information efficiently, and thus indirectly prevent the ever-emergent phenomenon of fake news.
Revised:  Our proposed mechanism incentivizes social media platforms to filter misleading information efficiently, and thus indirectly prevent the ever-emergent phenomenon of fake news.
Edit intent: clarity
Original:  Our proposed mechanism incentivizes social media  to filter misleading information efficiently, and thus indirectly prevent the ever-emergent phenomenon of fake news.
Revised:  Our proposed mechanism incentivizes social media to filter misleading information efficiently, and thus indirectly prevent the phenomenon of fake news.
Edit intent: clarity
Original:  In particular, we design an economically inspired mechanism that strongly implements all generalized Nash equilibria for the efficient allocation filtering of misleading information in the induced game of strategic social media.
Revised:  In particular, we design an economically inspired mechanism that strongly implements all generalized Nash equilibria for efficient filtering of misleading information in the induced game of strategic social media.
Edit intent: clarity
Original:  Furthermore, we show that our mechanism is individually rational, budget balanced, and it has at least one equilibrium  .
Revised:  Furthermore, we show that our mechanism is individually rational, budget balanced, and has at least one equilibrium .
Edit intent: clarity
Original:  Our proposed mechanism incentivizes social media platforms to filter misleading information efficiently, and thus indirectly prevent the phenomenon of fake news.
Revised:  Our proposed mechanism incentivizes social media platforms to filter misleading information efficiently, and thus indirectly prevents the spread of fake news.
Edit intent: clarity
Original:  We show that our mechanism is individually rational, budget balanced, and has at least one equilibrium.
Revised:  We show that our mechanism is individually rational, budget balanced, while it has at least one equilibrium.
Edit intent: clarity
Original:  Finally, we show that for quasi-concave utilities and constraints, our mechanism has a generalized Nash equilibrium and implements a Pareto efficient solution.
Revised:  Finally, we show that for quasi-concave utilities and constraints, our mechanism admits a generalized Nash equilibrium and implements a Pareto efficient solution.
Edit intent: clarity
Original:  However, security breaches also increased threatening the availability, integrity and confidentiality of microservice-based systems.
Revised:  However, security breaches have increased threatening availability, integrity and confidentiality of microservice-based systems.
Edit intent: clarity
Original:  In this paper, we conduct a systematic mapping study in order to categorize threats on microservice architectures and security proposals along with their applicability levels, platforms and validation techniques.
Edit intent: coherence
Original:  The results of the mapping revealed an unbalanced research focus on external attacks, authentication and authorization techniques compared with internal attacks and mitigationtechniques .
Revised:  The results of the mapping revealed an unbalanced research focus on external attacks, authentication and authorization techniques compared with prevention and mitigation .
Edit intent: clarity
Original:  We also found that performance analysis and case studies are the most used validation technique of security proposals.
Revised:  We also found that performance analysis and case studies are the most used validation techniques of security proposals.
Edit intent: fluency
Original:  Here we focus on extending the lifetime of sensor systems without additional data acquisition by transfering knowledge from one time window to a subsequent one after drift has occurred.
Revised:  This paper shows how such a system can be defined without additional data acquisition by transfering knowledge from one time window to a subsequent one after drift has occurred.
Edit intent: clarity
Original:  To support generalization across sensor states, we introduce a context-based neural network model which forms a latent representation of sensor state .
Revised:  A context-based neural network model which forms a latent representation of sensor state .
Edit intent: coherence
Original:  To support generalization across sensor states, we introduce a context-based neural network model which forms a latent representation of sensor state .
Revised:  To support generalization across sensor states, we introduce a context-based neural network model is used to form a latent representation of sensor state .
Edit intent: clarity
Original:  We tested our models to classify samples taken from unseen subsequent time windows and discovered favorable accuracy compared to drift-naive and ensemble methods on a gas sensor array drift dataset.
Revised:  We tested our models to classify samples taken from unseen subsequent time windows , the approach performed better than drift-naive and ensemble methods on a gas sensor array drift dataset.
Edit intent: clarity
Original:  By reducing the effect that sensor drift has on classification accuracy, context-based models may  extend the effective lifetime of gas identification systems in practical settings.
Revised:  By reducing the effect that sensor drift has on classification accuracy, context-based models may be used to extend the effective lifetime of gas identification systems in practical settings.
Edit intent: clarity
Original: In this paper, we present an original set of flocking rules using the ecologically-inspired paradigm for control of multi-robot systems.
Revised: In this paper, we present an original set of flocking rules using an ecologically-inspired paradigm for control of multi-robot systems.
Edit intent: fluency
Original:  We show how queries can be rewritten into equivalent execution plans, that are guaranteed to deliver the same results than the query on all databases.
Revised:  We show how queries can be rewritten into equivalent execution plans, which are guaranteed to deliver the same results than the query on all databases.
Edit intent: fluency
Original:  We show how queries can be rewritten into equivalent execution plans, that are guaranteed to deliver the same results than the query on all databases.
Revised:  We show how queries can be rewritten into equivalent execution plans, that are guaranteed to deliver the same results as the query on all databases.
Edit intent: fluency
Original:  This dataset could also help track scientific coronavirus misinformation and unverified rumors, or enable the understanding of fear and panic --- and undoubtedly more.
Revised:  This dataset could also help track scientific coronavirus misinformation and unverified rumors, or enable the understanding of fear and panic -- and undoubtedly more.
Edit intent: fluency
Original: Motivation : Named Entity Recognition (NER) and Normalisation (NEN) are core components of any text-mining system for biomedical texts.
Revised: Background : Named Entity Recognition (NER) and Normalisation (NEN) are core components of any text-mining system for biomedical texts.
Edit intent: coherence
Original:   Our analysis shows that the strengths of the two classifiers can be combined in a fruitful way.
Revised:  Conclusions: Our analysis shows that the strengths of the two classifiers can be combined in a fruitful way.
Edit intent: coherence
Original: Coronaviruses are a famous family of viruses that causes illness in human or animals.
Revised: Coronaviruses are a famous family of viruses that cause illness in both humans and animals.
Edit intent: clarity
Original:  The new type of corona virus COVID-19 disease was firstly discovered in Wuhan-China .
Revised:  The new type of coronavirus COVID-19 disease was firstly discovered in Wuhan-China .
Edit intent: clarity
Original:  The new type of corona virus COVID-19 disease was firstly discovered in Wuhan-China .
Revised:  The new type of corona virus COVID-19 was firstly discovered in Wuhan-China .
Edit intent: clarity
Original:  The new type of corona virus COVID-19 disease was firstly discovered in Wuhan-China .
Revised:  The new type of corona virus COVID-19 disease was firstly discovered in Wuhan, China .
Edit intent: fluency
Original:  However, recently, the virus has been widely spread in most of the world countries and is reported as a pandemic .
Revised:  However, recently, the virus has widely spread in most of the world countries and is reported as a pandemic .
Edit intent: fluency
Original:  However, recently, the virus has been widely spread in most of the world countries and is reported as a pandemic .
Revised:  However, recently, the virus has been widely spread in most of the world and causing a pandemic according to the World Health Organization (WHO) .
Edit intent: clarity
Original:  Further, nowadays, all the world countries are striving to control the coronavirus disease COVID-19.
Revised:  Further, nowadays, all the world countries are striving to control the COVID-19.
Edit intent: clarity
Original:  There are many mechanisms to detect the coronavirus disease COVID-19 including clinical analysis of chest CT scan images and blood test results.
Revised:  There are many mechanisms to detect coronavirus including clinical analysis of chest CT scan images and blood test results.
Edit intent: clarity
Original:  However, such devices are incurring huge cost and it takes time to install them and use.
Revised:  However, such devices are incurring huge cost , taking time to install them and use.
Edit intent: coherence
Original:  Therefore, in this paper, a new framework is proposed to detect coronavirus disease COVID-19 using onboard smartphone sensors.
Revised:  Therefore, in this paper, a new framework is proposed to detect COVID-19 using onboard smartphone sensors.
Edit intent: clarity
Original:  Therefore, in this paper, a new framework is proposed to detect coronavirus disease COVID-19 using onboard smartphone sensors.
Revised:  Therefore, in this paper, a new framework is proposed to detect coronavirus disease COVID-19 using built-in smartphone sensors.
Edit intent: clarity
Original:  The proposal provides a low-cost solution, since most of the radiologists have already held smartphones for different daily-purposes.
Revised:  The proposal provides a low-cost solution, since most of radiologists have already held smartphones for different daily-purposes.
Edit intent: fluency
Original:  People can use the framework on their smartphones for the virus detection purpose.
Revised:  Not only that but also ordinary people can use the framework on their smartphones for the virus detection purpose.
Edit intent: coherence
Original:  Among them, graph attention networks (GATs) first employ a self-attention strategy to learn attention weights for each edge in the spatial domain.
Revised:  Among them, Graph Attention Network (GAT) first employs a self-attention strategy to learn attention weights for each edge in the spatial domain.
Edit intent: clarity
Original:  However, learning the attentions over edges only pays attention to the local information of graphs and greatly increases the number of parameters .
Revised:  However, learning the attentions over edges can only focus on the local information of graphs and greatly increases the number of parameters .
Edit intent: clarity
Original:  However, learning the attentions over edges only pays attention to the local information of graphs and greatly increases the number of parameters .
Revised:  However, learning the attentions over edges only pays attention to the local information of graphs and greatly increases the computational costs .
Edit intent: clarity
Original:  In this paper, we first introduce attentions in the spectral domain of graphs .
Revised:  In this paper, we first introduce the attention mechanism in the spectral domain of graphs .
Edit intent: clarity
Original:  Accordingly, we present Spectral Graph Attention Network (SpGAT) that learn representations for different frequency components regarding weighted filters and graph wavelets bases.
Revised:  Accordingly, we present Spectral Graph Attention Network (SpGAT) that learns representations for different frequency components regarding weighted filters and graph wavelets bases.
Edit intent: fluency
Original:   We thoroughly evaluate the performance of SpGAT in the semi-supervised node classification task and verified the effectiveness of the learned attentions in the spectral domain.
Revised:  We thoroughly evaluate the performance of SpGAT in the semi-supervised node classification tasks and verify the effectiveness of the learned attentions in the spectral domain.
Edit intent: fluency
Original: Writing high-performance code requires significant expertise of the programming language, compiler optimizations, and hardware knowledge.
Revised: Writing high-performance code requires significant expertise in the programming language, compiler optimizations, and hardware knowledge.
Edit intent: clarity
Original:  A key innovation is utilizing  mathematical complexity of the kernels as a feature to achieve higher accuracy.
Revised:  A key innovation is utilizing the mathematical complexity of the kernels as a feature to achieve higher accuracy.
Edit intent: fluency
Original:  We further demonstrate that our variant selection approach can be used in Halide implementations to obtain up to 1.5 x speedup over Halide's autoscheduler .
Revised:  We further demonstrate that our variant-selection approach can be used in Halide implementations to obtain up to 1.5 x speedup over Halide's autoscheduler .
Edit intent: fluency
Original:  We further demonstrate that our variant selection approach can be used in Halide implementations to obtain up to 1.5 x speedup over Halide's autoscheduler .
Revised:  We further demonstrate that our variant selection approach can be used in Halide implementations to obtain up to 1.5 x speedup over Halide's auto-scheduler .
Edit intent: fluency
Original:  Even worse, it is known that the "second best" mechanism-the mechanism that maximizes social welfare subject to the other constraints-has to be carefully tailored to the Bayesian priors and is extremely complex.
Revised:  Even worse, it is known that the "second best" mechanism-the mechanism that maximizes social welfare subject to the Bayesian priors and is extremely complex.
Edit intent: clarity
Original:  We investigate the existence and computation of \beta-plurality points, and obtain the following results . * Define \beta^*_d := \sup \{ \beta : \text{any finite multiset V in R^d admits a \beta-plurality point} \}.
Revised:  We investigate the existence and computation of \beta-plurality points, and obtain the following . * Define \beta^*_d := \sup \{ \beta : \text{any finite multiset V in R^d admits a \beta-plurality point} \}.
Edit intent: clarity
Original: With the broader and highly successful usage of machine learning in industry and the sciences, there has been a growing demand for explainable AI.
Revised: With the broader and highly successful usage of machine learning in industry and the sciences, there has been a growing demand for Explainable AI.
Edit intent: fluency
Original:  Interpretability and explanation methods for gaining a better understanding about the problem solving abilities and strategies of nonlinear Machine Learning such as Deep Learning (DL), LSTMs, and kernel methods are therefore receiving increased attention.
Revised:  Interpretability and explanation methods for gaining a better understanding about the problem solving abilities and strategies of nonlinear Machine Learning , in particular, deep neural networks, are therefore receiving increased attention.
Edit intent: clarity
Original: We consider an online assortment problem with [n]:=\{1,2,\ldots,n\} sellers, each holding exactly one item i\in[n] of initial inventory c_i\in Z_+, and a sequence of homogeneous buyers arriving over a finite time horizon t=1,2,\ldots,m.
Revised: We consider an online assortment problem with [n]:=\{1,2,\ldots,n\} sellers, each holding exactly one item i\in[n] with initial inventory c_i\in Z_+, and a sequence of homogeneous buyers arriving over a finite time horizon t=1,2,\ldots,m.
Edit intent: clarity
Original:  In particular, in this model, the revenue obtained from selling an item i at a given time t critically depends on the assortment S_t offered at that time and is given by the Nash equilibrium of a Bertrand game played among the sellers in S_t. This imposes a strong dependence/externality between the offered assortments, items revenues, and inventory levels.
Revised:  In this model, the revenue obtained from selling an item i at a given time t critically depends on the assortment S_t offered at that time and is given by the Nash equilibrium of a Bertrand game played among the sellers in S_t. This imposes a strong dependence/externality between the offered assortments, items revenues, and inventory levels.
Edit intent: coherence
Original:  In particular, in this model, the revenue obtained from selling an item i at a given time t critically depends on the assortment S_t offered at that time and is given by the Nash equilibrium of a Bertrand game played among the sellers in S_t. This imposes a strong dependence/externality between the offered assortments, items revenues, and inventory levels.
Revised:  In particular, in this model, the revenue obtained from selling an item i at a given time t critically depends on the assortment S_t offered at that time and is given by the Nash equilibrium of a Bertrand game among the sellers in S_t. This imposes a strong dependence/externality between the offered assortments, items revenues, and inventory levels.
Edit intent: clarity
Original:  Despite these challenges, we devise the first constant factor competitive algorithm for the online platform .
Revised:  Despite these challenges, we devise a constant competitive algorithm for the online platform .
Edit intent: clarity
Original:  In this model, the revenue obtained from selling an item i at a given time t critically depends on the assortment S_t offered at that time and is given by the Nash equilibrium of a Bertrand game among the sellers in S_t. This imposes a strong dependence/externality between the offered assortments, items revenues, and inventory levels.
Revised:  In this model, the revenue obtained from selling an item i at a given time t critically depends on the assortment S_t offered at that time and is given by the Nash equilibrium of a Bertrand game among the sellers in S_t. This imposes a strong dependence/externality among the offered assortments, items revenues, and inventory levels.
Edit intent: fluency
Original:  Despite these challenges , we devise a constant competitive algorithm for the online assortment problem with homogeneous buyers.
Revised:  Despite that challenge , we devise a constant competitive algorithm for the online assortment problem with homogeneous buyers.
Edit intent: clarity
Original:  Under a mild market consistency assumption, we show that the generalized Bertrand game admits a pure strategy Nash equilibrium over arbitrary buyer-seller bipartite graphs.
Revised:  Under a mild market consistency assumption, we show that the generalized Bertrand game admits a pure Nash equilibrium over arbitrary buyer-seller bipartite graphs.
Edit intent: clarity
Original:  In this model, the revenue obtained from selling an item i at a given time t critically depends on the assortment S_t offered at that time and is given by the Nash equilibrium of a Bertrand game among the sellers in S_t. This imposes a strong dependence/externality among the offered assortments, items revenues, and inventory levels.
Revised:  In this model, the revenue obtained from selling an item i at a given time t critically depends on the assortment S_t offered at that time and is given by the Nash equilibrium of a Bertrand game among the sellers in S_t. This imposes a strong dependence/externality among the offered assortments, sellers' revenues, and inventory levels.
Edit intent: clarity
Original:  A suite of computational fluid dynamics (CFD) simulations geared towards chemical process equipment modelling has been developed and validated with experimental results from the literature.
Revised:  A suite of computational fluid dynamics (CFD) simulations geared toward chemical process equipment modelling has been developed and validated with experimental results from the literature.
Edit intent: fluency