wanyu/IteraTeR_v2 huggingface dataset:
Original:  To improve efficiency, information systems may invoke signaling  so that whenever a suspicious access request occurs, the system can, in real time, warn the user that the access may be audited.
Revised:  To improve efficiency, information systems may invoke signaling , so that whenever a suspicious access request occurs, the system can, in real time, warn the user that the access may be audited.
Edit intent: fluency
Original:  At the end of some period, a selected subset of suspicious accesses is then audited.
Revised:  Then, at the close of a finite period, a selected subset of suspicious accesses is then audited.
Edit intent: clarity
Original:  At the end of some period, a selected subset of suspicious accesses is then audited.
Revised:  At the end of some period, a selected subset of suspicious accesses are audited.
Edit intent: clarity
Original:  This gives rise to an online problem in which one needs to determine 1) whether a warning should be triggered and 2) the likelihood that the event of data request will be audited.
Revised:  This gives rise to an online problem in which one needs to determine 1) whether a warning should be triggered and 2) the likelihood that the data request event will be audited.
Edit intent: clarity
Original:  In this work, we formulate this problem as a Signaling Audit Game (SAG),  study the properties of its Stackelberg equilibria , and develop a scalable approach to compute its solution.
Revised:  In this paper, we formalize this auditing problem as a Signaling Audit Game (SAG), study the properties of its Stackelberg equilibria , and develop a scalable approach to compute its solution.
Edit intent: clarity
Original:  In this work, we formulate this problem as a Signaling Audit Game (SAG),  study the properties of its Stackelberg equilibria , and develop a scalable approach to compute its solution.
Revised:  In this work, we formulate this problem as a Signaling Audit Game (SAG), study the properties of its Stackelberg equilibria and develop a scalable approach to compute its solution.
Edit intent: fluency
Original:  We show that an intelligent presentation of warnings adds value in that SAGs can realize significantly higher utility for the auditor than systems without signaling.
Revised:  We show that a strategic presentation of warnings adds value in that SAGs can realize significantly higher utility for the auditor than systems without signaling.
Edit intent: clarity
Original:  We show that an intelligent presentation of warnings adds value in that SAGs can realize significantly higher utility for the auditor than systems without signaling.
Revised:  We show that an intelligent presentation of warnings adds value in that SAGs realize significantly higher utility for the auditor than systems without signaling.
Edit intent: clarity
Original:  We perform an analysis over 10 million real access events in a large academic medical center to illustrate the value of our approach .
Revised:  We illustrate the value of our approach .
Edit intent: clarity
Original: In this work we obtain a priori, a posteriori  and mixed type upper bounds for the absolute change in Ritz values of Rayleigh quotients of self-adjoint matrices in terms of submajorization relations  . Some of our results solve recent conjectures by Knyazev, Argentati  and Zhu, that extend several known results for one dimensional subspaces to arbitrary subspaces.
Revised: A priori, a posteriori and mixed type upper bounds for the absolute change in Ritz values of Rayleigh quotients of self-adjoint matrices in terms of submajorization relations . Some of our results solve recent conjectures by Knyazev, Argentati and Zhu, that extend several known results for one dimensional subspaces to arbitrary subspaces.
Edit intent: clarity
Original: In this work we obtain a priori, a posteriori  and mixed type upper bounds for the absolute change in Ritz values of Rayleigh quotients of self-adjoint matrices in terms of submajorization relations  . Some of our results solve recent conjectures by Knyazev, Argentati  and Zhu, that extend several known results for one dimensional subspaces to arbitrary subspaces.
Revised: In this work we obtain a priori, a posteriori , and mixed type upper bounds for the absolute change in Ritz values of Rayleigh quotients of self-adjoint matrices in terms of submajorization relations . Some of our results solve recent conjectures by Knyazev, Argentati and Zhu, that extend several known results for one dimensional subspaces to arbitrary subspaces.
Edit intent: fluency
Original: In this work we obtain a priori, a posteriori  and mixed type upper bounds for the absolute change in Ritz values of Rayleigh quotients of self-adjoint matrices in terms of submajorization relations  . Some of our results solve recent conjectures by Knyazev, Argentati  and Zhu, that extend several known results for one dimensional subspaces to arbitrary subspaces.
Revised: In this work we obtain a priori, a posteriori and mixed type upper bounds for the absolute change in Ritz values of self-adjoint matrices in terms of submajorization relations . Some of our results solve recent conjectures by Knyazev, Argentati and Zhu, that extend several known results for one dimensional subspaces to arbitrary subspaces.
Edit intent: clarity
Original: In this work we obtain a priori, a posteriori  and mixed type upper bounds for the absolute change in Ritz values of Rayleigh quotients of self-adjoint matrices in terms of submajorization relations  . Some of our results solve recent conjectures by Knyazev, Argentati  and Zhu, that extend several known results for one dimensional subspaces to arbitrary subspaces.
Revised: In this work we obtain a priori, a posteriori and mixed type upper bounds for the absolute change in Ritz values of Rayleigh quotients of self-adjoint matrices in terms of submajorization relations are obtained . Some of our results solve recent conjectures by Knyazev, Argentati and Zhu, that extend several known results for one dimensional subspaces to arbitrary subspaces.
Edit intent: clarity
Original: In this work we obtain a priori, a posteriori  and mixed type upper bounds for the absolute change in Ritz values of Rayleigh quotients of self-adjoint matrices in terms of submajorization relations  . Some of our results solve recent conjectures by Knyazev, Argentati  and Zhu, that extend several known results for one dimensional subspaces to arbitrary subspaces.
Revised: In this work we obtain a priori, a posteriori and mixed type upper bounds for the absolute change in Ritz values of Rayleigh quotients of self-adjoint matrices in terms of submajorization relations . Some of our results prove recent conjectures by Knyazev, Argentati and Zhu, that extend several known results for one dimensional subspaces to arbitrary subspaces.
Edit intent: clarity
Original: In this work we obtain a priori, a posteriori  and mixed type upper bounds for the absolute change in Ritz values of Rayleigh quotients of self-adjoint matrices in terms of submajorization relations  . Some of our results solve recent conjectures by Knyazev, Argentati  and Zhu, that extend several known results for one dimensional subspaces to arbitrary subspaces.
Revised: In this work we obtain a priori, a posteriori and mixed type upper bounds for the absolute change in Ritz values of Rayleigh quotients of self-adjoint matrices in terms of submajorization relations . Some of our results solve recent conjectures by Knyazev, Argentati , and Zhu, that extend several known results for one dimensional subspaces to arbitrary subspaces.
Edit intent: fluency
Original: In this work we obtain a priori, a posteriori  and mixed type upper bounds for the absolute change in Ritz values of Rayleigh quotients of self-adjoint matrices in terms of submajorization relations  . Some of our results solve recent conjectures by Knyazev, Argentati  and Zhu, that extend several known results for one dimensional subspaces to arbitrary subspaces.
Revised: In this work we obtain a priori, a posteriori and mixed type upper bounds for the absolute change in Ritz values of Rayleigh quotients of self-adjoint matrices in terms of submajorization relations . Some of our results solve recent conjectures by Knyazev, Argentati and Zhu, which extend several known results for one dimensional subspaces to arbitrary subspaces.
Edit intent: fluency
Original:  In particular, we revisit Nakatsukasa's version of the \tan \Theta theorem of Davies and Kahanand obtain an improved version of this result .
Revised:  In addition, we improve Nakatsukasa's version of the \tan \Theta theorem of Davies and Kahanand obtain an improved version of this result .
Edit intent: clarity
Original:  In particular, we revisit Nakatsukasa's version of the \tan \Theta theorem of Davies and Kahanand obtain an improved version of this result .
Revised:  In particular, we revisit Nakatsukasa's version of the \tan \Theta theorem of Davis and Kahan .
Edit intent: clarity
Original:  As a consequence, we obtain improved quadratic a posteriori bounds for the absolute change in Ritz values of Rayleigh quotients .
Revised:  As a consequence, we obtain new quadratic a posteriori bounds for the absolute change in Ritz values of Rayleigh quotients .
Edit intent: clarity
Original:  As a consequence, we obtain improved quadratic a posteriori bounds for the absolute change in Ritz values of Rayleigh quotients .
Revised:  As a consequence, we obtain improved quadratic a posteriori bounds for the absolute change in Ritz values .
Edit intent: clarity
Original: This work is devoted to the development and analysis of a linearization algorithm that can be used for the numerical implementation of microscopic elliptic equations, with scaled degenerate production, posed in a perforated medium and constrained by the homogeneous Neumann-Dirichlet boundary conditions.
Revised: This work is devoted to the development and analysis of a linearization algorithm for microscopic elliptic equations, with scaled degenerate production, posed in a perforated medium and constrained by the homogeneous Neumann-Dirichlet boundary conditions.
Edit intent: clarity
Original:  In particular, we give an optimal \Omega( \varepsilon ^{-2}\log(N) \log \log(mM)) bits of space lower bound for the fundamental problem of (1\pm \varepsilon )-approximating the number \|x\|_0 of non-zero entries of an n-dimensional vector x after m  updates each of magnitude  M, and with success probability \ge 2/3, in a strict turnstile stream.
Revised:  In particular, we give an optimal \Omega( \varepsilon ^{-2}\log(N) \log \log(mM)) bits of space lower bound for the fundamental problem of (1\pm \varepsilon )-approximating the number \|x\|_0 of non-zero entries of an n-dimensional vector x after m integer updates each of magnitude M, and with success probability \ge 2/3, in a strict turnstile stream.
Edit intent: clarity
Original:  In particular, we give an optimal \Omega( \varepsilon ^{-2}\log(N) \log \log(mM)) bits of space lower bound for the fundamental problem of (1\pm \varepsilon )-approximating the number \|x\|_0 of non-zero entries of an n-dimensional vector x after m  updates each of magnitude  M, and with success probability \ge 2/3, in a strict turnstile stream.
Revised:  In particular, we give an optimal \Omega( \varepsilon ^{-2}\log(N) \log \log(mM)) bits of space lower bound for the fundamental problem of (1\pm \varepsilon )-approximating the number \|x\|_0 of non-zero entries of an n-dimensional vector x after m updates each of magnitude at most M, and with success probability \ge 2/3, in a strict turnstile stream.
Edit intent: clarity
Original:  Our results match } the best known upper bound when \varepsilon \ge 1/ \mathsf{polylog (mM)  . It also improves on the prior \Omega( \varepsilon ^{-2}\log(mM) ) lower bound and separates the complexity of approximating L_0 from approximating the p-norm L_p for p bounded away from 0, since the latter has an O( \varepsilon ^{-2}\log (mM)) bit upper bound.
Revised:  Our results match } the best known upper bounds when \epsilon \ge 1/ \mathsf{polylog (mM) . It also improves on the prior \Omega( \varepsilon ^{-2}\log(mM) ) lower bound and separates the complexity of approximating L_0 from approximating the p-norm L_p for p bounded away from 0, since the latter has an O( \varepsilon ^{-2}\log (mM)) bit upper bound.
Edit intent: clarity
Original:  Our results match } the best known upper bound when \varepsilon \ge 1/ \mathsf{polylog (mM)  . It also improves on the prior \Omega( \varepsilon ^{-2}\log(mM) ) lower bound and separates the complexity of approximating L_0 from approximating the p-norm L_p for p bounded away from 0, since the latter has an O( \varepsilon ^{-2}\log (mM)) bit upper bound.
Revised:  Our results match } the best known upper bound when \varepsilon \ge 1/ (mM) . It also improves on the prior \Omega( \varepsilon ^{-2}\log(mM) ) lower bound and separates the complexity of approximating L_0 from approximating the p-norm L_p for p bounded away from 0, since the latter has an O( \varepsilon ^{-2}\log (mM)) bit upper bound.
Edit intent: clarity
Original:  Our results match } the best known upper bound when \varepsilon \ge 1/ \mathsf{polylog (mM)  . It also improves on the prior \Omega( \varepsilon ^{-2}\log(mM) ) lower bound and separates the complexity of approximating L_0 from approximating the p-norm L_p for p bounded away from 0, since the latter has an O( \varepsilon ^{-2}\log (mM)) bit upper bound.
Revised:  Our results match } the best known upper bound when \varepsilon \ge 1/ \mathsf{polylog (mM) . It also improves on the prior \Omega( \varepsilon ^{-2}\log(mM) ) lower bound and separates the complexity of approximating L_0 from approximating the p-norm L_p for p bounded away from 0, since the latter has an O( \epsilon ^{-2}\log (mM)) bit upper bound.
Edit intent: clarity
Original:  The long search for an optimal complementation construction for B\"uchi automata climaxed with the work of Schewe, who proposed a worst-case optimal rank-based procedure that generates complements of a size matching the theoretical lower bound of (0.76n) n , modulo a polynomial factor of O( n2 ).
Revised:  The long search for an optimal complementation construction climaxed with the work of Schewe, who proposed a worst-case optimal rank-based procedure that generates complements of a size matching the theoretical lower bound of (0.76n) n , modulo a polynomial factor of O( n2 ).
Edit intent: clarity
Original:  The long search for an optimal complementation construction for B\"uchi automata climaxed with the work of Schewe, who proposed a worst-case optimal rank-based procedure that generates complements of a size matching the theoretical lower bound of (0.76n) n , modulo a polynomial factor of O( n2 ).
Revised:  The long search for an optimal complementation construction for B\"uchi automata climaxed with the work of Schewe, who proposed a worst-case optimal rank-based procedure that generates complements of a size matching the theoretical lower bound of (0.76n) ^n , modulo a polynomial factor of O( n2 ).
Edit intent: clarity
Original:  The long search for an optimal complementation construction for B\"uchi automata climaxed with the work of Schewe, who proposed a worst-case optimal rank-based procedure that generates complements of a size matching the theoretical lower bound of (0.76n) n , modulo a polynomial factor of O( n2 ).
Revised:  The long search for an optimal complementation construction for B\"uchi automata climaxed with the work of Schewe, who proposed a worst-case optimal rank-based procedure that generates complements of a size matching the theoretical lower bound of (0.76n) n , modulo a polynomial factor of O( n^2 ).
Edit intent: clarity
Original:  An example application is Isabelle/MMT, which is able to turn all of Isabelle + AFP into OMDoc and RDF triples, but it is easy to reuse the Isabelle technology for other applications.
Revised:  An example application is Isabelle/MMT, which is able to turn all of Isabelle + AFP into OMDoc and RDF triples, but it is straight-forward to reuse the Isabelle technology for other applications.
Edit intent: clarity
Original: Latest algorithms for automatic neural architecture search perform remarkable but  basically directionless in search space and computational expensive in the training of every intermediate architecture.
Revised: Latest algorithms for automatic neural architecture search perform remarkable but are basically directionless in search space and computational expensive in the training of every intermediate architecture.
Edit intent: fluency
Original: Latest algorithms for automatic neural architecture search perform remarkable but  basically directionless in search space and computational expensive in the training of every intermediate architecture.
Revised: Latest algorithms for automatic neural architecture search perform remarkable but basically directionless in search space and computational expensive in training of every intermediate architecture.
Edit intent: fluency
Original:  In this paper, we propose a method for efficient architecture search called EENA (Efficient Evolution of Neural Architecture) with mutation and crossover operations  guided by the information have already been learned to speed up this process and consume less computational effort by reducing redundant searching and training  .
Revised:  In this paper, we propose a method for efficient architecture search called EENA (Efficient Evolution of Neural Architecture) with mutation and crossover operations guided by the information have already been learned . Therefore, less computational effort by reducing redundant searching and training .
Edit intent: coherence
Original:  In this paper, we propose a method for efficient architecture search called EENA (Efficient Evolution of Neural Architecture) with mutation and crossover operations  guided by the information have already been learned to speed up this process and consume less computational effort by reducing redundant searching and training  .
Revised:  In this paper, we propose a method for efficient architecture search called EENA (Efficient Evolution of Neural Architecture) with mutation and crossover operations guided by the information have already been learned to speed up this process and consume less computational effort will be required while the searching and training .
Edit intent: coherence
Original:  Furthermore, The best architecture discovered is also transferable for CIFAR-100.
Revised:  Furthermore, the best architecture discovered is also transferable for CIFAR-100.
Edit intent: fluency
Original:  In this paper we explore a research direction which has been surprisingly neglected in the literature: leveraging noisy user-generated text to learn cross-lingual embeddings particularly tailored towards social media applications.
Revised:  In this paper we explore a research direction that has been surprisingly neglected in the literature: leveraging noisy user-generated text to learn cross-lingual embeddings particularly tailored towards social media applications.
Edit intent: fluency
Original:  Our contribution consists in a very simple post-processing step that exploits these phenomena to significantly improve the performance of state-of-the-art alignment methods.
Revised:  Our contribution consists of a very simple post-processing step that exploits these phenomena to significantly improve the performance of state-of-the-art alignment methods.
Edit intent: fluency
Original:  Our main result is a factorisation of RelCoCat models through free cartesian bicategories, as a corollary we get a logspace reduction from the semantics problem to the evaluation of conjunctive queries  .
Revised:  Our main result is a factorisation of RelCoCat models through free cartesian bicategories, as a corollary we get logspace reductions from semantics and entailment to evaluation and containment of conjunctive queries .
Edit intent: clarity
Original:  We show that RelCoCat models factorise through Cartesian bicategories, as a corollary we get logspace reductions from semantics and entailment  to evaluation and containment of conjunctive queries  respectively.
Revised:  We show that RelCoCat models factorise through Cartesian bicategories, as a corollary we get logspace reductions from semantics and entailment to evaluation and containment of conjunctive queries , respectively.
Edit intent: fluency
Original: We present a method for randomizing a formula for bilinear computation of matrix products.
Revised: We present a method for randomizing formulas for bilinear computation of matrix products.
Edit intent: fluency
Original:  We consider the implications of such randomization when  the formula itself is approximate, and when the formula is exact but its computation is plagued by numerical error due to finite precision arithmetic.
Revised:  We consider the implications of such randomization when the formula itself only being approximately correct, and one due to using floating point arithmetic.
Edit intent: clarity
Original:  However, these are either limited to adding structural patterns or augmenting coarse flows with turbulence structures, and hence cannot capture the full spectrum of different styles and semantically complex structures.
Revised:  However, these are either limited to adding structural patterns or augmenting coarse flows with turbulent structures, and hence cannot capture the full spectrum of different styles and semantically complex structures.
Edit intent: fluency
Original:  In this paper, we propose the first transport-based Neural Style Transfer (TNST) algorithm for volumetric smoke data.
Revised:  In this paper, we propose the first Transport-based Neural Style Transfer (TNST) algorithm for volumetric smoke data.
Edit intent: fluency
Original: One of the basic characteristics of any physical system is its response to small perturbations.
Revised: Diverse physical systems are characterized by their response to small perturbations.
Edit intent: clarity
Original:  For instance, response is used to quantify material properties--such as conductivity and viscoelasticity--the sensing capability of cells, and the accuracy of biomolecular processes.
Edit intent: coherence
Original:  Near thermodynamic equilibrium, response is completely determined by the nature of spontaneous fluctuations, according to the fluctuation-dissipation theorem (FDT).
Revised:  Near thermodynamic equilibrium, the fluctuation-dissipation theorem (FDT).
Edit intent: clarity
Original:  In this work, we present equalities and inequalities--akin to the FDT but valid arbitrarily far from equilibrium--that link response to the strength of nonequilibrium driving.
Revised:  In this spirit, we derive here a collection of equalities and inequalities valid arbitrarily far from equilibrium--that link response to the strength of nonequilibrium driving.
Edit intent: clarity
Original:  Our results open new possibilities to experimentally characterize away-from-equilibrium response and suggest design principles for high-sensitivity, low-noise devices .
Revised:  Our work opens new avenues for characterizing nonequilibrium response .
Edit intent: clarity
Original:  Recently, a raw audio waveform separation network (TasNet)  introduced for single-channel data, with achieving high Si-SNR (scale-invariant source-to-noise ratio) and SDR (source-to-distortion ratio) comparing against the state-of-the-art solution in frequency-domain.
Revised:  Recently, a raw audio waveform separation network (TasNet) is introduced for single-channel data, with achieving high Si-SNR (scale-invariant source-to-noise ratio) and SDR (source-to-distortion ratio) comparing against the state-of-the-art solution in frequency-domain.
Edit intent: coherence
Original:  In this study, we incorporate effective components of  TasNet into a frequency-domain separation method.
Revised:  In this study, we incorporate effective components of the TasNet into a frequency-domain separation method.
Edit intent: fluency