wanyu/IteraTeR_v2 huggingface dataset:
Original: Server assignment is an essential part in Content Delivery Network (CDN) , responsible for choosing a surrogate server to provide the best Quality of Service (QoS) for clients and balancing the server load.
Revised: Server assignment plays an essential part in Content Delivery Network (CDN) , responsible for choosing a surrogate server to provide the best Quality of Service (QoS) for clients and balancing the server load.
Edit intent: clarity
Original:  2) dynamic server assignment may bring about a huge amount of cached content migration among servers.
Edit intent: coherence
Original:  To address these issues, we work with one of the largest CDN operators in the world, and design a persistent dynamic server assignment algorithm, DynDNS.
Revised:  To address these issues, we design a consistent dynamic server assignment algorithm, DynDNS.
Edit intent: clarity
Original:  Theoretical analysis proves that the proposed greedy algorithm has considerable optimality guarantees, and evaluation shows that DynDNS can avoid about 50\% unnecessary shift in demand allocationand yield more stable cache hit ratio  .
Revised:  Theoretical analysis proves that the proposed greedy algorithm has considerable optimality guarantees, and evaluation shows that DynDNS can avoid about 50\% unnecessary shift in user-traffic allocation, yield more stable cache hit ratio .
Edit intent: clarity
Original:  In this work, we investigate how two pretrained contextualized language modes (ELMo and BERT) can be utilized for ad-hoc document ranking.
Revised:  In this work, we investigate how two pretrained contextualized language models (ELMo and BERT) can be utilized for ad-hoc document ranking.
Edit intent: clarity
Original: In addition to pre- and postconditions, program specifications in recent separation logics for concurrency have employed an algebraic structure of resources - a form of state transition systems - to describe the state-based program invariants that must be preserved, and to record the permissible atomic changes to program state.
Revised: In addition to pre- and postconditions, program specifications in recent separation logics for concurrency have employed an algebraic structure of resources---a form of state transition systems - to describe the state-based program invariants that must be preserved, and to record the permissible atomic changes to program state.
Edit intent: fluency
Original: In addition to pre- and postconditions, program specifications in recent separation logics for concurrency have employed an algebraic structure of resources - a form of state transition systems - to describe the state-based program invariants that must be preserved, and to record the permissible atomic changes to program state.
Revised: In addition to pre- and postconditions, program specifications in recent separation logics for concurrency have employed an algebraic structure of resources - a form of state transition systems---to describe the state-based program invariants that must be preserved, and to record the permissible atomic changes to program state.
Edit intent: fluency
Original:  We apply morphisms to abstract atomicity, where a program verified under one resource is adapted to operate under another resource, thus facilitating proof reuse.
Revised:  We apply morphisms and simulations to programs verified under one resource is adapted to operate under another resource, thus facilitating proof reuse.
Edit intent: clarity
Original: In addition to pre- and postconditions, program specifications in recent separation logics for concurrency have employed an algebraic structure of resources---a form of state transition systems---to describe the state-based program invariants that must be preserved, and to record the permissible atomic changes to program state.
Revised: In addition to pre- and postconditions, program specifications in recent separation logics for concurrency have employed an algebraic structure of resources---a form of state transition system---to describe the state-based program invariants that must be preserved, and to record the permissible atomic changes to program state.
Edit intent: fluency
Original:  We utilize graph neural networks to iteratively infer point weights for a plane fitting algorithm applied to local neighborhoods.
Revised:  We utilize graph neural networks to iteratively infer point weights for weighted least-squares plane fitting in local neighborhoods.
Edit intent: clarity
Original:  The approach retains the interpretability and efficiency of traditional sequential plane fitting while benefiting from a data-dependent deep-learning parameterization .
Revised:  The approach retains the interpretability and efficiency of traditional sequential plane fitting while benefiting from adaptation to data set statistics through deep learning .
Edit intent: clarity
Original: We present an integral equation approach to solve the Cahn-Hilliard equation equipped with boundary conditions that model solid surfaces with prescribed Young's angles.
Revised: We present an integral equation approach to solving the Cahn-Hilliard equation equipped with boundary conditions that model solid surfaces with prescribed Young's angles.
Edit intent: fluency
Original:  Discretization of the system in time using convex splitting leads to a modified biharmonic equation at each time step.
Revised:  The discretization of the system in time using convex splitting leads to a modified biharmonic equation at each time step.
Edit intent: clarity
Original:  To solve it, the basic idea is to split the solution into a volume potential computed with free space kernels, plus the solution to a second kind integral equation (SKIE).
Revised:  To solve it, we split the solution into a volume potential computed with free space kernels, plus the solution to a second kind integral equation (SKIE).
Edit intent: clarity
Original:  The volume potential is evaluated with  a box-based volume-FMM method.
Revised:  The volume potential is evaluated with the help of a box-based volume-FMM method.
Edit intent: clarity
Original:  Inspired by the state-of-the-art x-vector based speaker verification approach, this paper proposes a deep neural network ( DNN) architecture for spoof detection from both logical and physical access.
Revised:  Inspired by the state-of-the-art x based speaker verification approach, this paper proposes a deep neural network ( DNN) architecture for spoof detection from both logical and physical access.
Edit intent: clarity
Original:  Inspired by the state-of-the-art x-vector based speaker verification approach, this paper proposes a deep neural network ( DNN) architecture for spoof detection from both logical and physical access.
Revised:  Inspired by the state-of-the-art x-vector-vector based speaker verification approach, this paper proposes a deep neural network ( DNN) architecture for spoof detection from both logical and physical access.
Edit intent: fluency
Original:  Inspired by the state-of-the-art x-vector based speaker verification approach, this paper proposes a deep neural network ( DNN) architecture for spoof detection from both logical and physical access.
Revised:  Inspired by the state-of-the-art x-vector based speaker verification approach, this paper proposes a deep neural network ( TD-SNN) for spoof detection from both logical and physical access.
Edit intent: clarity
Original:  Inspired by the state-of-the-art x-vector based speaker verification approach, this paper proposes a deep neural network ( DNN) architecture for spoof detection from both logical and physical access.
Revised:  Inspired by the state-of-the-art x-vector based speaker verification approach, this paper proposes a deep neural network ( DNN) architecture for spoof detection for both logical and physical access.
Edit intent: fluency
Original:  A novelty of the x-vector approach vis-a-vis conventional DNN based systems is that it can handle variable length utterances during testing.
Revised:  The novelty of the x-vector approach vis-a-vis conventional DNN based systems is that it can handle variable length utterances during testing.
Edit intent: fluency
Original:  A novelty of the x-vector approach vis-a-vis conventional DNN based systems is that it can handle variable length utterances during testing.
Revised:  A novelty of the x-vector approach vis-a-vis conventional DNN systems is that it can handle variable length utterances during testing.
Edit intent: clarity
Original:  Performance of the proposed x-vector systems and the baseline Gaussian mixture model (GMM) systems is analyzed on the ASV-spoof-2019 dataset.
Revised:  Performance of the proposed x-vector systems and the baseline Gaussian mixture models (GMMs) is analyzed on the ASV-spoof-2019 dataset.
Edit intent: fluency
Original:  When combined with the decision-level feature switching (DLFS) paradigm, the best system in the proposed approach outperforms the best baseline systems with a relative improvement of 67.48\% and 40.04\% for both logical and physical accessin terms of minimum tandem cost detection function (min-t-DCF)\\%DIF > and 49.47\\% for both logical and physical  , respectively.
Revised:  When combined with the decision-level feature switching (DLFS) paradigm, the best system in the proposed approach outperforms the best baseline systems with a relative improvement of 67.48\% and 40.04\% for both logical and physical accessin terms of minimum tandem cost detection function (min-t-DCF)\\%DIF > and 49.47\\% for both logical and physical access , respectively.
Edit intent: fluency
Original: Given a dynamic set K of k strings of total length n whose characters are drawn from an alphabet of size \sigma, a keyword dictionary is a data structure built on K that provides locate , prefix search, and update operations on K.
Revised: Given a dynamic set K of k strings of total length n whose characters are drawn from an alphabet of size \sigma, a keyword dictionary is a data structure built on K that provides lookup , prefix search, and update operations on K.
Edit intent: clarity
Original:  Under the assumption that \alpha = \lg_{\sigma characters fit into a single machine word w , we propose a keyword dictionary that represents K in  n \lg \sigma + O(k w) bits of space, supporting all operations in O(m / \alpha + \lg \alpha) expected time on an input string of length m in the word RAM model.
Revised:  Under the assumption that \alpha = \lg_{\sigma characters fit into a single machine word of w bits , we propose a keyword dictionary that represents K in n \lg \sigma + O(k w) bits of space, supporting all operations in O(m / \alpha + \lg \alpha) expected time on an input string of length m in the word RAM model.
Edit intent: clarity
Original:  This data structure is underlined with an exhaustive practical evaluation , highlighting the practical usefulness of the proposed data structure  .
Revised:  An exhaustive practical evaluation , highlighting the practical usefulness of the proposed data structure .
Edit intent: coherence
Original:  This data structure is underlined with an exhaustive practical evaluation , highlighting the practical usefulness of the proposed data structure  .
Revised:  This data structure is underlined with an exhaustive practical evaluation highlights the practical usefulness of the proposed data structure .
Edit intent: fluency
Original:  Under the assumption that \alpha = w / \lg \sigma characters fit into a single machine word of wbits , we propose a keyword dictionary that represents K in either n \lg \sigma + \Theta(k \lg n) or |T| \lg \sigma + \Theta(k w) bits of space, where |T| is the number of nodes of a trie representing K.
Revised:  Under the assumption that \alpha = w / \lg \sigma characters fit into a single machine word w , we propose a keyword dictionary that represents K in either n \lg \sigma + \Theta(k \lg n) or |T| \lg \sigma + \Theta(k w) bits of space, where |T| is the number of nodes of a trie representing K.
Edit intent: clarity
Original:  Under the assumption that \alpha = w / \lg \sigma characters fit into a single machine word of wbits , we propose a keyword dictionary that represents K in either n \lg \sigma + \Theta(k \lg n) or |T| \lg \sigma + \Theta(k w) bits of space, where |T| is the number of nodes of a trie representing K.
Revised:  Under the assumption that \alpha = w / \lg \sigma characters fit into a single machine word of wbits , we propose a keyword dictionary that represents K in n \lg \sigma + \Theta(k \lg n) or |T| \lg \sigma + \Theta(k w) bits of space, where |T| is the number of nodes of a trie representing K.
Edit intent: clarity
Original:  Under the assumption that \alpha = w / \lg \sigma characters fit into a single machine word of wbits , we propose a keyword dictionary that represents K in either n \lg \sigma + \Theta(k \lg n) or |T| \lg \sigma + \Theta(k w) bits of space, where |T| is the number of nodes of a trie representing K.
Revised:  Under the assumption that \alpha = w / \lg \sigma characters fit into a single machine word of wbits , we propose a keyword dictionary that represents K in either n \lg \sigma + \Theta(k \lg n) bits of space, where |T| is the number of nodes of a trie representing K.
Edit intent: clarity
Original:  An exhaustive practical evaluation highlights the practical usefulness of the proposed data structure, especially for prefix searches - one of the most essential keyword dictionary operations.
Revised:  An exhaustive practical evaluation , highlighting the practical usefulness of the proposed data structure, especially for prefix searches - one of the most essential keyword dictionary operations.
Edit intent: fluency
Original:  An exhaustive practical evaluation highlights the practical usefulness of the proposed data structure, especially for prefix searches - one of the most essential keyword dictionary operations.
Revised:  An exhaustive practical evaluation highlights the practical usefulness of the proposed data structure, especially for prefix searches - one of the most elementary keyword dictionary operations.
Edit intent: clarity
Original:  With simulations, we illustrate the influence of variations in order flow and valuation distributions on price/volume, noting the emergence of resistance levels, as well as the distinction between high- and low-volume auction price variance.
Revised:  With simulations, we illustrate the influence of variations in order flow and valuation distributions on price/volume, noting a distinction between high- and low-volume auction price variance.
Edit intent: clarity
Original:  To verify the validity of the model statistically, we predict a year's worth of daily closing-price distributions for 5 ~shares in the Eurostoxx 50 index;
Revised:  To verify the validity of the model statistically, we predict a year's worth of daily closing price distributions for 5 ~shares in the Eurostoxx 50 index;
Edit intent: fluency
Original:  To verify the validity of the model statistically, we predict a year's worth of daily closing-price distributions for 5 ~shares in the Eurostoxx 50 index;
Revised:  To verify the validity of the model statistically, we predict a year's worth of daily closing-price distributions for 5 constituents of the Eurostoxx 50 index;
Edit intent: clarity
Original: Microstructural geometry plays a critical role in a response of heterogeneous materials.
Revised: Microstructural geometry plays a critical role in the response of heterogeneous materials.
Edit intent: fluency
Original:  Consequently, methods for generating microstructural samples are becoming an integral part of advanced numerical analyses.
Revised:  Consequently, methods for generating microstructural samples are increasingly crucial to advanced numerical analyses.
Edit intent: clarity
Original:  However, a robust procedure capable of designing complex, three-dimensional, foam-like and cellular morphologies of Wang tiles has been missing .
Revised:  However, a robust procedure capable of designing complex, three-dimensional, foam-like and cellular morphologies of Wang tiles has not yet been proposed .
Edit intent: clarity
Original:  This contribution thus significantly broadens the applicability of the tiling concept.
Revised:  This contribution fills the gap by significantly broadening the applicability of the tiling concept.
Edit intent: clarity
Original:  This is an improvement with respect to Makarov  algorithm using 22 multiplications[ 10 ].
Revised:  This is an improvement with respect to Makarov 's algorithm using 22 multiplications[ 10 ].
Edit intent: fluency
Original:  We also study the asymptotics of P(G,m) - P_{DP}(G,m) for a fixed graph G , and we develop techniques to compute P_{DP}(G,m) exactly for certain classes of graphs such as chordal graphs, unicyclic graphs, and cycles with a chord (G \vee K_p, m) = P(G \vee K_p , m) for large enough m} .
Revised:  We also study the asymptotics of P(G,m) - P_{DP}(G,m) for a fixed graph G . We develop techniques to compute P_{DP}(G,m) exactly for certain classes of graphs such as chordal graphs, unicyclic graphs, and cycles with a chord (G \vee K_p, m) = P(G \vee K_p , m) for large enough m} .
Edit intent: coherence
Original:  We also study the asymptotics of P(G,m) - P_{DP}(G,m) for a fixed graph G , and we develop techniques to compute P_{DP}(G,m) exactly for certain classes of graphs such as chordal graphs, unicyclic graphs, and cycles with a chord (G \vee K_p, m) = P(G \vee K_p , m) for large enough m} .
Revised:  We also study the asymptotics of P(G,m) - P_{DP}(G,m) for a fixed graph G , and we develop techniques to compute P_{DP}(G,m) exactly and apply them to certain classes of graphs such as chordal graphs, unicyclic graphs, and cycles with a chord (G \vee K_p, m) = P(G \vee K_p , m) for large enough m} .
Edit intent: clarity
Original:  In this paper, we introduce a DP-coloring analogue of the chromatic polynomial called the DP color function  denoted P_{DP}(G,m)  . Motivated by known results related to the list color function, we show that while the DP color function behaves similar to the list color function for some graphs, there are also some surprising differences.
Revised:  In this paper, we introduce a DP-coloring analogue of the chromatic polynomial called the DP color function , denoted P_{DP}(G,m) . Motivated by known results related to the list color function, we show that while the DP color function behaves similar to the list color function for some graphs, there are also some surprising differences.
Edit intent: fluency
Original: Approximation and uncertainty quantification methods based on Lagrange interpolation are typically abandoned in cases where the probability distributions of a stochastic system's input  parameters are not normal, uniform, or closely related ones , due to the lack of suitable interpolation nodes .
Revised: Approximation and uncertainty quantification methods based on Lagrange interpolation are typically abandoned in cases where the probability distributions of one or more parameters are not normal, uniform, or closely related ones , due to the lack of suitable interpolation nodes .
Edit intent: clarity
Original: Approximation and uncertainty quantification methods based on Lagrange interpolation are typically abandoned in cases where the probability distributions of a stochastic system's input  parameters are not normal, uniform, or closely related ones , due to the lack of suitable interpolation nodes .
Revised: Approximation and uncertainty quantification methods based on Lagrange interpolation are typically abandoned in cases where the probability distributions of a stochastic system's input system parameters are not normal, uniform, or closely related ones , due to the lack of suitable interpolation nodes .
Edit intent: clarity
Original: Approximation and uncertainty quantification methods based on Lagrange interpolation are typically abandoned in cases where the probability distributions of a stochastic system's input  parameters are not normal, uniform, or closely related ones , due to the lack of suitable interpolation nodes .
Revised: Approximation and uncertainty quantification methods based on Lagrange interpolation are typically abandoned in cases where the probability distributions of a stochastic system's input parameters are not normal, uniform, or closely related distributions , due to the lack of suitable interpolation nodes .
Edit intent: clarity
Original:  This paper suggests the use of weighted Leja node sequences as a remedy to this situation.
Revised:  This paper examines the use of weighted Leja node sequences as a remedy to this situation.
Edit intent: clarity
Original:  The performance and reliability of the suggested approach is verified by the results of three numerical experiments, where the respective models feature extreme value and truncated normal input distributions.
Revised:  The performance and reliability of the suggested approach is verified by four numerical experiments, where the respective models feature extreme value and truncated normal input distributions.
Edit intent: clarity
Original:  The suggested approach is also compared against a well-established polynomial chaos method and found to be either comparable or superior in terms of approximation and statistical moment estimation accuracy.
Revised:  The suggested approach is compared with a well-established polynomial chaos method and found to be either comparable or superior in terms of approximation and statistical moment estimation accuracy.
Edit intent: clarity
Original:  The suggested approach is also compared against a well-established polynomial chaos method and found to be either comparable or superior in terms of approximation and statistical moment estimation accuracy.
Revised:  The suggested approach is also compared against a well-established polynomial chaos method and found to be either comparable or superior in terms of approximation and statistics estimation accuracy.
Edit intent: clarity
Original: In recent decade, utility mining has attracted a great  attention, but most of the existing studies are developed to deal with itemset-based data.
Revised: In recent decade, utility mining has attracted a great amount of attention, but most of the existing studies are developed to deal with itemset-based data.
Edit intent: clarity
Original: In recent decade, utility mining has attracted a great  attention, but most of the existing studies are developed to deal with itemset-based data.
Revised: In recent decade, utility mining has attracted a great attention, but most of the existing studies have been developed to deal with itemset-based data.
Edit intent: fluency
Original:  Different from the itemset-based data, the time-ordered sequence data is more commonly seen in real-world situations . Current utility mining algorithms have the limitation when dealing with sequence datasince they are time-consuming and require large amount of memory usage .
Revised:  Time-ordered sequence data is more commonly seen in real-world situations . Current utility mining algorithms have the limitation when dealing with sequence datasince they are time-consuming and require large amount of memory usage .
Edit intent: coherence
Original:  Different from the itemset-based data, the time-ordered sequence data is more commonly seen in real-world situations . Current utility mining algorithms have the limitation when dealing with sequence datasince they are time-consuming and require large amount of memory usage .
Revised:  Different from the itemset-based data, the time-ordered sequence data is more commonly seen in real-world situations , which is different from itemset-based data. Since they are time-consuming and require large amount of memory usage .
Edit intent: coherence
Original:  The utility-array structure is designed to store  necessary information of  sequence-order and utility.
Revised:  The utility-array structure is designed to store the necessary information of sequence-order and utility.
Edit intent: fluency
Original:  The utility-array structure is designed to store  necessary information of  sequence-order and utility.
Revised:  The utility-array structure is designed to store necessary information of the sequence-order and utility.
Edit intent: fluency