wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this paper, we present how the ExaHyPE engine facilitates the collaboration of such teams by isolating three roles -- application, algorithms, and optimization expert -- thus allowing team members to focus on their own area of expertise , while integrating their contributions into an HPC production code.
Revised:  In this paper, we present how the ExaHyPE engine facilitates the collaboration of such teams by isolating three roles -- application, algorithms, and optimization expert -- thus allowing team members to focus on their own area of expertise while integrating their contributions into an HPC production code.
Edit intent: fluency
Original:  Inspired by web application development practices  ExaHyPE relies on two custom code generation modules, the Toolkit and the Kernel Generator, which follow a Model-View-Controller architectural pattern on top of the Jinja2 template engine library.
Revised:  Inspired by web application development practices , ExaHyPE relies on two custom code generation modules, the Toolkit and the Kernel Generator, which follow a Model-View-Controller architectural pattern on top of the Jinja2 template engine library.
Edit intent: fluency
Original:  The template language also allows us to define and use custom  macros that isolate low-level optimizations from the numerical scheme described in the templates.
Revised:  The template language also allows us to define and use custom template macros that isolate low-level optimizations from the numerical scheme described in the templates.
Edit intent: fluency
Original:  The development is formalized using the Agda theorem-prover .
Revised:  The development is formalized using the Agda theorem prover .
Edit intent: fluency
Original:  Typically, structure-aware neural methods for embedding logical formulae have been variants of either Tree LSTMs or GNNs . While more effective than character and token-level approaches, such methods have often made representational trade-offs that limited their ability to effectively represent the global structure of their inputs.
Revised:  Typically, structure-aware neural methods to work with the underlying graph representations of logical expressions . While more effective than character and token-level approaches, such methods have often made representational trade-offs that limited their ability to effectively represent the global structure of their inputs.
Edit intent: clarity
Original:  Typically, structure-aware neural methods for embedding logical formulae have been variants of either Tree LSTMs or GNNs . While more effective than character and token-level approaches, such methods have often made representational trade-offs that limited their ability to effectively represent the global structure of their inputs.
Revised:  Typically, structure-aware neural methods for embedding logical formulae have been variants of either Tree LSTMs or GNNs . While more effective than character and token-level approaches, such methods have often made representational trade-offs that limited their ability to capture key structural properties of their inputs.
Edit intent: clarity
Original:  In this work , we introduce a novel approach for embedding logical formulae using DAG LSTMs that is designed to overcome the limitations of both Tree LSTMs and GNNs.
Revised:  In this work , we introduce a novel approach for embedding logical formulae that is designed to overcome the limitations of both Tree LSTMs and GNNs.
Edit intent: coherence
Original:  The effectiveness of the proposed framework is demonstrated on the tasks of premise selection and proof step classification where it achieves the state-of-the-art performance on two standard datasets .
Revised:  The effectiveness of the proposed framework is demonstrated on the tasks of premise selection and proof step classification significantly compared to state-of-the-art performance on two standard datasets .
Edit intent: clarity
Original:  The effectiveness of the proposed framework is demonstrated on the tasks of premise selection and proof step classification where it achieves the state-of-the-art performance on two standard datasets .
Revised:  The effectiveness of the proposed framework is demonstrated on the tasks of premise selection and proof step classification where it achieves the state-of-the-art .
Edit intent: clarity
Original:  In this work we propose a novel , LSTM-based approach for embedding logical formulae that is designed to overcome the representational limitations of prior approaches.
Revised:  In this work we propose a novel approach for embedding logical formulae that is designed to overcome the representational limitations of prior approaches.
Edit intent: coherence
Original:  Our proposed architecture works for logics of different expressivity;
Revised:  Our architecture works for logics of different expressivity;
Edit intent: clarity
Original:  We evaluate our approach on two standard datasets and show that the proposed architecture improves the performance of premise selection and proof step classification significantly compared to state-of-the-art .
Revised:  We evaluate our approach on two standard datasets and show that the proposed architecture achieves state-of-the-art performance on both premise selection and proof step classification significantly compared to state-of-the-art .
Edit intent: clarity
Original:  We evaluate our approach on two standard datasets and show that the proposed architecture improves the performance of premise selection and proof step classification significantly compared to state-of-the-art .
Revised:  We evaluate our approach on two standard datasets and show that the proposed architecture improves the performance of premise selection and proof step classification .
Edit intent: clarity
Original: We design a nonadaptive algorithm that, given a Boolean function f%DIFDELCMD < \colon %DIFDELCMD < %%%  \{0,1\}^n \to \{0,1\} which is \alpha-far from monotone, makes poly(n, 1/\alpha) queries and returns an estimate that, with high probability, is an O(n)-approximation to the distance of f to monotonicity.
Revised: We design a nonadaptive algorithm that, given %DIFDELCMD < \colon %DIFDELCMD < %%% \{0,1\}^n \to \{0,1\} which is \alpha-far from monotone, makes poly(n, 1/\alpha) queries and returns an estimate that, with high probability, is an O(n)-approximation to the distance of f to monotonicity.
Edit intent: clarity
Original:  Furthermore, we show that for any constant \kappa > 0, approximating the distance to monotonicity up to n^{1/2 - \kappa-factor requires 2^{n^\kappa} nonadaptive queries, thereby ruling }  out a poly(n, 1/\alpha)-query nonadaptive algorithm for such approximations-approximation algorithm for this problem requires 2^{n^\kappa} queries} .
Revised:  -factor requires 2^{n^\kappa} nonadaptive queries, thereby ruling } out a poly(n, 1/\alpha)-query nonadaptive algorithm for such approximations-approximation algorithm for this problem requires 2^{n^\kappa} queries} .
Edit intent: coherence
Original:  Our method  yields the same lower bounds for unateness and being a k-junta .
Revised:  Our method also yields the same lower bounds for unateness and being a k-junta .
Edit intent: clarity
Original: Many real-world multi-agent reinforcement learning applications require agents to communicate, assisted by a communication protocol .
Revised: Many real-world multi-agent reinforcement learning , where agents cooperate with the assistance of a communication protocol .
Edit intent: clarity
Original:  In this paper, rather than proposing a fixed communication protocol, we develop an Informative Multi-Agent Communication (IMAC) method to learn efficient communication protocols .
Revised:  In this paper, we develop an Informative Multi-Agent Communication (IMAC) method to learn efficient communication protocols .
Edit intent: coherence
Original:  Third, we apply the information bottleneck method to discover the optimal communication protocol , which can satisfy a bandwidth constraint via training with the prior distribution in the method .
Revised:  Third, we apply the information bottleneck principle, we learn a valuable and compact communication protocol and a weight-based scheduler .
Edit intent: coherence
Original:  To demonstrate the efficacy of our method, we conduct extensive experiments in various cooperative and competitive multi-agent tasks across two dimensions: the number of agents and different bandwidths.
Revised:  To demonstrate the efficiency of our method, we conduct extensive experiments in various cooperative and competitive multi-agent tasks across two dimensions: the number of agents and different bandwidths.
Edit intent: fluency
Original:  To demonstrate the efficacy of our method, we conduct extensive experiments in various cooperative and competitive multi-agent tasks across two dimensions: the number of agents and different bandwidths.
Revised:  To demonstrate the efficacy of our method, we conduct extensive experiments in various cooperative and competitive multi-agent tasks with different numbers of agents and different bandwidths.
Edit intent: clarity
Original:  We show that IMAC converges fast, and leads to efficient communication among agents under the limited-bandwidth constraint as compared to many baseline methods.
Revised:  We show that IMAC converges faster and leads to efficient communication among agents under the limited-bandwidth constraint as compared to many baseline methods.
Edit intent: fluency
Original:  We show that IMAC converges fast, and leads to efficient communication among agents under the limited-bandwidth constraint as compared to many baseline methods.
Revised:  We show that IMAC converges fast, and leads to efficient communication among agents under the limited bandwidth as compared to many baseline methods.
Edit intent: clarity
Original:  In recent years, several efforts have been made towards this topic, but there lacks a detailed survey in  literature.
Revised:  In recent years, several efforts have been made towards this topic, but there is a lack of detailed survey in literature.
Edit intent: fluency
Original:  In recent years, several efforts have been made towards this topic, but there lacks a detailed survey in  literature.
Revised:  In recent years, several efforts have been made towards this topic, but there lacks a detailed survey in the literature.
Edit intent: fluency
Original:  Followed by a summary and analysis of the representative state-of-the-art objective metrics.
Revised:  Followed by a summary analysis of the representative state-of-the-art objective metrics.
Edit intent: coherence
Original: A new polynomial preconditioner is given for solving large systems of linear equations.
Revised: We present a polynomial preconditioner for solving large systems of linear equations.
Edit intent: clarity
Original:  It this paper, we study the polynomial preconditioner applied to GMRES , however it could be used with any Krylov solver.
Revised:  It this paper, we study the polynomial preconditioner applied to GMRES ; however it could be used with any Krylov solver.
Edit intent: fluency
Original:  This preconditioning algorithm can dramatically improve convergence for difficult problems and can reduce dot products by an even greater margin.
Edit intent: coherence
Original:  We show the Matrix Formalism representation requires around 100 eigenmodes to match the reference signal computed by solving the Bloch-Torrey equation when the cell geometry comes from realistic neurons.
Revised:  We show the Matrix Formalism representation requires around a few hundred eigenmodes to match the reference signal computed by solving the Bloch-Torrey equation when the cell geometry comes from realistic neurons.
Edit intent: clarity
Original:  We call the singular set image C:= \varphi (\Gamma) the crease of \varphi and the singular set \Gamma the crease pattern of \varphi .
Revised:  We call the singular set image C:= \varphi (\Gamma) the crease of \varphi and the singular set \Gamma the crease pattern of \Phi .
Edit intent: clarity
Original:  We are interested in the number of origami maps whose creases and crease patterns are C and \Gamma  respectively.
Revised:  We are interested in the number of origami maps whose creases and crease patterns are C and \Gamma , respectively.
Edit intent: fluency
Original:  In the previous authors' work, two other new possibilities and an explicit example with four such non-congruent distinct curved foldings were established.
Revised:  In the authors' previous work, two other new possibilities and an explicit example with four such non-congruent distinct curved foldings were established.
Edit intent: fluency
Original:  Moreover , when C is a closed curve, we show that there are infinitely many distinct possibilities for curved foldings with the same crease and crease pattern, in general.
Revised:  On the other hand , when C is a closed curve, we show that there are infinitely many distinct possibilities for curved foldings with the same crease and crease pattern, in general.
Edit intent: coherence
Original:  Moreover , when C is a closed curve, we show that there are infinitely many distinct possibilities for curved foldings with the same crease and crease pattern, in general.
Revised:  Moreover , when C is a closed curve, there are infinitely many distinct possibilities for curved foldings with the same crease and crease pattern, in general.
Edit intent: coherence
Original:  In service of that we introduce a novel notion, termed the %DIFDELCMD < {\em %%% granularity threshold , that characterizes VCG Bayesian resilience to false-name attacks as a function of the bidder type distribution.
Revised:  In service of that we introduce a novel notion, termed the %DIFDELCMD < {\em %%% granularity threshold , that characterizes VCG Bayesian resilience to false-name attacks as a function of the bidder type distribution.
Edit intent: fluency
Original:  The current article will focus on the computational aspects of the algorithm.
Revised:  The current article will focus on computational aspects of the algorithm.
Edit intent: fluency
Original:  The key to PriorityGraph is a novel priority-based abstraction that enables vertices to be processed in a dynamic order while hiding low-level implementation details from the user.
Revised:  The extension enables vertices to be processed in a dynamic order while hiding low-level implementation details from the user.
Edit intent: clarity
Original:  We also introduce bucket fusion, a new performance optimization that fuses together different rounds of ordered algorithms to reduce synchronization overhead, resulting in 1.2\times to 3 \times speedup over the fastest existing ordered algorithm implementations on road networks with large diameters.
Revised:  We also introduce bucket fusion, a new performance optimization that fuses together different rounds of ordered algorithms to reduce synchronization overhead, resulting in 1.2\times --3 \times speedup over the fastest existing ordered algorithm implementations on road networks with large diameters.
Edit intent: clarity
Original:  We say that a pair of such curves %DIFDELCMD < {\it %%% touch if they intersect at a single point of common tangency.
Revised:  We say that a pair of such curves %DIFDELCMD < {\it %%% touch if they intersect at a single point of common tangency.
Edit intent: fluency
Original:  In this work we show that any m-intersecting family of n Jordan curves in general position in the plane contains O\left(n^{2-1{3m+15}}\right) touching pairs .\footnote{A family of Jordan curves is in general position if no three of its curves pass through the same point, and no two of them overlap.
Revised:  In this work we show that any m-intersecting family of n Jordan curves in general position in the plane contains O\left(n^{2-1{3m+15}}\right) touching pairs \footnote{A family of Jordan curves is in general position if no three of its curves pass through the same point, and no two of them overlap.
Edit intent: fluency
Original:  Furthermore, we use the string separator theorem of Fox and Pach \mbox{ FP10 in order to establish the following Crossing Lemma for contact graphs of Jordan curves: Let \Gamma be an m-intersecting family of closed Jordan curves in general position in the plane with exactly T=\Omega(n) touching pairs of curves, then the curves of \Gamma determine \Omega\left(T\cdot\left(T{n}\right)^{1{9m+45}}\right) intersection points.
Revised:  Furthermore, we use the string separator theorem of Fox and Pach in order to establish the following Crossing Lemma for contact graphs of Jordan curves: Let \Gamma be an m-intersecting family of closed Jordan curves in general position in the plane with exactly T=\Omega(n) touching pairs of curves, then the curves of \Gamma determine \Omega\left(T\cdot\left(T{n}\right)^{1{9m+45}}\right) intersection points.
Edit intent: coherence
Original:  The breakthrough work by Bencz\'ur and Karger (STOC'96) and Spielman and Teng (STOC'04) showed that sparsification can be done optimally in time near-linear in the number of edges of the original graph.
Edit intent: coherence
Original:  The algorithm builds on a string of existing results , most notably sparsificationalgorithms by Spielman and Srivastava (STOC'08) and Koutis and Xu (TOPC'16), a spanner construction by Thorup and Zwick (STOC'01), a single-source shortest-paths quantum algorithm by D\"urr et al. (ICALP'04) and an efficient k-wise independent hash construction by Christiani, Pagh and Thorup (STOC'15).
Revised:  The algorithm builds on a string of existing results on sparsification, graph spanners, quantum algorithms for shortest paths, and efficient constructions for k-wise independent hash construction by Christiani, Pagh and Thorup (STOC'15).
Edit intent: clarity
Original: We extend unsteady thin aerofoil theory to model aerofoils with generalized chordwise porosity distributions.
Revised: We extend unsteady thin aerofoil theory to model aerofoils with generalised chordwise porosity distributions.
Edit intent: fluency
Original:  The analysis considers a Darcy-type porosity law where the seepage velocity through the aerofoil is linearly related to the local pressure jump across the aerofoil surface  . Application of the Plemelj formulae  yields a singular Fredholm--Volterra integral equation which does not admit an analytic solution.
Revised:  The analysis considers a Darcy-type porosity law where the seepage velocity through the aerofoil is related to the local pressure jump across the aerofoil surface . Application of the Plemelj formulae yields a singular Fredholm--Volterra integral equation which does not admit an analytic solution.
Edit intent: clarity
Original:  The Jacobi polynomial basis enables the construction of a numerical scheme that is accurate and rapid, in contrast to the standard choice of Chebyshev basis functions that are shown to be ill-posed in their application to  porous aerofoils.
Revised:  The Jacobi polynomial basis enables the construction of a numerical scheme that is accurate and rapid, in contrast to the standard choice of Chebyshev basis functions that are shown to be unsuitable porous aerofoils.
Edit intent: clarity
Original:  The Jacobi polynomial basis enables the construction of a numerical scheme that is accurate and rapid, in contrast to the standard choice of Chebyshev basis functions that are shown to be ill-posed in their application to  porous aerofoils.
Revised:  The Jacobi polynomial basis enables the construction of a numerical scheme that is accurate and rapid, in contrast to the standard choice of Chebyshev basis functions that are shown to be ill-posed in their application to for porous aerofoils.
Edit intent: fluency
Original:  However, the existing target detection algorithms suffer from either  low resolution/accuracy or  high time complexity.
Revised:  However, the existing target detection algorithms suffer from either the low resolution/accuracy or high time complexity.
Edit intent: fluency
Original:  However, the existing target detection algorithms suffer from either  low resolution/accuracy or  high time complexity.
Revised:  However, the existing target detection algorithms suffer from either low resolution/accuracy or the high time complexity.
Edit intent: coherence
Original:  In this work , we propose two efficient approximate algorithms to significantly accelerate the high-resolution subspace algorithm.
Revised:  In this study , we propose two efficient approximate algorithms to significantly accelerate the high-resolution subspace algorithm.
Edit intent: clarity
Original:  In this work , we propose two efficient approximate algorithms to significantly accelerate the high-resolution subspace algorithm.
Revised:  In this work , we propose two computational efficient methods to accomplish the high-resolution subspace algorithm.
Edit intent: clarity
Original:  Specifically, we show that, in the case of high signal-to-noise ratio, the pseudo-spectrum produced by our algorithms are very close to the exact MUSIC.
Revised:  Specifically, we show that, in the case of high signal-to-noise ratio, the pseudo-spectrum acquired by our fast-MUSIC is highly precise, when compared to the exact MUSIC.
Edit intent: clarity
Original:  This work enables super-resolution automotive sensing in real time and thus has great practical value in emerging automotive applications.
Revised:  As such, our fast-MUSIC enables the high-resolution yet real-time sensing with massive MIMO radar, which has great potential in the emerging mobile computing and automotive applications.
Edit intent: coherence
Original:  It is studied that the presented fourth-order scheme provides less oscillatory approximation than the third-order scheme.
Edit intent: coherence
Original:  Extensive numerical results are presented to validate the accuracy and robustness of the schemes.
Revised:  Extensive numerical results are presented to validate the accuracy and stability of the proposed schemes.
Edit intent: clarity
Original:  The inverse problem of dynamic games, where cost functions are sought which explain observed behavior , has recently gained attention due to its potential application for identification of biological systems and the possibility of generalizing inverse optimal control results.
Revised:  The inverse problem of dynamic games, where cost function parameters are sought which explain observed behavior , has recently gained attention due to its potential application for identification of biological systems and the possibility of generalizing inverse optimal control results.
Edit intent: clarity
Original:  On this basis, we first present a method for identification of cost function parameters in a cooperative game.
Revised:  We present methods for identification of cost function parameters in a cooperative game.
Edit intent: coherence
Original:  Afterwards, we propose an approach for identifying cost function parameters which explain the behavior of the players in a non-cooperative setting, i.e. open-loop and feedback Nash equilibrium behaviors .
Revised:  Afterwards, we propose an approach for identifying cost function parameters which explain the behavior of the players in a non-cooperative setting, i.e. open-loop and feedback Nash equilibrium .
Edit intent: clarity
Original:  These results make it possible to compare impact and frequency of different flaw types, contrast smart contract flaws with non-smart-contract flaws, and estimate the potential of automated flaw-detection approaches.
Revised:  These results make it possible to compare the severity and frequency of different flaw types, contrast smart contract flaws with non-smart-contract flaws, and estimate the potential of automated flaw-detection approaches.
Edit intent: clarity
Original:  These results make it possible to compare impact and frequency of different flaw types, contrast smart contract flaws with non-smart-contract flaws, and estimate the potential of automated flaw-detection approaches.
Revised:  These results make it possible to compare impact and frequency of different vulnerability types, compare smart contract and non-smart contract flaws, and to estimate the efficacy of automated vulnerability detection approaches.
Edit intent: clarity