wanyu/IteraTeR_v2 huggingface dataset:
Original: Knowledge graphs have become popular over the past decade and frequently rely on the Resource Description Framework (RDF) or Property Graph (PG) databases as data models.
Revised: Knowledge graphs have become popular over the past years and frequently rely on the Resource Description Framework (RDF) or Property Graph (PG) databases as data models.
Edit intent: clarity
Original: Knowledge graphs have become popular over the past decade and frequently rely on the Resource Description Framework (RDF) or Property Graph (PG) databases as data models.
Revised: Knowledge graphs have become popular over the past decade and frequently rely on the Resource Description Framework (RDF) or Property Graphs (PG) databases as data models.
Edit intent: fluency
Original: Knowledge graphs have become popular over the past decade and frequently rely on the Resource Description Framework (RDF) or Property Graph (PG) databases as data models.
Revised: Knowledge graphs have become popular over the past decade and frequently rely on the Resource Description Framework (RDF) or Property Graph (PG) as underlying data models.
Edit intent: clarity
Original:  However, the query languages for these two data models -- SPARQL for RDF and the property graph traversal language Gremlin -- are lacking interoperability.
Revised:  However, the query languages for these two data models -- SPARQL for RDF and the property graph traversal -- are lacking interoperability.
Edit intent: coherence
Original: We present a spectral inverse model to estimate a smooth  source function from a limited number of observations for an advection-diffusion problem.
Revised: We present a hp-inverse model to estimate a smooth source function from a limited number of observations for an advection-diffusion problem.
Edit intent: fluency
Original:  Here, the choice of the collocation points is modeled as a random variable and the generalized polynomial chaos (gPC) expansion is used to represent the random mesh system.
Revised:  Here, the choice of the mesh system is modeled as a random variable and the generalized polynomial chaos (gPC) expansion is used to represent the random mesh system.
Edit intent: clarity
Original:  We propose a mixed l1 and l2 regularization to exploit the hierarchical nature of the basis polynomials to find a sparse solution.
Revised:  We propose a mixed l_1 and l_2 regularization to exploit the hierarchical nature of the basis polynomials to find a sparse solution.
Edit intent: fluency
Original:  We propose a mixed l1 and l2 regularization to exploit the hierarchical nature of the basis polynomials to find a sparse solution.
Revised:  We propose a mixed l1 and l2 regularization to exploit the hierarchical nature of the basis functions to find a sparse solution.
Edit intent: clarity
Original:  The spectral inverse model has an advantage over the standard least-square inverse model when the number of data is limited.
Revised:  The hp-inverse model has an advantage over the standard least-square inverse model when the number of data is limited.
Edit intent: clarity
Original:  It is shown that the spectral inverse model provides a good estimate of the source function even when the number of unknown parameters (m) is much larger the number of data (n), e.g., m/n > 50.
Revised:  It is shown that the hp-inverse model provides a good estimate of the source function even when the number of unknown parameters (m) is much larger the number of data (n), e.g., m/n > 50.
Edit intent: clarity
Original:  But, an increasing number of RNA molecules are now known to fold into multiple stable structures.
Revised:  But, an increasing number of RNA sequences are now known to fold into multiple stable structures.
Edit intent: clarity
Original:  We provide an FD transceiver baseline program and present an example FD experiment, where 90dB  overall SI cancellation is achieved  across both the RF and digital domains , demonstrating the FD capability in the ORBIT testbed .
Revised:  We provide an FD transceiver baseline program and present an example FD experiment, where 90dB overall SI cancellation is achieved across both the RF and digital domains .
Edit intent: clarity
Original: We present an O(n) expected time algorithm and an O(n \log n) deterministic time algorithm to find a set of five points that stab a set of n pairwise intersecting disks in the plane.
Revised: We present an O(n) expected time algorithm and an O(n ) time to find five points that stab a set of n pairwise intersecting disks in the plane.
Edit intent: clarity
Original:  We also give a simple construction with 13 pairwise intersecting disks that cannot be stabbed by three  points.
Revised:  We also give a simple example of 13 pairwise intersecting disks that cannot be stabbed by three points.
Edit intent: clarity
Original:  In particular, we show that the problem of finding a feasible embedding is already \mathcal{NP in general, and, hence, the VNEP cannot be approximated under any objective, unless \mathcal{NP = \mathcal{P holds.
Revised:  In particular, we show that the problem of finding a feasible embedding is already \mathcal{NP in general, and, hence, the VNEP cannot be approximated under any objective, unless P = \mathcal{P holds.
Edit intent: fluency
Original:  In particular, we show that the problem of finding a feasible embedding is already \mathcal{NP in general, and, hence, the VNEP cannot be approximated under any objective, unless \mathcal{NP = \mathcal{P holds.
Revised:  In particular, we show that the problem of finding a feasible embedding is already \mathcal{NP in general, and, hence, the VNEP cannot be approximated under any objective, unless \mathcal{NP = NP holds.
Edit intent: clarity
Original:  Any improvement in robust and accurate image-based tumor characterization can assist in determining non-invasive cancer stage, prognosis, and  personalized treatment planning as a part of precision medicine.
Revised:  Any improvement in robust and accurate image-based tumor characterization can assist in determining non-invasive cancer staging and prognosis, and personalized treatment planning as a part of precision medicine.
Edit intent: fluency
Original:  Any improvement in robust and accurate image-based tumor characterization can assist in determining non-invasive cancer stage, prognosis, and  personalized treatment planning as a part of precision medicine.
Revised:  Any improvement in robust and accurate image-based tumor characterization can assist in determining non-invasive cancer stage, prognosis, and foster personalized treatment planning as a part of precision medicine.
Edit intent: fluency
Original:  In the second approach, we explore an unsupervised scheme in order to address the limited availability of labeled training data, a common problem in medical imaging applications.
Revised:  In the second approach, we explore an unsupervised scheme to address the limited availability of labeled training data, a common problem in medical imaging applications.
Edit intent: coherence
Original:  In this second approach, we also seek the answer to the fundamental question about the goodness of "deep features" for unsupervised tumor classification .
Revised:  We also seek the answer to the fundamental question about the goodness of "deep features" for unsupervised tumor classification .
Edit intent: clarity
Original:  Risk stratification of cancer tumors in radiology images can be improved with computer-aided diagnosis (CAD) tools which can be made faster and more accurate .
Revised:  Risk stratification of cancer tumors in radiology images can be more accurate and faster with computer-aided diagnosis (CAD) tools which can be made faster and more accurate .
Edit intent: clarity
Original:  Risk stratification of cancer tumors in radiology images can be improved with computer-aided diagnosis (CAD) tools which can be made faster and more accurate .
Revised:  Risk stratification of cancer tumors in radiology images can be improved with computer-aided diagnosis (CAD) tools .
Edit intent: coherence
Original:  Tumor characterization through CADs can enable non-invasive cancer staging and prognosis, and foster personalized treatment planning as a part of precision medicine.
Revised:  Tumor characterization through such tools can also enable non-invasive cancer staging and prognosis, and foster personalized treatment planning as a part of precision medicine.
Edit intent: clarity
Original:  Tumor characterization through CADs can enable non-invasive cancer staging and prognosis, and foster personalized treatment planning as a part of precision medicine.
Revised:  Tumor characterization through CADs can enable non-invasive cancer staging , prognosis, and foster personalized treatment planning as a part of precision medicine.
Edit intent: fluency
Original:  Our first approach is based on supervised learning for which we demonstrate significant gains in deep learning algorithms, particularly by utilizing a 3D Convolutional Neural Network along with transfer learning .
Revised:  Our first approach is based on supervised learning for which we demonstrate significant gains with deep learning algorithms, particularly by utilizing a 3D Convolutional Neural Network along with transfer learning .
Edit intent: clarity
Original:  Our first approach is based on supervised learning for which we demonstrate significant gains in deep learning algorithms, particularly by utilizing a 3D Convolutional Neural Network along with transfer learning .
Revised:  Our first approach is based on supervised learning for which we demonstrate significant gains in deep learning algorithms, particularly by utilizing a 3D Convolutional Neural Network and Transfer Learning .
Edit intent: clarity
Original:  In the second approach, we explore an unsupervised scheme to address the limited availability of labeled training data, a common problem in medical imaging applications.
Revised:  In the second approach, we explore an unsupervised learning algorithm to address the limited availability of labeled training data, a common problem in medical imaging applications.
Edit intent: clarity
Original:  Inspired by learning from label proportion (LLP) approaches  , we propose a new algorithm, proportion-SVM , to characterize tumor types .
Revised:  Inspired by learning from label proportion (LLP) approaches , we propose to use proportion-SVM , to characterize tumor types .
Edit intent: clarity
Original:  Inspired by learning from label proportion (LLP) approaches  , we propose a new algorithm, proportion-SVM , to characterize tumor types .
Revised:  Inspired by learning from label proportion (LLP) approaches , we propose a new algorithm, proportion-SVM for characterizing tumors .
Edit intent: clarity
Original:  We evaluate our proposed approaches (both supervised and unsupervised ) on two different tumor diagnosis challenges: lung and pancreas with 1018 CT and 171 MRI scans respectively .
Revised:  We evaluate our proposed supervised and unsupervised ) on two different tumor diagnosis challenges: lung and pancreas with 1018 CT and 171 MRI scans respectively .
Edit intent: clarity
Original:   We therefore suggest that this novel multivariable prognostic model is accurate, robust, and interpretable.
Revised:  We therefore suggest that this novel prognostic model is accurate, robust, and interpretable.
Edit intent: clarity
Original:  We consider that a base-station updates many users on stochastic information arrivals over a wireless broadcast network, where only one user can be updated for each time.
Revised:  We consider a wireless broadcast network where a base-station updates many users on stochastic information arrivals over a wireless broadcast network, where only one user can be updated for each time.
Edit intent: fluency
Original:  We consider that a base-station updates many users on stochastic information arrivals over a wireless broadcast network, where only one user can be updated for each time.
Revised:  We consider that a base-station updates many users on stochastic information arrivals . Suppose that only one user can be updated for each time.
Edit intent: clarity
Original:  We successfully derive the Whittle index in a closed form and establish the indexability , by introducing a post-action age . Based on the Whittle index, we propose a scheduling algorithm, while experimentally showing that it closely approximates an age-optimal scheduling algorithm.
Revised:  We successfully derive the Whittle index in a closed form and establish the indexability . Based on the Whittle index, we propose a scheduling algorithm, while experimentally showing that it closely approximates an age-optimal scheduling algorithm.
Edit intent: coherence
Original: A new paradigm for mechanical computing is demonstrated that requires only two basic parts , links and rotary joints.
Revised: A new model for mechanical computing is demonstrated that requires only two basic parts , links and rotary joints.
Edit intent: clarity
Original: A new paradigm for mechanical computing is demonstrated that requires only two basic parts , links and rotary joints.
Revised: A new paradigm for mechanical computing is demonstrated that requires only two basic parts : links and rotary joints.
Edit intent: fluency
Original:  These basic parts are combined into two main higher level structures , locks and balances, and suffice to create all necessary combinatorial and sequential logic required for a Turing-complete computational system.
Revised:  These basic parts are combined into two main higher level structures : locks and balances, and suffice to create all necessary combinatorial and sequential logic required for a Turing-complete computational system.
Edit intent: fluency
Original:  These basic parts are combined into two main higher level structures , locks and balances, and suffice to create all necessary combinatorial and sequential logic required for a Turing-complete computational system.
Revised:  These basic parts are combined into two main higher level structures , locks and balances, which suffice to create all necessary combinatorial and sequential logic required for a Turing-complete computational system.
Edit intent: coherence
Original:  While working systems have yet to be implemented using this new paradigm , the mechanical simplicity of the systems described may lend themselves better to, e.g., microfabrication, than previous mechanical computing designs.
Revised:  While working systems have yet to be implemented using this new approach , the mechanical simplicity of the systems described may lend themselves better to, e.g., microfabrication, than previous mechanical computing designs.
Edit intent: clarity
Original: Similar to dual numbers, hyper-dual numbers are extended numbers that can be used for automatic differentiation.
Revised: In this review we present hyper-dual numbers are extended numbers that can be used for automatic differentiation.
Edit intent: clarity
Original:  In this note we explain in an illustrative way how to use hyper-dual numbers .
Revised:  Afterwards, we present hyper-dual numbers .
Edit intent: coherence
Original:  We convey our exposition with mathematical theorems, that validate the correctness of the derivatives as computed with hyper-dual numbers.
Revised:  We convey our exposition with mathematical theorems, that validate the correctness of the derivative information that is obtained from hyper-dual numbers.
Edit intent: clarity
Original:  Eventually we refer to freely available implementations of hyper-dual numbers .
Revised:  Finally, we refer to freely available implementations of hyper-dual numbers .
Edit intent: coherence
Original:  Eventually we refer to freely available implementations of hyper-dual numbers .
Revised:  Eventually we refer to a freely available implementation of a hyper-dual numbers .
Edit intent: fluency
Original:  We propose new methods for community structures detection based on the above findings, and the experimental results on both synthetic and real networks demonstrate their effectiveness.
Revised:  We propose new methods for community structures detection based on the above findings, and the experimental results on synthetic networks demonstrate their effectiveness.
Edit intent: clarity
Original: Information Retrieval (IR) is a part of Neutral Language Processing (NLP), which is basically the science of retrieving useful (relative) informationand keeps the irrelative information behind as much as possible . Building an Information Retrieval system for any language is imperative and there are many researches try to build IR systems using any of its models that are valid for specific language .
Revised: Information Retrieval (IR) is a part of Neutral Language Processing (NLP), which is basically the science of retrieving useful (relative) informationand keeps the irrelative information behind as much as possible . Building an IR system for any language is imperative and there are many researches try to build IR systems using any of its models that are valid for specific language .
Edit intent: fluency
Original: Information Retrieval (IR) is a part of Neutral Language Processing (NLP), which is basically the science of retrieving useful (relative) informationand keeps the irrelative information behind as much as possible . Building an Information Retrieval system for any language is imperative and there are many researches try to build IR systems using any of its models that are valid for specific language .
Revised: Information Retrieval (IR) is a part of Neutral Language Processing (NLP), which is basically the science of retrieving useful (relative) informationand keeps the irrelative information behind as much as possible . Building an Information Retrieval system for any language is imperative . This is evident through the massive conducted efforts to build IR systems using any of its models that are valid for specific language .
Edit intent: coherence
Original: Information Retrieval (IR) is a part of Neutral Language Processing (NLP), which is basically the science of retrieving useful (relative) informationand keeps the irrelative information behind as much as possible . Building an Information Retrieval system for any language is imperative and there are many researches try to build IR systems using any of its models that are valid for specific language .
Revised: Information Retrieval (IR) is a part of Neutral Language Processing (NLP), which is basically the science of retrieving useful (relative) informationand keeps the irrelative information behind as much as possible . Building an Information Retrieval system for any language is imperative and there are many researches try to build IR systems using any of its models that are valid for certain languages .
Edit intent: clarity
Original:  This report basically presents an implementation for one of IR techniques that is Vector Space Model (VSM).
Revised:  This report presents an implementation for one of IR techniques that is Vector Space Model (VSM).
Edit intent: coherence
Original:  This report basically presents an implementation for one of IR techniques that is Vector Space Model (VSM).
Revised:  This report basically presents an implementation for a core IR technique which is Vector Space Model (VSM).
Edit intent: clarity
Original:  We have chosen VSM model for our project since it is  term weighting scheme, and the retrieved documents could be sorted out according to their relevancy degree.
Revised:  We have chosen VSM model for our project since it is a term weighting scheme, and the retrieved documents could be sorted out according to their relevancy degree.
Edit intent: fluency
Original:  We have chosen VSM model for our project since it is  term weighting scheme, and the retrieved documents could be sorted out according to their relevancy degree.
Revised:  We have chosen VSM model for our project since it is term weighting scheme, and the retrieved documents could be sorted according to their relevancy degree.
Edit intent: clarity
Original:  Our evaluation shows that, on current machines, the new rule of thumb for the threshold from which on scanning should be favored over parallel versions of classical MDIS should be set rather around 1\% .
Revised:  Our evaluation indicates that, on current machines, the new rule of thumb for the threshold from which on scanning should be favored over parallel versions of classical MDIS should be set rather around 1\% .
Edit intent: clarity
Original:  Our evaluation shows that, on current machines, the new rule of thumb for the threshold from which on scanning should be favored over parallel versions of classical MDIS should be set rather around 1\% .
Revised:  Our evaluation shows that, on current machines, scanning should be favored over parallel versions of classical MDIS should be set rather around 1\% .
Edit intent: clarity
Original: A stable populations' network is hard to interrupt without any ecological consequences.
Revised: A stable population network is hard to interrupt without any ecological consequences.
Edit intent: fluency
Original:  A communication blockage between patches may have a negative impact on populations' stability or it may destabilize the populations in the ecological network.
Revised:  A communication blockage between patches may destabilize the populations in the ecological network.
Edit intent: clarity
Original:  This paper deals with the construction of a safe way passing through the metapopulations habitat such that populations remain stable.
Revised:  This work deals with the construction of a safe way passing through the metapopulations habitat such that populations remain stable.
Edit intent: clarity
Original:  This paper deals with the construction of a safe way passing through the metapopulations habitat such that populations remain stable.
Revised:  This paper deals with the construction of a safe cut passing through metapopulations habitat such that populations remain stable.
Edit intent: clarity
Original:  To our best knowledge, this is a completely novel idea, which uses a combined approach of dynamical system stability analysis and graph partitioning algorithms .
Revised:  We combine the dynamical system stability analysis and graph partitioning algorithms .
Edit intent: coherence
Original:  To our best knowledge, this is a completely novel idea, which uses a combined approach of dynamical system stability analysis and graph partitioning algorithms .
Revised:  To our best knowledge, this is a completely novel idea, which uses a combined approach of dynamical system stability analysis with graph partitioning algorithms .
Edit intent: fluency
Original:  Our study finds that such safe construction is possible if algebraic connectivity of the graph components is stronger than  the spatially local instabilities in  respective components.
Revised:  Our study finds that such safe construction is possible if algebraic connectivity of the graph components is stronger than all the spatially local instabilities in respective components.
Edit intent: clarity
Original:  Our study finds that such safe construction is possible if algebraic connectivity of the graph components is stronger than  the spatially local instabilities in  respective components.
Revised:  Our study finds that such safe construction is possible if algebraic connectivity of the graph components is stronger than the spatially local instabilities in the respective components.
Edit intent: fluency
Original:  Dynamical system stability analysis determines the threshold value for the stability, while a graph partitioning algorithm ensures the populations' stability in graph components after the partitioning.
Edit intent: coherence
Original:  The dynamics of the populations on  spatially discrete patches (graph nodes) and their spatial communication with other patches is described by a set of differential equations with the general kinetics .
Revised:  The dynamics of the populations on the spatially discrete patches (graph nodes) and their spatial communication with other patches is described by a set of differential equations with the general kinetics .
Edit intent: fluency