wanyu/IteraTeR_v2 huggingface dataset:
Original:  Practical limitations are faced in the available deployment budget, capacity and hardware requirements of the edge servers and the underlying backbone network topology.
Revised:  In the edge server placement, it is important to consider computing capacity, available deployment budget, capacity and hardware requirements of the edge servers and the underlying backbone network topology.
Edit intent: clarity
Original:  Practical limitations are faced in the available deployment budget, capacity and hardware requirements of the edge servers and the underlying backbone network topology.
Revised:  Practical limitations are faced in the available deployment budget, and hardware requirements of the edge servers and the underlying backbone network topology.
Edit intent: clarity
Original:  Practical limitations are faced in the available deployment budget, capacity and hardware requirements of the edge servers and the underlying backbone network topology.
Revised:  Practical limitations are faced in the available deployment budget, capacity and hardware requirements for the edge servers and the underlying backbone network topology.
Edit intent: clarity
Original:  In this paper, we  survey the existing literature in edge server placement and identify gaps and  an extensive set of parameters to be considered.
Revised:  In this paper, we thoroughly survey the existing literature in edge server placement and identify gaps and an extensive set of parameters to be considered.
Edit intent: clarity
Original:  In this paper, we  survey the existing literature in edge server placement and identify gaps and  an extensive set of parameters to be considered.
Revised:  In this paper, we survey the existing literature in edge server placement , identify gaps and an extensive set of parameters to be considered.
Edit intent: fluency
Original:  In this paper, we  survey the existing literature in edge server placement and identify gaps and  an extensive set of parameters to be considered.
Revised:  In this paper, we survey the existing literature in edge server placement and identify gaps and present an extensive set of parameters to be considered.
Edit intent: coherence
Original:  Then, we develop a novel algorithm, called PACK, for server placement as a capacitated location-allocation problem.
Revised:  We then develop a novel algorithm, called PACK, for server placement as a capacitated location-allocation problem.
Edit intent: coherence
Original:  Moreover, PACK allows consideration of practical issues , including prioritized locations and reliability concerns.
Revised:  Moreover, PACK considers practical issues such as prioritized locations and reliability concerns.
Edit intent: clarity
Original:  The algorithm is evaluated in two distinct scenarios , with high capacity servers for edge computing in general and low capacity servers for Fog computing.
Revised:  The algorithm is evaluated in two distinct scenarios : one with high capacity servers for edge computing in general and low capacity servers for Fog computing.
Edit intent: clarity
Original:  In the evaluation, we utilize a data set collected in a real-world network, consisting of both dense and sparse deployments of access points across a city area.
Revised:  Evaluations are performed with a data set collected in a real-world network, consisting of both dense and sparse deployments of access points across a city area.
Edit intent: clarity
Original:  Lastly, PACK is published as an open source software.
Revised:  The resulting algorithm and related tools are publicly available as open source software.
Edit intent: clarity
Original: Most network data are collected from only partially observable networks with both missing nodes and edges, for example  due to limited resources and privacy settings specified by users on social media.
Revised: Most network data are collected from only partially observable networks with both missing nodes and edges, for example , due to limited resources and privacy settings specified by users on social media.
Edit intent: fluency
Original:  Thus, it stands to the reason that inferring the missing parts of the networks by performing %DIFDELCMD < \network %%%  completion should precede downstream mining or learning tasks on the networks.
Revised:  Thus, it stands to reason that inferring the missing parts of the networks by performing %DIFDELCMD < \network %%% completion should precede downstream mining or learning tasks on the networks.
Edit intent: fluency
Original:  In this paper, we present DeepNC, a novel method for inferring the missing parts of a network that is based on a deep generative graph model . Specifically, our model first learns a likelihood over edges via a recurrent neural network (RNN)-based generative graph , and then identifies the graph that maximizes the learned likelihood conditioned on the observable graph topology.
Revised:  In this paper, we present DeepNC, a novel method for inferring the missing parts of a network that is based on a deep generative model of graphs . Specifically, our model first learns a likelihood over edges via a recurrent neural network (RNN)-based generative graph , and then identifies the graph that maximizes the learned likelihood conditioned on the observable graph topology.
Edit intent: clarity
Original:  In this paper, we present DeepNC, a novel method for inferring the missing parts of a network that is based on a deep generative graph model . Specifically, our model first learns a likelihood over edges via a recurrent neural network (RNN)-based generative graph , and then identifies the graph that maximizes the learned likelihood conditioned on the observable graph topology.
Revised:  In this paper, we present DeepNC, a novel method for inferring the missing parts of a network that is based on a deep generative graph model . Specifically, our method first learns a likelihood over edges via a recurrent neural network (RNN)-based generative graph , and then identifies the graph that maximizes the learned likelihood conditioned on the observable graph topology.
Edit intent: clarity
Original:  Moreover, we propose a computationally efficient DeepNC algorithm that consecutively finds a single node to maximize the probability in each node generation step, whose runtime complexity is almost linear in the number of nodes in the network.
Revised:  Moreover, we propose a computationally efficient DeepNC algorithm that consecutively finds individual nodes that maximize the probability in each node generation step, whose runtime complexity is almost linear in the number of nodes in the network.
Edit intent: clarity
Original:  We empirically show the superiority of DeepNC over state-of-the-art network completion approaches on a variety of synthetic and real-world networks .
Revised:  We empirically demonstrate the superiority of DeepNC over state-of-the-art network completion approaches on a variety of synthetic and real-world networks .
Edit intent: fluency
Original:  We empirically show the superiority of DeepNC over state-of-the-art network completion approaches on a variety of synthetic and real-world networks .
Revised:  We empirically show the superiority of DeepNC over state-of-the-art network completion approaches .
Edit intent: clarity
Original: Most network data are collected from only partially observable networks with both missing nodes and  edges, for example, due to limited resources and privacy settings specified by users on social media.
Revised: Most network data are collected from partially observable networks with both missing nodes and edges, for example, due to limited resources and privacy settings specified by users on social media.
Edit intent: clarity
Original: Most network data are collected from only partially observable networks with both missing nodes and  edges, for example, due to limited resources and privacy settings specified by users on social media.
Revised: Most network data are collected from only partially observable networks with both missing nodes and missing edges, for example, due to limited resources and privacy settings specified by users on social media.
Edit intent: fluency
Original:  Thus, it stands to reason that inferring the missing parts of the networks by performing network completion should precede downstream mining or learning tasks on the networks .
Revised:  Thus, it stands to reason that inferring the missing parts of the networks by performing network completion should precede downstream applications .
Edit intent: clarity
Original:  In this paper, we present DeepNC, a novel method for inferring the missing parts of a network that is based on a deep generative model of graphs.
Revised:  In this paper, we present DeepNC, a novel method for inferring the missing parts of a network based on a deep generative model of graphs.
Edit intent: coherence
Original:  It is shown that the conservative RMHD equations are not symmetrizable and do not possess an entropy pair.
Revised:  It is shown that the conservative RMHD equations are not symmetrizable and do not admit a thermodynamic entropy pair.
Edit intent: clarity
Original:  Arbitrarily high-order accurate entropy stable finite difference schemes are then developed on Cartesian meshes based on the symmetrizable RMHD system.
Revised:  Arbitrarily high-order accurate entropy stable finite difference schemes are developed on Cartesian meshes based on the symmetrizable RMHD system.
Edit intent: coherence
Original:  Several benchmark numerical tests demonstrate the accuracy and robustness of the proposed entropy stable schemes of the symmetrizable RMHD equations .
Revised:  Several numerical tests demonstrate the accuracy and robustness of the proposed entropy stable schemes of the symmetrizable RMHD equations .
Edit intent: clarity
Original:  Several benchmark numerical tests demonstrate the accuracy and robustness of the proposed entropy stable schemes of the symmetrizable RMHD equations .
Revised:  Several benchmark numerical tests demonstrate the accuracy and robustness of the proposed entropy stable schemes .
Edit intent: clarity
Original: In this paper, we consider the problem of optimally coordinating the response of a group of distributed energy resources (DERs) to meet total electric power demand while minimizing the total generation cost and respecting the DER capacity limits.
Revised: In this paper, we consider the problem of optimally coordinating the response of a group of distributed energy resources (DERs) so they collectively meet the electric power demanded by a collection of loads, while minimizing the total generation cost and respecting the DER capacity limits.
Edit intent: clarity
Original:  This problem can be cast as a convex optimization problem, where the global objective is to minimize a sum of convex functions corresponding to the costs of generating power from the DERs while satisfying linear inequality constraints corresponding to the DER capacity limits and  a linear equality constraint corresponding to the total power generated by the DERs being equal to the total power demand.
Revised:  This problem can be cast as a convex optimization problem, where the global objective is to minimize a sum of convex functions corresponding to the costs of generating power from the DERs while satisfying linear inequality constraints corresponding to the DER capacity limits and (ii) a linear equality constraint corresponding to the total power generated by the DERs being equal to the total power demand.
Edit intent: coherence
Original:  We develop distributed algorithms to solve the DER coordination problem over time-varying communication networks with either (i) bidirectional or (ii) unidirectional communication links.
Revised:  We develop distributed algorithms to solve the DER coordination problem over time-varying communication networks with either bidirectional or unidirectional communication links.
Edit intent: fluency
Original:  The algorithms proposed for directed communication graphs have the geometric convergence rate  when communication out-degrees are unknown to agents.
Revised:  The algorithms proposed for directed communication graphs have geometric convergence rate when communication out-degrees are unknown to agents.
Edit intent: clarity
Original:  The algorithms proposed for directed communication graphs have the geometric convergence rate  when communication out-degrees are unknown to agents.
Revised:  The algorithms proposed for directed communication graphs have the geometric convergence rate even when communication out-degrees are unknown to agents.
Edit intent: clarity
Original:  The algorithms can be seen as the distributed versions of a centralized primal-dual algorithm.
Edit intent: clarity
Original:  We showcase the algorithms using the standard IEEE 39 - bus test system, and compare their performance against that of existing ones .
Revised:  We showcase the algorithms using the standard IEEE 39-bus test system, and compare their performance against that of existing ones .
Edit intent: fluency
Original:  The algorithms for directed communication graphs have geometric convergence rate even when communication out-degrees are unknown to agents.
Revised:  One algorithm proposed for directed communication graphs have geometric convergence rate even when communication out-degrees are unknown to agents.
Edit intent: clarity
Original:  The algorithms for directed communication graphs have geometric convergence rate even when communication out-degrees are unknown to agents.
Revised:  The algorithms for directed communication graphs has geometric convergence rate even when communication out-degrees are unknown to agents.
Edit intent: fluency
Original:  We showcase the  algorithms using the standard IEEE 39-bus test system, and compare their performance against other ones proposed in the literature.
Revised:  We showcase the proposed algorithms using the standard IEEE 39-bus test system, and compare their performance against other ones proposed in the literature.
Edit intent: fluency
Original:  The proposed algorithms can be seen as the distributed versions of a centralized primal-dual algorithm.
Revised:  The proposed algorithms can be seen as distributed versions of a centralized primal-dual algorithm.
Edit intent: fluency
Original:  One algorithm proposed for directed communication graphs has geometric convergence rate even when communication out-degrees are unknown to agents.
Revised:  One of the algorithms proposed for directed communication graphs has geometric convergence rate even when communication out-degrees are unknown to agents.
Edit intent: clarity
Original:  Another particularity of the news domain is that constantly fresh articles are published, which might be immediately considered for recommendation.
Revised:  Another particularity of the news domain is that constantly fresh articles are published, which should be immediately considered for recommendation.
Edit intent: clarity
Original:  To deal with such item cold-start problem, it is important to consider the actual content of items when recommending.
Revised:  To deal with this item cold-start problem, it is important to consider the actual content of items when recommending.
Edit intent: fluency
Original:  Furthermore,  the choice of the content encoding can have an impact on the resulting performance.
Revised:  Furthermore, we show that the choice of the content encoding can have an impact on the resulting performance.
Edit intent: coherence
Original:  In order to demonstrate the  proposed framework, we consider a scenario where a team of eight planar robots explore an urban environment in order to localize and rescue a subject .
Revised:  In order to demonstrate the significance of the proposed framework, we consider a scenario where a team of eight planar robots explore an urban environment in order to localize and rescue a subject .
Edit intent: clarity
Original:  This very recent artistic movement, sharing several approaches and philosophies with conceptual art, is producing data at an unprecedented level of detail when compared to the traditional art market.
Revised:  This very recent artistic movement, sharing several approaches and motivations with conceptual art, is producing data at an unprecedented level of detail when compared to the traditional art market.
Edit intent: clarity
Original:  We introduce an extended and unified architecture which can be used for tasks involving a variety of modalities like image, text, videos, etc.
Revised:  We introduce an extended and unified architecture that can be used for tasks involving a variety of modalities like image, text, videos, etc.
Edit intent: fluency
Original:  The degree structure associated with this ordering, the Levin-V'yugin degrees (orLV-degrees ), can be shown to be a Boolean algebra, and in fact a measure algebra.
Revised:  The degree structure associated with this ordering, the (orLV-degrees ), can be shown to be a Boolean algebra, and in fact a measure algebra.
Edit intent: clarity
Original:  The degree structure associated with this ordering, the Levin-V'yugin degrees (orLV-degrees ), can be shown to be a Boolean algebra, and in fact a measure algebra.
Revised:  The degree structure associated with this ordering, the Levin-V'yugin degrees LV-degrees ), can be shown to be a Boolean algebra, and in fact a measure algebra.
Edit intent: fluency
Original:  The degree structure associated with this ordering, the Levin-V'yugin degrees (orLV-degrees ), can be shown to be a Boolean algebra, and in fact a measure algebra.
Revised:  The degree structure associated with this ordering, the Levin-V'yugin degrees (orLevin-V'yugin degrees (or LV-degrees ), can be shown to be a Boolean algebra, and in fact a measure algebra.
Edit intent: fluency
Original:  Roughly speaking, given two such collections A and B, A is less than B in this ordering if A\setminusB is negligible.
Revised:  Roughly speaking, given two such collections A and B, A is below B in this ordering if A\setminusB is negligible.
Edit intent: clarity
Original: Given a finite sequence a_1, a_2,\ldots, a_d of d permutations in the symmetric group S_n, and a permutation word k_1k_2\cdots k_{m over the alphabet \{1,2,\ldots, d\}, computation of the product a_{k_1}a_{k_2}\cdots a_{k_{m}} in a straightforward manner takes O(n m) time.
Revised:  over the alphabet \{1,2,\ldots, d\}, computation of the product a_{k_1}a_{k_2}\cdots a_{k_{m}} in a straightforward manner takes O(n m) time.
Edit intent: clarity
Original:  The above result is used to solve the }  transitive simultaneous conjugacy problem in O(n^2 \log d / \log n + dn\log n) time and O(n^{1+ \epsilon + dn) space, where 0 < \epsilon <1.
Revised:  The above result is used to solve the } The transitive simultaneous conjugacy problem in O(n^2 \log d / \log n + dn\log n) time and O(n^{1+ \epsilon + dn) space, where 0 < \epsilon <1.
Edit intent: fluency
Original:  This problem } asks whether there exists a permutation \tau \in S_n such that b_j = \tau^{-1} a_j \tau holds for all j = 1,2, \ldots, d, where a_1, a_2, \ldots, a_d and b_1, b_2, \ldots, b_d are given sequences of d permutations in S_n, each of which generates a transitive subgroup of S_n. As from mid 70' it has been know that the problem can be solved in O(dn^2) time.
Revised:  This problem } asks whether there exists a permutation \tau \in S_n such that b_j = \tau^{-1} a_j \tau holds for all j = 1,2, \ldots, d, where a_1, a_2, \ldots, a_d and b_1, b_2, \ldots, b_d are given sequences of d permutations in S_n, each of which generates a transitive subgroup of S_n. As from mid 70' it has been known that the problem can be solved in O(dn^2) time.
Edit intent: fluency
Original:  Analyzing their variability is crucial for understanding speech production, diagnosing speech and swallowing disorders and building intuitive applications for rehabilitation.
Revised:  Analyzing their variations is crucial for understanding speech production, diagnosing speech and swallowing disorders and building intuitive applications for rehabilitation.
Edit intent: fluency
Original:  Identifying key anatomical landmarks on it is a pre-requisite for further analyses.
Revised:  Identifying key anatomical landmarks of these structures on medical images is a pre-requisite for further analyses.
Edit intent: clarity
Original:  This is a challenging task considering the high inter- and intra-speaker variability and the mutual interaction between the articulators  .
Revised:  This is a challenging task considering the high inter- and intra-speaker variability , the mutual interaction between the articulators .
Edit intent: fluency
Original:  This study intends to solve this issue automatically for the first time .
Revised:  This study addresses this issue for the first time .
Edit intent: clarity
Original:  For this purpose, midsagittal anatomical MRI for 9 speakers sustaining 62 articulations and annotated with the location of 21 key anatomical landmarks are considered.
Revised:  For this purpose, midsagittal anatomical MRI for 9 speakers sustaining 62 articulations with 21 key anatomical landmarks are considered.
Edit intent: clarity
Original:  The generation of such a multi-channel image from an input MRI image is tested through two deep learning networks, one taken from the literature and one designed on purpose in this study, the flat-net . Results show that the flat-net approach outperforms the other methods, leading to an overall Root Mean Square Error of 3.4~ pixels/ 0.34~ cm obtained in a leave-one-out procedure over the speakers.
Revised:  The generation of such a multi-channel image from an input MRI image is tested through two deep learning networks, one taken from the literature and one designed on purpose in this study, the flat-net . Results show that the Flat-net approach outperforms the other methods, leading to an overall Root Mean Square Error of 3.4~ pixels/ 0.34~ cm obtained in a leave-one-out procedure over the speakers.
Edit intent: fluency
Original:  The generation of such a multi-channel image from an input MRI image is tested through two deep learning networks, one taken from the literature and one designed on purpose in this study, the flat-net . Results show that the flat-net approach outperforms the other methods, leading to an overall Root Mean Square Error of 3.4~ pixels/ 0.34~ cm obtained in a leave-one-out procedure over the speakers.
Revised:  The generation of such a multi-channel image from an input MRI image is tested through two deep learning networks, one taken from the literature and one designed on purpose in this study, the flat-net . Results show that the flat-net approach outperforms the former methods, leading to an overall Root Mean Square Error of 3.4~ pixels/ 0.34~ cm obtained in a leave-one-out procedure over the speakers.
Edit intent: clarity
Original:  Our Savina microbenchmark results further detail how different utilization patterns impact snapshotting cost.
Revised:  Our Savina microbenchmark results detail how different utilization patterns impact snapshotting cost.
Edit intent: clarity
Original:  We consider the property \mathcal{P of containing a spanning graph H as a subgraph.
Revised:  We consider the property of containing a spanning graph H as a subgraph.
Edit intent: clarity
Original:  We answer this question positively in a strong sense, showing that any graph with maximum degree \Delta can be constructed w.h.p. in (3\Delta/2 + o(\Delta)) n rounds , where the o(\Delta) term tends to zero as \Delta%DIFDELCMD < \to %DIFDELCMD < %%% \infty .
Revised:  We answer this question positively in a strong sense, showing that any graph with maximum degree \Delta can be constructed w.h.p. in (3\Delta/2 + o(\Delta)) n rounds %DIFDELCMD < \to %DIFDELCMD < %%% \infty .
Edit intent: clarity
Original: Essentially all Internet communication relies on the Domain Name System (DNS), which first maps a human-readable Internet destination or service to an IP address before two endpoints establish a connection to exchange data .
Revised: Nearly every service on the Internet relies on the Domain Name System (DNS), which first maps a human-readable Internet destination or service to an IP address before two endpoints establish a connection to exchange data .
Edit intent: clarity