wanyu/IteraTeR_v2 huggingface dataset:
Original:  We show that these codes meet the Singleton bound (for the sum-rank metric) and are the duals of the linearized Reed-Solomon codes defined recently by Mart \'i%DIFDELCMD < }%%% nez-Pe \~n%DIFDELCMD < }%%% as.
Revised:  We show that these codes meet the Singleton bound (for the sum-rank metric) and are the duals of the linearized Reed-Solomon codes defined recently by Mart %DIFDELCMD < }%%% nez-Pe \~n%DIFDELCMD < }%%% as.
Edit intent: fluency
Original:  We show that these codes meet the Singleton bound (for the sum-rank metric) and are the duals of the linearized Reed-Solomon codes defined recently by Mart \'i%DIFDELCMD < }%%% nez-Pe \~n%DIFDELCMD < }%%% as.
Revised:  We show that these codes meet the Singleton bound (for the sum-rank metric) and are the duals of the linearized Reed-Solomon codes defined recently by Mart \'i%DIFDELCMD < }%%% \~n%DIFDELCMD < }%%% as.
Edit intent: coherence
Original:  We show that these codes meet the Singleton bound (for the sum-rank metric) and are the duals of the linearized Reed-Solomon codes defined recently by Mart \'i%DIFDELCMD < }%%% nez-Pe \~n%DIFDELCMD < }%%% as.
Revised:  We show that these codes meet the Singleton bound (for the sum-rank metric) and are the duals of the linearized Reed-Solomon codes defined recently by Mart \'i%DIFDELCMD < }%%% nez-Pe %DIFDELCMD < }%%% as.
Edit intent: coherence
Original: While it is trivial for humans to quickly assess the perceptual similarity between two images, the underlying mechanism is thought to be quite complex.
Revised: Human visual system has the strong ability to quick assess the perceptual similarity between two images, the underlying mechanism is thought to be quite complex.
Edit intent: clarity
Original:  In this paper, we design a perceptual metric,called Structure Co-Occurrence Texture (Scoot), which simultaneously considers the blocklevel spatial structure and co-occurrence texture statistics.
Revised:  In this paper, we design a perceptual metric,called Structure Co-Occurrence Texture (Scoot), which simultaneously considers the block-level spatial structure and co-occurrence texture statistics.
Edit intent: fluency
Original:  To test the quality of metrics, we propose three novel metameasures based on various reliable properties.
Revised:  To test the quality of metrics, we propose three novel meta-measures based on various reliable properties.
Edit intent: fluency
Original:  Extensive experiments verify that our Scoot metric exceeds the performance of prior work.
Revised:  Extensive experiments demonstrate that our Scoot metric exceeds the performance of prior work.
Edit intent: clarity
Original:  A major assumption of this theory is that all species have identical access to resources.
Revised:  A major assumption of this theory is that all species have equal access to resources.
Edit intent: clarity
Original:  Subsequently, beyond the monotone deterministic case, we also show that the last iterate of single-call, stochastic extra-gradient methods still enjoys a O(1/t) local convergence rate to solutions of non-monotone variational inequalities that satisfy a second-order sufficient condition.
Revised:  Subsequently, beyond the monotone deterministic case, we also show that the last iterate of single-call, stochastic extra-gradient methods still enjoys a O(1/t) local convergence rate to solutions of non-monotone variational inequalities that satisfy a second-order sufficient condition.
Edit intent: fluency
Original: Both astronomy and biology are experiencing explosive growth of data, resulting in a "big data" problem standing in the way of a "big data" opportunity for discovery.
Revised: Both astronomy and biology are experiencing explosive growth of data, resulting in a "big data" problem that stands in the way of a "big data" opportunity for discovery.
Edit intent: clarity
Original:  One common task on such data sets is the problem of approximate search , or \rho-nearest neighbors search  .
Revised:  One common question asked of such data is that of approximate search , or \rho-nearest neighbors search .
Edit intent: clarity
Original:  One common task on such data sets is the problem of approximate search , or \rho-nearest neighbors search  .
Revised:  One common task on such data sets is the problem of approximate search ( \rho-nearest neighbors search .
Edit intent: clarity
Original:  One common task on such data sets is the problem of approximate search , or \rho-nearest neighbors search  .
Revised:  One common task on such data sets is the problem of approximate search , or \rho-nearest neighbors search ) .
Edit intent: fluency
Original:  We present CHESS (Clustered Hierarchical Entropy-Scaling Search), a GPU-accelerated search tool with  no loss in specificity or sensitivity, demonstrating a 6.4 \times speedup over linear search on the Sloan Digital Sky Survey's APOGEE data set and a 3.97 \times speedup on the GreenGenes 16S metagenomic data set, as well as asymptotically fewer  comparisons on APOGEE when compared to the FALCONN locality-sensitive hashing library.
Revised:  We present CHESS (Clustered Hierarchical Entropy-Scaling Search), a GPU-accelerated search tool with virtually no loss in specificity or sensitivity, demonstrating a 6.4 \times speedup over linear search on the Sloan Digital Sky Survey's APOGEE data set and a 3.97 \times speedup on the GreenGenes 16S metagenomic data set, as well as asymptotically fewer comparisons on APOGEE when compared to the FALCONN locality-sensitive hashing library.
Edit intent: clarity
Original: Roles are sets of structurally similar nodes that are more similar to nodes inside the set than outside, whereas communities are sets of nodes with more connections inside the set than outside (based on proximity/closeness, density).
Revised: Structural roles define sets of structurally similar nodes that are more similar to nodes inside the set than outside, whereas communities are sets of nodes with more connections inside the set than outside (based on proximity/closeness, density).
Edit intent: clarity
Original: Roles are sets of structurally similar nodes that are more similar to nodes inside the set than outside, whereas communities are sets of nodes with more connections inside the set than outside (based on proximity/closeness, density).
Revised: Roles are sets of structurally similar nodes that are more similar to nodes inside the set than outside, whereas communities define sets of nodes with more connections inside the set than outside (based on proximity/closeness, density).
Edit intent: clarity
Original:  As such, this manuscript seeks to clarify the differences between roles and communities, and formalize the general mechanisms (e.g., random walks, feature diffusion) that give rise to community or role-based  embeddings.
Revised:  As such, this paper seeks to clarify the differences between roles and communities, and formalize the general mechanisms (e.g., random walks, feature diffusion) that give rise to community or role-based embeddings.
Edit intent: clarity
Original:  We show mathematically why embedding methods based on these identified mechanisms are either community or role-based  .
Revised:  We theoretically prove that embedding methods based on these identified mechanisms are either community or role-based .
Edit intent: clarity
Original:  We show mathematically why embedding methods based on these identified mechanisms are either community or role-based  .
Revised:  We show mathematically why embedding methods based on these mechanisms result in either community or role-based .
Edit intent: clarity
Original:  These mechanisms are typically easy to identify and can help researchers quickly determine whether a method is more prone to learn community or role-based embeddings.
Revised:  These mechanisms are typically easy to identify and can help researchers quickly determine whether a method preserves community or role-based embeddings.
Edit intent: clarity
Original:  Furthermore, they also serve as a basis for developing new and better methods for community or role-based  embeddings.
Revised:  Furthermore, they also serve as a basis for developing new and improved methods for community or role-based embeddings.
Edit intent: clarity
Original:  Finally, we analyze and discuss the applications and data characteristics where community or role-based embeddings are most appropriate.
Revised:  Finally, we analyze and discuss applications and data characteristics where community or role-based embeddings are most appropriate.
Edit intent: fluency
Original: Advertisers that engage in real-time bidding (RTB) to display their ads commonly have two goals: learning their optimal bidding policy and estimating the expected effect of exposing users to their ads.
Revised: Real-time bidding (RTB) to display their ads commonly have two goals: learning their optimal bidding policy and estimating the expected effect of exposing users to their ads.
Edit intent: clarity
Original:  Notably, our model is competitive in terms of classification performance, capable of conducting online semi-supervised learning, and more computationally economical and biologically-plausible than popular artificial neural networks.
Revised:  Notably, our model is competitive in terms of classification performance, can conduct online semi-supervised learning, and more computationally economical and biologically-plausible than popular artificial neural networks.
Edit intent: clarity
Original:  In the best scenario , we could observe a speedup of about 122\% compared to the on-the-fly integration.
Revised:  Depending on the compute architecture , we could observe a speedup of about 122\% compared to the on-the-fly integration.
Edit intent: clarity
Original:  For the r-fold van Kampen--Flores conjecture we also produce counterexamples which are stronger than previously known.
Revised:  For the r-fold van Kampen-Flores conjecture we also produce counterexamples which are stronger than previously known.
Edit intent: fluency
Original:  We compared the proposed approach against a state-of-the-art approach to show that NetSyn performs better in synthesizing programs .
Revised:  We compared the proposed approach against a state-of-the-art program generation systems and demonstrate that it finds more correct programs with fewer candidate program generations .
Edit intent: clarity
Original:  Although GAs have been used successfully for many problems, one criticism is that hand-crafting a GA's fitness function, the test that aims to effectively guide its evolution, can be notably challenging.
Revised:  Although GAs have been used successfully for many problems, one criticism is that hand-crafting its fitness function, the test that aims to effectively guide its evolution, can be notably challenging.
Edit intent: fluency
Original:  We also augment the GA evolutionary process with a minimally intrusive search heuristic.
Revised:  We also augment the evolutionary process with a minimally intrusive search heuristic.
Edit intent: clarity
Original:  This heuristic improves the GA 's ability to discover correct programs from ones that are approximately correct and does so with negligible computational overhead.
Revised:  This heuristic improves the framework 's ability to discover correct programs from ones that are approximately correct and does so with negligible computational overhead.
Edit intent: clarity
Original:  We compare our approach to two state-of-the-art program generation systems and demonstrate that it finds more correct programs with fewer candidate program generations.
Revised:  We compare our approach with two state-of-the-art program generation systems and demonstrate that it finds more correct programs with fewer candidate program generations.
Edit intent: fluency
Original:  We compare our approach to two state-of-the-art program generation systems and demonstrate that it finds more correct programs with fewer candidate program generations.
Revised:  We compare our approach to two state-of-the-art program synthesis methods and demonstrate that it finds more correct programs with fewer candidate program generations.
Edit intent: clarity
Original:  Our framework presents a novel approach to learn the fitness function using neural networks to predict values of ideal fitness function .
Revised:  Our framework presents a novel approach to learn the fitness function using neural networks to predict values of ideal fitness functions .
Edit intent: fluency
Original: Text classification tends to be difficult when the data is deficient or when it is required to adapt to unseen classes.
Revised: Text classification tends to be difficult when data are deficient or when it is required to adapt to unseen classes.
Edit intent: coherence
Original:  In such challenging scenarios, recent studies have often used meta-learning to simulate the few-shot task, thus negating explicit common linguistic features across tasks.
Revised:  In such challenging scenarios, recent studies have often used meta-learning to simulate the few-shot task, thus negating implicit common linguistic features across tasks.
Edit intent: fluency
Original:  We show that our approach is not only simple but also produces  state-of-the-art performance on a well-studied sentiment classification dataset.
Revised:  We show that our approach is not only simple but also produces a state-of-the-art performance on a well-studied sentiment classification dataset.
Edit intent: fluency
Original:  It can thus be further suggested that pretraining could be a promising solution for few shot learning of many other NLP tasks.
Revised:  It can thus be further suggested that pretraining could be a promising solution for few-shot learning of many other NLP tasks.
Edit intent: fluency
Original:  The assignment game can be described in this framework and core elements of an assignment game are the stable agreements.
Edit intent: coherence
Original:  Similarly to previous proximal Monte Carlo approaches, the proposed method is derived from an approximation of the Langevin diffusion .
Revised:  Similarly to previous proximal Monte Carlo approaches, the proposed method is derived from an approximation of the Langevin diffusion .
Edit intent: fluency
Original:  However, instead of the conventional Euler-Maruyama approximation that underpins existing proximal Monte Carlo methods, here we use a state-of-the-art orthogonal Runge-Kutta-Chebyshev stochastic approximation \mbox{ abdulleSKROCK that combines several gradient evaluations to significantly accelerate its convergence speed, similarly to accelerated gradient optimisation methods.
Revised:  However, instead of the conventional Euler-Maruyama approximation that underpins existing proximal Monte Carlo methods, here we use a state-of-the-art orthogonal Runge-Kutta-Chebyshev stochastic approximation that combines several gradient evaluations to significantly accelerate its convergence speed, similarly to accelerated gradient optimisation methods.
Edit intent: coherence
Original: In this paper we investigate the reduced order solution of the optimal control problem governed by a parameterized stationary Maxwell  system with the Gauss law.
Revised: In this paper we investigate the reduced order solution of the optimal control problem governed by a parameterized stationary Maxwell 's system with the Gauss law.
Edit intent: fluency
Original:  In this context the dielectric, the magnetic permeabilityand the charge densityare assumed to be known, where the control is constrained of general type and the parameter set is  compact.
Revised:  In this context the dielectric, the magnetic permeabilityand the charge densityare assumed to be known, where the control is constrained of general type and the parameter set is assumed to be compact.
Edit intent: fluency
Original:  We approximate the electric field of the Maxwell system in finite element spaces.
Revised:  We discretize the electric field of the Maxwell system in finite element spaces.
Edit intent: clarity
Original:  Utilizing techniques from the primal reduced basis approach, we construct a reduced basis surrogate model for the aforementioned optimal control problem .
Revised:  Utilizing techniques from the primal reduced basis approach, we construct a reduced basis method for the optimal control problem .
Edit intent: clarity
Original:  We prove the uniform convergence of  reduced order solutions to that of the original high dimensional problem provided  the snapshot parameter sample being dense in the parameter set and with an appropriate parameter separability rule.
Revised:  We prove the uniform convergence of the reduced order solutions to that of the original high dimensional problem provided the snapshot parameter sample being dense in the parameter set and with an appropriate parameter separability rule.
Edit intent: fluency
Original:  We prove the uniform convergence of  reduced order solutions to that of the original high dimensional problem provided  the snapshot parameter sample being dense in the parameter set and with an appropriate parameter separability rule.
Revised:  We prove the uniform convergence of reduced order solutions to that of the original high dimensional problem provided that the snapshot parameter sample being dense in the parameter set and with an appropriate parameter separability rule.
Edit intent: fluency
Original:  We prove the uniform convergence of  reduced order solutions to that of the original high dimensional problem provided  the snapshot parameter sample being dense in the parameter set and with an appropriate parameter separability rule.
Revised:  We prove the uniform convergence of reduced order solutions to that of the original high dimensional problem provided the snapshot parameter sample is dense in the parameter set and with an appropriate parameter separability rule.
Edit intent: clarity
Original:  We prove the uniform convergence of  reduced order solutions to that of the original high dimensional problem provided  the snapshot parameter sample being dense in the parameter set and with an appropriate parameter separability rule.
Revised:  We prove the uniform convergence of reduced order solutions to that of the original high dimensional problem provided the snapshot parameter sample being dense in the parameter set , with an appropriate parameter separability rule.
Edit intent: coherence
Original:  Furthermore , we establish the absolute a posteriori error estimator for the reduced order solutions and the corresponding cost functional which deals with the norm of the residuals of the state and adjoint equations .
Revised:  Finally , we establish the absolute a posteriori error estimator for the reduced order solutions and the corresponding cost functional which deals with the norm of the residuals of the state and adjoint equations .
Edit intent: coherence
Original:  Furthermore , we establish the absolute a posteriori error estimator for the reduced order solutions and the corresponding cost functional which deals with the norm of the residuals of the state and adjoint equations .
Revised:  Furthermore , we establish the absolute a posteriori error estimator for the reduced order solutions and the corresponding cost functions in terms of the state and adjoint equations .
Edit intent: clarity
Original:  Furthermore , we establish the absolute a posteriori error estimator for the reduced order solutions and the corresponding cost functional which deals with the norm of the residuals of the state and adjoint equations .
Revised:  Furthermore , we establish the absolute a posteriori error estimator for the reduced order solutions and the corresponding cost functional which deals with the norm of the residuals of the state and adjoint residuals .
Edit intent: clarity
Original: Multicasting for disseminating popular data in cellular networks is a natural solution for improving the energy and spectral efficiencies .
Revised: Multicasting for disseminating popular data is an interesting solution for improving the energy and spectral efficiencies .
Edit intent: clarity
Original:  To improve the achievable throughput of such networks, underlay device-to-device (D2D) multicast communication offers a practical solution.
Revised:  To improve the achievable performance of such networks, underlay device-to-device (D2D) multicast communication offers a practical solution.
Edit intent: clarity
Original:  However, despite having significant potential for providing higher throughput and lower delay, implementing underlay D2D multicast communication poses several challenges .
Revised:  However, despite significant potential for providing higher throughput and lower delay, implementing underlay D2D multicast communication poses several challenges .
Edit intent: coherence
Original:  For example, mutual interference among cellular users (CUs) and D2D multicast groups (MGs), and overhead signaling to provide channel state information  may limit potential gains.
Revised:  For example, mutual interference among cellular users (CUs) and D2D multicast groups (MGs), and overhead signaling to provide channel state information , that may limit potential gains.
Edit intent: coherence
Original:  In this work, we study a scenario where multiple D2D multicast groups may share a CU's uplink channel.
Revised:  We study a scenario where multiple D2D multicast groups may share a CU's uplink channel.
Edit intent: clarity
Original:  We formulate an optimization problem to maximize the achievable system throughput while fulfilling quality of service (QoS) requirements of every CU and D2D MGs, subject to the corresponding maximum transmit power constraints.
Revised:  We formulate an optimization problem to maximize the achievable system throughput while fulfilling quality of service (QoS) requirements of every CU and D2D MGs, subject to their corresponding maximum transmit power constraints.
Edit intent: fluency
Original:  Then, we propose an algorithm to allocate power to these MGs subsets that maximizes the system throughput, while satisfying transmit power constraint.
Revised:  Then, we propose an algorithm to allocate power to these MG subsets that maximizes the system throughput, while satisfying transmit power constraint.
Edit intent: fluency
Original:  Numerical results show the efficacy of proposed model in terms of higher achievable sum throughput and better spectrum efficiency with respect to various existing schemes.
Revised:  Numerical results show the efficacy of proposed approach in terms of higher achievable sum throughput and better spectrum efficiency with respect to various existing schemes.
Edit intent: clarity
Original:  This framework has various advantages: the computation of forwards  and correlation between different forwards are fully explicit, and the model can be calibrated to observed electricity forward curves easily and well.
Revised:  This framework has several advantages: the computation of forwards and correlation between different forwards are fully explicit, and the model can be calibrated to observed electricity forward curves easily and well.
Edit intent: fluency
Original: This paper introduces the deployment of a group of Wireless Sensor and Actuator Network (WSAN) part of Internet of Thing (IoT) systems in rural regions deployed by a drone dropping sensors and actuators at a certain position as a mesh of a hexagonal form.
Revised: This paper introduces the deployment of a group of Wireless Sensor and Actuator Network (WSAN) for Internet of Thing (IoT) systems in rural regions deployed by a drone dropping sensors and actuators at a certain position as a mesh of a hexagonal form.
Edit intent: clarity
Original: Different convolutional neural network (CNN) models have been tested for their application in histologic imaging analyses.
Revised: Different convolutional neural network (CNN) models have been tested for their application in histological image analyses.
Edit intent: fluency
Original:  However, these models are prone to overfitting due to their large parameter capacity, requiring more data and expensive computational resources for model training.
Revised:  However, these models are prone to overfitting due to their large parameter capacity, requiring more data or valuable computational resources for model training.
Edit intent: clarity