wanyu/IteraTeR_v2 huggingface dataset:
Original:  The MTs first cache the files in their local memories  and then exchange the  files with each other within the vincinity via D2D communications  . Prior works have largely overlooked MTs' heterogeneity in file preferences and assume unselfish caching behaviorsof the MTs .
Revised:  The MTs first cache the files in their local memories and then exchange the files with each other within the vincinity via D2D communications . Prior works largely overlook MTs' heterogeneity in file preferences and assume unselfish caching behaviorsof the MTs .
Edit intent: fluency
Original:  The MTs first cache the files in their local memories  and then exchange the  files with each other within the vincinity via D2D communications  . Prior works have largely overlooked MTs' heterogeneity in file preferences and assume unselfish caching behaviorsof the MTs .
Revised:  The MTs first cache the files in their local memories and then exchange the files with each other within the vincinity via D2D communications . Prior works have largely overlooked MTs' heterogeneity in file preferences and their selfish behaviors .
Edit intent: clarity
Original:  In this work , we practically divide the MTs into different  groups according to their invididual preferences over the files and propose optimal file caching strategies for self-interested MTs to reduce the average file download time.
Revised:  In this paper , we practically divide the MTs into different groups according to their invididual preferences over the files and propose optimal file caching strategies for self-interested MTs to reduce the average file download time.
Edit intent: clarity
Original:  In this work , we practically divide the MTs into different  groups according to their invididual preferences over the files and propose optimal file caching strategies for self-interested MTs to reduce the average file download time.
Revised:  In this work , we practically categorize the MTs into different groups according to their invididual preferences over the files and propose optimal file caching strategies for self-interested MTs to reduce the average file download time.
Edit intent: fluency
Original:  In this work , we practically divide the MTs into different  groups according to their invididual preferences over the files and propose optimal file caching strategies for self-interested MTs to reduce the average file download time.
Revised:  In this work , we practically divide the MTs into different groups according to their individual file preferences and jointly investigate each group's caching strategies to reduce the average file download time.
Edit intent: clarity
Original: Wireless device-to-device (D2D) caching has been recently introduced as an effective scheme for reducing the average download delay of mobile terminals (MTs) in cellular network . Specifically, the MTs first cache popular files in their local memories in off-peak hours and then exchange the requested files with each other in the vicinity via D2D communications during the peak hours.
Revised: Local caching is an effective scheme for reducing the average download delay of mobile terminals (MTs) in cellular network . Specifically, the MTs first cache popular files in their local memories in off-peak hours and then exchange the requested files with each other in the vicinity via D2D communications during the peak hours.
Edit intent: coherence
Original: Wireless device-to-device (D2D) caching has been recently introduced as an effective scheme for reducing the average download delay of mobile terminals (MTs) in cellular network . Specifically, the MTs first cache popular files in their local memories in off-peak hours and then exchange the requested files with each other in the vicinity via D2D communications during the peak hours.
Revised: Wireless device-to-device (D2D) caching has been recently introduced as an effective scheme for reducing the average download delay of mobile terminals (MTs) in cellular network . Specifically, the MTs first cache in their local memories in off-peak hours and then exchange the requested files with each other in the vicinity via D2D communications during the peak hours.
Edit intent: clarity
Original: Wireless device-to-device (D2D) caching has been recently introduced as an effective scheme for reducing the average download delay of mobile terminals (MTs) in cellular network . Specifically, the MTs first cache popular files in their local memories in off-peak hours and then exchange the requested files with each other in the vicinity via D2D communications during the peak hours.
Revised: Wireless device-to-device (D2D) caching has been recently introduced as an effective scheme for reducing the average download delay of mobile terminals (MTs) in cellular network . Specifically, the MTs first cache popular files in their local memories in off-peak hours and then exchange the requested files with each other in the vicinity during peak hours.
Edit intent: clarity
Original:  Prior works largely overlook MTs' heterogeneity in file preferences and their selfish behaviors .
Revised:  However, prior works largely overlook MTs' heterogeneity in file preferences and their selfish behaviors .
Edit intent: coherence
Original:  Prior works largely overlook MTs' heterogeneity in file preferences and their selfish behaviors .
Revised:  Prior works largely overlook MTs' heterogeneity in file preferences and their selfish behaviours .
Edit intent: fluency
Original:  By modeling MTs' mobilities as homogeneous Poisson point processes (HPPPs), we analytically characterize MTs' average download delay in closed-form.
Revised:  By modeling MTs' mobilities as homogeneous Poisson point processes (HPPPs), we analytically characterize MTs' utilities in closed-form.
Edit intent: clarity
Original:  We first consider the fully cooperative case where a centralizer helps all MT groups to make caching decisions.
Revised:  We first consider the fully cooperative case where a centralizer helps all groups to make caching decisions.
Edit intent: clarity
Original:  We formulate the problem as a weighted sum delay minimization problem, through which the minimum delay trade-offs of different groups are characterized.
Revised:  We formulate the problem as a weighted-sum utility maximization problem, through which the minimum delay trade-offs of different groups are characterized.
Edit intent: clarity
Original:  We formulate the problem as a weighted sum delay minimization problem, through which the minimum delay trade-offs of different groups are characterized.
Revised:  We formulate the problem as a weighted sum delay minimization problem, through which the maximum utility trade-offs of different groups are characterized.
Edit intent: clarity
Original:  Finally, extensive numerical examples are presented to compare the delay performances of different schemes and show the effectiveness of the cooperative D2D caching compared to the two benchmark cases.
Revised:  Finally, numerical examples are presented to compare the delay performances of different schemes and show the effectiveness of the cooperative D2D caching compared to the two benchmark cases.
Edit intent: clarity
Original:  Finally, extensive numerical examples are presented to compare the delay performances of different schemes and show the effectiveness of the cooperative D2D caching compared to the two benchmark cases.
Revised:  Finally, extensive numerical examples are presented to compare the utilities under different cases and show the effectiveness of the cooperative D2D caching compared to the two benchmark cases.
Edit intent: clarity
Original:  In this letter , we present a  dual method of computing PTDFs.
Revised:  In this paper , we present a dual method of computing PTDFs.
Edit intent: clarity
Original:  For power grids containing a relatively small number of cycles, the method offers a significant speedup of numerical calculations.
Revised:  For power grids containing a relatively small number of cycles, the method can offer a speedup of numerical calculations.
Edit intent: clarity
Original:  With the background of neural network, we will gradually introduce how convolutional neural networks , as a representative of deep discriminative models, is developed from neural networks, together with many practical techniques that can help in optimization of neural networks.
Revised:  With the background of neural network, we will gradually introduce how convolutional neural network , as a representative of deep discriminative models, is developed from neural networks, together with many practical techniques that can help in optimization of neural networks.
Edit intent: fluency
Original:  We start with Time Delay Neural Networks and move further to currently famous model named Recurrent Neural Network and its extension Lone Time Short Memory.
Revised:  We start with Time Delay Neural Networks and move further to currently famous model named Recurrent Neural Network and its extension Long Short Term Memory.
Edit intent: clarity
Original: This survey aims at proving that the structure of precedence constraints plays a tremendous role on the complexity of scheduling problems.
Revised: This survey aims at demonstrating that the structure of precedence constraints plays a tremendous role on the complexity of scheduling problems.
Edit intent: clarity
Original:  In this technique the subspace projection onto the target space of wanted eigenvectors is approximated with high-order filter polynomials obtained from a regularized Chebyshev expansion of a window function.
Revised:  In this technique the subspace projection onto the target space of wanted eigenvectors is approximated with filter polynomials obtained from a regularized Chebyshev expansion of a window function.
Edit intent: clarity
Original:  To demonstrate the potential of Chebyshev filter diagonalization for large scale problems of this kind we include as an example the computation of the 10^2 innermost eigenpairs of a topological insulator matrix with dimension 10^9 derived from quantum physics applications.
Revised:  To demonstrate the potential of Chebyshev filter diagonalization for large-scale problems of this kind we include as an example the computation of the 10^2 innermost eigenpairs of a topological insulator matrix with dimension 10^9 derived from quantum physics applications.
Edit intent: fluency
Original: The BIR workshop brings together experts of Bibliometrics and Information Retrieval.
Revised: The BIR workshop brings together experts in Bibliometrics and Information Retrieval.
Edit intent: clarity
Original:  While sometimes perceived as rather loosely related, they share various interests and face similar challenges.
Revised:  While sometimes perceived as rather loosely related, these research areas share various interests and face similar challenges.
Edit intent: clarity
Original:  First, both communities are only partly overlapping albeit sharing various interests.
Revised:  First, both communities only partly overlap, albeit sharing various interests.
Edit intent: clarity
Original:  Second, knowledge transfer would be profitable for both sides to tackle some of the emerging problems scholars face nowadays when they have to deal with identifying relevant and high quality literature among the very fast growing number of electronic publications available worldwide.
Revised:  Second, it will be profitable for both sides to tackle some of the emerging problems scholars face nowadays when they have to deal with identifying relevant and high quality literature among the very fast growing number of electronic publications available worldwide.
Edit intent: clarity
Original:  Second, knowledge transfer would be profitable for both sides to tackle some of the emerging problems scholars face nowadays when they have to deal with identifying relevant and high quality literature among the very fast growing number of electronic publications available worldwide.
Revised:  Second, knowledge transfer would be profitable for both sides to tackle some of the emerging problems that scholars face today when they have to deal with identifying relevant and high quality literature among the very fast growing number of electronic publications available worldwide.
Edit intent: clarity
Original:  Second, knowledge transfer would be profitable for both sides to tackle some of the emerging problems scholars face nowadays when they have to deal with identifying relevant and high quality literature among the very fast growing number of electronic publications available worldwide.
Revised:  Second, knowledge transfer would be profitable for both sides to tackle some of the emerging problems scholars face nowadays when they have to identify relevant and high quality literature among the very fast growing number of electronic publications available worldwide.
Edit intent: clarity
Original:  Second, knowledge transfer would be profitable for both sides to tackle some of the emerging problems scholars face nowadays when they have to deal with identifying relevant and high quality literature among the very fast growing number of electronic publications available worldwide.
Revised:  Second, knowledge transfer would be profitable for both sides to tackle some of the emerging problems scholars face nowadays when they have to deal with identifying relevant and high quality literature in the fast growing number of electronic publications available worldwide.
Edit intent: clarity
Original:  Bibliometric techniques are not yet widely used to enhance retrieval processes in digital libraries, although they offer value-added effects for users.
Revised:  Bibliometric techniques are not yet used widely to enhance retrieval processes in digital libraries, although they offer value-added effects for users.
Edit intent: fluency
Original:  The second workshop in 2015 continued the overall communication and reunification .
Revised:  The second workshop in 2015 further elaborated these themes .
Edit intent: clarity
Original:  This third BIR workshop continues to foster a common ground for the incorporation of bibliometric-enhanced services into scholarly search engine interfaces.
Revised:  This third BIR workshop aims to foster a common ground for the incorporation of bibliometric-enhanced services into scholarly search engine interfaces.
Edit intent: clarity
Original:  In particular we  address specific communities, as well as studies on large, cross-domain collections like Mendeley and ResearchGate.
Revised:  In particular we will address specific communities, as well as studies on large, cross-domain collections like Mendeley and ResearchGate.
Edit intent: fluency
Original:  The third BIR workshop addresses scholarly and explicitly industrial researchers.
Revised:  This third BIR workshop addresses scholarly and explicitly industrial researchers.
Edit intent: fluency
Original:  The third BIR workshop addresses scholarly and explicitly industrial researchers.
Revised:  The third BIR workshop addresses explicitly both scholarly and industrial researchers.
Edit intent: clarity
Original:  Moreover, the complexity of the algorithm follows immediately from the length of the chain, which can be bounded using Hilbert's function and Macaulay's theorem.
Revised:  The complexity of the algorithm follows immediately from the length of the chain, which can be bounded using Hilbert's function and Macaulay's theorem.
Edit intent: coherence
Original:  Moreover, the complexity of the algorithm follows immediately from the length of the chain, which can be bounded using Hilbert's function and Macaulay's theorem.
Revised:  Moreover, the complexity of the algorithm follows immediately from the length of the chain, which can be computed by Hilbert's function and Macaulay's theorem.
Edit intent: clarity
Original:  To the best of our knowledge, the  family of polynomial programs under consideration should be the largest one with a decidable termination problem so far.
Revised:  To the best of our knowledge, the family of polynomial programs should be the largest one with a decidable termination problem so far.
Edit intent: clarity
Original: In this paper, we investigate the termination problem of a family of polynomial programs , in which all assignments to program variables are polynomials, and test conditions of loops and conditional statements are polynomial equations.
Revised: We investigate the termination problem of a family of polynomial programs , in which all assignments to program variables are polynomials, and test conditions of loops and conditional statements are polynomial equations.
Edit intent: clarity
Original:  Our main result is that the non-terminating inputs  of such a polynomial program is algorithmically computable according to a strictly descending chain of algebraic sets, which implies that the termination problem of these programs is decidable.
Revised:  Our main result is that the non-terminating inputs of such a program is algorithmically computable according to a strictly descending chain of algebraic sets, which implies that the termination problem of these programs is decidable.
Edit intent: clarity
Original:  To the best of our knowledge, the considered family of polynomial programs should be the largest one with a decidable termination problem so far.
Revised:  To the best of our knowledge, the considered family of MPPs is hitherto the largest one with a decidable termination problem so far.
Edit intent: clarity
Original: Scala's type system unifies aspects of ML-style module systems , object-oriented, and functional programming paradigms.
Revised: Scala's type system unifies ML modules , object-oriented, and functional programming paradigms.
Edit intent: clarity
Original:  The DOT ( Dependent Object Types  ) family of calculi has been proposed as a new theoretic foundation for Scala and similar expressive languages.
Revised:  The DOT ( Dependent Object Types ) family of calculi has been proposed as a new foundation for Scala and similar expressive languages.
Edit intent: clarity
Original:  The DOT ( Dependent Object Types  ) family of calculi has been proposed as a new theoretic foundation for Scala and similar expressive languages.
Revised:  The DOT ( Dependent Object Types ) family of calculi has been proposed as a new theoretic foundation for Scala and similar languages.
Edit intent: clarity
Original:  Unfortunately, type soundness has only been established for a very restricted subset of DOT (muDOT), and it has been shown that adding important Scala features such as type refinement or extending subtyping to a lattice breaks at least one key metatheoretic property such as  narrowing or subtyping transitivity, which are usually required for a type soundness proof.
Revised:  Unfortunately, type soundness has only been established for very restricted subsets. In fact, important Scala features such as type refinement or extending subtyping to a lattice breaks at least one key metatheoretic property such as narrowing or subtyping transitivity, which are usually required for a type soundness proof.
Edit intent: coherence
Original:  Unfortunately, type soundness has only been established for a very restricted subset of DOT (muDOT), and it has been shown that adding important Scala features such as type refinement or extending subtyping to a lattice breaks at least one key metatheoretic property such as  narrowing or subtyping transitivity, which are usually required for a type soundness proof.
Revised:  Unfortunately, type soundness has only been established for a very restricted subset of DOT (muDOT), and it has been shown that adding important Scala features are known to break at least one key metatheoretic property such as narrowing or subtyping transitivity, which are usually required for a type soundness proof.
Edit intent: clarity
Original:  The first main contribution of this paper is to demonstrate how, perhaps surprisingly, even though these properties are lost in their full generality, a richer DOT calculus that includes both type refinement and a subtyping lattice with intersection types can still be proved sound.
Revised:  First, and, perhaps surprisingly, even though these properties are lost in their full generality, a richer DOT calculus that includes both type refinement and a subtyping lattice with intersection types can still be proved sound.
Edit intent: coherence
Original:  The first main contribution of this paper is to demonstrate how, perhaps surprisingly, even though these properties are lost in their full generality, a richer DOT calculus that includes both type refinement and a subtyping lattice with intersection types can still be proved sound.
Revised:  The first main contribution of this paper is to demonstrate how, perhaps surprisingly, we show how rich DOT calculi can still be proved sound.
Edit intent: clarity
Original:  Alas, the dominant method of proving type soundness, Wright and Felleisen's syntactic approach, is based on term rewriting, which does not make an adequate distinction between runtime and type assignment time.
Revised:  Alas, the dominant method of proving type soundness, Wright and Felleisen's syntactic approach, is based on term rewriting, which does not a priori make a distinction between runtime and type assignment time.
Edit intent: clarity
Original:  The second main contribution of this paper is to demonstrate how type soundness proofs for advanced, polymorphic, type systems can be carried out with an operational semantics based on high-level, definitional interpreters, implemented in Coq.
Revised:  Second, we demonstrate how type soundness proofs for advanced, polymorphic, type systems can be carried out with an operational semantics based on high-level, definitional interpreters, implemented in Coq.
Edit intent: coherence
Original:  The second main contribution of this paper is to demonstrate how type soundness proofs for advanced, polymorphic, type systems can be carried out with an operational semantics based on high-level, definitional interpreters, implemented in Coq.
Revised:  The second main contribution of this paper is to demonstrate how type soundness can be proved for advanced, polymorphic, type systems can be carried out with an operational semantics based on high-level, definitional interpreters, implemented in Coq.
Edit intent: coherence
Original:  The second main contribution of this paper is to demonstrate how type soundness proofs for advanced, polymorphic, type systems can be carried out with an operational semantics based on high-level, definitional interpreters, implemented in Coq.
Revised:  The second main contribution of this paper is to demonstrate how type soundness proofs for advanced, polymorphic, type systems with respect to high-level, definitional interpreters, implemented in Coq.
Edit intent: clarity
Original:  We discuss the challenges that arise in this setting, in particular due to abstract types, and we illustrate in detail how DOT-like calculi emerge from straightforward generalizations of the operational aspects of F<:  .
Revised:  We discuss the challenges that arise in this setting, in particular due to abstract types, and we illustrate in detail how DOT-like calculi emerge as generalizations of F<: .
Edit intent: clarity
Original:  For the optimization task, we show that when the population size is large enough, the complete partition which contains only one sample in each component is always better, and utilize the correlation computation result obtained earlier to reduce finding optimal complete partition to a well-studied Max-r-Cut problem.
Revised:  For the optimization task, we show that when the population size is large enough, the complete partition which contains only one sample in each group are always better, and utilize the correlation computation result obtained earlier to reduce finding optimal complete partition to a well-studied Max-r-Cut problem.
Edit intent: clarity