wanyu/IteraTeR_v2 huggingface dataset:
Original: Synthetic generation of three-dimensional cell models from histopathological images enables an enhanced understanding of cell mutation, spatial context, and progression of cancer, necessary for clinical assessment and optimal treatment.
Revised: Synthetic generation of three-dimensional cell models from histopathological images aims to enhance understanding of cell mutation, spatial context, and progression of cancer, necessary for clinical assessment and optimal treatment.
Edit intent: clarity
Original: Synthetic generation of three-dimensional cell models from histopathological images enables an enhanced understanding of cell mutation, spatial context, and progression of cancer, necessary for clinical assessment and optimal treatment.
Revised: Synthetic generation of three-dimensional cell models from histopathological images enables an enhanced understanding of cell mutation, and progression of cancer, necessary for clinical assessment and optimal treatment.
Edit intent: clarity
Original:  Simultaneously a discriminator is trained to distinguish between the original cell patches and projections of the three-dimensional model.
Edit intent: coherence
Original: Fibrin is a structural protein key for processes such as wound healing and thrombus formation.
Revised: Biopolymer gels, such as those made out of fibrin or collagen, are widely used in tissue engineering applications and biomedical research. Moreover, fibrin naturally assembles into gels in vivo during wound healing and thrombus formation.
Edit intent: coherence
Original:  At the macroscale, fibrin forms a gel and has a mechanical response that is dictated by the mechanics of a microscale fiber network.
Revised:  Macroscale biopolymer gel mechanics are dictated by the mechanics of a microscale fiber network.
Edit intent: clarity
Original:  At the macroscale, fibrin forms a gel and has a mechanical response that is dictated by the mechanics of a microscale fiber network.
Revised:  At the macroscale, fibrin forms a gel and has a mechanical response that is dictated by the microscale fiber network.
Edit intent: clarity
Original:  The stress data from the RVE, together with the total energy on the fibers and the condition of incompressibility of the surrounding matrix, were used to determine the derivatives of an unknown strain energy function with respect to the deformation invariants.
Revised:  The stress data from the RVE, together with the total energy and the condition of incompressibility of the surrounding matrix, were used to determine the derivatives of an unknown strain energy function with respect to the deformation invariants.
Edit intent: clarity
Original: The paper analyzes the parameterized complexity of evaluating Ontology Mediated Queries (OMQs) based on Guarded TGDs (GTGDs) and Unions of Conjunctive Queries (UCQs), in the setting where relational symbols might have unbounded arity and where the parameter is the size of the OMQ. It establishes exact criteria for fixed-parameter tractability (fpt) evaluation of recursively enumerable classes of such OMQs (under the widely held Exponential Time Hypothesis).
Revised: We study the parameterized complexity of evaluating Ontology Mediated Queries (OMQs) based on Guarded TGDs (GTGDs) and Unions of Conjunctive Queries (UCQs), in the setting where relational symbols might have unbounded arity and where the parameter is the size of the OMQ. It establishes exact criteria for fixed-parameter tractability (fpt) evaluation of recursively enumerable classes of such OMQs (under the widely held Exponential Time Hypothesis).
Edit intent: clarity
Original: The paper analyzes the parameterized complexity of evaluating Ontology Mediated Queries (OMQs) based on Guarded TGDs (GTGDs) and Unions of Conjunctive Queries (UCQs), in the setting where relational symbols might have unbounded arity and where the parameter is the size of the OMQ. It establishes exact criteria for fixed-parameter tractability (fpt) evaluation of recursively enumerable classes of such OMQs (under the widely held Exponential Time Hypothesis).
Revised: The paper analyzes the parameterized complexity of evaluating Ontology Mediated Queries (OMQs) based on Guarded TGDs (GTGDs) and Unions of Conjunctive Queries (UCQs), in the case where relational symbols might have unbounded arity and where the parameter is the size of the OMQ. It establishes exact criteria for fixed-parameter tractability (fpt) evaluation of recursively enumerable classes of such OMQs (under the widely held Exponential Time Hypothesis).
Edit intent: clarity
Original: The paper analyzes the parameterized complexity of evaluating Ontology Mediated Queries (OMQs) based on Guarded TGDs (GTGDs) and Unions of Conjunctive Queries (UCQs), in the setting where relational symbols might have unbounded arity and where the parameter is the size of the OMQ. It establishes exact criteria for fixed-parameter tractability (fpt) evaluation of recursively enumerable classes of such OMQs (under the widely held Exponential Time Hypothesis).
Revised: The paper analyzes the parameterized complexity of evaluating Ontology Mediated Queries (OMQs) based on Guarded TGDs (GTGDs) and Unions of Conjunctive Queries (UCQs), in the setting where relational symbols have unrestricted arity and where the parameter is the size of the OMQ. It establishes exact criteria for fixed-parameter tractability (fpt) evaluation of recursively enumerable classes of such OMQs (under the widely held Exponential Time Hypothesis).
Edit intent: clarity
Original: The paper analyzes the parameterized complexity of evaluating Ontology Mediated Queries (OMQs) based on Guarded TGDs (GTGDs) and Unions of Conjunctive Queries (UCQs), in the setting where relational symbols might have unbounded arity and where the parameter is the size of the OMQ. It establishes exact criteria for fixed-parameter tractability (fpt) evaluation of recursively enumerable classes of such OMQs (under the widely held Exponential Time Hypothesis).
Revised: The paper analyzes the parameterized complexity of evaluating Ontology Mediated Queries (OMQs) based on Guarded TGDs (GTGDs) and Unions of Conjunctive Queries (UCQs), in the setting where relational symbols might have unbounded arity and where the parameter is the size of the OMQ. We establish exact criteria for fixed-parameter tractability (fpt) evaluation of recursively enumerable classes of such OMQs (under the widely held Exponential Time Hypothesis).
Edit intent: fluency
Original:  A fundamental feature of the reduction is preservation of measures which are known to be essential for classifying  classes of parameterized uniform CSPs: submodular width (according to the well known result of Marx for unbounded-arity schemas) and treewidth (according to the well known result of Grohe for bounded-arity schemas).
Revised:  The reduction preserves measures which are known to be essential for classifying classes of parameterized uniform CSPs: submodular width (according to the well known result of Marx for unbounded-arity schemas) and treewidth (according to the well known result of Grohe for bounded-arity schemas).
Edit intent: clarity
Original:  A fundamental feature of the reduction is preservation of measures which are known to be essential for classifying  classes of parameterized uniform CSPs: submodular width (according to the well known result of Marx for unbounded-arity schemas) and treewidth (according to the well known result of Grohe for bounded-arity schemas).
Revised:  A fundamental feature of the reduction is preservation of measures which are known to be essential for classifying classes of parameterized uniform CSPs: submodular width (according to the well known result of Marx for unrestricted-arity schemas) and treewidth (according to the well known result of Grohe for bounded-arity schemas).
Edit intent: fluency
Original:  As such, the reduction can be employed to obtain hardness results for evaluation of  classes of parameterized OMQs both in the unbounded and in the bounded arity case.
Revised:  As such, it can be employed to obtain hardness results for evaluation of classes of parameterized OMQs both in the unbounded and in the bounded arity case.
Edit intent: clarity
Original:  As such, the reduction can be employed to obtain hardness results for evaluation of  classes of parameterized OMQs both in the unbounded and in the bounded arity case.
Revised:  As such, the reduction can be employed to obtain hardness results for evaluation of classes of parameterized OMQs both in the unrestricted and in the bounded arity case.
Edit intent: clarity
Original:  Several RHLs include a rule , Sequential-Product, that infers a relational correctness judgment from judgments of ordinary Hoare logic (HL).
Revised:  Several RHLs include a rule we call sequential product that infers a relational correctness judgment from judgments of ordinary Hoare logic (HL).
Edit intent: clarity
Original:  A variety of other rules have been found useful in practice, but Sequential-Product is relatively complete on its own (with HL).
Revised:  Other rules embody sensible patterns of reasoning and have been found useful in practice, but Sequential-Product is relatively complete on its own (with HL).
Edit intent: clarity
Original:  A variety of other rules have been found useful in practice, but Sequential-Product is relatively complete on its own (with HL).
Revised:  A variety of other rules have been found useful in practice, but sequential product is relatively complete on its own (with HL).
Edit intent: clarity
Original:  As a more satisfactory way to evaluate RHLs, a notion of alignment completeness for rules is introduced, in terms of the inductive assertion method and product automata.
Revised:  As a more satisfactory way to evaluate RHLs, a notion of alignment completeness is introduced, in terms of the inductive assertion method and product automata.
Edit intent: clarity
Original:  Applying alignment completeness to richer languages and product notions may serve to guide the design of RHLs  .
Revised:  The notion may serve to guide the design of RHLs .
Edit intent: clarity
Original:  Applying the SPDI in noisy binary neural networks, we obtain our key lower bound and investigate its implications on network depth-width trade-offs, our results suggest a depth-width trade-off for noisy neural networks that is very different from the established understanding regarding noiseless neural networks.
Revised:  Applying the SDPI in noisy binary neural networks, we obtain our key lower bound and investigate its implications on network depth-width trade-offs, our results suggest a depth-width trade-off for noisy neural networks that is very different from the established understanding regarding noiseless neural networks.
Edit intent: fluency
Original: Recently, as a consequence of the COVID-19 pandemic, dependence on telecommunication for remote learning/ working and telemedicine has significantly increased.
Revised: Recently, as a consequence of the COVID-19 pandemic, dependence on telecommunication for remote working and telemedicine has significantly increased.
Edit intent: clarity
Original:  Referred to as the Cluster-centric and Coded UAV-aided Femtocaching (CCUF) framework,  a two-phase clustering framework is proposed for optimal FAPs' formation and UAVs' deployment.
Revised:  Referred to as the Cluster centric and Coded UAV-aided Femtocaching (CCUF) framework, a two-phase clustering framework is proposed for optimal FAPs' formation and UAVs' deployment.
Edit intent: fluency
Original:  Referred to as the Cluster-centric and Coded UAV-aided Femtocaching (CCUF) framework,  a two-phase clustering framework is proposed for optimal FAPs' formation and UAVs' deployment.
Revised:  Referred to as the Cluster-centric and Coded UAV-aided Femtocaching (CCUF) framework, a two-phase clustering for FAPs' formation and UAVs' deployment.
Edit intent: clarity
Original:  The proposed CCUF leads to an increase in the cache diversity, a reduction in the users' access delay, and significant reduction in UAVs' energy consumption.
Revised:  First objective is to increase the content diversity. In this context, we propose a coded content placement in a reduction in the users' access delay, and significant reduction in UAVs' energy consumption.
Edit intent: clarity
Original:  Furthermore, the optimal number of coded contents to be stored in each caching node is computed to increase the cache-hit-ratio , Signal-to-Interference-plus-Noise Ratio (SINR), and cache diversity and decrease the users' access delay and cache redundancy for different content popularity profiles  .
Revised:  Furthermore, the optimal number of coded contents to be stored in each caching node to increase the cache-hit-ratio , Signal-to-Interference-plus-Noise Ratio (SINR), and cache diversity and decrease the users' access delay and cache redundancy for different content popularity profiles .
Edit intent: clarity
Original:  Furthermore, the optimal number of coded contents to be stored in each caching node is computed to increase the cache-hit-ratio , Signal-to-Interference-plus-Noise Ratio (SINR), and cache diversity and decrease the users' access delay and cache redundancy for different content popularity profiles  .
Revised:  Furthermore, the optimal number of coded contents to be stored in each caching node is computed to increase the cache-hit ratio , Signal-to-Interference-plus-Noise Ratio (SINR), and cache diversity and decrease the users' access delay and cache redundancy for different content popularity profiles .
Edit intent: fluency
Original:  We theoretically solve the joint Bellman optimum equations of reinforcement learning.
Revised:  We theoretically solve the simultaneous Bellman optimality equations of reinforcement learning.
Edit intent: clarity
Original:  QUIC (Quick UDP Internet Connections), as an alternative to traditional HTTP, demonstrates its unique transmission characteristics: based on UDP for encrypted resource transmission , accelerating web page rendering.
Revised:  QUIC (Quick UDP Internet Connections), as an alternative to traditional HTTP, demonstrate their unique transmission characteristics: based on UDP for encrypted resource transmission , accelerating web page rendering.
Edit intent: fluency
Original:  QUIC (Quick UDP Internet Connections), as an alternative to traditional HTTP, demonstrates its unique transmission characteristics: based on UDP for encrypted resource transmission , accelerating web page rendering.
Revised:  QUIC (Quick UDP Internet Connections), as an alternative to traditional HTTP, demonstrates its unique transmission characteristics: based on UDP for encrypted resource transmitting , accelerating web page rendering.
Edit intent: fluency
Original:  We also find that features are transferable between protocols , and the feature importance is partially inherited on normal traffic due to the relatively fixed browser rendering sequence and the similar request-response model of protocols .
Revised:  We also find that features are transferable between protocols when on normal full traffic scenario .
Edit intent: clarity
Original:  However, the transferability is inefficient when on early traffic, as QUIC and HTTPS show significantly different vulnerability when considering early traffic.
Revised:  However, the transferability is inefficient when on early traffic, as QUIC and HTTPS show the significantly different magnitude of variation in the traffic distribution on early traffic.
Edit intent: clarity
Original:  We also show that attack accuracy on QUIC could reach 95.4\%  with only 40 packets and just using simple features, whereas  only 60.7\% when on HTTPS  .
Revised:  We also show that attack accuracy on QUIC could reach 95.4\% with only 40 packets and just using simple features, whereas reach only 60.7\% when on HTTPS .
Edit intent: clarity
Original:  We also experimentally compare our model with BERT and show our ad-vantages on long documents.
Revised:  We also experimentally compare our model with BERT and show our advantages on long documents.
Edit intent: fluency
Original:  With the development of Automated Machine Learning , agricultural experts are now able to train, evaluate and make predictions using cutting edge machine learning (ML) models without the need for much ML knowledge.
Revised:  With the development of automated machine learning , agricultural experts are now able to train, evaluate and make predictions using cutting edge machine learning (ML) models without the need for much ML knowledge.
Edit intent: fluency
Original:  To validate AHMoSE , we describe a use case scenario in the viticulture domain, grape quality prediction, where the system enables users to diagnose and select prediction models that perform better.
Revised:  To validate AHMoSe , we describe a use case scenario in the viticulture domain, grape quality prediction, where the system enables users to diagnose and select prediction models that perform better.
Edit intent: fluency
Original:  Furthermore, to fit better with convolutions, we suggest to first aggregate traffic flows according to pre-conceived regions of interest , then dispose to sequentially organized raster images for network input.
Revised:  Furthermore, to better fit with convolutions, we suggest to first aggregate traffic flows according to pre-conceived regions of interest , then dispose to sequentially organized raster images for network input.
Edit intent: fluency
Original:  Furthermore, to fit better with convolutions, we suggest to first aggregate traffic flows according to pre-conceived regions of interest , then dispose to sequentially organized raster images for network input.
Revised:  Furthermore, to fit better with convolutions, we suggest to first aggregate traffic flows according to pre-conceived regions or self-organized regions based on traffic flows , then dispose to sequentially organized raster images for network input.
Edit intent: clarity
Original:  Finally, we demonstrate the advantage of DeFlow-Net in maintaining spatial autocorrelation, and reveal the impacts of partition shapes and scales on deep traffic flow prediction.
Revised:  We also demonstrate the advantage of DeFlow-Net in maintaining spatial autocorrelation, and reveal the impacts of partition shapes and scales on deep traffic flow prediction.
Edit intent: coherence
Original:  In the literature, techniques try to understand the scatter plot organization by visualizing the importance of the features for clusters definition with interaction and layout enrichment strategies.
Revised:  In the literature, techniques support the understanding of scatterplots' organization by visualizing the importance of the features for clusters definition with interaction and layout enrichment strategies.
Edit intent: clarity
Original:  In the literature, techniques try to understand the scatter plot organization by visualizing the importance of the features for clusters definition with interaction and layout enrichment strategies.
Revised:  In the literature, techniques try to understand the scatter plot organization by visualizing the importance of the features for cluster definition with layout enrichment strategies.
Edit intent: clarity
Original:  This paper introduces a methodology to visually explore multidimensional datasets and interpret clusters' formation based on the contrastive analysis.
Revised:  Thus, this paper introduces a methodology to visually explore multidimensional datasets and interpret clusters' formation based on the contrastive analysis.
Edit intent: coherence
Original:  This paper introduces a methodology to visually explore multidimensional datasets and interpret clusters' formation based on the contrastive analysis.
Revised:  This paper introduces a methodology to visually explore multidimensional datasets and interpret clusters' formation based on contrastive analysis.
Edit intent: fluency
Original:  We also introduce a bipartite graph to visually interpret and explore the relationship between the statistical variables used to understand how the attributes influenced cluster formation.
Revised:  We also introduce a bipartite graph to visually interpret and explore the relationship between the statistical variables employed to understand how the attributes influenced cluster formation.
Edit intent: clarity
Original:  We also introduce a bipartite graph to visually interpret and explore the relationship between the statistical variables used to understand how the attributes influenced cluster formation.
Revised:  We also introduce a bipartite graph to visually interpret and explore the relationship between the statistical variables used to understand how the data features influence cluster formation.
Edit intent: clarity
Original:  Our methodology is validated through case studies .
Revised:  Our approach is demonstrated through case studies .
Edit intent: clarity
Original:  We explore a multivariate dataset of patients with vertebral problems and two document collections , one related to news articles and other related to tweets about COVID-19 symptoms.
Revised:  We explore a multivariate dataset of patients with vertebral problems and two document collections related to news articles and other related to tweets about COVID-19 symptoms.
Edit intent: coherence
Original:  We explore a multivariate dataset of patients with vertebral problems and two document collections , one related to news articles and other related to tweets about COVID-19 symptoms.
Revised:  We explore a multivariate dataset of patients with vertebral problems and two document collections , one related to news articles and tweets about COVID-19 symptoms.
Edit intent: clarity
Original:  Finally, we also validate our approach through quantitative results to demonstrate how it can be robust enough to support multidimensional analysis.
Revised:  Finally, we evaluate our approach through quantitative results to demonstrate how it can be robust enough to support multidimensional analysis.
Edit intent: clarity
Original:  Finally, we also validate our approach through quantitative results to demonstrate how it can be robust enough to support multidimensional analysis.
Revised:  Finally, we also validate our approach through quantitative results to demonstrate its robustness to support multidimensional analysis.
Edit intent: clarity
Original: We introduce an approach based on the Chapman-Kolmogorov equation to model heterogeneous probabilistic circuits, namely, the circuits combining binary or multi-state probabilistic memristive devices and continuum reactive components (capacitors and/or inductors).
Revised: We introduce an approach based on the Chapman-Kolmogorov equation to model heterogeneous stochastic circuits, namely, the circuits combining binary or multi-state probabilistic memristive devices and continuum reactive components (capacitors and/or inductors).
Edit intent: clarity
Original: We introduce an approach based on the Chapman-Kolmogorov equation to model heterogeneous probabilistic circuits, namely, the circuits combining binary or multi-state probabilistic memristive devices and continuum reactive components (capacitors and/or inductors).
Revised: We introduce an approach based on the Chapman-Kolmogorov equation to model heterogeneous probabilistic circuits, namely, the circuits combining binary or multi-state stochastic memristive devices and continuum reactive components (capacitors and/or inductors).
Edit intent: clarity
Original: Wireless edge caching is a popular strategy to avoid backhaul congestion in the next generation networks, where the content is cached in advance at the base stations to fulfil the redundant requests during peak  periods.
Revised: Wireless edge caching is a popular strategy to avoid backhaul congestion in the next generation networks, where the content is cached in advance at base stations to fulfil the redundant requests during peak periods.
Edit intent: fluency