wanyu/IteraTeR_v2 huggingface dataset:
Original:  In the first part of the study, we have used an initial set of 50,822 articles obtained from the Web of Science using an extensive search query constructed through expert opinion.
Revised:  In the first part of the study, we have used an initial set of 50,822 articles obtained from the Web of Science (WoS) database using a search query constructed through expert opinion.
Edit intent: clarity
Original:  Analysis of this section revealed that QIT is deeply rooted in the field of physicsand over 80\% of the articles are published in journals mainly reserved for publication in physics .
Revised:  Analysis of this revealed that QT is deeply rooted in the field of physicsand over 80\% of the articles are published in journals mainly reserved for publication in physics .
Edit intent: clarity
Original:  Analysis of this section revealed that QIT is deeply rooted in the field of physicsand over 80\% of the articles are published in journals mainly reserved for publication in physics .
Revised:  Analysis of this section revealed that QIT is deeply rooted in physics, and the majority of the articles are published in journals mainly reserved for publication in physics .
Edit intent: clarity
Original:  Furthermore, a keyword analysis on this set revealed that the main academic literature can be clustered into three distinct sets, which are (i) quantum communication/cryptography, (ii) quantum computation, and (iii) physical realizations of quantum systems.
Revised:  Furthermore, a keyword analysis on this set revealed that the literature could be clustered into three distinct sets, which are (i) quantum communication/cryptography, (ii) quantum computation, and (iii) physical realizations of quantum systems.
Edit intent: clarity
Original:  Finally, for the first section, a burst analysis on this set using different density parameters showed the emergence and fading away of certain key concepts in the literature.
Revised:  We performed a burst analysis on this set using different density parameters showed the emergence and fading away of certain key concepts in the literature.
Edit intent: clarity
Original:  Finally, for the first section, a burst analysis on this set using different density parameters showed the emergence and fading away of certain key concepts in the literature.
Revised:  Finally, for the first section, a burst analysis that showed the emergence and fading away of certain key concepts in the literature.
Edit intent: clarity
Original:  Finallyfor the second section, using bibliographic coupling we have mapped collaboration networks on the country and institutional levels . Search queries and access to enhanced views of figures are provided in  appendix.
Revised:  Finallyfor the second section, using bibliographic coupling we have mapped collaboration networks on the country and institutional levels . Search queries and access to figures are provided in appendix.
Edit intent: clarity
Original:  Finallyfor the second section, using bibliographic coupling we have mapped collaboration networks on the country and institutional levels . Search queries and access to enhanced views of figures are provided in  appendix.
Revised:  Finallyfor the second section, using bibliographic coupling we have mapped collaboration networks on the country and institutional levels . Search queries and access to enhanced views of figures are provided in the appendix.
Edit intent: fluency
Original: An agent has access to multiple data sources, each of which provides information about a different attribute of an unknown state.
Revised: An agent has access to multiple information sources, each of which provides information about a different attribute of an unknown state.
Edit intent: clarity
Original:  We show that the optimal information acquisition strategy proceeds in stages, where resource allocation is constant over a fixed set of providers during each stage, and at each stage a new provider is added to the set.
Revised:  We provide an exact characterization of the optimal information acquisition strategy proceeds in stages, where resource allocation is constant over a fixed set of providers during each stage, and at each stage a new provider is added to the set.
Edit intent: clarity
Original:  We additionally apply this characterization to derive  results regarding: (1) endogenous information acquisition in a binary choiceproblem , and (2) equilibrium information provision by competing news sources.
Revised:  We additionally apply this characterization to derive results regarding: (1) endogenous information acquisition for binary choice , and (2) equilibrium information provision by competing news sources.
Edit intent: clarity
Original:  We then apply this characterization to derive new results regarding: (1) endogenous information acquisition for binary choice, and (2) strategic information provision by competing news sources .
Revised:  We then apply this characterization to derive new results regarding: (1) endogenous information acquisition for binary choice, (2) strategic information provision by competing news sources .
Edit intent: fluency
Original:  The main results characterize which rationalizable actions and Nash equilibria can be predicted when agents observe a finite quantity of data , and how much data is needed to predict various solutions.
Revised:  The main results characterize the analyst's confidence in a given prediction as the quantity of data , and how much data is needed to predict various solutions.
Edit intent: clarity
Original: Kirigami, the creative art of paper cutting, is a promising paradigm for mechanical meta-materials .
Revised: Kirigami, the creative art of paper cutting, is a promising paradigm for mechanical metamaterials .
Edit intent: fluency
Original:  However, to make this a reality requires controlling the topology of kirigami to achieve connectivity and rigidity.
Revised:  However, to make kirigami-inspired structures a reality requires controlling the topology of kirigami to achieve connectivity and rigidity.
Edit intent: clarity
Original:  This leads to a deterministic hierarchical construction method that yields an efficient topological way to control both the number of connected pieces (T) and the total degrees of freedom (DoF).
Revised:  A deterministic hierarchical construction method that yields an efficient topological way to control both the number of connected pieces (T) and the total degrees of freedom (DoF).
Edit intent: coherence
Original:  This leads to a deterministic hierarchical construction method that yields an efficient topological way to control both the number of connected pieces (T) and the total degrees of freedom (DoF).
Revised:  This leads to a deterministic hierarchical construction method yields an efficient topological way to control both the number of connected pieces (T) and the total degrees of freedom (DoF).
Edit intent: fluency
Original:  This leads to a deterministic hierarchical construction method that yields an efficient topological way to control both the number of connected pieces (T) and the total degrees of freedom (DoF).
Revised:  This leads to a deterministic hierarchical construction method that yields an efficient topological way to control both the number of connected pieces and the total degrees of freedom (DoF).
Edit intent: clarity
Original:  All together, our work provides a general framework for the topological and statistical control of rigidity and connectivity in planar kirigami.
Revised:  All together, our work provides a general framework for the control of rigidity and connectivity in planar kirigami.
Edit intent: clarity
Original: Effective and efficient recommendation is crucial for modern e-commerce platforms.
Revised: Recommender system, as an essential part of modern e-commerce platforms.
Edit intent: clarity
Original:  It consists of two indispensable components named Click-Through Rate (CTR) prediction and Conversion Rate (CVR) prediction , where the latter is an essential factor contributing to the final purchasing volume.
Revised:  It consists of two fundamental modules, namely Click-Through Rate (CTR) prediction and Conversion Rate (CVR) prediction , where the latter is an essential factor contributing to the final purchasing volume.
Edit intent: clarity
Original:  It consists of two indispensable components named Click-Through Rate (CTR) prediction and Conversion Rate (CVR) prediction , where the latter is an essential factor contributing to the final purchasing volume.
Revised:  It consists of two indispensable components named Click-Through Rate (CTR) and Conversion Rate (CVR) prediction , where the latter is an essential factor contributing to the final purchasing volume.
Edit intent: fluency
Original:  To address these issues\toclick\topurchase , we propose a novel deep CVR prediction method by considering the post-click behaviors.
Revised:  To address these issues\toclick\topurchase , we propose a novel idea of post-click behaviors.
Edit intent: clarity
Original: Grammar-based compression is a popular and powerful approach to compressing repetitive texts but until recently its relatively poor time-space trade-offs in real life made it impractical for truly massive datasets such as genomic databases.
Revised: Grammar-based compression is a popular and powerful approach to compressing repetitive texts but until recently its relatively poor time-space trade-offs during real-life construction made it impractical for truly massive datasets such as genomic databases.
Edit intent: clarity
Original: Parallel exploration is a key to a successful search.
Revised: Effective exploration is a key to a successful search.
Edit intent: clarity
Original: Parallel exploration is a key to a successful search.
Revised: Parallel exploration is a key to successful search.
Edit intent: fluency
Original:  However, the original diversity model was mostly devised by intuition , which introduced several drawbacks to NCS . In this paper, a mathematically principled diversity model is proposed to solve the existing drawbacks of NCS, resulting a new NCS framework.
Revised:  However, the original diversity model was mostly devised by intuition . In this paper, a mathematically principled diversity model is proposed to solve the existing drawbacks of NCS, resulting a new NCS framework.
Edit intent: coherence
Original: We consider the problem of assigning residents to hospitals when hospitals have upper and lower quotas . Apart from this, both residents and hospitals have a preference list which is a strict ordering on a subset of the other side.
Revised: We consider the problem of assigning residents to hospitals when hospitals have upper and lower quotas and both residents and hospitals have a preference list which is a strict ordering on a subset of the other side.
Edit intent: coherence
Original:  On the other hand we show that the MIN-UR-EFM problem cannot be approximated for any alpha > 0. We present 1/(L+1) approximation algorithm for MAXEFM  when quotas are at most 1 where L is the length of longest preference list of a resident .
Revised:  On the other hand we show that the MIN-UR-EFM problem cannot be approximated for any alpha > 0. We present 1/(L+1) approximation algorithm for MAXEFM when quotas are 0 or 1 where L is the length of longest preference list of a resident .
Edit intent: clarity
Original:  We also investigate the parameterized complexity of these problems and prove that they are W[1]-hard when deficiency is the parameter.
Revised:  We investigate the parameterized complexity of these problems and prove that they are W[1]-hard when deficiency is the parameter.
Edit intent: clarity
Original:  In recent years, different flow-based classifiers have been proposed based on both shallow and deep learning .
Revised:  In recent years, different flow-based classifiers have been proposed using machine learning algorithms .
Edit intent: clarity
Original:  Nevertheless, these classical machine learning algorithms have some limitations.
Revised:  Nevertheless, the classical machine learning algorithms have some limitations.
Edit intent: coherence
Original:  We show that EFC is capable to accurately perform a two-class flow classification and is resilient to context change . Given the positive results obtained , we consider EFC o be a promising algorithm to perform  flow-based traffic classification.
Revised:  We show that EFC is capable to accurately perform a two-class flow classification and is resilient to context change . Given the positive results obtained , we consider EFC to be a promising algorithm to perform flow-based traffic classification.
Edit intent: fluency
Original:  In recent years, different flow-based classifiers have been proposed using machine learning algorithms.
Revised:  In recent years, different flow-based classifiers have been proposed using Machine Learning (ML) algorithms.
Edit intent: clarity
Original:  Nevertheless, the classical machine learning algorithms have some limitations.
Revised:  Nevertheless, classical ML-based classifiers have some limitations.
Edit intent: clarity
Original:  Additionally, most machine learning algorithms are not capable of domain adaptation, %DIFDELCMD < \ie %%%  after being trained on a specific dataset , they are not general enough to be applied to other related data distributions.
Revised:  Additionally, most ML-based classifiers are not capable of domain adaptation, %DIFDELCMD < \ie %%% after being trained on a specific dataset , they are not general enough to be applied to other related data distributions.
Edit intent: clarity
Original:  Additionally, most machine learning algorithms are not capable of domain adaptation, %DIFDELCMD < \ie %%%  after being trained on a specific dataset , they are not general enough to be applied to other related data distributions.
Revised:  Additionally, most machine learning algorithms are not capable of domain adaptation, %DIFDELCMD < \ie %%% i.e. after being trained on a specific dataset , they are not general enough to be applied to other related data distributions.
Edit intent: clarity
Original:  Additionally, most machine learning algorithms are not capable of domain adaptation, %DIFDELCMD < \ie %%%  after being trained on a specific dataset , they are not general enough to be applied to other related data distributions.
Revised:  Additionally, most machine learning algorithms are not capable of domain adaptation, %DIFDELCMD < \ie %%% after being trained on an specific data distribution , they are not general enough to be applied to other related data distributions.
Edit intent: clarity
Original:  And, finally, many of the models inferred by this algorithms are black boxes, hard to understand in detail.
Revised:  And, finally, many of the models inferred by these algorithms are black boxes, hard to understand in detail.
Edit intent: fluency
Original:  To overcome these limitations, we propose a new flow-based classifier , called Energy-based Flow Classifier (EFC).
Revised:  To overcome these limitations, we propose a new algorithm , called Energy-based Flow Classifier (EFC).
Edit intent: clarity
Original:  We show that EFC is capable of accurately performing a one-class flow classification and is more adaptable to new domains than classical machine learning algorithms . Given the positive results obtained on three different datasets (CIDDS-001, CICIDS17 and CICDDoS19), we consider EFC to be a promising algorithm to perform robust flow-based traffic classification.
Revised:  We show that EFC is capable of accurately performing a one-class flow classification and is more adaptable to new domains than classical ML-based classifiers . Given the positive results obtained on three different datasets (CIDDS-001, CICIDS17 and CICDDoS19), we consider EFC to be a promising algorithm to perform robust flow-based traffic classification.
Edit intent: clarity
Original:  For instance, they require large amounts of labeled data  , which might be difficult to obtain.
Revised:  For instance, they require large amounts of labeled data for training , which might be difficult to obtain.
Edit intent: clarity
Original:  And, finally, many of the models inferred by these algorithms are black boxes, hard to understand in detail .
Revised:  And, finally, many of the models inferred by these algorithms are black boxes, which do not provide explainable results .
Edit intent: clarity
Original:  We show that EFC is capable of accurately performing binary flow classification and is more adaptable to new domains than classical ML-based classifiers.
Revised:  We show that EFC is capable of accurately performing binary flow classification and is more adaptable to different data distributions than classical ML-based classifiers.
Edit intent: clarity
Original:  By further endowing these structures with operators ( akin to the theory of modal Algebras ) RBAs serve as models of modal logics in which truth is relative.
Revised:  By further endowing these structures with operators -- akin to the theory of modal Algebras ) RBAs serve as models of modal logics in which truth is relative.
Edit intent: fluency
Original:  By further endowing these structures with operators ( akin to the theory of modal Algebras ) RBAs serve as models of modal logics in which truth is relative.
Revised:  By further endowing these structures with operators ( akin to the theory of modal Algebras -- RBAs serve as models of modal logics in which truth is relative.
Edit intent: fluency
Original:   Empirical evaluation using the Yahoo!
Revised:  Our proposed theoretical framework and algorithm do not depend on the propensity score and can obtain a well-performing rating predictor without the true propensity information. Empirical evaluation using the Yahoo!
Edit intent: coherence
Original: To construct a well-performing recommender offline, eliminating selection biases of the rating feedback is critical.
Revised: It is critical to eliminate selection biases of the rating feedback is critical.
Edit intent: coherence
Original:  We further propose a corresponding algorithm minimizing the bound via adversarial learning.
Revised:  We further propose a corresponding algorithm that minimizes the bound via adversarial learning.
Edit intent: fluency
Original:  Empirical evaluation using benchmark real-world datasets demonstrates the effectiveness and the real-world applicability of the proposed approach.
Revised:  Empirical evaluation using benchmark real-world datasets demonstrates the effectiveness and real-world applicability of the proposed approach.
Edit intent: fluency
Original: It is critical to eliminate selection biases of the rating feedback to construct a well-performing recommender offline.
Revised: It is critical to eliminate selection bias of the rating feedback to construct a well-performing recommender offline.
Edit intent: fluency
Original:  Currently, a promising solution to the challenge is the propensity weighting approach that models the missing mechanism of rating feedback .
Revised:  Currently, a promising solution to address the bias is to use the propensity score .
Edit intent: clarity
Original:  However, the performance of  existing propensity-based algorithms can be significantly affected by the propensity estimation bias.
Revised:  However, the performance of the existing propensity-based algorithms can be significantly affected by the propensity estimation bias.
Edit intent: fluency
Original:  However, the performance of  existing propensity-based algorithms can be significantly affected by the propensity estimation bias.
Revised:  However, the performance of existing propensity-based methods can significantly suffer from propensity estimation bias.
Edit intent: clarity
Original:  To alleviate the problem, we formulate the missing-not-at-random recommendation as the unsupervised domain adaptation problem and drive the propensity-independent generalization error bound.
Revised:  To solve the problem, we formulate the missing-not-at-random recommendation as the unsupervised domain adaptation problem and drive the propensity-independent generalization error bound.
Edit intent: clarity
Original:  To alleviate the problem, we formulate the missing-not-at-random recommendation as the unsupervised domain adaptation problem and drive the propensity-independent generalization error bound.
Revised:  To alleviate the problem, we formulate the recommendation with selection bias as unsupervised domain adaptation problem and drive the propensity-independent generalization error bound.
Edit intent: clarity
Original:  To alleviate the problem, we formulate the missing-not-at-random recommendation as the unsupervised domain adaptation problem and drive the propensity-independent generalization error bound.
Revised:  To alleviate the problem, we formulate the missing-not-at-random recommendation as the unsupervised domain adaptation and derive a propensity-independent generalization error bound.
Edit intent: clarity
Original:  We further propose a corresponding algorithm that minimizes the bound via adversarial learning.
Revised:  We further propose a novel algorithm that minimizes the bound via adversarial learning.
Edit intent: clarity
Original:  Our proposed theoretical framework and algorithm do not depend on the propensity score and can obtain a well-performing rating predictor without  the true propensity information.
Revised:  Our theory and algorithm do not depend on the propensity score and can obtain a well-performing rating predictor without the true propensity information.
Edit intent: clarity
Original:  Our proposed theoretical framework and algorithm do not depend on the propensity score and can obtain a well-performing rating predictor without  the true propensity information.
Revised:  Our proposed theoretical framework and algorithm do not depend on propensity scores, and thus can result in a well-performing rating predictor without the true propensity information.
Edit intent: clarity
Original:  Our proposed theoretical framework and algorithm do not depend on the propensity score and can obtain a well-performing rating predictor without  the true propensity information.
Revised:  Our proposed theoretical framework and algorithm do not depend on the propensity score and can obtain a well-performing rating predictor without requiring the true propensity information.
Edit intent: clarity
Original:  Empirical evaluation using benchmark real-world datasets demonstrates the effectiveness and real-world applicability of the proposed approach.
Revised:  Empirical evaluation demonstrates the effectiveness and real-world applicability of the proposed approach.
Edit intent: clarity
Original:  This new orthogonal basis of the splines is better visualized as a net of orthogonalized functions rather than a sequence of them.
Revised:  This new orthogonal basis of splines is best visualized as a net of orthogonalized functions rather than a sequence of them.
Edit intent: fluency
Original:  This new orthogonal basis of the splines is better visualized as a net of orthogonalized functions rather than a sequence of them.
Revised:  This new orthogonal basis of the splines is better visualized as a net of functions rather than a sequence of them.
Edit intent: clarity
Original:  The net is spread over different support rangeution and different locations resembling in this respect wavelets bases.
Edit intent: coherence
Original:  For this reason the constructed basis is referred to as a splinet and features some clear advantages over other spline bases.
Revised:  For this reason , the basis is referred to as a splinet and features some clear advantages over other spline bases.
Edit intent: clarity
Original:  For this reason the constructed basis is referred to as a splinet and features some clear advantages over other spline bases.
Revised:  For this reason the constructed basis is referred to as a splinet . The splinets feature clear advantages over other spline bases.
Edit intent: clarity