wanyu/IteraTeR_full_sent huggingface dataset:
Original:  The discussion is also instrumental , on the basis of some very simplified , but working, hypotheses , to frame the logistic and \theta-logistic equations in an unified context, within which also the Gompertz model emerges from  anomalous scaling.
Revised:  The discussion is also instrumental , on the basis of a few simplified but functional hypotheses - to frame the logistic and \theta-logistic equations in an unified context, within which also the Gompertz model emerges from anomalous scaling.
Edit intent: clarity
Original:  The discussion is also instrumental , on the basis of some very simplified , but working, hypotheses , to frame the logistic and \theta-logistic equations in an unified context, within which also the Gompertz model emerges from  anomalous scaling.
Revised:  The discussion is also instrumental , on the basis of some very simplified , but working, hypotheses , to frame the logistic and \theta-logistic equations in a unified context, within which also the Gompertz model emerges from anomalous scaling.
Edit intent: fluency
Original:  The discussion is also instrumental , on the basis of some very simplified , but working, hypotheses , to frame the logistic and \theta-logistic equations in an unified context, within which also the Gompertz model emerges from  anomalous scaling.
Revised:  The discussion is also instrumental , on the basis of some very simplified , but working, hypotheses , to frame the logistic and \theta-logistic equations in an unified context, within which also the Gompertz model emerges from an anomalous scaling.
Edit intent: fluency
Original:  In the second half of the paper we pass then to deal with the logistic and \theta-logistic stochastic models for which, but for the Gompertz case, many aspects are not completely defined. The solutions of the processes contain in fact some exponential functionals of Brownian motion, a rather complex kind of processes extensively studied in financial contexts. First, we recall a few known results, and then we exploit some integral representation that allow to establish simple estimates on the moments of the processes. Furthermore, we derive closed expressions for the transition probability density functions, on which too we obtain some easy estimate implying other bounds for all the moments
Edit intent: meaning-changed
Original:  In this document  we explore the definition of  energy transition, how it is reached,  what are the driven factors to achieve it , and why in the 21st century context we can refer to it as Green energy transition .
Revised:  In this document , we explore the definition of energy transition, how it is reached, what are the driven factors to achieve it , and why in the 21st century context we can refer to it as Green energy transition .
Edit intent: fluency
Original:  In this document  we explore the definition of  energy transition, how it is reached,  what are the driven factors to achieve it , and why in the 21st century context we can refer to it as Green energy transition .
Revised:  In this document we explore the definition of green energy transition, how it is reached, what are the driven factors to achieve it , and why in the 21st century context we can refer to it as Green energy transition .
Edit intent: meaning-changed
Original:  In this document  we explore the definition of  energy transition, how it is reached,  what are the driven factors to achieve it , and why in the 21st century context we can refer to it as Green energy transition .
Revised:  In this document we explore the definition of energy transition, how it is reached, and what are the driven factors to achieve it , and why in the 21st century context we can refer to it as Green energy transition .
Edit intent: fluency
Original:  To answer that firstly, we have conducted a literature review discovering definitions from different disciplines, secondly, gathering the key factors that are drivers for energy transition, finally, a preliminary analysis of the factors is conducted within the context of European Union data preliminary finding that household net income and governmental legal actions related to environment are potential candidates to predict energy transition within countries.
Revised:  To answer that firstly, we have conducted a literature review discovering definitions from different disciplines, secondly, gathering the key factors that are drivers for energy transition, finally, an analysis of the factors is conducted within the context of European Union data preliminary finding that household net income and governmental legal actions related to environment are potential candidates to predict energy transition within countries.
Edit intent: clarity
Original:  To answer that firstly, we have conducted a literature review discovering definitions from different disciplines, secondly, gathering the key factors that are drivers for energy transition, finally, a preliminary analysis of the factors is conducted within the context of European Union data preliminary finding that household net income and governmental legal actions related to environment are potential candidates to predict energy transition within countries.
Revised:  To answer that firstly, we have conducted a literature review discovering definitions from different disciplines, secondly, gathering the key factors that are drivers for energy transition, finally, a preliminary analysis of the factors is conducted within the context of European Union data . Preliminary results have shown that household net income and governmental legal actions related to environment are potential candidates to predict energy transition within countries.
Edit intent: clarity
Original:  To answer that firstly, we have conducted a literature review discovering definitions from different disciplines, secondly, gathering the key factors that are drivers for energy transition, finally, a preliminary analysis of the factors is conducted within the context of European Union data preliminary finding that household net income and governmental legal actions related to environment are potential candidates to predict energy transition within countries.
Revised:  To answer that firstly, we have conducted a literature review discovering definitions from different disciplines, secondly, gathering the key factors that are drivers for energy transition, finally, a preliminary analysis of the factors is conducted within the context of European Union data preliminary finding that household net income and governmental legal actions related to environmental issues are potential candidates to predict energy transition within countries.
Edit intent: clarity
Original: In the Maximum Clique Problem, the objective is to find a clique whose size is maximum among all the cliques of an arbitrary undirected and unweighted graph. Maximum Clique Problem resembles with minimum vertex cover problem , independent set problem. As it is an NP-hard problem, no polynomial time algorithms can be found. As these problems have several important practical applications such as information retrieval, community detection in network, spatial data mining etc, it is of great interest to try to synthesis the circuit of Maximum Clique Problem. In classical computing any brute-force solution to the Maximum Clique Problem requires an exponential increase of time with the size of the problem (i.e., with time complexity of O(2^n)) . In this paper, Maximum Clique Problem has been solved using combinatorial approachof Grover's search algorithm .
Revised: Clique problem has several applications in computer vision, automatic test pattern generation, predicting protein structures, and many kinds of such pattern search . In this paper, Maximum Clique Problem has been solved using combinatorial approachof Grover's search algorithm .
Edit intent: meaning-changed
Original:  In classical computing any brute-force solution to the Maximum Clique Problem requires an exponential increase of time with the size of the problem (i.e., with time complexity of O(2^n)) . In this paper, Maximum Clique Problem has been solved using combinatorial approachof Grover's search algorithm . An algorithm has been proposed that auto-generates the circuit for any given undirected and unweighted graph  which makes the approach generalized in nature for Maximum Clique Problem.
Revised:  In classical computing any brute-force solution to the Maximum Clique Problem requires an exponential increase of time with the size of the problem (i.e., with time complexity of O(2^n)) . In this paper, a generalized algorithm for the k-Clique problem has been newly proposed using a classical-quantum hybrid approach, which can also be extended as a generalized algorithm for maximum clique problem. The complexity of the proposed algorithm has been proposed that auto-generates the circuit for any given undirected and unweighted graph which makes the approach generalized in nature for Maximum Clique Problem.
Edit intent: meaning-changed
Original:  An algorithm has been proposed that auto-generates the circuit for any given undirected and unweighted graph  which makes the approach generalized in nature for Maximum Clique Problem. Computational speed up is achieved by using our approach with the help of quantum mechanical effect that is quantum superposition. We have simulated the proposed circuit using IBM 's QISkit platform and verified its correctness .
Revised:  An algorithm has been proposed that auto-generates the circuit for any given undirected and unweighted graph which makes the approach generalized in nature . The experimental result of the generic algorithm has been implemented in the IBMQ\_Qasm\_Simulator. The generated circuit can also be mapped in Noisy Intermediate-Scale Quantum (NISQ) devices(IBM QX architecture) .
Edit intent: meaning-changed
Original: Clique problem has several applications in computer vision, automatic test pattern generation, predicting protein structures, and many kinds of such pattern search .
Revised: Clique problem has several applications for its pattern matching ability. k-clique problem, a special case of clique problem, determines whether an arbitrary graph contains a clique of size k, has already been addressed in quantum domain. A variant of k-clique problem that lists all cliques of size k, has also popular modern-day applications. Albeit, the implementation of such variant of k-clique problem in quantum setting still remains untouched .
Edit intent: meaning-changed
Original:  In this paper, a generalized algorithm for the k-Clique problemhas been newly proposed using a classical-quantum hybrid approach , which can also be extended as a generalized algorithm for maximum clique problem .
Revised:  In this paper, apart from theoretical solution of such k-clique problem, practical quantum gate-based implementation has been addressed using Grover's algorithm. This approach is further extended to design circuit for the maximum clique problem .
Edit intent: meaning-changed
Original:  In this paper, a generalized algorithm for the k-Clique problemhas been newly proposed using a classical-quantum hybrid approach , which can also be extended as a generalized algorithm for maximum clique problem . The complexity of the proposed algorithm has been reduced to O(\sqrt{2^{k*log_2n . The algorithm automatically generates the circuit for any given undirected and unweighted graph  , which makes the approach generalized in nature.
Revised:  In this paper, a generalized algorithm for the k-Clique problemhas been newly proposed using a classical-quantum hybrid approach , which can also be extended as a generalized algorithm for maximum clique problem in classical-quantum hybrid architecture . The algorithm automatically generates the circuit for any given undirected and unweighted graph , which makes the approach generalized in nature.
Edit intent: clarity
Original:  The complexity of the proposed algorithm has been reduced to O(\sqrt{2^{k*log_2n . The algorithm automatically generates the circuit for any given undirected and unweighted graph  , which makes the approach generalized in nature.
Revised:  The complexity of the proposed algorithm has been reduced to O(\sqrt{2^{k*log_2n . The algorithm automatically generates the circuit for any given undirected and unweighted graph and any given k , which makes the approach generalized in nature.
Edit intent: meaning-changed
Original:  The complexity of the proposed algorithm has been reduced to O(\sqrt{2^{k*log_2n . The algorithm automatically generates the circuit for any given undirected and unweighted graph  , which makes the approach generalized in nature.
Revised:  The complexity of the proposed algorithm has been reduced to O(\sqrt{2^{k*log_2n . The algorithm automatically generates the circuit for any given undirected and unweighted graph , which makes our approach generalized in nature.
Edit intent: fluency
Original:  The experimental result of the generic algorithm has been implemented in the IBMQ\_Qasm\_Simulator. The generated circuit can also be mapped in Noisy Intermediate-Scale Quantum (NISQ) devices (IBMQX architecture) .
Revised:  The proposed approach of solving k-clique problem has exhibited a reduction of qubit cost and circuit depth as compared to the state-of-the-art approach, for a small k with respect to a large graph. A framework that can map the automated generated circuit for clique problem to quantum devices is also proposed. An analysis of the experimental results is demonstrated using IBM's Qiskit .
Edit intent: meaning-changed
Original: We propose a stochastic model for a limit order book with liquidity fluctuations. Our model shows how severe intermittencies in the liquidity can affect the order book dynamics .
Revised: We propose a stochastic model for a limit order book with different type of liquidities. Within this class of models we study the one where a spread decreases uniformly, belonging to the class of processes known as a population processes with uniform catastrophes .
Edit intent: meaning-changed
Original:  Featuring modules that support text data (e.g., text classification, sequence-tagging , open-domain question-answering), vision data (e.g., image classification), and graph data (e.g., node classification, link prediction), ktrain presents a simple unified interface enabling one to quickly solve a wide range of tasks in as little as three or four "commands" or lines of code.
Revised:  Featuring modules that support text data (e.g., text classification, sequence tagging , open-domain question-answering), vision data (e.g., image classification), and graph data (e.g., node classification, link prediction), ktrain presents a simple unified interface enabling one to quickly solve a wide range of tasks in as little as three or four "commands" or lines of code.
Edit intent: fluency
Original:  As a wrapper to TensorFlow and many other libraries (e.g., transformers, scikit-learn, stellargraph), it is designed to make sophisticated, state-of-the-art machine learning models simple to build, train, inspect, and deploy by both beginners and experienced practitioners.
Revised:  As a wrapper to TensorFlow and many other libraries (e.g., transformers, scikit-learn, stellargraph), it is designed to make sophisticated, state-of-the-art machine learning models simple to build, train, inspect, and apply by both beginners and experienced practitioners.
Edit intent: clarity
Original:  Featuring modules that support text data (e.g., text classification, sequence tagging, open-domain question-answering), vision data (e.g., image classification), and graph data (e.g., node classification, link prediction)  , ktrain presents a simple unified interface enabling one to quickly solve a wide range of tasks in as little as three or four "commands" or lines of code.
Revised:  Featuring modules that support text data (e.g., text classification, sequence tagging, open-domain question-answering), vision data (e.g., image classification), graph data (e.g., node classification, link prediction) , ktrain presents a simple unified interface enabling one to quickly solve a wide range of tasks in as little as three or four "commands" or lines of code.
Edit intent: fluency
Original:  Featuring modules that support text data (e.g., text classification, sequence tagging, open-domain question-answering), vision data (e.g., image classification), and graph data (e.g., node classification, link prediction)  , ktrain presents a simple unified interface enabling one to quickly solve a wide range of tasks in as little as three or four "commands" or lines of code.
Revised:  Featuring modules that support text data (e.g., text classification, sequence tagging, open-domain question-answering), vision data (e.g., image classification), and graph data (e.g., node classification, link prediction) , and tabular data , ktrain presents a simple unified interface enabling one to quickly solve a wide range of tasks in as little as three or four "commands" or lines of code.
Edit intent: meaning-changed
Original:  Here, we applied the ivis framework as a novel machine learning based dimensionality reduction method originally developed for single-cell datasets for analysis of macromolecular simulations . Compared with other methods, ivis is  superior in constructing Markov state model (MSM), preserving global distance and maintaining similarity between high dimension and low dimension with the least information loss.
Revised:  ivis is a novel deep learning-based dimensionality reduction method originally developed for single-cell datasets for analysis of macromolecular simulations . Compared with other methods, ivis is superior in constructing Markov state model (MSM), preserving global distance and maintaining similarity between high dimension and low dimension with the least information loss.
Edit intent: clarity
Original:  Here, we applied the ivis framework as a novel machine learning based dimensionality reduction method originally developed for single-cell datasets for analysis of macromolecular simulations . Compared with other methods, ivis is  superior in constructing Markov state model (MSM), preserving global distance and maintaining similarity between high dimension and low dimension with the least information loss.
Revised:  Here, we applied the ivis framework as a novel machine learning based dimensionality reduction method originally developed for single-cell datasets . Here we applied this framework for the study of light, oxygen and voltage (LOV) domain of diatom Phaeodactylum tricornutum aureochrome 1a (PtAu1a) . Compared with other methods, ivis is superior in constructing Markov state model (MSM), preserving global distance and maintaining similarity between high dimension and low dimension with the least information loss.
Edit intent: meaning-changed
Original:  Here, we applied the ivis framework as a novel machine learning based dimensionality reduction method originally developed for single-cell datasets for analysis of macromolecular simulations . Compared with other methods, ivis is  superior in constructing Markov state model (MSM), preserving global distance and maintaining similarity between high dimension and low dimension with the least information loss.
Revised:  Here, we applied the ivis framework as a novel machine learning based dimensionality reduction method originally developed for single-cell datasets for analysis of macromolecular simulations . Compared with other methods, ivis is shown to be superior in constructing Markov state model (MSM), preserving global distance and maintaining similarity between high dimension and low dimension with the least information loss.
Edit intent: coherence
Original:  Here, we applied the ivis framework as a novel machine learning based dimensionality reduction method originally developed for single-cell datasets for analysis of macromolecular simulations . Compared with other methods, ivis is  superior in constructing Markov state model (MSM), preserving global distance and maintaining similarity between high dimension and low dimension with the least information loss.
Revised:  Here, we applied the ivis framework as a novel machine learning based dimensionality reduction method originally developed for single-cell datasets for analysis of macromolecular simulations . Compared with other methods, ivis is superior in constructing Markov state model (MSM), preserving information of both local and global distances and maintaining similarity between high dimension and low dimension with the least information loss.
Edit intent: meaning-changed
Original:  We conclude that a strong reliance on contact tracing to contain the spread of the SARS-CoV-2 pandemic can lead to the potential danger of allowing the pandemic to spread unchecked.
Revised:  We conclude that relying largely on automated contact tracing without population-wide participation to contain the spread of the SARS-CoV-2 pandemic can lead to the potential danger of allowing the pandemic to spread unchecked.
Edit intent: meaning-changed
Original:  The advantage of modeling the pandemic using the reaction mechanism is that the rate constants have sound physical interpretation and could be modeled using the collision rate theory. As such, the infection rate constant is  shown to be linearly related to the square of the virus laden droplet lifetime.
Revised:  The advantage of modeling the pandemic using the reaction mechanism is that the rate constants have sound physical interpretation . The infection rate constant is shown to be linearly related to the square of the virus laden droplet lifetime.
Edit intent: coherence
Original:  In the second part, we have emulated the respiratory droplets responsible for disease transmission as salt solution droplets and computed their evaporation time accounting for initial droplet cooling, heat and mass transfer and finally crystallization of the salt.
Revised:  In the second part, we have emulated the respiratory droplets responsible for disease transmission as salt solution droplets and computed their evaporation time accounting for droplet cooling, heat and mass transfer and finally crystallization of the salt.
Edit intent: clarity
Original:  The model shows that the overall evaporation/desiccation time is indeed dependent on ambient temperature and relative humidity . It is shown that the evaporation time of a particular droplet size could also be chosen as the characteristic lifetime of the droplets.
Revised:  The model shows that the overall evaporation/desiccation time is indeed dependent on ambient temperature and relative humidity , considered at both outdoor and indoor conditions.
Edit intent: meaning-changed
Original:  Such a construction is more parsimonious and tractable in higher dimensions than plain vanilla common shock models. We also consider practical implementation and explicitly incorporate known covariates , such as seasonality patterns and trends, which may explain some of the relationship between two insurance processes( or at least help tease out those relationships ).
Revised:  In aggregate, our approach allows for (i) over-dispersion and auto-correlation within each line of business; (ii) realistic features involving time-varying, known covariates; and (iii) parsimonious dependence between processes without requiring simultaneous primary (e.g. accidents) events. The explicit incorporation of time-varying, known covariates can accommodate characteristics of real data and hence facilitate implementation in practice. In an insurance context, these could be changes in policy volumes over time, as well as seasonality patterns and trends, which may explain some of the relationship between two insurance processes( or at least help tease out those relationships ).
Edit intent: meaning-changed