wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our results show that the template function approach yields high accuracy rates that match and often exceed the results of existing methods for featurizing persistence diagrams .
Revised:  Our results show that the template function approach yields high accuracy rates that match and often exceed those of existing featurization methods .
Edit intent: clarity
Original:  Along the way, we also provide a complete characterization of compact sets in persistence diagram space endowed with the bottleneck distance .
Revised:  Along the way, we provide a complete characterization of compact sets in persistence diagram space endowed with the bottleneck distance .
Edit intent: coherence
Original:  Along the way, we also provide a complete characterization of compact sets in persistence diagram space endowed with the bottleneck distance .
Revised:  Along the way, we also provide a complete characterization of compactness in the space of persistence diagrams .
Edit intent: clarity
Original:  The setting in this paper is that of  hybrid games, in which discrete, continuous, and adversarial dynamics interact in differential game logic dGL.
Revised:  The setting in this paper is that of differential hybrid games, in which discrete, continuous, and adversarial dynamics interact in differential game logic dGL.
Edit intent: fluency
Original:  By postponing soundness-critical admissibility checks does this paper introduce a uniform substitution mechanism that proceeds in a linear pass homomorphically along the formula.
Revised:  By postponing soundness-critical admissibility checks , this paper introduces a uniform substitution mechanism that proceeds in a linear pass homomorphically along the formula.
Edit intent: clarity
Original: An analogue of the total-variation prior for the normal vector field along the boundary of smooth and non-smooth shapes in 3D is introduced.
Revised: An analogue of the total variation prior for the normal vector field along the boundary of smooth and non-smooth shapes in 3D is introduced.
Edit intent: fluency
Original: An analogue of the total-variation prior for the normal vector field along the boundary of smooth and non-smooth shapes in 3D is introduced.
Revised: An analogue of the total-variation prior for the normal vector field along the boundary of smooth shapes in 3D is introduced.
Edit intent: clarity
Original:  The numerical problem is to approximate this solution using only {\em   particles sampled from the probability distribution .
Revised:  The numerical problem is to approximate this solution using {\em particles sampled from the probability distribution .
Edit intent: clarity
Original:  The algorithm does not require approximation of the probability distribution as an intermediate step . A procedure for carrying out error analysis of the approximation is introduced and certain asymptotic estimates for bias and variance are derived.
Revised:  The algorithm is named as such because it involves, as an intermediate step . A procedure for carrying out error analysis of the approximation is introduced and certain asymptotic estimates for bias and variance are derived.
Edit intent: coherence
Original:  The advantage of the Lagrangian framework is that the time-varying trajectories and particle attributes are displayed in a single visualization.
Revised:  The advantage of the proposed Lagrangian technique is that the time-varying trajectories and particle attributes are displayed in a single visualization.
Edit intent: clarity
Original:  The advantage of the Lagrangian framework is that the time-varying trajectories and particle attributes are displayed in a single visualization.
Revised:  The advantage of the Lagrangian framework is that the time-varying particle trajectories and attributes are displayed in a single visualization.
Edit intent: fluency
Original:  Applying our Lagrangian analysis to the glymphatic system , we successfully distinguish between flow patterns under two different anesthetics .
Revised:  The Lagrangian analysis applied to the glymphatic system , we successfully distinguish between flow patterns under two different anesthetics .
Edit intent: fluency
Original:  In our work, we take another step in this direction and show that for any abelian group G and function f:G \rightarrow \mathbb C \C , the matrix given by M_{xy} = f(x - y) for x,y \in G is not rigid.
Revised:  In our work, we take another step in this direction and show that for any abelian group G and function f:G \rightarrow \C , the matrix given by M_{xy} = f(x - y) for x,y \in G is not rigid.
Edit intent: coherence
Original:  Our work differs from previous non-rigidity results in that those works considered matrices whose underlying group of symmetries was of the form \mathbb F \F _p^n with p fixed and n tending to infinity, while in the families of matrices we study, the underlying group of symmetries can be any abelian group and, in particular cyclic groups which have\Z very different structure.
Revised:  Our work differs from previous non-rigidity results in that those works considered matrices whose underlying group of symmetries was of the form \F _p^n with p fixed and n tending to infinity, while in the families of matrices we study, the underlying group of symmetries can be any abelian group and, in particular cyclic groups which have\Z very different structure.
Edit intent: coherence
Original:  Our work differs from previous non-rigidity results in that those works considered matrices whose underlying group of symmetries was of the form \mathbb F \F _p^n with p fixed and n tending to infinity, while in the families of matrices we study, the underlying group of symmetries can be any abelian group and, in particular cyclic groups which have\Z very different structure.
Revised:  Our work differs from previous non-rigidity results in that those works considered matrices whose underlying group of symmetries was of the form \mathbb F \F _p^n with p fixed and n tending to infinity, while in the families of matrices we study, the underlying group of symmetries can be any abelian group and, in particular , the cyclic group\Z very different structure.
Edit intent: clarity
Original:  This resolves an open question of Ambainis , Magnin, Roetteler, and Roland (CCC 2011), who gave a tight bound for the coherent case, the case where the ancillary memory must return to its initial state.
Revised:  This resolves an open question of Ambainis et al., who gave a tight bound for the coherent case, the case where the ancillary memory must return to its initial state.
Edit intent: clarity
Original:  Our work combines deep geometric results by Rips, Sela, Dahmani and Guirardel on decidability of existential theories of hyperbolic groups, work of Computer Scientists including Plandowski, Je\.z, Diekert and others on PSPACE algorithms to solve equations in free monoids and groups using compression, and an intricate language-theoretic analysis.
Revised:  Our work combines deep geometric results by Rips, Sela, Dahmani and Guirardel on decidability of existential theories of hyperbolic groups, work of computer scientists including Plandowski, Je\.z, Diekert and others on PSPACE algorithms to solve equations in free monoids and groups using compression, and an intricate language-theoretic analysis.
Edit intent: fluency
Original: We introduce a new scheduling problem in distributed computing that we call the DSMSproblem.
Revised: This paper introduces a new resource allocation problem in distributed computing that we call the DSMSproblem.
Edit intent: clarity
Original:  Navigating mobile servers in a large-scale distributed system needs a scalable location service.
Revised:  Navigating mobile servers in a large-scale distributed systems requires a scalable location service.
Edit intent: fluency
Original:  We devise the distributed GNN protocol , a novel linked-reversal-based protocol for the DSMS problem that works on overlay trees.
Revised:  We introduce the distributed protocol GNN that solves the DSMS problem that works on overlay trees.
Edit intent: clarity
Original:  We devise the distributed GNN protocol , a novel linked-reversal-based protocol for the DSMS problem that works on overlay trees.
Revised:  We devise the distributed GNN protocol , a novel linked-reversal-based protocol for the DSMS problem on overlay trees.
Edit intent: clarity
Original:  We prove that GNN is a starvation-free protocol that correctly integrates locating the servers and synchronizing the concurrent access to the servers despite asynchrony  .
Revised:  We prove that GNN is starvation-free protocol that correctly integrates locating the servers and synchronizing the concurrent access to the servers despite asynchrony .
Edit intent: fluency
Original:  We prove that GNN is a starvation-free protocol that correctly integrates locating the servers and synchronizing the concurrent access to the servers despite asynchrony  .
Revised:  We prove that GNN is a starvation-free and correctly integrates locating the servers and synchronizing the concurrent access to the servers despite asynchrony .
Edit intent: clarity
Original:  We prove that GNN is a starvation-free protocol that correctly integrates locating the servers and synchronizing the concurrent access to the servers despite asynchrony  .
Revised:  We prove that GNN is a starvation-free protocol that correctly integrates locating the servers and synchronizing the concurrent access to servers despite asynchrony .
Edit intent: fluency
Original:  Further, we analyze the GNN protocol for one-shot executions where all requests are simultaneously issued.
Revised:  Further, we analyze GNN for " one-shot executions where all requests are simultaneously issued.
Edit intent: clarity
Original:  Further, we analyze the GNN protocol for one-shot executions where all requests are simultaneously issued.
Revised:  Further, we analyze the GNN protocol for one-shot " executions, i.e., all requests are simultaneously issued.
Edit intent: clarity
Original:  We show that when running the GNN protocol on top of a special family of tree topologies---known as hierarchically well-separated trees (HSTs)---we obtain a randomized distributed protocol with an expected competitive ratio of O(\log n) on general network topologies for the DSMS problem where n is the number of processorsin the given network .
Revised:  We show that when running GNN on top of a special family of tree topologies---known as hierarchically well-separated trees (HSTs)---we obtain a randomized distributed protocol with an expected competitive ratio of O(\log n) on general network topologies for the DSMS problem where n is the number of processorsin the given network .
Edit intent: clarity
Original:  We show that when running the GNN protocol on top of a special family of tree topologies---known as hierarchically well-separated trees (HSTs)---we obtain a randomized distributed protocol with an expected competitive ratio of O(\log n) on general network topologies for the DSMS problem where n is the number of processorsin the given network .
Revised:  We show that when running the GNN protocol on top of a special family of tree topologies---known as hierarchically well-separated trees (HSTs)---we obtain a randomized distributed protocol with an expected competitive ratio of O(\log n) on general network topologies with n processors .
Edit intent: clarity
Original:  From a technical point of view, the main result of our paper shows that the GNN protocol optimally solves the DSMS problem on HSTs for one-shot executions .
Revised:  From a technical point of view, our main result is that GNN optimally solves the DSMS problem on HSTs for one-shot executions .
Edit intent: clarity
Original:  The proof is an application of second moment method coupled with an iterative random shifting trick along the lines of Blinovsky.
Revised:  The proof is an application of second moment method coupled with an iterative random shift trick along the lines of Blinovsky.
Edit intent: fluency
Original: Fast Fourier transform (FFT) based methods has turned out to be an effective computational approach for numerical homogenisation.
Revised: Fast Fourier transform (FFT) based methods have turned out to be an effective computational approach for numerical homogenisation.
Edit intent: fluency
Original:  Particularly , Fourier-Galerkin methods are computational methods for partial differential equations that are discretised with trigonometric polynomials.
Revised:  In particular , Fourier-Galerkin methods are computational methods for partial differential equations that are discretised with trigonometric polynomials.
Edit intent: coherence
Original:  Its computational effectiveness benefits from efficient FFT based algorithms as well as a favourable condition number.
Revised:  Their computational effectiveness benefits from efficient FFT based algorithms as well as a favourable condition number.
Edit intent: fluency
Original:  Here this kind of methods are accelerated by low-rank tensor approximation techniques for a solution field using canonical  , Tucker, and tensor train formats.
Revised:  Here these kind of methods are accelerated by low-rank tensor approximation techniques for a solution field using canonical , Tucker, and tensor train formats.
Edit intent: fluency
Original:  The advantages of this approach against those using full material tensors are demonstrated using numerical examples for the model homogenisation problem that consists of a scalar linear elliptic variational problem defined in two and three dimensional setting with continuous and discontinuous heterogeneous material coefficients.
Revised:  The advantages of this approach against those using full material tensors are demonstrated using numerical examples for the model homogenisation problem that consists of a scalar linear elliptic variational problem defined in two and three dimensional settings with continuous and discontinuous heterogeneous material coefficients.
Edit intent: fluency
Original: We consider the problem of determining termination of single-path  loops with integer variables and affine updates.
Revised: We consider the problem of deciding termination of single-path loops with integer variables and affine updates.
Edit intent: fluency
Original:  The framework is based on the geometrical interpretation of the Vandermonde-matrix describing the relation between the nodes and the weights and can be used to determine all nodes that can be added to an interpolatory quadrature rule with positive weights such that the positive weights are preserved.
Revised:  The framework is based on the geometrical interpretation of the Vandermonde matrix describing the relation between the nodes and the weights and can be used to determine all nodes that can be added to an interpolatory quadrature rule with positive weights such that the positive weights are preserved.
Edit intent: clarity
Original:  In the case of addition of a single node, the derived inequalities that describe the regions where nodes can be added or replaced are explicit.
Revised:  In the case of addition of a single node, the derived inequalities that describe the regions where nodes can be added are explicit.
Edit intent: clarity
Original:  It is shown that, depending on the location of existing nodes and moments of the distribution, addition of a single node and preservation of positive weights is not always possible  .
Revised:  It is shown that, depending on the location of existing nodes and moments of the distribution, addition of a single node and preservation of positive weights is not always possible to add a single node while preserving positive weights .
Edit intent: clarity
Original:  An algorithm is presented to explore these regions and it is shown that the well-known Patterson extension of quadrature rules  forms the boundary of these regions .
Revised:  It is shown that the well-known Patterson extension of quadrature rules forms the boundary of these regions .
Edit intent: coherence
Original:  The result shows that the uncertainty related to the domain can be a dominating factor in the finite element discretization error.
Revised:  The result shows that the error related to the domain can be a dominating factor in the finite element discretization error.
Edit intent: clarity
Original:  The main result consists of H^1- and L ^2-error estimates for the Laplace problem.
Revised:  The main result consists of H^1- and L _2- error estimates for the Laplace problem.
Edit intent: clarity
Original:  Theoretical considerations are validated by a computational examples .
Revised:  Theoretical considerations are validated by a computational example .
Edit intent: fluency
Original: We study the effectiveness of various machine learning techniques, including artificial neural networks , support vector machine, logistic regression, K-nearest neighbors, decision tree and Naive Bayesian, for detecting and mitigating power jamming attacks in optical networks.
Revised: Optical networks are prone to power jamming attacks intending service disruption. This paper presents a Machine Learning (ML) framework for detection and prevention of jamming attacks in optical networks.
Edit intent: clarity
Original:  To further mitigating the power jamming attacks, we apply a new resource reallocation scheme that utilizes the statistical information of attack detection accuracy , and propose a resource reallocation algorithm to lower the probability of successful jamming of lightpaths  . Simulation results show that higher the accuracy of detection, lower is the likelihood of jamming a lightpath .
Revised:  To further mitigating the power jamming attacks, we apply a new resource reallocation scheme that utilizes the statistical information of attack detection accuracy to lower the probability of successful jamming of lightpaths . Simulation results show that higher the accuracy of detection, lower is the likelihood of jamming a lightpath .
Edit intent: clarity
Original:  To further mitigating the power jamming attacks, we apply a new resource reallocation scheme that utilizes the statistical information of attack detection accuracy , and propose a resource reallocation algorithm to lower the probability of successful jamming of lightpaths  . Simulation results show that higher the accuracy of detection, lower is the likelihood of jamming a lightpath .
Revised:  To further mitigating the power jamming attacks, we apply a new resource reallocation scheme that utilizes the statistical information of attack detection accuracy , and propose a resource reallocation algorithm to lower the probability of successful jamming of lightpaths . Simulation results show that the likelihood of jamming a lightpath .
Edit intent: coherence
Original:  Numerical results show that artificial neural network is the fastest (10^6 detection per second) for inference and most accurate (~ 100 \%) in detecting power jamming attacks as well as identifying the optical channels attacked.
Revised:  Numerical results show that artificial neural network is the fastest (10^6 detections per second) for inference and most accurate (~ 100 \%) in detecting power jamming attacks as well as identifying the optical channels attacked.
Edit intent: clarity
Original:  Our method is simple to implement, deterministic, and results in an exponential improvement in both query time and storage space compared with all previous work .
Revised:  Our method is simple to implement, deterministic, and results in an exponential improvement in both query time and storage space compared to all previous bounds .
Edit intent: clarity
Original:   Tree-based Deep Model (TDM) for recommendation zhu2018learning greatly improves recommendation accuracy using tree index.
Revised:  Tree-based Deep Model (TDM) zhu2018learning greatly improves recommendation accuracy using tree index.
Edit intent: clarity
Original:  In tree-based recommendation methods, the quality of both the tree index and the trained user preference prediction model determines the recommendation accuracy for the most part.
Revised:  In tree-based recommendation methods, the quality of both the tree index and the user-node preference prediction model determines the recommendation accuracy for the most part.
Edit intent: clarity
Original:  We argue that the learning of tree index and user preference model has interdependence.
Revised:  We argue that the learning of tree index and preference model has interdependence.
Edit intent: clarity
Original:  Online A/B test results at Taobao display advertising also demonstrate the effectiveness of the proposed method in production environments.
Revised:  Online A/B test results at a display advertising platform also demonstrate the effectiveness of the proposed method in production environments.
Edit intent: clarity
Original: Data theft and tampering are serious concerns as attackers have aggressively begun to exploit weaknesses in current memory systems to advance their nefarious schemes.
Edit intent: coherence
Original:  The storage industry is moving toward emerging non-volatile memories ( NVM ), including the spin-transfer torque magnetoresistive random access memory (STT-MRAM) and the phase change memory (PCM), owing to their high density and low power operation.
Revised:  The storage industry is moving toward emerging non-volatile memories ( NVMs ), including the spin-transfer torque magnetoresistive random access memory (STT-MRAM) and the phase change memory (PCM), owing to their high density and low power operation.
Edit intent: clarity
Original:  The storage industry is moving toward emerging non-volatile memories ( NVM ), including the spin-transfer torque magnetoresistive random access memory (STT-MRAM) and the phase change memory (PCM), owing to their high density and low power operation.
Revised:  The storage industry is moving toward emerging non-volatile memories ( NVM ), including the spin-transfer torque magnetoresistive random-access memory (STT-MRAM) and the phase change memory (PCM), owing to their high density and low power operation.
Edit intent: fluency
Original:  The storage industry is moving toward emerging non-volatile memories ( NVM ), including the spin-transfer torque magnetoresistive random access memory (STT-MRAM) and the phase change memory (PCM), owing to their high density and low power operation.
Revised:  The storage industry is moving toward emerging non-volatile memories ( NVM ), including the spin-transfer torque magnetoresistive random access memory (STT-MRAM) and the phase-change memory (PCM), owing to their high density and low power operation.
Edit intent: fluency
Original:  SMART memory is not only resilient against data confidentiality attacks seeking to leak sensitive information but also protects data integrity and prevents Denial of Service (DoS) attacks on the memory.
Revised:  SMART memory is not only resilient against data confidentiality attacks seeking to leak sensitive information but also ensures data integrity and prevents Denial of Service (DoS) attacks on the memory.
Edit intent: clarity
Original:  SMART memory is not only resilient against data confidentiality attacks seeking to leak sensitive information but also protects data integrity and prevents Denial of Service (DoS) attacks on the memory.
Revised:  SMART memory is not only resilient against data confidentiality attacks seeking to leak sensitive information but also protects data integrity and prevents Denial-of-Service (DoS) attacks on the memory.
Edit intent: fluency
Original:  It is impervious to  power side-channel attacks, which exploit asymmetric reads / writes for 0 and 1 logic levels, and photonic side-channel attacks , which monitor photo-emission signatures from the chip backside .
Revised:  It is impervious to power side-channel attacks, which exploit asymmetric read / writes for 0 and 1 logic levels, and photonic side-channel attacks , which monitor photo-emission signatures from the chip backside .
Edit intent: fluency