wanyu/IteraTeR_v2 huggingface dataset:
Original:  We present the simulation results of the dedicated-path protection with signal modulation constraints for the elastic optical networks of three sizes: 25, 50 and 100 nodes, and three numbers of spectrum units: 160, 320, and 640.
Revised:  We present the simulation results of dedicated-path protection with signal modulation constraints for the elastic optical networks of three sizes: 25, 50 and 100 nodes, and three numbers of spectrum units: 160, 320, and 640.
Edit intent: fluency
Original:  We present the simulation results of the dedicated-path protection with signal modulation constraints for the elastic optical networks of three sizes: 25, 50 and 100 nodes, and three numbers of spectrum units: 160, 320, and 640.
Revised:  We present the simulation results of the dedicated-path protection with signal modulation constraints for elastic optical networks of three sizes: 25, 50 and 100 nodes, and three numbers of spectrum units: 160, 320, and 640.
Edit intent: fluency
Original:  We present the simulation results of the dedicated-path protection with signal modulation constraints for the elastic optical networks of three sizes: 25, 50 and 100 nodes, and three numbers of spectrum units: 160, 320, and 640.
Revised:  We present the simulation results of the dedicated-path protection with signal modulation constraints for the elastic optical networks of 25, 50 and 100 nodes, and three numbers of spectrum units: 160, 320, and 640.
Edit intent: clarity
Original:  We present the simulation results of the dedicated-path protection with signal modulation constraints for the elastic optical networks of three sizes: 25, 50 and 100 nodes, and three numbers of spectrum units: 160, 320, and 640.
Revised:  We present the simulation results of the dedicated-path protection with signal modulation constraints for the elastic optical networks of three sizes: 25, 50 and 100 nodes, and with 160, 320, and 640.
Edit intent: clarity
Original:  We present the simulation results of the dedicated-path protection with signal modulation constraints for the elastic optical networks of three sizes: 25, 50 and 100 nodes, and three numbers of spectrum units: 160, 320, and 640.
Revised:  We present the simulation results of the dedicated-path protection with signal modulation constraints for the elastic optical networks of three sizes: 25, 50 and 100 nodes, and three numbers of spectrum units: 160, 320, and 640 spectrum units.
Edit intent: clarity
Original:  The algorithm is efficient , because it can solve large problems, and it is exact , because its results are optimal  .
Revised:  The algorithm can be efficient because it can solve large problems, and it is exact , because its results are optimal .
Edit intent: coherence
Original:  The algorithm is efficient , because it can solve large problems, and it is exact , because its results are optimal  .
Revised:  The algorithm is efficient , because it can solve large problems, and it can be exact because its results are optimal .
Edit intent: clarity
Original:  We argue the stated problem is tractable by providing for the proposed algorithm a polynomial pessimistic complexity analysis, and a proof of correctness.
Edit intent: coherence
Original:  We present the  simulation results of dedicated-path protection with signal modulation constraints for elastic optical networks of 25, 50  and 100 nodes, and with 160, 320, and 640 spectrum units.
Revised:  We present the extensive simulation results of dedicated-path protection with signal modulation constraints for elastic optical networks of 25, 50 and 100 nodes, and with 160, 320, and 640 spectrum units.
Edit intent: clarity
Original:  We present the  simulation results of dedicated-path protection with signal modulation constraints for elastic optical networks of 25, 50  and 100 nodes, and with 160, 320, and 640 spectrum units.
Revised:  We present the simulation results of dedicated-path protection with signal modulation constraints for elastic optical networks of 25, 50 , and 100 nodes, and with 160, 320, and 640 spectrum units.
Edit intent: fluency
Original: The election control problem  asks to find a set of nodes in a social network of voters to be the starters of a political campaign aimed at supporting a given target candidate.
Revised: The election control problem asks to find a set of nodes in a social network of voters to be the starters of a political campaign aiming at supporting a given target candidate.
Edit intent: fluency
Original:  When a voter is reached by the campaign it changes its opinion on the candidates.
Revised:  Voters reached by the campaign it changes its opinion on the candidates.
Edit intent: clarity
Original:  When a voter is reached by the campaign it changes its opinion on the candidates.
Revised:  When a voter is reached by the campaign change their opinions on the candidates.
Edit intent: clarity
Original:  Previous works on this problem show that it can be approximated within a constant ratio in several models for information diffusion and voting systems .
Revised:  Previous work shows that the problem can be approximated within a constant ratio in several models for information diffusion and voting systems .
Edit intent: clarity
Original:  Previous works on this problem show that it can be approximated within a constant ratio in several models for information diffusion and voting systems .
Revised:  Previous works on this problem show that it can be approximated within a constant factor in several models for information diffusion and voting systems .
Edit intent: clarity
Original:  Previous works on this problem show that it can be approximated within a constant ratio in several models for information diffusion and voting systems .
Revised:  Previous works on this problem show that it can be approximated within a constant ratio in several models of information diffusion and voting systems .
Edit intent: fluency
Original:  However , this information is not always available since voters can be undecided or they may not want to reveal it.
Revised:  However , this information is not always available since some voters might not reveal it.
Edit intent: clarity
Original:  We propose two new models in which, when a voter is reached by a campaign, it modifies its probability distribution according to the amount of influence it received from its neighbors in the network.
Revised:  We propose two models in which, when a voter is reached by a campaign, it modifies its probability distribution according to the amount of influence it received from its neighbors in the network.
Edit intent: clarity
Original:  We propose two new models in which, when a voter is reached by a campaign, it modifies its probability distribution according to the amount of influence it received from its neighbors in the network.
Revised:  We propose two new models in which, when an electoral campaign reaches a voter, this latter modifies its probability distribution according to the amount of influence it received from its neighbors in the network.
Edit intent: clarity
Original:  We then study the election control problem  on the new models: In the first model, under the Gap-ETH hypothesis , election control cannot be approximated within a factor better than 1/n^{o(1)}, where n is the number of voters;
Revised:  We then study the election control problem on the new models: In the first model, under the Gap-ETH , election control cannot be approximated within a factor better than 1/n^{o(1)}, where n is the number of voters;
Edit intent: clarity
Original: The proliferation of fake news and its propagation on social media have become a major concern due to its ability to create devastating impacts.
Revised: The proliferation of fake news and its propagation on social media has become a major concern due to its ability to create devastating impacts.
Edit intent: fluency
Original:  Different machine learning approaches have been attempted to detect it .
Revised:  Different machine learning approaches have been suggested to detect fake news .
Edit intent: clarity
Original:  However, most of those focused on a special type of news (such as political) and did not apply many advanced techniques .
Revised:  However, most of those focused on a specific type of news (such as political) and did not apply many advanced techniques .
Edit intent: clarity
Original:  In this research, we conduct a benchmark study to assess the performance of different applicable  approaches on three different datasets where  the largest and most diversified one was developed by us.
Revised:  In this research, we conducted a benchmark study to assess the performance of different applicable approaches on three different datasets where the largest and most diversified one was developed by us.
Edit intent: fluency
Original:  In this research, we conduct a benchmark study to assess the performance of different applicable  approaches on three different datasets where  the largest and most diversified one was developed by us.
Revised:  In this research, we conduct a benchmark study to assess the performance of different applicable approaches on three different datasets where we accumulated the largest and most diversified one was developed by us.
Edit intent: coherence
Original:  However, research focused on closed DQBFs in prenex form (where all quantifiers are placed in front of a propositional formula) and non-prenex DQBFs have almost not been studied in the literature.
Revised:  However, research focused on closed DQBFs in prenex form (where all quantifiers are placed in front of a propositional formula) , while non-prenex DQBFs have almost not been studied in the literature.
Edit intent: coherence
Original:  In this paper  we provide a formal definition for syntax and semantics of non-closed non-prenex DQBFs and prove useful properties enabling quantifier localization.
Revised:  In this paper , we provide a formal definition for syntax and semantics of non-closed non-prenex DQBFs and prove useful properties enabling quantifier localization.
Edit intent: fluency
Original:  Experiments with prenex DQBF benchmarks including those from the QBFEVAL' 18 competition clearly show that quantifier localization pays off in this context.
Revised:  Experiments with prenex DQBF benchmarks , including all instances from the QBFEVAL' 18 competition clearly show that quantifier localization pays off in this context.
Edit intent: clarity
Original: We investigate a classification problem using multiple mobile agents that are capable of collecting (partial) pose-dependent observations of an unknown environment.
Revised: We investigate a classification problem using multiple mobile agents capable of collecting (partial) pose-dependent observations of an unknown environment.
Edit intent: clarity
Original:  The objective is to classify an image (e.g, map of a large area) over a finite time horizon.
Revised:  The objective is to classify an image over a finite time horizon.
Edit intent: clarity
Original:  We propose a network architecture on how agents should form a local belief, take local actions,  extract relevant features and specification from their raw partial observations.
Revised:  We propose a network architecture on how agents should form a local belief, take local actions, and extract relevant features and specification from their raw partial observations.
Edit intent: coherence
Original:  We propose a network architecture on how agents should form a local belief, take local actions,  extract relevant features and specification from their raw partial observations.
Revised:  We propose a network architecture on how agents should form a local belief, take local actions, extract relevant features from their raw partial observations.
Edit intent: clarity
Original:  Agents are allowed to exchange information with their neighboring agents and run a decentralized consensus protocol to update their own beliefs.
Revised:  Agents are allowed to exchange information with their neighboring agents to update their own beliefs.
Edit intent: clarity
Original:  Our experimental results on  MNIST handwritten digit dataset demonstrates the effectiveness of our proposed framework.
Revised:  Our experimental results on the MNIST handwritten digit dataset demonstrates the effectiveness of our proposed framework.
Edit intent: fluency
Original:  Agents' beliefs are represented within Dempster-Shafer theory by mass functions and we invegate the macro-level properties of four well-known belief combination operators for this multi-agent consensus formation problem: Dempster's rule, Yager's rule, Dubois & Prade's operator and the averaging operator.
Revised:  Agents' beliefs are represented within Dempster-Shafer theory by mass functions and we investigate the macro-level properties of four well-known belief combination operators for this multi-agent consensus formation problem: Dempster's rule, Yager's rule, Dubois & Prade's operator and the averaging operator.
Edit intent: fluency
Original:  Results show that a combination of updating from direct evidence and belief combination between agents results in better consensus to the best state than does evidence updating alone.
Revised:  Results show that a combination of updating on direct evidence and belief combination between agents results in better consensus to the best state than does evidence updating alone.
Edit intent: fluency
Original:  Broadly, Dubois Prade's operator results in better convergence to the best state .
Revised:  Broadly, Prade's operator results in better convergence to the best state .
Edit intent: clarity
Original:  Moreover, the errors  are robust with respect to the viscosity  . Results of numerical experiments are presented to verify the theoretical analysis.
Revised:  Moreover, the errors are robust with respect to the viscosity . Results of numerical experiments are presented to support the theoretical analysis.
Edit intent: clarity
Original:  In the present paper, we propose polynomial-time algorithms for the problem for c=1 and 2.
Revised:  In the present paper, we propose polynomial-time algorithms for the cases of c=1 and 2.
Edit intent: clarity
Original:  The time complexities of the algorithms are O((k+m)log n) for c=1 and O( m^4log n+ k^3+ n(k^2 +log n)) for c=2, respectively, where n=|V|, m=|E| and k=|X|.
Revised:  The time complexities of the algorithms are O((k+m)log n) for c=1 and O( m^4log n+ k^3+ k^2n+m(m +log n)) for c=2, respectively, where n=|V|, m=|E| and k=|X|.
Edit intent: fluency
Original: In deterministic and time-sensitive networking, it is important to bound delays of network elements in the worst case.
Edit intent: coherence
Original:  Network calculus is often used to formally prove such delay bounds , based on arrival and service curves characterizations.
Revised:  Network calculus is often used to prove delay bounds in deterministic networks, using arrival and service curves characterizations.
Edit intent: clarity
Original:  We prove that our bound is tight.
Revised:  We prove that it is tight.
Edit intent: clarity
Original:  To this end, we introduce the `` softwarised network data zoo '' (SNDZoo), an open collection of software networking data sets aiming to streamline and ease machine learning research in the software networking domain.
Revised:  To this end, we introduce the " softwarised network data zoo '' (SNDZoo), an open collection of software networking data sets aiming to streamline and ease machine learning research in the software networking domain.
Edit intent: fluency
Original:  To this end, we introduce the `` softwarised network data zoo '' (SNDZoo), an open collection of software networking data sets aiming to streamline and ease machine learning research in the software networking domain.
Revised:  To this end, we introduce the `` softwarised network data zoo " (SNDZoo), an open collection of software networking data sets aiming to streamline and ease machine learning research in the software networking domain.
Edit intent: fluency
Original:  Here we analyse the impact of diversity by means of scale-free interaction networks with high and low levels of clustering, and test various interference paradigms using simulations of agents facing a cooperative dilemma.
Revised:  Here we analyse the impact of diversity by means of scale-free interaction networks with high and low levels of clustering, and test various interference mechanisms using simulations of agents facing a cooperative dilemma.
Edit intent: clarity
Original:  Our results show that interference on scale-free networks is not trivial and that distinct levels of clustering react differently to each interference strategy .
Revised:  Our results show that interference on scale-free networks is not trivial and that distinct levels of clustering react differently to each interference mechanism .
Edit intent: clarity
Original:  As such, we argue that no tailored response fits all scale-free networks and present which strategies are more efficient at fostering cooperation in both types of networks.
Revised:  As such, we argue that no tailored response fits all scale-free networks and present which mechanisms are more efficient at fostering cooperation in both types of networks.
Edit intent: clarity
Original:  Finally, we discuss the pitfalls of considering reckless interference strategies .
Revised:  Finally, we discuss the pitfalls of considering reckless interference mechanisms .
Edit intent: clarity
Original:  Specifically, our solver can produce solutions for systems of the form L\mathbf{x = \mathbf{b where exactly one of the coordinates of \mathbf{b is negative.
Revised:  Specifically, our solver can produce solutions for systems of the form Lx = \mathbf{b where exactly one of the coordinates of \mathbf{b is negative.
Edit intent: coherence
Original:  Specifically, our solver can produce solutions for systems of the form L\mathbf{x = \mathbf{b where exactly one of the coordinates of \mathbf{b is negative.
Revised:  Specifically, our solver can produce solutions for systems of the form L\mathbf{x = b where exactly one of the coordinates of \mathbf{b is negative.
Edit intent: fluency
Original:  Specifically, our solver can produce solutions for systems of the form L\mathbf{x = \mathbf{b where exactly one of the coordinates of \mathbf{b is negative.
Revised:  Specifically, our solver can produce solutions for systems of the form L\mathbf{x = \mathbf{b where exactly one of the coordinates of b is negative.
Edit intent: fluency
Original:  Our solver, which we call "Distributed Random Walk-based Laplacian Solver" (DRW-LSolve) works by  approximating the stationary distribution of a multi-dimensional Markov chain .
Revised:  Our solver, which we call "Distributed Random Walk-based Laplacian Solver" (DRW-LSolve) works by quickly approximating the stationary distribution of a multi-dimensional Markov chain .
Edit intent: clarity
Original:  This chain describes the evolution of a "data collection" process where each node v for which \mathbf{b_v > 0 generates data packets with a rate proportional to \mathbf{b}_v and the node for which \mathbf{b}_v < 0 acts as a sink.
Revised:  This chain describes the evolution of a "data collection" process _v > 0 generates data packets with a rate proportional to \mathbf{b}_v and the node for which \mathbf{b}_v < 0 acts as a sink.
Edit intent: clarity
Original:  }  We show that when this multidimensional chain is ergodic the vector whose vth coordinate is proportional to the probability at stationarity of the queue at v being non-empty is a solution to L\mathbf{x = \mathbf{b .
Revised:  } . We show that when this multidimensional chain is ergodic the vector whose vth coordinate is proportional to the probability at stationarity of the queue at v being non-empty is a solution to L\mathbf{x = \mathbf{b .
Edit intent: fluency
Original:  }  We show that when this multidimensional chain is ergodic the vector whose vth coordinate is proportional to the probability at stationarity of the queue at v being non-empty is a solution to L\mathbf{x = \mathbf{b .
Revised:  } We show that when this multidimensional chain is ergodic the vector whose vth coordinate is proportional to the probability at stationarity of the queue at v being non-empty is a solution to Lx = \mathbf{b .
Edit intent: coherence
Original:  }  We show that when this multidimensional chain is ergodic the vector whose vth coordinate is proportional to the probability at stationarity of the queue at v being non-empty is a solution to L\mathbf{x = \mathbf{b .
Revised:  } We show that when this multidimensional chain is ergodic the vector whose vth coordinate is proportional to the probability at stationarity of the queue at v being non-empty is a solution to L\mathbf{x = b .
Edit intent: coherence
Original:  Our solver is an organically distributed algorithm that takes O(t_{hit}) rounds to produce an approximate solution where t_{hit} is the  hitting time of the random walk on the graph, which is \Theta(n) for a large set of important graphs.
Revised:  Our solver is a distributed algorithm that takes O(t_{hit}) rounds to produce an approximate solution where t_{hit} is the hitting time of the random walk on the graph, which is \Theta(n) for a large set of important graphs.
Edit intent: clarity
Original:  Our solver is an organically distributed algorithm that takes O(t_{hit}) rounds to produce an approximate solution where t_{hit} is the  hitting time of the random walk on the graph, which is \Theta(n) for a large set of important graphs.
Revised:  Our solver is an organically distributed algorithm that takes O(t_{hit}) time to produce an approximate solution where t_{hit} is the hitting time of the random walk on the graph, which is \Theta(n) for a large set of important graphs.
Edit intent: clarity
Original:  The class of one-sink Laplacians includes the important voltage computation problem and allows us to compute the effective resistance between nodes in a distributed setting assuming the CONGEST model, i.e., each message is \Theta(\log n) in size .
Revised:  The class of one-sink Laplacians includes the important voltage computation problem and allows us to compute the effective resistance between nodes in a distributed setting .
Edit intent: coherence
Original: We present a completely new approach to solve Laplacian systemsusing queueing networks .
Revised: We use queueing networks to present a new approach to solve Laplacian systemsusing queueing networks .
Edit intent: clarity
Original: We present a completely new approach to solve Laplacian systemsusing queueing networks .
Revised: We present a completely new approach to solving Laplacian systems .
Edit intent: clarity
Original:  This marks a significant departure from the existing techniques  mostly based on graph-theoretic constructions and sampling.
Revised:  This marks a significant departure from the existing techniques , mostly based on graph-theoretic constructions and sampling.
Edit intent: fluency
Original: Automated keyphrase extraction is a crucial textual information processing task regarding the most types of digital content management systems.
Revised: Keyphrase extraction is a crucial textual information processing task regarding the most types of digital content management systems.
Edit intent: clarity
Original: Automated keyphrase extraction is a crucial textual information processing task regarding the most types of digital content management systems.
Revised: Automated keyphrase extraction is a textual information processing task regarding the most types of digital content management systems.
Edit intent: clarity
Original:  It concerns the selection of representative and characteristic phrases from a document that express all aspects related to its content.
Revised:  It concerns the selection of representative and characteristic phrases from a document that express all the key aspects of its content.
Edit intent: clarity