wanyu/IteraTeR_v2 huggingface dataset:
Original:  Hence, most of the mobile healthcare applications leverage the cloud computing infrastructure, where the data collected on the mobile / IoT devices would be transmitted to the cloud computing platforms for analysis.
Revised:  Hence, most of the mobile healthcare systems leverage the cloud computing infrastructure, where the data collected on the mobile / IoT devices would be transmitted to the cloud computing platforms for analysis.
Edit intent: clarity
Original:  Hence, most of the mobile healthcare applications leverage the cloud computing infrastructure, where the data collected on the mobile / IoT devices would be transmitted to the cloud computing platforms for analysis.
Revised:  Hence, most of the mobile healthcare applications leverage the cloud computing infrastructure, where the data collected by the mobile and IoT devices would be transmitted to the cloud computing platforms for analysis.
Edit intent: clarity
Original:  However, in  contested environments, relying on the cloud server might not be practical at all times ;
Revised:  However, in the contested environments, relying on the cloud server might not be practical at all times ;
Edit intent: fluency
Original:  However, in  contested environments, relying on the cloud server might not be practical at all times ;
Revised:  However, in contested environments, relying on the cloud might not be practical at all times ;
Edit intent: clarity
Original:  In this paper, we propose SAIA, a Split Artificial Intelligence Architecture for mobile healthcare systems.
Revised:  We propose SAIA, a Split Artificial Intelligence Architecture for mobile healthcare systems.
Edit intent: clarity
Original:  Unlike traditional approach for artificial intelligence (AI) which solely exploits the computational power of the cloud server, SAIA  not only relies on the cloud computing infrastructure while the wireless communication is available, but also utilizes the lightweight AI solutions that work locally at the client side (e.g., mobile and IoT devices), hence, it can work even when the communication is impeded.
Revised:  Unlike traditional approaches for artificial intelligence (AI) which solely exploits the computational power of the cloud server, SAIA not only relies on the cloud computing infrastructure while the wireless communication is available, but also utilizes the lightweight AI solutions that work locally at the client side (e.g., mobile and IoT devices), hence, it can work even when the communication is impeded.
Edit intent: fluency
Original:  Unlike traditional approach for artificial intelligence (AI) which solely exploits the computational power of the cloud server, SAIA  not only relies on the cloud computing infrastructure while the wireless communication is available, but also utilizes the lightweight AI solutions that work locally at the client side (e.g., mobile and IoT devices), hence, it can work even when the communication is impeded.
Revised:  Unlike traditional approach for artificial intelligence (AI) which solely exploits the computational power of the cloud server, SAIA could not only relies on the cloud computing infrastructure while the wireless communication is available, but also utilizes the lightweight AI solutions that work locally at the client side (e.g., mobile and IoT devices), hence, it can work even when the communication is impeded.
Edit intent: clarity
Original:  Unlike traditional approach for artificial intelligence (AI) which solely exploits the computational power of the cloud server, SAIA  not only relies on the cloud computing infrastructure while the wireless communication is available, but also utilizes the lightweight AI solutions that work locally at the client side (e.g., mobile and IoT devices), hence, it can work even when the communication is impeded.
Revised:  Unlike traditional approach for artificial intelligence (AI) which solely exploits the computational power of the cloud server, SAIA not only relies on the cloud computing infrastructure while the wireless communication is available, but also utilizes the lightweight AI solutions that work locally on the client side (e.g., mobile and IoT devices), hence, it can work even when the communication is impeded.
Edit intent: fluency
Original:  Unlike traditional approach for artificial intelligence (AI) which solely exploits the computational power of the cloud server, SAIA  not only relies on the cloud computing infrastructure while the wireless communication is available, but also utilizes the lightweight AI solutions that work locally at the client side (e.g., mobile and IoT devices), hence, it can work even when the communication is impeded.
Revised:  Unlike traditional approach for artificial intelligence (AI) which solely exploits the computational power of the cloud server, SAIA not only relies on the cloud computing infrastructure while the wireless communication is available, but also utilizes the lightweight AI solutions that work locally at the client side , hence, it can work even when the communication is impeded.
Edit intent: coherence
Original:  In the experimental evaluation, extensive experiments have been conducted on two popular healthcare datasets.
Revised:  In our experimental evaluation, extensive experiments have been conducted on two popular healthcare datasets.
Edit intent: fluency
Original:  One model is developed to interpret the fast-growth phase of the epidemic and another model for the full interpretation during the fast-, slow- and plateau phases . Both models are shown to agree reasonably with the data.
Revised:  One model is developed to interpret the fast-growth phase of the epidemic and another model for an interpretation of the entire data set . Both models are shown to agree reasonably with the data.
Edit intent: clarity
Original:  One model is developed to interpret the fast-growth phase of the epidemic and another model for the full interpretation during the fast-, slow- and plateau phases . Both models are shown to agree reasonably with the data.
Revised:  One model is developed to interpret the fast-growth phase of the epidemic and another model for the full interpretation during the fast-, slow- and plateau phases . Both models agree reasonably with the data.
Edit intent: clarity
Original:  It is shown  that during the fast phase, the number of new infected cases in several countries depends on the total number of cases by a power-law relation with a scaling exponent equal to 0.82.
Revised:  It is shown that during the fast phase, the number of new infected cases depends on the total number of cases by a power-law relation with a scaling exponent equal to 0.82.
Edit intent: clarity
Original:  We } apply these results to solve the synthesis problem of strategies resolving non-determinism in (non-deterministic) register transducers on data words .
Revised:  We } apply these results to the transducer synthesis problem for input-driven register automata, where each output data is restricted to be the content of some register, and show that if there exists an implementation, then there exists one which is a register transducer .
Edit intent: clarity
Original: When a problem has more than one solution, it is often important, depending on the underlying context, to list them all.
Revised: When a problem has more than one solution, it is often important, depending on the underlying context, to enumerate (i.e. to list) them all.
Edit intent: clarity
Original:  This paper addresses this problem by proposing what we called alazy listing algorithm.
Revised:  lazy listing algorithm.
Edit intent: coherence
Original:  This paper addresses this problem by proposing what we called alazy listing algorithm.
Revised:  This paper addresses this problem by proposing what we called a algorithm.
Edit intent: clarity
Original: When a problem has more than one solution, it is often important, depending on the underlying context, to enumerate (i.e.  to list) them all.
Revised: When a problem has more than one solution, it is often important, depending on the underlying context, to enumerate (i.e. , to list) them all.
Edit intent: fluency
Original:  In this work we prove, under a syntactical constraint called safety, decidability of the model-checking problem for recursion schemes against properties defined by alternating B-automata, an extension of alternating parity automata for infinite trees with a boundedness acceptance condition.
Revised:  In this work we prove, under a syntactical constraint called safety, decidability of the model-checking problem for recursion schemes against properties defined by alternating B-automata, an extension of alternating parity automata over infinite trees with a boundedness acceptance condition.
Edit intent: fluency
Original: In this paper we study the mincut problem on connected graphs in the online setting.
Revised: In this paper we study the mincut problem in the online setting.
Edit intent: clarity
Original:  whenever a new vertex arrives it's adjacency to previously revealed vertices are given .
Revised:  whenever a new vertex arrives it's neighborhood with respect to the set of known vertices is revealed .
Edit intent: clarity
Original:  An online algorithm must make an irrevocable decision to determine the side of the cut that the vertex must belong to in order to minimize the size of the  cut.
Revised:  An online algorithm must make an irrevocable decision to determine the side of the cut that the vertex must belong to in order to minimize the size of the final cut.
Edit intent: clarity
Original:  Nevertheless we obtain a complete analysis with error comprising of stochastic dimension truncation error, finite element error and cubature error, with results comparable to those obtained for the diffusion problem.
Revised:  Nevertheless we obtain a complete analysis with error comprising stochastic dimension truncation error, finite element error and cubature error, with results comparable to those obtained for the diffusion problem.
Edit intent: clarity
Original:  We then show that if one picks the best among two matchings or modifies a random matching even a little, using the so-called flip operation, it leads to MaXWeight like heavy-traffic performance under uniform traffic.
Revised:  We then show that if one picks the best among two matchings or modifies a random matching even a little, using the so-called flip operation, it leads to MaxWeight like heavy-traffic performance under uniform traffic.
Edit intent: clarity
Original:  Finally, we use simulations to compare the performance of various algorithms.
Revised:  Finally, we perform empirical study on a new algorithm to compare its performance with some existing algorithms.
Edit intent: clarity
Original: Many information retrieval and natural language processing  problems can be formalized as a semantic matchingtask.
Revised: Many natural language processing problems can be formalized as a semantic matchingtask.
Edit intent: clarity
Original:  However, the existing work in this area has been focused in large part on the matching between short texts like finding answer spans, sentences and passages given a query or a natural language question.
Revised:  However, the existing work in this area has been largely focused on matching between short texts like finding answer spans, sentences and passages given a query or a natural language question.
Edit intent: clarity
Original:  However, the existing work in this area has been focused in large part on the matching between short texts like finding answer spans, sentences and passages given a query or a natural language question.
Revised:  However, the existing work in this area has been focused in large part on the matching between short texts (e.g., question answering), or between a short and a long text (e.g., ad-hoc retrieval).
Edit intent: coherence
Original:  Semantic matching between long-form texts like documents, which can be applied to applications such as document clustering, news recommendationand related article recommendation  , is relatively less explored and needs more research effort.
Revised:  Semantic matching between long-form documents, which can be applied to applications such as document clustering, news recommendationand related article recommendation , is relatively less explored and needs more research effort.
Edit intent: clarity
Original:  Semantic matching between long-form texts like documents, which can be applied to applications such as document clustering, news recommendationand related article recommendation  , is relatively less explored and needs more research effort.
Revised:  Semantic matching between long-form texts like documents, which has many important applications like news recommendation, related article recommendation , is relatively less explored and needs more research effort.
Edit intent: clarity
Original:  These kinds of models, however, are still restricted to short text sequences like sentences due to the quadratic computational time and space complexity of self-attention with respect to the input sequence length.
Revised:  These kinds of models, however, are still limited to short text sequences like sentences due to the quadratic computational time and space complexity of self-attention with respect to the input sequence length.
Edit intent: coherence
Original:  These kinds of models, however, are still restricted to short text sequences like sentences due to the quadratic computational time and space complexity of self-attention with respect to the input sequence length.
Revised:  These kinds of models, however, are still restricted to short text sequences like sentences due to the quadratic computational complexity of self-attention with respect to the input sequence length.
Edit intent: clarity
Original:  These kinds of models, however, are still restricted to short text sequences like sentences due to the quadratic computational time and space complexity of self-attention with respect to the input sequence length.
Revised:  These kinds of models, however, are still restricted to short text sequences like sentences due to the quadratic computational time and space complexity of self-attention with respect to input text length.
Edit intent: fluency
Original:  For model pre-training, we propose the masked sentence block language modeling task in addition to the original masked word language modeling task used in BERT, to capture sentence block relations within a document.
Revised:  For model pre-training, we propose the masked sentence block language modeling task in addition to the masked word language modeling task used in BERT, to capture sentence block relations within a document.
Edit intent: clarity
Original:  This paper starts the first step to rigorously analyze evolutionary algorithms for time-linkage functions.
Revised:  This paper takes the first step to rigorously analyze evolutionary algorithms for time-linkage functions.
Edit intent: clarity
Original:  Currently , the applied methods are outdated, labour intensive and highly inaccurate.
Revised:  Currently applied methods are outdated, labour intensive and highly inaccurate.
Edit intent: coherence
Original:  Currently , the applied methods are outdated, labour intensive and highly inaccurate.
Revised:  Currently , the applied methods are outdated, labour-intensive and inaccurate.
Edit intent: clarity
Original:  At the same time, the latest methods using Artificial Intelligence techniques , despite achieving satisfactory results in the detection of infrastructure damage, are severely limited in their application due to two main factors - labour-intensive gathering of new datasets and high demand for computing power.
Revised:  At the same time, the latest methods using Artificial Intelligence techniques are severely limited in their application due to two main factors - labour-intensive gathering of new datasets and high demand for computing power.
Edit intent: coherence
Original:  At the same time, the latest methods using Artificial Intelligence techniques , despite achieving satisfactory results in the detection of infrastructure damage, are severely limited in their application due to two main factors - labour-intensive gathering of new datasets and high demand for computing power.
Revised:  At the same time, the latest methods using Artificial Intelligence techniques , despite achieving satisfactory results in the detection of infrastructure damage, are severely limited in their application due to two main factors -- labour-intensive gathering of new datasets and high demand for computing power.
Edit intent: fluency
Original:  In the presented work, we propose to utilize Transfer Learning techniques and computer vision to overcome these limiting factor and fully harness the advantages of Artificial Intelligence methods.
Revised:  We propose to utilize Transfer Learning techniques and computer vision to overcome these limiting factor and fully harness the advantages of Artificial Intelligence methods.
Edit intent: clarity
Original:  It is implemented in the form of a ready-to-use software package distributed under an open software licence and available for the public.
Revised:  It is implemented in the form of a ready-to-use software package openly distributed to the public.
Edit intent: clarity
Original: We prove a uniform bounded variation estimate for finite volume approximations of the nonlinear scalar conservation law \partial_t \alpha + div(uf(\alpha)) = 0 in two  dimensions with an initial data of bounded variation  .
Revised: A uniform bounded variation estimate for finite volume approximations of the nonlinear scalar conservation law \partial_t \alpha + div(uf(\alpha)) = 0 in two dimensions with an initial data of bounded variation .
Edit intent: coherence
Original:  A uniform bounded variation estimate provides compactness for finite volume approximations in L^p spaces, which is essential to prove the existence of a solution for a partial differential equation (p.d.e.) with nonlinear terms in \alpha, when uniqueness of the solution is not available.
Edit intent: coherence
Original:   ] Results from numerical tests are provided , and they complement theoretical findings.
Revised:  14] Results from numerical tests are provided , and they complement theoretical findings.
Edit intent: fluency
Original:   ] Results from numerical tests are provided , and they complement theoretical findings.
Revised:  ] Results from numerical tests are provided and they complement theoretical findings.
Edit intent: fluency
Original:  Epidemic models relying on the incidence rate of new cases for forecasting epidemic outbreaks have received increasing attention.
Revised:  Mathematical and empirical models relying on the incidence rate of new cases for forecasting epidemic outbreaks have received increasing attention.
Edit intent: clarity
Original:  Here , we propose a SUIR model based on the classical SIR model object to supervise the effective prediction, prevention, and control of infectious diseases.
Revised:  Here , we propose a Susceptible-Undiagnosed-Infected-Removed (SUIR) model to offer the effective prediction, prevention, and control of infectious diseases.
Edit intent: clarity
Original: The predictability of social media popularity is a topic of much scientific interest and significant practical importance.
Revised: Our global population contributes visual content on platforms like Instagram, attempting to express themselves and engage their audiences, at an unprecedented and increasing rate. In this paper, we revisit the popularity prediction on Instagram.
Edit intent: coherence
Original:  We use transfer learning to extract visual semantics  as concepts, scenes, and objects, which allows us to interpret and explain the trained model and predictions.
Revised:  We use transfer learning to extract visual semantics such as concepts, scenes, and objects, which allows us to interpret and explain the trained model and predictions.
Edit intent: clarity
Original: We present an in-place algorithm for the parallel partition problem that has linear work and polylogarithmic span.
Revised: We present an in-place algorithm for the partition problem that has linear work and polylogarithmic span.
Edit intent: clarity
Original:  The system of EVIDENCEMINER is available at URL evidenceminer.firebaseapp.com/.
Edit intent: coherence
Original:  For these algorithms we only derive upper bounds , which are of the form \exp(-c_3 N^{1/(2d)}) for a positive constant c_3.
Revised:  For these algorithms we derive upper bounds , which are of the form \exp(-c_3 N^{1/(2d)}) for a positive constant c_3.
Edit intent: clarity
Original:  For these algorithms we only derive upper bounds , which are of the form \exp(-c_3 N^{1/(2d)}) for a positive constant c_3.
Revised:  For these algorithms we only derive upper bounds of the form \exp(-c_3 N^{1/(2d)}) for a positive constant c_3.
Edit intent: clarity
Original: To effectively tackle sexism online, research has focused on automated methods for detecting sexism .
Revised: Research has focused on automated methods for detecting sexism .
Edit intent: clarity
Original: To effectively tackle sexism online, research has focused on automated methods for detecting sexism .
Revised: To effectively tackle sexism online, research has focused on automated methods to effectively detect sexism online. Although overt sexism seems easy to spot, its subtle forms and manifold expressions are not.
Edit intent: coherence
Original:  A section on a proposed time-dependent adjusted SIRD model for NUTS-3 regions is also provided in the app .
Revised:  A section on a proposed time-dependent adjusted SIRD model for NUTS-3 regions is also provided in the dashboard .
Edit intent: clarity
Original: This work deals with the fractional SIS epidemic model  in the case of constant population size.
Revised: In this paper we consider the fractional SIS epidemic model in the case of constant population size.
Edit intent: clarity
Original:  We provide a representation of the explicit solution to the fractional model under suitable assumptions and we validate the results by considering two numerical schemes.
Revised:  We provide a representation of the explicit solution to the fractional model and we illustrate the results by considering two numerical schemes.
Edit intent: clarity
Original:  We provide a representation of the explicit solution to the fractional model under suitable assumptions and we validate the results by considering two numerical schemes.
Revised:  We provide a representation of the explicit solution to the fractional model under suitable assumptions and we validate the results by numerical schemes.
Edit intent: clarity
Original:  We introduce a " Markov chains of Markov chains " model such that with probably (1-\omega) \in[0,1]  random walkers remain in the same layer and follow (layer-specific) \emph{intralayer Markov chains , whereas with probability \omega they move to different layers following (node-specific) interlayer Markov chains .
Revised:  We introduce a novel `` Markov chains of Markov chains " model such that with probably (1-\omega) \in[0,1] random walkers remain in the same layer and follow (layer-specific) \emph{intralayer Markov chains , whereas with probability \omega they move to different layers following (node-specific) interlayer Markov chains .
Edit intent: clarity
Original:  We introduce a " Markov chains of Markov chains " model such that with probably (1-\omega) \in[0,1]  random walkers remain in the same layer and follow (layer-specific) \emph{intralayer Markov chains , whereas with probability \omega they move to different layers following (node-specific) interlayer Markov chains .
Revised:  We introduce a " Markov chains of Markov chains " model such that with probably (1-\omega) \in[0,1] random walkers remain in the same layer and follow (layer-specific) \emph{intralayer Markov chains , whereas with probability \omega they move to different layers following (node-specific) interlayer Markov chains .
Edit intent: fluency