wanyu/IteraTeR_v2 huggingface dataset:
Original:  In a  high-dimensional setting it is also already possible to deal with special sampling sets such as sparse grids or rank-1 lattices.
Revised:  In a high-dimensional setting , it is already possible to deal with special sampling sets such as sparse grids or rank-1 lattices.
Edit intent: clarity
Original:  In this paper we propose fast algorithms for high-dimensional scattered data points with corresponding frequency sets that consist of groups along the dimensions in the frequency domain .
Revised:  In this paper we propose fast algorithms for high-dimensional scattered data points and grouped frequency index sets along the dimensions in the frequency domain .
Edit intent: clarity
Original:  In this paper we propose fast algorithms for high-dimensional scattered data points with corresponding frequency sets that consist of groups along the dimensions in the frequency domain .
Revised:  In this paper we propose fast algorithms for high-dimensional scattered data points with corresponding frequency sets that consist of groups along the dimensions .
Edit intent: clarity
Original:  We tested two different approximation approaches : Classical Tikhonov-regularization, namely, regularized least squares , and the technique of group lasso, which promotes sparsity in the groups.
Revised:  We tested two different approximation approaches : Classical Tikhonov-regularization, namely, regularized least squares and the technique of group lasso, which promotes sparsity in the groups.
Edit intent: fluency
Original: One of the fundamental notions of linear algebra is the concept of a basis for a vector space.
Revised: Some of the fundamental notions of linear algebra is the concept of a basis for a vector space.
Edit intent: clarity
Original:  In this paper we show that the notion of a basis can be extended to algebras of arbitrary monads on arbitrary categories.
Revised:  In this paper we investigate general notions of generators and bases for algebras over arbitrary monads on arbitrary categories.
Edit intent: clarity
Original:  On the other hand, we use the general notion of a basis in the context of coalgebraic systems and show that a basis for the underlying algebra of a bialgebra gives rise to an equivalent free bialgebra.
Revised:  On the other hand, we use the general notion in the context of coalgebraic systems and show that a basis for the underlying algebra of a bialgebra gives rise to an equivalent free bialgebra.
Edit intent: clarity
Original:  On the other hand, we use the general notion of a basis in the context of coalgebraic systems and show that a basis for the underlying algebra of a bialgebra gives rise to an equivalent free bialgebra.
Revised:  On the other hand, we use the general notion of a basis in the context of coalgebraic systems and show that a generator for the underlying algebra of a bialgebra gives rise to an equivalent free bialgebra.
Edit intent: clarity
Original:  As a result, we are , for instance, able to recover known constructions from automata theory , namely the so-called canonical residual finite state automaton  .
Revised:  As a result, we are able to recover known constructions from automata theory , namely the so-called canonical residual finite state automaton .
Edit intent: coherence
Original:  As a result, we are , for instance, able to recover known constructions from automata theory , namely the so-called canonical residual finite state automaton  .
Revised:  As a result, we are , for instance, able to recover known constructions from automata theory such as the canonical residual finite state automaton .
Edit intent: clarity
Original:  Finally, we instantiate the framework to a variety of example monads, including the powerset, downset, distribution, and neighbourhood monad .
Revised:  Finally, we instantiate the framework to a variety of example monads, both set and non set-based .
Edit intent: clarity
Original:  On the one hand, we establish purely algebraic results, for instance about the existence and uniqueness of generators and bases, and the representation of algebra homomorphisms  .
Revised:  On the one hand, we establish purely algebraic results, for instance about the existence and uniqueness of generators and bases, the representation of algebra homomorphisms .
Edit intent: coherence
Original: Stencil kernels dominate a range of scientific applications  including seismic and medical imaging, image processing, and neural networks.
Revised: Stencil kernels dominate a range of scientific applications , including seismic and medical imaging, image processing, and neural networks.
Edit intent: fluency
Original:  Temporal blocking is a performance optimisation that aims to reduce the required memory bandwidth of stencil computations by re-using data from the cache for multiple time steps.
Revised:  Temporal blocking is a performance optimization that aims to reduce the required memory bandwidth of stencil computations by re-using data from the cache for multiple time steps.
Edit intent: fluency
Original:  However, optimising stencils for practical applications remains challenging.
Revised:  However, applying temporal blocking to practical applications' stencils remains challenging.
Edit intent: clarity
Original:  These computations often include sparsely located operators , not aligned with the computational grid ("off-the-grid").
Revised:  These computations often consist of sparsely located operators , not aligned with the computational grid ("off-the-grid").
Edit intent: clarity
Original:  These computations often include sparsely located operators , not aligned with the computational grid ("off-the-grid").
Revised:  These computations often include sparsely located operators not aligned with the computational grid ("off-the-grid").
Edit intent: fluency
Original:  For example, our work is motivated by sources that inject a wavefieldand measurements interpolating grid values .
Revised:  Our work is motivated by sources that inject a wavefieldand measurements interpolating grid values .
Edit intent: coherence
Original:  For example, our work is motivated by sources that inject a wavefieldand measurements interpolating grid values .
Revised:  For example, our work is motivated by modeling problems in which source injections result in wavefields that must then be measured at receivers by interpolation from the grided wavefield .
Edit intent: clarity
Original:  Devito implements a domain-specific language embedded in Python to generate optimised partial differential equation solvers using the finite-difference method from high-level symbolic problem definitions.
Revised:  Devito implements a domain-specific language embedded in Python to generate optimized partial differential equation solvers using the finite-difference method from high-level symbolic problem definitions.
Edit intent: fluency
Original:  We evaluate our scheme using isotropic acoustic, anisotropic acoustic  and isotropic elastic wave propagators of industrial significance.
Revised:  We evaluate our scheme using isotropic acoustic, anisotropic acoustic , and isotropic elastic wave propagators of industrial significance.
Edit intent: fluency
Original:  Performance evaluation, after auto-tuning,  shows that this enables substantial performance improvement through temporal blocking , over highly-optimised vectorized spatially-blocked code of up to 1.6x.
Revised:  After auto-tuning, shows that this enables substantial performance improvement through temporal blocking , over highly-optimised vectorized spatially-blocked code of up to 1.6x.
Edit intent: clarity
Original:  Performance evaluation, after auto-tuning,  shows that this enables substantial performance improvement through temporal blocking , over highly-optimised vectorized spatially-blocked code of up to 1.6x.
Revised:  Performance evaluation, after auto-tuning, shows that this enables substantial performance improvement through temporal blocking over highly-optimized vectorized spatially-blocked code of up to 1.6x.
Edit intent: fluency
Original:  Using the MS MARCO dataset, we show that CoRT significantly increases first-stage ranking quality and recall by complementing BM25 with missing candidates.
Revised:  Using the MS MARCO dataset, we show that CoRT significantly increases the candidate recall by complementing BM25 with missing candidates.
Edit intent: clarity
Original:  Consequently, we found subsequent re-rankers achieve superior results while requiring less candidatesto saturate ranking quality.
Revised:  Consequently, we find subsequent re-rankers achieve superior results while requiring less candidatesto saturate ranking quality.
Edit intent: fluency
Original:  Finally, we demonstrate that with CoRT a representation-focused retrieval at web-scale can be realized with latencies as low as BM25 .
Revised:  Finally, we demonstrate that with CoRT a representation-focused retrieval at web-scale can be realized with surprisingly low latencies .
Edit intent: clarity
Original:  Consequently, these content features do not have a clear musicological meaning, thus they are not necessarily relevant from a musical preference perspective.
Revised:  Consequently, these content features do not have a clear musical meaning, thus they are not necessarily relevant from a musical preference perspective.
Edit intent: clarity
Original:  From low-level acoustic features we extract three factors (arousal, valence and depth), which accurately describe musical taste.
Revised:  From low-level acoustic features we extract three factors (arousal, valence and depth), which have been shown appropriate for describing musical taste.
Edit intent: clarity
Original: There have been growing interests in building a conversational recommender system, where the system simultaneously interacts with the user and explores the user's preference throughout conversational interactions . Recommendation and conversation were usually treated as two separate modules with limited information exchange in existing works, which hinders the capability of both systems:
Revised: Growing interests have been attracted in Conversational Recommender Systems (CRS), which explore user preference through conversational interactions in order to make appropriate recommendation. However, there is still a lack of ability in existing CRS to
Edit intent: clarity
Original:  (2) recommendation utilized dialog only as a form of interaction instead of improving recommendation effectively .
Revised:  (2) arrange selected entities appropriately under current system intents to control response generation .
Edit intent: clarity
Original:  To address the above issues, we propose a novel recommender dialog model: CR-Walker .
Revised:  To address these issues, we propose a novel recommender dialog model: CR-Walker .
Edit intent: coherence
Original:  To address the above issues, we propose a novel recommender dialog model: CR-Walker .
Revised:  To address the above issues, we propose CR-Walker .
Edit intent: clarity
Original:  Such provenance information is commonly represented in graphs with relevant labels on both their nodes and edges.
Revised:  Such provenance information is commonly represented as graphs with relevant labels on both their nodes and edges.
Edit intent: fluency
Original:  With the growing adoption of provenance in a wide range of application domains, increasingly, users are confronted with an abundance of graph data, which may prove challenging to analyse . Graph kernels, on the other hand, have been consistently and successfully used to efficiently classify graphs.
Revised:  With the growing adoption of provenance in a wide range of application domains, users are increasingly confronted with an abundance of graph data, which may prove challenging to analyse . Graph kernels, on the other hand, have been consistently and successfully used to efficiently classify graphs.
Edit intent: coherence
Original:  With the growing adoption of provenance in a wide range of application domains, increasingly, users are confronted with an abundance of graph data, which may prove challenging to analyse . Graph kernels, on the other hand, have been consistently and successfully used to efficiently classify graphs.
Revised:  With the growing adoption of provenance in a wide range of application domains, increasingly, users are confronted with an abundance of graph data, which may prove challenging to process . Graph kernels, on the other hand, have been consistently and successfully used to efficiently classify graphs.
Edit intent: clarity
Original:  With the growing adoption of provenance in a wide range of application domains, increasingly, users are confronted with an abundance of graph data, which may prove challenging to analyse . Graph kernels, on the other hand, have been consistently and successfully used to efficiently classify graphs.
Revised:  With the growing adoption of provenance in a wide range of application domains, increasingly, users are confronted with an abundance of graph data, which may prove challenging to analyse . Graph kernels, on the other hand, have been successfully used to efficiently classify graphs.
Edit intent: clarity
Original:  With the growing adoption of provenance in a wide range of application domains, increasingly, users are confronted with an abundance of graph data, which may prove challenging to analyse . Graph kernels, on the other hand, have been consistently and successfully used to efficiently classify graphs.
Revised:  With the growing adoption of provenance in a wide range of application domains, increasingly, users are confronted with an abundance of graph data, which may prove challenging to analyse . Graph kernels, on the other hand, have been consistently and successfully used to efficiently analyse graphs.
Edit intent: clarity
Original:  In this paper, we introduce a novel graph kernel called provenance kernel , which is inspired by and tailored for provenance data.
Revised:  In this paper, we introduce a novel graph kernel called provenance kernel , which is inspired by and tailored for provenance data.
Edit intent: fluency
Original:  Our evaluation shows that they perform well in terms of classification accuracy and yield competitive results when compared against standard graph kernel methods and the provenance network analytics method while taking significantly less time.
Revised:  Our evaluation shows that they perform well in terms of classification accuracy and yield competitive results when compared against existing graph kernel methods and the provenance network analytics method while taking significantly less time.
Edit intent: clarity
Original:  Our evaluation shows that they perform well in terms of classification accuracy and yield competitive results when compared against standard graph kernel methods and the provenance network analytics method while taking significantly less time.
Revised:  Our evaluation shows that they perform well in terms of classification accuracy and yield competitive results when compared against standard graph kernel methods and the provenance network analytics method while more efficient in computing time.
Edit intent: clarity
Original:  Moreover, we illustrate how the provenance types used in provenance kernels help improve the explainability of predictive models  .
Revised:  Moreover, the provenance types used in provenance kernels help improve the explainability of predictive models .
Edit intent: coherence
Original:  Moreover, we illustrate how the provenance types used in provenance kernels help improve the explainability of predictive models  .
Revised:  Moreover, we illustrate how the provenance types used by provenance kernels also help improve the explainability of predictive models .
Edit intent: clarity
Original:  This practice is known - in fact, obvious - and accepted in ML research.
Revised:  This practice is known--in fact, obvious--and accepted in ML research.
Edit intent: fluency
Original:  I show that, in existing papers published in top venues, once normative assumptions are clarified, it is often possible to get muddled results.
Revised:  I show that, in existing papers published in top venues, once normative assumptions are clarified, it is often possible to get unclear or contradictory results.
Edit intent: clarity
Original:  [STACS ~ '20] provided a 2^{O(\Delta\nu)}\cdot |{\mathcal G}|^{O(1)}-time algorithm to compute the maximum size of \Delta-temporal matching in a temporal graph \mathcal G, where |\mathcal G| denotes the size of \mathcal G, and \nu is the \Delta-vertex cover number of \mathcal G. The \Delta-vertex cover number is the minimum number of vertices which are needed to hit (or cover) all edges in any \Delta consecutive layers of the temporal graph.
Revised:  [STACS '20] provided a 2^{O(\Delta\nu)}\cdot |{\mathcal G}|^{O(1)}-time algorithm to compute the maximum size of \Delta-temporal matching in a temporal graph \mathcal G, where |\mathcal G| denotes the size of \mathcal G, and \nu is the \Delta-vertex cover number of \mathcal G. The \Delta-vertex cover number is the minimum number of vertices which are needed to hit (or cover) all edges in any \Delta consecutive layers of the temporal graph.
Edit intent: fluency
Original: A temporal graph is a sequence of graphs (called layers) over the same vertex set---describing a graph topology which is subject to discrete changes over time.
Revised: A temporal graph is a sequence of graphs (called layers) over the same vertex set -- describing a graph topology which is subject to discrete changes over time.
Edit intent: fluency
Original:  We propose new security properties that are relevant for such systems, namely, platform-wide attestation and platform awareness.
Revised:  We propose new security properties relevant to such systems: platform-wide attestation and platform awareness.
Edit intent: coherence
Original:  These properties allow a remote verifier to verify the current state and to define how the enclave reacts upon a change in connected peripherals.
Revised:  These properties allow a remote verifier to verify the enclave reacts upon a change in connected peripherals.
Edit intent: clarity
Original: While modern computing architectures rely on specialized hardwaresuch as accelerators to provide performance and functionality, trusted execution environments (TEEs), one of the most promising recent developments in  security, can only protect code confined in the CPU, limiting TEEs  potential and applicability to a handful of applications.
Revised: The ever-rising computation demand is forcing the move from the CPU to heterogeneous specialized hardware, which is readily available across modern datacenters through disaggregated infrastructure. On the other hand, trusted execution environments (TEEs), one of the most promising recent developments in security, can only protect code confined in the CPU, limiting TEEs potential and applicability to a handful of applications.
Edit intent: coherence
Original: While modern computing architectures rely on specialized hardwaresuch as accelerators to provide performance and functionality, trusted execution environments (TEEs), one of the most promising recent developments in  security, can only protect code confined in the CPU, limiting TEEs  potential and applicability to a handful of applications.
Revised: While modern computing architectures rely on specialized hardwaresuch as accelerators to provide performance and functionality, trusted execution environments (TEEs), one of the most promising recent developments in security, can only protect code confined in the CPU, limiting TEEs ' potential and applicability to a handful of applications.
Edit intent: fluency
Original:  We observe that the TEEs' hardware trusted computing base (TCB) is fixed at design time, forcing users to rely on (mostly untrustworthy) software to allow peripherals into the TEE . Based on this observation, we propose PIE, a secure platform design with a configurable hardware and software TCB, which allows us to support specialized hardware while ensuring the least privilege principle.
Revised:  We observe that the TEEs' hardware trusted computing base (TCB) is fixed at design time, which in practice leads to using untrusted software to employ peripherals in TEEs . Based on this observation, we propose PIE, a secure platform design with a configurable hardware and software TCB, which allows us to support specialized hardware while ensuring the least privilege principle.
Edit intent: clarity
Original:  We observe that the TEEs' hardware trusted computing base (TCB) is fixed at design time, forcing users to rely on (mostly untrustworthy) software to allow peripherals into the TEE . Based on this observation, we propose PIE, a secure platform design with a configurable hardware and software TCB, which allows us to support specialized hardware while ensuring the least privilege principle.
Revised:  We observe that the TEEs' hardware trusted computing base (TCB) is fixed at design time, forcing users to rely on (mostly untrustworthy) software to allow peripherals into the TEE . Based on this observation, we propose composite enclaves with a configurable hardware and software TCB, which allows us to support specialized hardware while ensuring the least privilege principle.
Edit intent: clarity
Original: We continue to analyze matching of some basic constraints on human's decision making with quantum theory of measurement.
Revised: We continue to analyze basic constraints on human's decision making with quantum theory of measurement.
Edit intent: clarity
Original:  As was found, quantum measurement theory based on the projection postulate does not match with combination of the question order effect (QOE) and the response replicability effect (RRE).
Revised:  As was found, quantum measurement theory based on the projection postulate cannot account for the combination of the question order effect (QOE) and the response replicability effect (RRE).
Edit intent: clarity
Original:  This was the alarm signal for quantum-like modeling of decision making.
Revised:  This was alarming finding for quantum-like modeling of decision making.
Edit intent: clarity
Original:  Recently, it was shown that this objection to quantum-like modeling can be removed on the basis of the general measurement theory based on quantum instruments.
Revised:  Recently, it was shown that this difficulty can be resolved by using of the general measurement theory based on quantum instruments.
Edit intent: clarity
Original:  Recently, it was shown that this objection to quantum-like modeling can be removed on the basis of the general measurement theory based on quantum instruments.
Revised:  Recently, it was shown that this objection to quantum-like modeling can be removed on the basis of the general QMT based on quantum instruments.
Edit intent: clarity
Original:  In the present paper , the problem of combination QOE, RRE with the famous QQ-equality is analyzed .
Revised:  In the present paper we analyse the problem of combination QOE, RRE with the famous QQ-equality is analyzed .
Edit intent: clarity
Original:  In the present paper , the problem of combination QOE, RRE with the famous QQ-equality is analyzed .
Revised:  In the present paper , the problem of the combination of QOE, RRE with the famous QQ-equality is analyzed .
Edit intent: fluency
Original:  In the present paper , the problem of combination QOE, RRE with the famous QQ-equality is analyzed .
Revised:  In the present paper , the problem of combination QOE, RRE , and the well-known QQ-equality is analyzed .
Edit intent: clarity
Original:  This equality was derived by Busemeyer and Wang and it was shown (in the joint paper with Solloway and Shiffrin) that statistical data from many social opinion polls satisfies it.
Revised:  This equality was derived by Busemeyer and Wang and it was shown (in a joint paper with Solloway and Shiffrin) that statistical data from many social opinion polls satisfies it.
Edit intent: fluency