wanyu/IteraTeR_v2 huggingface dataset:
Original:  Further, we compare SpotNet to a customized convolutional neural network layout  for cell detection based on recent advances .
Revised:  Further, we compare SpotNet to a convolutional neural network layout for cell detection based on recent advances .
Edit intent: clarity
Original:  Further, we compare SpotNet to a customized convolutional neural network layout  for cell detection based on recent advances .
Revised:  Further, we compare SpotNet to a customized convolutional neural network layout for cell detection .
Edit intent: clarity
Original:  We show empirical evidence that, while both designs obtain a detection performance  far beyond that of a human expert, SpotNet is substantially easier to train and obtains better estimates of cell secretion .
Revised:  We show empirical evidence that, while both designs obtain a detection performance far beyond that of a human expert, SpotNet is easier to train and obtains better estimates of cell secretion .
Edit intent: clarity
Original: In this paper, we propose an eigenvalue analysis -- of system dynamics models -- based on the Mutual Information concept , which in turn will be estimated via the Kernel Density Estimation concept .
Revised: In this paper, we propose an eigenvalue analysis -- of system dynamics models -- based on the Mutual Information measure , which in turn will be estimated via the Kernel Density Estimation concept .
Edit intent: clarity
Original: In this paper, we propose an eigenvalue analysis -- of system dynamics models -- based on the Mutual Information concept , which in turn will be estimated via the Kernel Density Estimation concept .
Revised: In this paper, we propose an eigenvalue analysis -- of system dynamics models -- based on the Mutual Information concept , which in turn will be estimated via the Kernel Density Estimation method .
Edit intent: clarity
Original:  We postulate that the Kernel Density Estimation will provide a multivariate sensitivity analysis method that overcomes previous limitations, in addition to, having a reasonable computational complexity .
Revised:  We postulate that the proposed approach represents a novel and efficient multivariate eigenvalue sensitivity analysis .
Edit intent: clarity
Original: We show that activity of online news outlets follows a temporal fluctuation scaling law and we recover this feature using an independent cascade model augmented with a varying hype parameter representing a viral potential of an original article.
Revised: We show that activity of online news outlets follows a temporal fluctuation scaling law and we recover this feature using an independent cascade model augmented with a varying hype parameter representing a viral potential of an original article.
Edit intent: fluency
Original:  It is shown that the critical radius of spherical vesicles dispersed in a liquid solvent will grow in time with an exponent of 0.25.
Revised:  The critical size of the spherical vesicles is shown to grow in time with an exponent of 0.25.
Edit intent: clarity
Original:  A constant is suggested subsequently that characterizes how easily a vesicle can absorb amphiphiles into its periphery .
Revised:  A constant is suggested that characterizes how easily a vesicle can absorb amphiphiles into its periphery .
Edit intent: clarity
Original:  The essential point here is to take into account dynamically evolving input graphs: Having a cluster graph (that is, a disjoint union of cliques) that represents a solution for a first input graph, can we cost-efficiently transform it into a "similar" cluster graph that is a solution for a second ("subsequent") input graph?
Revised:  The essential point here is to take into account dynamically evolving input graphs: Having a cluster graph (that is, a disjoint union of cliques) that represents a solution for the first input graph, can we cost-efficiently transform it into a "similar" cluster graph that is a solution for a second ("subsequent") input graph?
Edit intent: fluency
Original:  The essential point here is to take into account dynamically evolving input graphs: Having a cluster graph (that is, a disjoint union of cliques) that represents a solution for a first input graph, can we cost-efficiently transform it into a "similar" cluster graph that is a solution for a second ("subsequent") input graph?
Revised:  The essential point here is to take into account dynamically evolving input graphs: Having a cluster graph (that is, a disjoint union of cliques) that represents a solution for a first input graph, can we cost-efficiently transform it into a "similar" cluster graph that is a solution for the second ("subsequent") input graph?
Edit intent: fluency
Original:  We obtain both fixed-parameter tractability as well as parameterized hardness results, thus (except for two open questions) providing a fairly complete picture of the parameterized computational complexity landscape under the perhaps two most natural parameterizations: the distance of the new "similar" cluster graph to (i) the second input graph and to (ii) the input cluster graph.
Revised:  We obtain both fixed-parameter tractability as well as (parameterized) hardness results, thus (except for two open questions) providing a fairly complete picture of the parameterized computational complexity landscape under the perhaps two most natural parameterizations: the distance of the new "similar" cluster graph to (i) the second input graph and to (ii) the input cluster graph.
Edit intent: fluency
Original:  We obtain both fixed-parameter tractability as well as parameterized hardness results, thus (except for two open questions) providing a fairly complete picture of the parameterized computational complexity landscape under the perhaps two most natural parameterizations: the distance of the new "similar" cluster graph to (i) the second input graph and to (ii) the input cluster graph.
Revised:  We obtain both fixed-parameter tractability as well as parameterized hardness results, thus (except for two open questions) providing a fairly complete picture of the parameterized computational complexity landscape under the two perhaps most natural parameterizations: the distance of the new "similar" cluster graph to (i) the second input graph and to (ii) the input cluster graph.
Edit intent: fluency
Original:  Lack of adequate coverage in the dataset can result in undesirable outcomes such as biased decisions and algorithmic racism, as well as create vulnerabilities such as opening up room for adversarial attacks.
Revised:  Lack of adequate coverage in the dataset can result in undesirable outcomes such as biased decisions and algorithmic racism, as well as creating vulnerabilities such as opening up room for adversarial attacks.
Edit intent: fluency
Original:  We first provide efficient techniques for traversing the combinatorial explosion of attribute value combinations to %DIFDELCMD < {\em %%% identify any regions of attribute space not adequately covered by the data.
Revised:  We first provide efficient techniques for traversing the combinatorial explosion of value combinations to %DIFDELCMD < {\em %%% identify any regions of attribute space not adequately covered by the data.
Edit intent: fluency
Original:  We first provide efficient techniques for traversing the combinatorial explosion of attribute value combinations to %DIFDELCMD < {\em %%% identify any regions of attribute space not adequately covered by the data.
Revised:  We first provide efficient techniques for traversing the combinatorial explosion of attribute value combinations to %DIFDELCMD < {\em %%% identify any regions of attribute space not adequately covered by the data.
Edit intent: fluency
Original:  Then, we determine the least amount of additional data that must be %DIFDELCMD < {\em %%% obtained to resolve this lack of adequate coverage.
Revised:  Then, we determine the least amount of additional data that must be %DIFDELCMD < {\em %%% obtained to resolve this lack of adequate coverage.
Edit intent: fluency
Original: Detecting dense subgraphs from large graphs is a core component in many applications, ranging from social networks mining, bioinformatics , to online fraud detection .
Revised: Detecting dense subgraphs from large graphs is a core component in many applications, ranging from social networks mining, bioinformatics .
Edit intent: clarity
Original:  On high level, an algorithm in this framework recurses on balanced separators while possible, and in the leaves of the recursion uses high connectivity of the graph at hand to highlight a solution by color coding.
Revised:  On high level, an algorithm in this framework recurses on balanced separators while possible, and in the leaves of the recursion exploits the high connectivity of the graph at hand to highlight a solution by color coding.
Edit intent: clarity
Original:  On high level, an algorithm in this framework recurses on balanced separators while possible, and in the leaves of the recursion uses high connectivity of the graph at hand to highlight a solution by color coding.
Revised:  On high level, an algorithm in this framework recurses on balanced separators while possible, and in the leaves of the recursion uses high connectivity of the graph at hand to highlight a solution using color coding.
Edit intent: clarity
Original:  In 2014, a subset of the current authors showed that, given a graph G and a budget kfor the cut size in the studied separation problem , one can compute a tree decomposition of G with adhesions of size bounded in k and with bags exhibiting the same high connectivity properties with respect to cuts of size at most k as in the leaves of the recursion in the randomized contractions framework.
Revised:  In 2014, a subset of the current authors showed that, given a graph G and connectivity parameter k , one can compute a tree decomposition of G with adhesions of size bounded in k and with bags exhibiting the same high connectivity properties with respect to cuts of size at most k as in the leaves of the recursion in the randomized contractions framework.
Edit intent: clarity
Original:  This led to an FPT algorithm for the Minimum Bisection problem.
Revised:  This theorem was the key ingredient of the fixed-parameter algorithm for the Minimum Bisection problem.
Edit intent: clarity
Original:  In this paper, we provide a new construction algorithm for a tree decomposition with the aforementioned properties , by using the notion of lean decompositions of Thomas.
Revised:  In this paper, we provide a new construction algorithm for tree decompositions admitting the properties described above using the notion of lean decompositions of Thomas.
Edit intent: clarity
Original:  In 2014, a subset of the current authors showed a static decomposition theorem corresponding to the recursion scheme underlying randomized contractions: given a graph G and connectivity parameter k, one can compute a tree decomposition of G with adhesions of size bounded in k and with bags exhibiting the same high connectivity propertieswith respect to cuts of size at most k as in the leaves of the recursion in the randomized contractions framework.
Revised:  In 2014, a subset of the current authors showed a static decomposition theorem corresponding to the recursion scheme underlying randomized contractions: given a graph G and a parameter k, one can compute a tree decomposition of G with adhesions of size bounded in k and with bags exhibiting the same high connectivity propertieswith respect to cuts of size at most k as in the leaves of the recursion in the randomized contractions framework.
Edit intent: fluency
Original:  In 2014, a subset of the current authors showed a static decomposition theorem corresponding to the recursion scheme underlying randomized contractions: given a graph G and connectivity parameter k, one can compute a tree decomposition of G with adhesions of size bounded in k and with bags exhibiting the same high connectivity propertieswith respect to cuts of size at most k as in the leaves of the recursion in the randomized contractions framework.
Revised:  In 2014, a subset of the current authors showed a static decomposition theorem corresponding to the recursion scheme underlying randomized contractions: given a graph G and connectivity parameter k, one can compute a tree decomposition of G with the following properties: * every adhesion of the tree decomposition is of size at most k as in the leaves of the recursion in the randomized contractions framework.
Edit intent: clarity
Original: The Internet of Things (IoT) is an ubiquitous system connecting many different devices -- the things -- which can be accessed from the distance.
Revised: The Internet of Things (IoT) is a ubiquitous system connecting many different devices -- the things -- which can be accessed from the distance.
Edit intent: fluency
Original: The Internet of Things (IoT) is an ubiquitous system connecting many different devices -- the things -- which can be accessed from the distance.
Revised: The Internet of Things (IoT) is an ubiquitous system connecting many different devices - the things - which can be accessed from the distance.
Edit intent: fluency
Original:  With the possibility to monitor and control the physical environment from the distance , that is the IoT contains cyber-physical systems (CPS), the two concepts of dependability and security get deeply intertwined.
Revised:  The cyber-physical systems (CPS) monitor and control the physical environment from the distance , that is the IoT contains cyber-physical systems (CPS), the two concepts of dependability and security get deeply intertwined.
Edit intent: clarity
Original:  With the possibility to monitor and control the physical environment from the distance , that is the IoT contains cyber-physical systems (CPS), the two concepts of dependability and security get deeply intertwined.
Revised:  With the possibility to monitor and control the things from the distance , that is the IoT contains cyber-physical systems (CPS), the two concepts of dependability and security get deeply intertwined.
Edit intent: clarity
Original:  With the possibility to monitor and control the physical environment from the distance , that is the IoT contains cyber-physical systems (CPS), the two concepts of dependability and security get deeply intertwined.
Revised:  With the possibility to monitor and control the physical environment from the distance . As a result, the concepts of dependability and security get deeply intertwined.
Edit intent: coherence
Original:  This paper summarizes state-of-the-art of existing surveys on anomaly detection, fault-tolerance and self-healing  and adds a number of other methods applicable to achieve resilience in an IoT.
Revised:  This paper summarizes state-of-the-art of existing work on anomaly detection, fault-tolerance and self-healing and adds a number of other methods applicable to achieve resilience in an IoT.
Edit intent: clarity
Original:  This paper summarizes state-of-the-art of existing surveys on anomaly detection, fault-tolerance and self-healing  and adds a number of other methods applicable to achieve resilience in an IoT.
Revised:  This paper summarizes state-of-the-art of existing surveys on anomaly detection, fault-tolerance and self-healing , and adds a number of other methods applicable to achieve resilience in an IoT.
Edit intent: fluency
Original:  Furthermore, this paper presents the main challenges to build a resilient IoT for CPS  . It further summarizes our solutions, work-in-progress and future work to this topic for the project "Trustworthy IoT for CPS".
Revised:  Furthermore, this paper presents the main challenges in building a resilient IoT for CPS . It further summarizes our solutions, work-in-progress and future work to this topic for the project "Trustworthy IoT for CPS".
Edit intent: fluency
Original:  Furthermore, this paper presents the main challenges to build a resilient IoT for CPS  . It further summarizes our solutions, work-in-progress and future work to this topic for the project "Trustworthy IoT for CPS".
Revised:  Furthermore, this paper presents the main challenges to build a resilient IoT for CPS . It further summarizes our solutions, work-in-progress and future work to this topic to enable "Trustworthy IoT for CPS".
Edit intent: clarity
Original:  Eventually , this framework is applied to the selected use case of a smart sensor infrastructure in the transport domain.
Revised:  Finally , this framework is applied to the selected use case of a smart sensor infrastructure in the transport domain.
Edit intent: coherence
Original:  Eventually , this framework is applied to the selected use case of a smart sensor infrastructure in the transport domain.
Revised:  Eventually , this framework is illustrated on a selected use case of a smart sensor infrastructure in the transport domain.
Edit intent: clarity
Original:  Eventually , this framework is applied to the selected use case of a smart sensor infrastructure in the transport domain.
Revised:  Eventually , this framework is applied to the selected use case : A smart sensor infrastructure in the transport domain.
Edit intent: clarity
Original: The analysis of  dynamics on complex networks is closely connected to structural features of the network itself.
Revised: The analysis of the dynamics on complex networks is closely connected to structural features of the network itself.
Edit intent: fluency
Original:  Network features like, for instance  graph-cores and vertex degrees have been proven to be discriminants of network dynamics and are studied ubiquitously.
Revised:  Network features like, for instance , graph-cores and vertex degrees have been proven to be discriminants of network dynamics and are studied ubiquitously.
Edit intent: fluency
Original:  Network features like, for instance  graph-cores and vertex degrees have been proven to be discriminants of network dynamics and are studied ubiquitously.
Revised:  Network features like, for instance graph-cores and vertex degrees have been studied ubiquitously.
Edit intent: clarity
Original:  Here we connect these central discriminants of network dynamics by means of the D-spectrum  , a novel framework that identifies a collection of nested chains of subgraphs contained in the network.
Revised:  Here we introduce the D-spectrum , a novel framework that identifies a collection of nested chains of subgraphs contained in the network.
Edit intent: clarity
Original:  Here we connect these central discriminants of network dynamics by means of the D-spectrum  , a novel framework that identifies a collection of nested chains of subgraphs contained in the network.
Revised:  Here we connect these central discriminants of network dynamics by means of the D-spectrum of a network , a novel framework that identifies a collection of nested chains of subgraphs contained in the network.
Edit intent: clarity
Original:  Here we connect these central discriminants of network dynamics by means of the D-spectrum  , a novel framework that identifies a collection of nested chains of subgraphs contained in the network.
Revised:  Here we connect these central discriminants of network dynamics by means of the D-spectrum , a novel framework that identifies a collection of nested chains of subgraphs within the network.
Edit intent: clarity
Original:  Cores and vertex degrees can be derived from two particular such chains .
Revised:  Graph-cores and node degrees are merely from two particular such chains .
Edit intent: clarity
Original:  Furthermore, each chain gives rise to a rank of a vertex and the collection of these ranks is the D-spectrum of a vertex, providing a novel characterization.
Revised:  Furthermore, each chain gives rise to a rank of a vertex and the collection of these ranks provides us with the D-spectrum of a vertex, providing a novel characterization.
Edit intent: clarity
Original:  In order to reduce electricity costs and lower the impact on electricity markets, a centralised bidding coordination framework has been proposed in the literature employing a coordinator.
Revised:  With the aim of reducing electricity costs and lower the impact on electricity markets, a centralised bidding coordination framework has been proposed in the literature employing a coordinator.
Edit intent: coherence
Original:  In order to reduce electricity costs and lower the impact on electricity markets, a centralised bidding coordination framework has been proposed in the literature employing a coordinator.
Revised:  In order to reduce electricity costs and lowering the impact on electricity markets, a centralised bidding coordination framework has been proposed in the literature employing a coordinator.
Edit intent: fluency
Original:  Hence, we study  strategic manipulation of the ADMM algorithm and, in doing so, describe and analyse different  attack vectors and propose a mathematical framework to quantify and detect manipulation.
Revised:  Hence, we study the strategic manipulation of the ADMM algorithm and, in doing so, describe and analyse different attack vectors and propose a mathematical framework to quantify and detect manipulation.
Edit intent: fluency
Original:  Hence, we study  strategic manipulation of the ADMM algorithm and, in doing so, describe and analyse different  attack vectors and propose a mathematical framework to quantify and detect manipulation.
Revised:  Hence, we study strategic manipulation of the ADMM algorithm and, in doing so, describe and analyse different possible attack vectors and propose a mathematical framework to quantify and detect manipulation.
Edit intent: clarity
Original:  Moreover , this detection framework is not limited the considered EV scenario and can be applied to general ADMM algorithms.
Revised:  Importantly , this detection framework is not limited the considered EV scenario and can be applied to general ADMM algorithms.
Edit intent: coherence
Original:  Our empirical results show  the convergence of the coordination algorithm, and that the detection algorithm accurately detects deviating behaviour in up to 96\% of the cases .
Revised:  Our empirical results show the detection algorithm, results indicate that it achieves very high accuracies and significantly outperforms a naive benchmark .
Edit intent: coherence
Original: We present a novel numerical method for the computation of bound states of semi-infinite matrix Hamiltonians which model electronic  states localized at edges of one and two-dimensional materials (edge states) in the tight-binding limit.
Revised: We present a novel numerical method for the computation of bound states of Hamiltonians which model electronic states localized at edges of one and two-dimensional materials (edge states) in the tight-binding limit.
Edit intent: clarity
Original: We present a novel numerical method for the computation of bound states of semi-infinite matrix Hamiltonians which model electronic  states localized at edges of one and two-dimensional materials (edge states) in the tight-binding limit.
Revised: We present a novel numerical method for the computation of bound states of semi-infinite matrix Hamiltonians which model electronic states localized at boundaries of one and two-dimensional materials (edge states) in the tight-binding limit.
Edit intent: clarity
Original:  Our method, which overcomes this difficulty, is to accurately compute the Green's function of the semi-infinite Hamiltonian by imposing an appropriate boundary condition at the semi-infinite end ;
Revised:  Our method, which overcomes this difficulty, is to compute the Green's function of the semi-infinite Hamiltonian by imposing an appropriate boundary condition at the semi-infinite end ;
Edit intent: clarity
Original:  Our method, which overcomes this difficulty, is to accurately compute the Green's function of the semi-infinite Hamiltonian by imposing an appropriate boundary condition at the semi-infinite end ;
Revised:  Our method, which overcomes this difficulty, is to accurately compute the Green's function of the Hamiltonian by imposing an appropriate boundary condition at the semi-infinite end ;
Edit intent: fluency