wanyu/IteraTeR_v2 huggingface dataset:
Original: Gene expression data for a set of 12 localizations from The Cancer Genome Atlas are processed in order to evaluate an entropy-like magnitude allowing the characterization of tumors and comparison with the corresponding normal tissues .
Revised: Gene expression data for a set of 12 localizations from The Cancer Genome Atlas are processed in order to evaluate an entropy-like magnitude allowing the characterization of the regions occupied by tumor and normal samples .
Edit intent: clarity
Original: Narrowband Internet of Things (NB-IoT) is gaining momentum as a promising technology for massive Machine Type Communication (mMTC) and cellular Internet of Things (IoT) .
Revised: Narrowband Internet of Things (NB-IoT) is gaining momentum as a promising technology for massive Machine Type Communication (mMTC) .
Edit intent: coherence
Original:  Given that its deployment is rapidly progressing worldwide, measurement campaigns and performance analyses are increasingly needed to better understand the system and move toward its enhancement.
Revised:  Given that its deployment is rapidly progressing worldwide, measurement campaigns and performance analyses are needed to better understand the system and move toward its enhancement.
Edit intent: clarity
Original:  With this aim, in this paper we present a large scale measurement campaign and empirical analysis of NB-IoT on operational networks, and disclose valuable insights in terms of deployment strategies and radio coverage performance.
Revised:  With this aim, this paper presents a large scale measurement campaign and empirical analysis of NB-IoT on operational networks, and disclose valuable insights in terms of deployment strategies and radio coverage performance.
Edit intent: coherence
Original:  With this aim, in this paper we present a large scale measurement campaign and empirical analysis of NB-IoT on operational networks, and disclose valuable insights in terms of deployment strategies and radio coverage performance.
Revised:  With this aim, in this paper we present a large scale measurement campaign and empirical analysis of NB-IoT on operational networks, and discloses valuable insights in terms of deployment strategies and radio coverage performance.
Edit intent: fluency
Original:  The reported results also serve as examples showing the potential usage of the collected dataset, which we make open-source along with a lightweight and easy-to-use data visualization platform.
Revised:  The reported results also serve as examples showing the potential usage of the collected dataset, which we make open-source along with a lightweight data visualization platform.
Edit intent: clarity
Original: Case isolation and contact tracing is a widely-used intervention method for controlling epidemic outbreaks.
Revised: Discovering and isolating infected individuals is a cornerstone of epidemic control. Because many infectious diseases spread through close contacts, contact tracing is a widely-used intervention method for controlling epidemic outbreaks.
Edit intent: clarity
Original:  We also show that, when the number of traced contacts is small, the number of prevented transmission per traced node is even higher---although most traced individuals are healthy---than that from case isolation without contact tracing .
Revised:  We also show that---in terms of the number of prevented transmission per traced node is even higher---although most traced individuals are healthy---than that from case isolation without contact tracing .
Edit intent: clarity
Original:  Our results also have important consequences for new implementations of digital contact tracing and we argue backward and deep tracing can be incorporated without the important sacrificing privacy-preserving requirements of these new platforms.
Revised:  Our results also have important consequences for digital contact tracing and we argue backward and deep tracing can be incorporated without the important sacrificing privacy-preserving requirements of these new platforms.
Edit intent: clarity
Original:  Our results also have important consequences for new implementations of digital contact tracing and we argue backward and deep tracing can be incorporated without the important sacrificing privacy-preserving requirements of these new platforms.
Revised:  Our results also have important consequences for new implementations of digital contact tracing and we argue backward and deep tracing while adhering to the privacy-preserving requirements of these new platforms.
Edit intent: clarity
Original:  However, long-term social media data collection projects, which  involve collecting Twitter data from Twitter's public-use APIs, often encounter various issues when they try to collect streaming social media monitoring data from local-area network servers (LANs).
Revised:  However, long-term social media data collection projects, which often involve collecting Twitter data from Twitter's public-use APIs, often encounter various issues when they try to collect streaming social media monitoring data from local-area network servers (LANs).
Edit intent: fluency
Original:  However, long-term social media data collection projects, which often involve collecting Twitter data from Twitter's public-use APIs, often encounter various issues when they try to collect streaming social media monitoring data from local-area network servers (LANs)  .
Revised:  However, long-term social media data collection projects, which often involve collecting Twitter data from Twitter's public-use APIs, often encounter issues when relying on local-area network servers (LANs) .
Edit intent: clarity
Original:  We present a cloud-based data collection, pre-processing, and archiving infrastructure which we argue mitigates or resolves the problems we have encountered , at minimal cloud-computing costs.
Revised:  We present a cloud-based data collection, pre-processing, and archiving infrastructure , and argue that this system mitigates or resolves the problems we have encountered , at minimal cloud-computing costs.
Edit intent: clarity
Original:  We show how this approach works in different cloud computing architectures, and for collecting streaming data from different social media platforms.
Revised:  We show how this approach works in different cloud computing architectures, and how to adapt the method to collect streaming data from different social media platforms.
Edit intent: clarity
Original:  We show how this approach works in different cloud computing architectures, and for collecting streaming data from different social media platforms.
Revised:  We show how this approach works in different cloud computing architectures, and for collecting streaming data from other social media platforms.
Edit intent: clarity
Original:  We present a polynomial-time algorithm with an approximation factor of O(k \log w_{max{w_{\min}}} ) to the optimal solution, where w_{ max } and w_{ min } are the maximum and minimum weight of the sites respectively.
Revised:  We present a polynomial-time algorithm with an approximation factor of O(k \log w_{max{w_{\min}}} ) to the optimal solution, where w_{ \max } and w_{ min } are the maximum and minimum weight of the sites respectively.
Edit intent: fluency
Original:  We present a polynomial-time algorithm with an approximation factor of O(k \log w_{max{w_{\min}}} ) to the optimal solution, where w_{ max } and w_{ min } are the maximum and minimum weight of the sites respectively.
Revised:  We present a polynomial-time algorithm with an approximation factor of O(k \log w_{max{w_{\min}}} ) to the optimal solution, where w_{ max } and w_{ \min } are the maximum and minimum weight of the sites respectively.
Edit intent: fluency
Original:  When the sites may have different weights, we use dynamic programming to generate an 8-approximate solution, which also runs in polynomial time  .
Revised:  If the sites may have different weights, we use dynamic programming to generate an 8-approximate solution, which also runs in polynomial time .
Edit intent: fluency
Original:  When the sites may have different weights, we use dynamic programming to generate an 8-approximate solution, which also runs in polynomial time  .
Revised:  When the sites may have different weights, we use dynamic programming to generate an 8-approximate solution, which runs in polynomial time .
Edit intent: clarity
Original:  Due to the non-continuous behavior of the algorithm, we must use some smoothing methods.
Edit intent: coherence
Original:  We also show that unbiased gradient estimators of any expected output-dependent quantities can be efficiently obtained by sampling outputs.
Revised:  We also show how to efficiently compute unbiased gradient estimators of any expected output-dependent quantities can be efficiently obtained by sampling outputs.
Edit intent: clarity
Original:  We also show that unbiased gradient estimators of any expected output-dependent quantities can be efficiently obtained by sampling outputs.
Revised:  We also show that unbiased gradient estimators of any expected output-dependent quantities by sampling outputs.
Edit intent: clarity
Original:  We confirm the utility and effectiveness of our framework by applying it to sensitivity analysis of the greedy algorithm and decision-focused learning of parameterized submodular models .
Revised:  We demonstrate the utility and effectiveness of our framework by applying it to sensitivity analysis of the greedy algorithm and decision-focused learning of parameterized submodular models .
Edit intent: clarity
Original:  We confirm the utility and effectiveness of our framework by applying it to sensitivity analysis of the greedy algorithm and decision-focused learning of parameterized submodular models .
Revised:  We confirm the utility and effectiveness of our framework by applying it to various situations including the aforementioned ones .
Edit intent: clarity
Original:  We also show how to efficiently compute unbiased gradient estimators of any expected output-dependent quantities by sampling outputs .
Revised:  We also show how to efficiently compute unbiased gradient estimators of any expected output-dependent quantities .
Edit intent: clarity
Original:  We demonstrate the utility and effectiveness of our framework by applying it to various situations including the aforementioned ones .
Revised:  We demonstrate the usefulness of our framework by applying it to various situations including the aforementioned ones .
Edit intent: clarity
Original:  We demonstrate the utility and effectiveness of our framework by applying it to various situations including the aforementioned ones .
Revised:  We demonstrate the utility and effectiveness of our framework by instantiating it for various applications .
Edit intent: clarity
Original: A particularly promising line of quantum machine leaning (QML) algorithms with the potential to exhibit exponential speedups over their classical counterparts has recently been set back by a series of "dequantization" results , that is, quantum-inspired classical algorithms which perform equally well in essence .
Revised: Even after decades of quantum computing development, examples of generally useful quantum algorithms with exponential speedups over their classical counterparts has recently been set back by a series of "dequantization" results , that is, quantum-inspired classical algorithms which perform equally well in essence .
Edit intent: clarity
Original:  This raises the important question whether other QML algorithms are susceptible to such dequantization, or whether it can be formally argued that they are out of reach of classical computers .
Revised:  This raises the critical question whether exponential speedups of other linear-algebraic QML algorithms persist .
Edit intent: clarity
Original:  In this paper, we study the quantum algorithm for topological data analysis by Lloyd, Garnerone and Zanardi (LGZ) .
Revised:  In this paper, we study the quantum-algorithmic methods behind the algorithm for topological data analysis by Lloyd, Garnerone and Zanardi (LGZ) .
Edit intent: clarity
Original:  In this paper, we study the quantum algorithm for topological data analysis by Lloyd, Garnerone and Zanardi (LGZ) .
Revised:  In this paper, we study the quantum algorithm for topological data analysis of Lloyd, Garnerone and Zanardi (LGZ) .
Edit intent: style
Original:  We provide evidence that certain crucial steps in this algorithm solve problems that are classically intractable by closely relating them to the one clean qubit model , a restricted model of quantum computation whose power is strongly believed to lie beyond that of classical computation.
Revised:  We provide evidence that the problem solved by this algorithm is classically intractable by closely relating them to the one clean qubit model , a restricted model of quantum computation whose power is strongly believed to lie beyond that of classical computation.
Edit intent: clarity
Original:  Our results provide a number of useful applications for full-blown, and restricted quantum computers with a guaranteed exponential speedup over classical methods, recovering some of the potential for linear-algebraic QML to become a killer application of quantum computers .
Revised:  Our results provide a number of useful applications for full-blown, and restricted quantum computers with a guaranteed exponential speedup over classical methods, recovering some of the potential for linear-algebraic QML to become one of quantum computing's killer applications .
Edit intent: clarity
Original: In this paper, we present a novel computational framework for portfolio-wide risk management problems  where the presence of a potentially large number of risk factors makes traditional numerical techniques ineffective.
Revised: In this paper, we present a novel computational framework for portfolio-wide risk management problems , where the presence of a potentially large number of risk factors makes traditional numerical techniques ineffective.
Edit intent: fluency
Original:  We present a full theoretical analysis of the method , supported by several numerical experiments  .
Revised:  We discuss the full theoretical analysis of the method , supported by several numerical experiments .
Edit intent: clarity
Original:  We present a full theoretical analysis of the method , supported by several numerical experiments  .
Revised:  We present a full theoretical analysis of the method and support it with several numerical experiments .
Edit intent: coherence
Original:  We discuss the full theoretical analysis of the method and support it with several numerical experiments.
Revised:  We discuss the theoretical analysis of the method and support it with several numerical experiments.
Edit intent: clarity
Original:  A regularization term in the the \ell_p norm with p\geq 1 covers a wide range of choices  since its behavior critically depends on the choice of p and since it can easily be combined with a suitable regularization matrix.
Revised:  The \ell_p norm with p\geq 1 covers a wide range of choices since its behavior critically depends on the choice of p and since it can easily be combined with a suitable regularization matrix.
Edit intent: clarity
Original:  A regularization term in the the \ell_p norm with p\geq 1 covers a wide range of choices  since its behavior critically depends on the choice of p and since it can easily be combined with a suitable regularization matrix.
Revised:  A regularization term in the the \ell_p norm covers a wide range of choices since its behavior critically depends on the choice of p and since it can easily be combined with a suitable regularization matrix.
Edit intent: clarity
Original:  The numerical model is applied to simulate the vaporization, ignition and combustion of a  methanol droplet  suspended on a quartz fiber  at different oxygen concentrations.
Revised:  The numerical model is applied to simulate the vaporization, ignition and combustion of a methanol droplet is suspended on a quartz fiber at different oxygen concentrations.
Edit intent: clarity
Original:  In particular, the burning rate is found to be significantly affected by thermal conduction from the fiber, due to its relatively large size and the high temperatures involved in the combustion process.
Revised:  In particular, the burning rate is found to be significantly affected by thermal conduction from the fiber, due to the high temperatures involved in the combustion process.
Edit intent: clarity
Original:  On the other hand the fiber perturbs the flame itself, providing a partial quenching close to its surface.
Revised:  On the other hand the fiber perturbs the flame itself, providing quenching at its surface.
Edit intent: clarity
Original:  The droplet combustion behavior has been compared to the one predicted in microgravity conditions , evidencing a lower standoff ratio , a higher flame temperature and an intense internal circulation.
Revised:  The combustion physics is compared to the one predicted in microgravity conditions , evidencing a lower standoff ratio , a higher flame temperature and an intense internal circulation.
Edit intent: clarity
Original:  The droplet combustion behavior has been compared to the one predicted in microgravity conditions , evidencing a lower standoff ratio , a higher flame temperature and an intense internal circulation.
Revised:  The droplet combustion behavior has been compared to the one predicted at zero-gravity , evidencing a lower standoff ratio , a higher flame temperature and an intense internal circulation.
Edit intent: clarity
Original:  The droplet combustion behavior has been compared to the one predicted in microgravity conditions , evidencing a lower standoff ratio , a higher flame temperature and an intense internal circulation.
Revised:  The droplet combustion behavior has been compared to the one predicted in microgravity conditions , evidencing a lower standoff-ratio , a higher flame temperature and an intense internal circulation.
Edit intent: fluency
Original:  The gas-phase chemistry has been analyzed in terms of distribution of the main species in the gas phase, showing a local accumulation of (i) intermediate oxidation products at the fiber (due to the quenching) and (ii) water at the surface, which partially condenses on the droplet surface affecting the vaporization rate.
Revised:  The distribution of the main species in the gas phase, showing a local accumulation of (i) intermediate oxidation products at the fiber (due to the quenching) and (ii) water at the surface, which partially condenses on the droplet surface affecting the vaporization rate.
Edit intent: clarity
Original:  The gas-phase chemistry has been analyzed in terms of distribution of the main species in the gas phase, showing a local accumulation of (i) intermediate oxidation products at the fiber (due to the quenching) and (ii) water at the surface, which partially condenses on the droplet surface affecting the vaporization rate.
Revised:  The gas-phase chemistry has been analyzed in terms of distribution of the species around the droplet shows (i) a local accumulation of (i) intermediate oxidation products at the fiber (due to the quenching) and (ii) water at the surface, which partially condenses on the droplet surface affecting the vaporization rate.
Edit intent: clarity
Original:  The gas-phase chemistry has been analyzed in terms of distribution of the main species in the gas phase, showing a local accumulation of (i) intermediate oxidation products at the fiber (due to the quenching) and (ii) water at the surface, which partially condenses on the droplet surface affecting the vaporization rate.
Revised:  The gas-phase chemistry has been analyzed in terms of distribution of the main species in the gas phase, showing a local accumulation of intermediate oxidation products at the fiber (due to the quenching) and (ii) water at the surface, which partially condenses on the droplet surface affecting the vaporization rate.
Edit intent: fluency
Original:  The gas-phase chemistry has been analyzed in terms of distribution of the main species in the gas phase, showing a local accumulation of (i) intermediate oxidation products at the fiber (due to the quenching) and (ii) water at the surface, which partially condenses on the droplet surface affecting the vaporization rate.
Revised:  The gas-phase chemistry has been analyzed in terms of distribution of the main species in the gas phase, showing a local accumulation of (i) intermediate oxidation products at the fiber surface and (ii) water at the surface, which partially condenses on the droplet surface affecting the vaporization rate.
Edit intent: clarity
Original:  The gas-phase chemistry has been analyzed in terms of distribution of the main species in the gas phase, showing a local accumulation of (i) intermediate oxidation products at the fiber (due to the quenching) and (ii) water at the surface, which partially condenses on the droplet surface affecting the vaporization rate.
Revised:  The gas-phase chemistry has been analyzed in terms of distribution of the main species in the gas phase, showing a local accumulation of (i) intermediate oxidation products at the fiber (due to the quenching) and (ii) water absorption in the liquid phase, affecting the vaporization rate.
Edit intent: clarity
Original:  In this paper, we consider a limited-angle reflection tomography of high contrast objects that commonly occurs in ground-penetrating radar, exploration geophysics, terahertz imaging, ultrasound, and electron microscopy.
Revised:  In this paper, we consider reflection tomography of high contrast objects that commonly occurs in ground-penetrating radar, exploration geophysics, terahertz imaging, ultrasound, and electron microscopy.
Edit intent: clarity
Original: Linear mixed modelling is a popular approach for detecting and correcting spurious sample correlations due to hidden confounders in genome-wide gene expression data.
Revised: Random effect models are popular statistical models for detecting and correcting spurious sample correlations due to hidden confounders in genome-wide gene expression data.
Edit intent: clarity
Original:  Compared to gradient-based optimizers, our method attains equal or higher likelihood values, can be computed using standard matrix operations, results in latent factors that don't overlap with any known factors, and has a runtime reduced by several orders of magnitude.
Revised:  Compared to gradient-based optimizers, our method attains greater or equal likelihood values, can be computed using standard matrix operations, results in latent factors that don't overlap with any known factors, and has a runtime reduced by several orders of magnitude.
Edit intent: clarity
Original:  We anticipate that the restricted maximum-likelihood method will facilitate the application of linear mixed modelling strategies for learning latent variance components to much larger gene expression datasets than currently possible .
Revised:  Hence the restricted maximum-likelihood method will facilitate the application of linear mixed modelling strategies for learning latent variance components to much larger gene expression datasets than currently possible .
Edit intent: coherence
Original:  We anticipate that the restricted maximum-likelihood method will facilitate the application of linear mixed modelling strategies for learning latent variance components to much larger gene expression datasets than currently possible .
Revised:  We anticipate that the restricted maximum-likelihood method facilitates the application of linear mixed modelling strategies for learning latent variance components to much larger gene expression datasets than currently possible .
Edit intent: style
Original:  We anticipate that the restricted maximum-likelihood method will facilitate the application of linear mixed modelling strategies for learning latent variance components to much larger gene expression datasets than currently possible .
Revised:  We anticipate that the restricted maximum-likelihood method will facilitate the application of linear mixed modelling strategies for learning latent variance components to much larger gene expression datasets than possible with current methods .
Edit intent: clarity