wanyu/IteraTeR_v2 huggingface dataset:
Original:  However, since fog computing is a relatively new field, there is no standard platform for research and development in a realistic environment, and this dramatically inhibits innovation and development of applications suitable for the fog .
Revised:  However, since fog computing is a relatively new field, there is no standard platform for research and development in a realistic environment, and this dramatically inhibits innovation and development of fog-based applications .
Edit intent: clarity
Original:  In response to these challenges, we propose the FDK: A Fog Development Kit for software-defined edge-fog systems .
Revised:  In response to these challenges, we propose the Fog Development Kit for software-defined edge-fog systems .
Edit intent: clarity
Original:  In response to these challenges, we propose the FDK: A Fog Development Kit for software-defined edge-fog systems .
Revised:  In response to these challenges, we propose the FDK: A Fog Development Kit (FDK) .
Edit intent: clarity
Original:  By providing high-level interfaces for allocating computing and networking resources, the FDK abstracts the complexities of fog computing from developers and enables  rapid development of edge-fog systems.
Revised:  By providing high-level interfaces for allocating computing and networking resources, the FDK abstracts the complexities of fog computing from developers and enables the rapid development of edge-fog systems.
Edit intent: fluency
Original:  Also , the FDK supports the utilization of virtualized devices to create a highly realistic emulation environment , allowing fog application prototypes to be built with zero additional costs and enabling  portability to a physical infrastructure.
Revised:  Also , the FDK supports the utilization of virtualized devices to create a highly realistic emulation environment , allowing fog application prototypes to be built with zero additional costs and enabling seamless portability to a physical infrastructure.
Edit intent: clarity
Original:  We evaluate the resource allocation performance of the FDK using a testbed , including eight edge devices, four fog nodes, and five OpenFlow switches.
Revised:  Using a physical testbed and various kinds of applications running on it, we verify the operation and study the performance of the FDK. Specifically , including eight edge devices, four fog nodes, and five OpenFlow switches.
Edit intent: clarity
Original: Given a graph over which the contagions (e.g. virus, gossip) propagate, leveraging subgraphs with highly correlated nodes is beneficial to many applications.
Revised: Contagions (e.g. virus, gossip) propagate, leveraging subgraphs with highly correlated nodes is beneficial to many applications.
Edit intent: clarity
Original: Given a graph over which the contagions (e.g. virus, gossip) propagate, leveraging subgraphs with highly correlated nodes is beneficial to many applications.
Revised: Given a graph over which the contagions (e.g. virus, gossip) propagate, leveraging subgraphs with highly relevant nodes. This is beneficial to many applications.
Edit intent: clarity
Original:  First, the propagation pattern between a pair of nodes may change in various temporal dimensions .
Revised:  First, the propagation pattern between each pair of nodes may change in various temporal dimensions .
Edit intent: clarity
Original:  First, the propagation pattern between a pair of nodes may change in various temporal dimensions .
Revised:  First, the propagation pattern between a pair of nodes may change by time .
Edit intent: clarity
Original:  Second, not always the same contagion is propagated .
Revised:  Second, not always the same contagion propagates .
Edit intent: coherence
Original:  Hence,  state-of-the-art text mining approaches ranging from similarity measures to topic-modeling cannot use the textual contents to compute the weights between the nodes .
Revised:  Hence, the state-of-the-art text mining approaches ranging from similarity measures to topic-modeling cannot use the textual contents to compute the weights between the nodes .
Edit intent: style
Original:  Hence,  state-of-the-art text mining approaches ranging from similarity measures to topic-modeling cannot use the textual contents to compute the weights between the nodes .
Revised:  Hence, state-of-the-art text mining approaches including topic-modeling cannot use the textual contents to compute the weights between the nodes .
Edit intent: clarity
Original:  Hence,  state-of-the-art text mining approaches ranging from similarity measures to topic-modeling cannot use the textual contents to compute the weights between the nodes .
Revised:  Hence, state-of-the-art text mining approaches ranging from similarity measures to topic-modeling cannot effectively compute the edge weights .
Edit intent: clarity
Original:  Third, the word-word co-occurrence patterns may differ in various temporal dimensions, which increases the difficulty to employ current word embedding approaches.
Revised:  Third, the word-word co-occurrence patterns may differ in various temporal dimensions, that can decrease the effectiveness of word embedding approaches.
Edit intent: clarity
Original:  We argue that inseparable multi-aspect temporal collaborations are inevitably needed to better calculate the correlation metrics in dynamical processes .
Revised:  We argue that multi-aspect temporal collaborations are inevitably needed to better calculate the correlation metrics in dynamical processes .
Edit intent: clarity
Original:  We argue that inseparable multi-aspect temporal collaborations are inevitably needed to better calculate the correlation metrics in dynamical processes .
Revised:  We argue that inseparable multi-aspect temporal dimensions (hour, day, etc) should be considered to better calculate the correlation metrics in dynamical processes .
Edit intent: clarity
Original:  We argue that inseparable multi-aspect temporal collaborations are inevitably needed to better calculate the correlation metrics in dynamical processes .
Revised:  We argue that inseparable multi-aspect temporal collaborations are inevitably needed to better calculate the correlation weights between the nodes .
Edit intent: clarity
Original:  In this work, we showcase a sophisticated framework that on the one hand, integrates a neural network based time-aware word embedding component that can collectively construct the word vectors through an assembly of infinite latent temporal facets, and on the other hand, uses an elaborate generative model to compute the edge weightsthrough heterogeneous temporal attributes.
Revised:  In this work, we devise a novel framework that on the one hand, integrates a neural network based time-aware word embedding component that can collectively construct the word vectors through an assembly of infinite latent temporal facets, and on the other hand, uses an elaborate generative model to compute the edge weightsthrough heterogeneous temporal attributes.
Edit intent: clarity
Original:  In this work, we showcase a sophisticated framework that on the one hand, integrates a neural network based time-aware word embedding component that can collectively construct the word vectors through an assembly of infinite latent temporal facets, and on the other hand, uses an elaborate generative model to compute the edge weightsthrough heterogeneous temporal attributes.
Revised:  In this work, we showcase a sophisticated framework that on the one hand, integrates a neural network based time-aware word embedding component to construct the word vectors through an assembly of infinite latent temporal facets, and on the other hand, uses an elaborate generative model to compute the edge weightsthrough heterogeneous temporal attributes.
Edit intent: clarity
Original:  In this work, we showcase a sophisticated framework that on the one hand, integrates a neural network based time-aware word embedding component that can collectively construct the word vectors through an assembly of infinite latent temporal facets, and on the other hand, uses an elaborate generative model to compute the edge weightsthrough heterogeneous temporal attributes.
Revised:  In this work, we showcase a sophisticated framework that on the one hand, integrates a neural network based time-aware word embedding component that can collectively construct the word vectors through multiple temporal facets, and on the other hand, uses an elaborate generative model to compute the edge weightsthrough heterogeneous temporal attributes.
Edit intent: clarity
Original:  In this work, we showcase a sophisticated framework that on the one hand, integrates a neural network based time-aware word embedding component that can collectively construct the word vectors through an assembly of infinite latent temporal facets, and on the other hand, uses an elaborate generative model to compute the edge weightsthrough heterogeneous temporal attributes.
Revised:  In this work, we showcase a sophisticated framework that on the one hand, integrates a neural network based time-aware word embedding component that can collectively construct the word vectors through an assembly of infinite latent temporal facets, and on the other hand, uses a temporal generative model to compute the edge weightsthrough heterogeneous temporal attributes.
Edit intent: clarity
Original:  After computing the intra-nodes weights, we utilize our Max-Heap Graph cutting algorithm to exploit subgraphs.
Revised:  After computing the intra-nodes weights, we utilize our Max-Heap Graph cutting algorithm to generate subgraphs.
Edit intent: clarity
Original:  We then validate our model through comprehensive experiments on real-world propagation data .
Revised:  We validate our model through comprehensive experiments on real-world propagation data .
Edit intent: coherence
Original:  We then validate our model through comprehensive experiments on real-world propagation data .
Revised:  We then validate our model through comprehensive experiments on real-world datasets .
Edit intent: clarity
Original:  The algorithm uses d+1 colours and runs in O(m \sqrt n) time with high probability  .
Revised:  The algorithm uses d+1 colors and runs in O(m \sqrt n) time with high probability .
Edit intent: fluency
Original:  A 1985 technical report of Gabow et al. shows that such a coloring can be constructed deterministically in O(mn\log n) time, and this has remained the fastest known sequential algorithm (randomized or deterministic) for this task.
Revised:  A 1985 technical report of Gabow et al. showed that such a coloring can be constructed deterministically in O(mn\log n) time, and this has remained the fastest known sequential algorithm (randomized or deterministic) for this task.
Edit intent: fluency
Original:  A 1985 technical report of Gabow et al. shows that such a coloring can be constructed deterministically in O(mn\log n) time, and this has remained the fastest known sequential algorithm (randomized or deterministic) for this task.
Revised:  A 1985 technical report of Gabow et al. shows that such a coloring can be constructed deterministically in O(mn\log n) time, and this has remained the fastest known algorithm (randomized or deterministic) for this task.
Edit intent: clarity
Original:  Greedy-Euler-Color is an even simpler deterministic algorithm the edge-colors a multigraph in 2d-1 colors and runs in O(m\log d) time.
Revised:  Greedy-Euler-Color is an even simpler deterministic algorithm that edge-colors a multigraph in 2d-1 colors and runs in O(m\log d) time.
Edit intent: fluency
Original: We present efficient algorithms for edge-coloring graphs and multigraphs . Vizing's Theorem states that any simple graph can be edge-colored using d+1 colors , where d is the maximum degree of any vertex in the graph.
Revised: We develop sequential algorithms for constructing edge-colorings of graphs and multigraphs . Vizing's Theorem states that any simple graph can be edge-colored using d+1 colors , where d is the maximum degree of any vertex in the graph.
Edit intent: clarity
Original: We present efficient algorithms for edge-coloring graphs and multigraphs . Vizing's Theorem states that any simple graph can be edge-colored using d+1 colors , where d is the maximum degree of any vertex in the graph.
Revised: We present efficient algorithms for edge-coloring graphs and multigraphs . Vizing's Theorem states that every simple graph can be edge-colored using d+1 colors , where d is the maximum degree of any vertex in the graph.
Edit intent: style
Original:  Greedy-Euler-Color is an even simpler deterministic algorithm that edge-colors a multigraph in 2d-1 colors and runs in O( m \log d) time.
Revised:  On the way to these results, we give a simple algorithm for ( 2d-1 colors and runs in O( m \log d) time.
Edit intent: clarity
Original:  We also present a general strategy for devising edge-coloring algorithms .
Revised:  Underlying these algorithms is a general edge-coloring algorithms .
Edit intent: clarity
Original:  We also present a general strategy for devising edge-coloring algorithms .
Revised:  We also present a general strategy for devising edge-coloring strategy which may lend itself to further applications .
Edit intent: clarity
Original: Xorshift128+ is a newly proposed pseudo random number generator (PRNG), which is now the standard PRNG in a number of platforms.
Revised: Xorshift128+ is a newly proposed pseudorandom number generator (PRNG), which is now the standard PRNG in a number of platforms.
Edit intent: clarity
Original: Xorshift128+ is a newly proposed pseudo random number generator (PRNG), which is now the standard PRNG in a number of platforms.
Revised: Xorshift128+ is a newly proposed pseudo random number generator (PRNG), which is now the standard PRNG on a number of platforms.
Edit intent: clarity
Original:  We point out that three-dimensional plots of the random points generated by the generator have visible structures: they concentrate on particular planes in the cube.
Revised:  We demonstrate that three-dimensional plots of the random points generated by the generator have visible structures: they concentrate on particular planes in the cube.
Edit intent: clarity
Original:  In this paper we propose a method for FB model inference from behavior examples , based on reduction to Boolean satisfiability problem (SAT).
Revised:  In this paper we propose a method for FB model inference from behavior examples based on reduction to Boolean satisfiability problem (SAT).
Edit intent: fluency
Original:  In contrast to existing approaches, suggested method is more efficient and produce minimal finite-state models both in terms of number of states and guard conditions.
Edit intent: coherence
Original:  In contrast to existing approaches, the suggested method is more efficient and produces minimal finite-state models  both in terms of number of states and guard conditions complexity.
Revised:  In contrast to existing approaches, the suggested method is more efficient and produces finite-state models both in terms of number of states and guard conditions complexity.
Edit intent: clarity
Original:  We show the equivalent conditions for the triple being independent.
Revised:  We show the equivalent conditions for the triplet being independent.
Edit intent: fluency
Original:  For applications, we use these very general results for pricing of two-factor financial derivatives whose payoffs rely very much on the correlations of underlyings.
Revised:  For applications, we use these very general results for pricing two-factor financial derivatives whose payoffs rely very much on the correlations of underlyings.
Edit intent: fluency
Original: Bounded diffusion processes are models of transport phenomena with wide applicability across many fields.
Revised: Diffusion processes with boundaries are models of transport phenomena with wide applicability across many fields.
Edit intent: clarity
Original:  While obtaining analytical solutions is often possible in unbounded regions , obtaining closed-form solutions to the FPE is more challenging once absorbing boundaries are present.
Revised:  While obtaining analytical solutions is often possible in the absence of boundaries , obtaining closed-form solutions to the FPE is more challenging once absorbing boundaries are present.
Edit intent: clarity
Original:  Our main results is the explicit construction of a full family of closed-form solutions for their PDFs using the method of images (MoI).
Revised:  Our main result is the explicit construction of a full family of closed-form solutions for their PDFs using the method of images (MoI).
Edit intent: fluency
Original: We study the minimum spanning arborescence problem on the complete digraph K_n where an edge e has a weight W_e and a cost C_e, each of which is an independent uniform  [0,1] random variable .
Revised: We study the minimum spanning arborescence problem on the complete digraph K_n where an edge e has a weight W_e and a cost C_e, each of which is an independent uniform [0,1] .
Edit intent: clarity
Original:  Thus, constructing the preconditioner becomes a very problem-dependent task.
Revised:  Thus, constructing the preconditioner becomes a problem-dependent task.
Edit intent: clarity
Original:  We describe a hierarchical approximate factorization approach which addresses this issue by focusing on improving the accuracy on smooth eigenvectors (such eigenvectors typically correspond to the small eigenvalues) .
Revised:  We describe a hierarchical approximate factorization approach which focuses on improving accuracy on the smooth eigenvectors .
Edit intent: coherence
Original:  The improved accuracy is achieved by preserving the action of the factorized matrix on piecewise polynomial functions of the PDE domain . Based on the factorization, we propose a family of sparse preconditioners with \mathcal{O}%DIFDELCMD < \left(%%% n%DIFDELCMD < \right) %DIFDELCMD < %%% or \mathcal{O}%DIFDELCMD < \left( %%% n \log{n}%DIFDELCMD < \right) %%%  construction complexities.
Revised:  The improved accuracy is achieved by preserving the action of the factorized matrix on piecewise polynomial functions of the grid . Based on the factorization, we propose a family of sparse preconditioners with \mathcal{O}%DIFDELCMD < \left(%%% n%DIFDELCMD < \right) %DIFDELCMD < %%% or \mathcal{O}%DIFDELCMD < \left( %%% n \log{n}%DIFDELCMD < \right) %%% construction complexities.
Edit intent: clarity
Original:  The improved accuracy is achieved by preserving the action of the factorized matrix on piecewise polynomial functions of the PDE domain . Based on the factorization, we propose a family of sparse preconditioners with \mathcal{O}%DIFDELCMD < \left(%%% n%DIFDELCMD < \right) %DIFDELCMD < %%% or \mathcal{O}%DIFDELCMD < \left( %%% n \log{n}%DIFDELCMD < \right) %%%  construction complexities.
Revised:  The improved accuracy is achieved by preserving the action of the factorized matrix on piecewise polynomial functions of the PDE domain . Based on the factorization, we propose a family of sparse preconditioners with }%DIFDELCMD < \left(%%% n%DIFDELCMD < \right) %DIFDELCMD < %%% or \mathcal{O}%DIFDELCMD < \left( %%% n \log{n}%DIFDELCMD < \right) %%% construction complexities.
Edit intent: fluency
Original:  The improved accuracy is achieved by preserving the action of the factorized matrix on piecewise polynomial functions of the PDE domain . Based on the factorization, we propose a family of sparse preconditioners with \mathcal{O}%DIFDELCMD < \left(%%% n%DIFDELCMD < \right) %DIFDELCMD < %%% or \mathcal{O}%DIFDELCMD < \left( %%% n \log{n}%DIFDELCMD < \right) %%%  construction complexities.
Revised:  The improved accuracy is achieved by preserving the action of the factorized matrix on piecewise polynomial functions of the PDE domain . Based on the factorization, we propose a family of sparse preconditioners with \mathcal{O}%DIFDELCMD < \left(%%% %DIFDELCMD < \right) %DIFDELCMD < %%% or \mathcal{O}%DIFDELCMD < \left( %%% n \log{n}%DIFDELCMD < \right) %%% construction complexities.
Edit intent: fluency
Original:  The improved accuracy is achieved by preserving the action of the factorized matrix on piecewise polynomial functions of the PDE domain . Based on the factorization, we propose a family of sparse preconditioners with \mathcal{O}%DIFDELCMD < \left(%%% n%DIFDELCMD < \right) %DIFDELCMD < %%% or \mathcal{O}%DIFDELCMD < \left( %%% n \log{n}%DIFDELCMD < \right) %%%  construction complexities.
Revised:  The improved accuracy is achieved by preserving the action of the factorized matrix on piecewise polynomial functions of the PDE domain . Based on the factorization, we propose a family of sparse preconditioners with \mathcal{O}%DIFDELCMD < \left(%%% n%DIFDELCMD < \right) %DIFDELCMD < %%% }%DIFDELCMD < \left( %%% n \log{n}%DIFDELCMD < \right) %%% construction complexities.
Edit intent: coherence
Original:  The method employs a top-down hierarchical clustering algorithm, with a metric distance built for maximizing mathematical identifiability of the transmission matrix, and a stopping criteria based on significance testing.
Revised:  The method employs a top-down hierarchical partitioning algorithm, with a metric distance built for maximizing mathematical identifiability of the transmission matrix, and a stopping criteria based on significance testing.
Edit intent: clarity
Original:  We test the method on different examples from physics, stochastic control , and mathematical finance.
Revised:  We test the method on different examples from physics, stochastic control and mathematical finance.
Edit intent: fluency
Original: Participation in  energy demand response programs requires an active role by users of residential appliances: they contribute flexibility in appliance usage as the means to adjust energy consumption and improve Smart Grid reliability.
Revised: Participation in residential energy demand response programs requires an active role by users of residential appliances: they contribute flexibility in appliance usage as the means to adjust energy consumption and improve Smart Grid reliability.
Edit intent: fluency
Original: Participation in  energy demand response programs requires an active role by users of residential appliances: they contribute flexibility in appliance usage as the means to adjust energy consumption and improve Smart Grid reliability.
Revised: Participation in energy demand response programs requires an active role by the consumers. They contribute flexibility in appliance usage as the means to adjust energy consumption and improve Smart Grid reliability.
Edit intent: clarity
Original: Participation in  energy demand response programs requires an active role by users of residential appliances: they contribute flexibility in appliance usage as the means to adjust energy consumption and improve Smart Grid reliability.
Revised: Participation in energy demand response programs requires an active role by users of residential appliances: they contribute flexibility in how they use their appliances as the means to adjust energy consumption and improve Smart Grid reliability.
Edit intent: clarity
Original:  Understanding the collective potential that appliance-level flexibility has on Smart Grid reliability is challenging and complex.
Revised:  Understanding the collective potential of appliance-level flexibility has on Smart Grid reliability is challenging and complex.
Edit intent: fluency
Original:  Physical characteristics of appliances, usage preferences, habits, and lifestyle are socio-technical factors that influence system-wide reliability coming often at the expense of users' comfort, i.e. thermal.
Revised:  For instance, physical characteristics of appliances, usage preferences, habits, and lifestyle are socio-technical factors that influence system-wide reliability coming often at the expense of users' comfort, i.e. thermal.
Edit intent: coherence
Original:  These new findings have implications for the design of more cost-effective and granular  demand response programs in participatory and decentralised Smart Grids.
Revised:  These new findings have implications for the design of more cost-effective and granular demand response programs in participatory and decentralized Smart Grids.
Edit intent: fluency