wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our results show that our approach leads to significantly better results regarding mental models, explanation satisfaction, trust, emotions, and self-efficacy than two state-of-the art systems that work with saliency maps, namely LIME and LRP.
Revised:  Our results show that our approach leads to significantly better results regarding mental models, explanation satisfaction, trust, emotions, and self-efficacy than two state-of-the-art systems that work with saliency maps, namely LIME and LRP.
Edit intent: fluency
Original: Long Short-Term Memory (LSTM) models are the building blocks of many state-of-art algorithms for Natural Language Processing (NLP).
Revised: Long Short-Term Memory (LSTM) models are the building blocks of many state-of-the-art algorithms for Natural Language Processing (NLP).
Edit intent: fluency
Original:  In the absence of answer ordering, such a construction has been devised for the task  enumerating query answers of free-connex acyclic CQs, so that the access time is logarithmic.
Revised:  In the absence of answer ordering, such a construction has been devised for the task of enumerating query answers of free-connex acyclic CQs, so that the access time is logarithmic.
Edit intent: fluency
Original:  In this work, we embark on the challenge of identifying the  answer orderings that allow for ranked direct access with the above complexity guarantees.
Revised:  In this work, we embark on the challenge of identifying the tractable answer orderings that allow for ranked direct access with the above complexity guarantees.
Edit intent: clarity
Original:  In this work, we embark on the challenge of identifying the  answer orderings that allow for ranked direct access with the above complexity guarantees.
Revised:  In this work, we embark on the challenge of identifying the answer orderings that allow for ranked direct access with such complexity guarantees.
Edit intent: clarity
Original:  We begin with the class of lexicographic orderings and give a decidable characterization  of the class of feasible such orderings for every CQ without self-joins.
Revised:  We begin with lexicographic orderings and give a decidable characterization of the class of feasible such orderings for every CQ without self-joins.
Edit intent: fluency
Original:  We begin with the class of lexicographic orderings and give a decidable characterization  of the class of feasible such orderings for every CQ without self-joins.
Revised:  We begin with the class of lexicographic orderings and give a decidable characterization of the class of tractable lexicographic orderings for every CQ without self-joins.
Edit intent: clarity
Original:  We then continue to the more general case of orderings by the sum of attribute scores.
Revised:  We then continue to the more general orderings by the sum of attribute scores.
Edit intent: clarity
Original:  As it turns out, in this case ranked direct access is feasible only in trivial cases.
Revised:  As it turns out, in this case ranked direct access is tractable only in trivial cases.
Edit intent: clarity
Original:  Hence, to better understand the computational challenge at hand, we consider the more modest task of providing access to only one single answer (i.e., finding the answer at a given position)  .
Revised:  Hence, to better understand the computational challenge at hand, we consider the more modest task of providing access to only a single answer (i.e., finding the answer at a given position) .
Edit intent: clarity
Original:  In particular, we propose our approach using the transformer-based ensemble based on COVID-Twitter-BERT (CT-BERT)  .
Revised:  In particular, we propose our approach using the transformer-based ensemble of COVID-Twitter-BERT (CT-BERT) .
Edit intent: clarity
Original:  In particular, we propose our approach using the transformer-based ensemble based on COVID-Twitter-BERT (CT-BERT)  .
Revised:  In particular, we propose our approach using the transformer-based ensemble based on COVID-Twitter-BERT (CT-BERT) models .
Edit intent: clarity
Original:  In this paper  we propose a game-theoretic framework to formalize strategies of attacker and defender in the context of information leakage, and provide a basis for developing optimal defense methods.
Revised:  In this paper , we propose a game-theoretic framework to formalize strategies of attacker and defender in the context of information leakage, and provide a basis for developing optimal defense methods.
Edit intent: fluency
Original:  A crucial novelty of our games is that their utility is given by information leakage, which in some cases may behave in a non-linear way.
Revised:  A novelty of our games is that their utility is given by information leakage, which in some cases may behave in a non-linear way.
Edit intent: clarity
Original:  We consider two main categories of games, depending on the particular notion of information leakage being captured .
Revised:  We consider two kinds of games, depending on the particular notion of information leakage being captured .
Edit intent: clarity
Original:  We consider two main categories of games, depending on the particular notion of information leakage being captured .
Revised:  We consider two main categories of games, depending on the notion of leakage considered .
Edit intent: clarity
Original:  The first category, which we call QIF-games, is tailored for the theory of quantitative information flow (QIF).
Revised:  The first kind, the QIF-games, is tailored for the theory of quantitative information flow (QIF).
Edit intent: clarity
Original:  The second one, which we call DP-games, corresponds to differential privacy (DP).
Revised:  The second one, the DP-games, corresponds to differential privacy (DP).
Edit intent: clarity
Original: A connected graph K has a modulo 2 embedding to the sphere with g handles if and only if there is a general position PL map f of K in the plane and a symmetric square matrix A of size |E(K)| with modulo 2 entries and zeros on the diagonal such that rk A \leq 2g and A_{\sigma, \tau = |f\sigma \cap f\tau| mod 2 for any non-adjacent edges \sigma, \tau.
Revised: The study of graph drawings on 2-surfaces is an active area of mathematical research. Our main results are criteria for integer and modulo 2 entries and zeros on the diagonal such that rk A \leq 2g and A_{\sigma, \tau = |f\sigma \cap f\tau| mod 2 for any non-adjacent edges \sigma, \tau.
Edit intent: clarity
Original: A connected graph K has a modulo 2 embedding to the sphere with g handles if and only if there is a general position PL map f of K in the plane and a symmetric square matrix A of size |E(K)| with modulo 2 entries and zeros on the diagonal such that rk A \leq 2g and A_{\sigma, \tau = |f\sigma \cap f\tau| mod 2 for any non-adjacent edges \sigma, \tau.
Revised: A connected graph K has a modulo 2 embedding to the sphere with g handles if and only if there is a general position PL map f of K in the plane and a symmetric square matrix A of size |E(K)| with modulo 2 = |f\sigma \cap f\tau| mod 2 for any non-adjacent edges \sigma, \tau.
Edit intent: clarity
Original: We study nonparametric Bayesian modelling of reversible multi-dimensional diffusions with periodic drift.
Revised: We study nonparametric Bayesian models for reversible multi-dimensional diffusions with periodic drift.
Edit intent: fluency
Original:  For continuous observations paths, reversibility is exploited to prove a general posterior contraction rate theorem for the drift gradient vector field under approximation-theoretic conditions on the induced prior for the invariant measure.
Revised:  For continuous observation paths, reversibility is exploited to prove a general posterior contraction rate theorem for the drift gradient vector field under approximation-theoretic conditions on the induced prior for the invariant measure.
Edit intent: fluency
Original: Identifying cause-effect relation among variables is a key step in the decision-making process.
Revised: Identifying cause-effect relations among variables is a key step in the decision-making process.
Edit intent: fluency
Original:  In many cases, the proposed algorithms achieve global optimal solution .
Revised:  In many cases, the proposed algorithms achieve global optimal solutions .
Edit intent: fluency
Original:  CPL's distinctive features are Concealed Pointer Lookup, the ability to implicitly dereference pointers based on the type of operands involved, Consistent Procedure Linkage, the enforcement of function prototypes without dedicated header or interface files, and Custom Parameter Lists, the ability to overload function names which are  distinguished by the type of their parameters and/or parameter separators.
Revised:  CPL's distinctive features are Concealed Pointer Lookup, the ability to implicitly dereference pointers based on the type of operands involved, Consistent Procedure Linkage, the enforcement of function prototypes without dedicated header or interface files, and Custom Parameter Lists, the ability to overload function names which are then distinguished by the type of their parameters and/or parameter separators.
Edit intent: coherence
Original:  In this paper, through a detailed analysis of the read mechanism and rigorous characterization of 160 real 3D NAND flash  chips, we find new opportunities to reduce the read-retry latency by exploiting two advanced features widely adopted in modern NAND flash-based SSDs: ( 1) the CACHE READ command and ( 2) strong ECC engine.
Revised:  In this paper, through a detailed analysis of the read mechanism and rigorous characterization of 160 real 3D NAND flash memory chips, we find new opportunities to reduce the read-retry latency by exploiting two advanced features widely adopted in modern NAND flash-based SSDs: ( 1) the CACHE READ command and ( 2) strong ECC engine.
Edit intent: clarity
Original:  In this paper, through a detailed analysis of the read mechanism and rigorous characterization of 160 real 3D NAND flash  chips, we find new opportunities to reduce the read-retry latency by exploiting two advanced features widely adopted in modern NAND flash-based SSDs: ( 1) the CACHE READ command and ( 2) strong ECC engine.
Revised:  In this paper, through a detailed analysis of the read mechanism and rigorous characterization of 160 real 3D NAND flash chips, we find new opportunities to reduce the read-retry latency by exploiting two advanced features widely adopted in modern NAND flash-based SSDs: 1) the CACHE READ command and ( 2) strong ECC engine.
Edit intent: fluency
Original:  In this paper, through a detailed analysis of the read mechanism and rigorous characterization of 160 real 3D NAND flash  chips, we find new opportunities to reduce the read-retry latency by exploiting two advanced features widely adopted in modern NAND flash-based SSDs: ( 1) the CACHE READ command and ( 2) strong ECC engine.
Revised:  In this paper, through a detailed analysis of the read mechanism and rigorous characterization of 160 real 3D NAND flash chips, we find new opportunities to reduce the read-retry latency by exploiting two advanced features widely adopted in modern NAND flash-based SSDs: ( 1) the CACHE READ command and 2) strong ECC engine.
Edit intent: fluency
Original:  Based on our new findings, we develop two new techniques that effectively reduce the read-retry latency: ( 1) Pipelined Read-Retry (PR^2) and ( 2) Adaptive Read-Retry (AR^2).
Revised:  Based on our new findings, we develop two new techniques that effectively reduce the read-retry latency: 1) Pipelined Read-Retry (PR^2) and ( 2) Adaptive Read-Retry (AR^2).
Edit intent: fluency
Original:  Based on our new findings, we develop two new techniques that effectively reduce the read-retry latency: ( 1) Pipelined Read-Retry (PR^2) and ( 2) Adaptive Read-Retry (AR^2).
Revised:  Based on our new findings, we develop two new techniques that effectively reduce the read-retry latency: ( 1) Pipelined Read-Retry (PR^2) and 2) Adaptive Read-Retry (AR^2).
Edit intent: fluency
Original: In this tech report, we present the current state of our ongoing work on reconstructing Neural Radiance Fields ( NERF)of general non-rigid scenes via ray bending.
Revised: We present Non-Rigid Neural Radiance Fields ( NERF)of general non-rigid scenes via ray bending.
Edit intent: clarity
Original:  Non-rigid NeRF (NR-NeRF) takes RGB images of a deforming object ( e.g., from a monocular video ) as input and then learns a geometry and appearance representation that not only allows to reconstruct the input sequence but also to re-render any time step into novel camera views with high fidelity .
Revised:  Non-rigid NeRF (NR-NeRF) takes RGB images of a dynamic scene as input, e.g., from a monocular video ) as input and then learns a geometry and appearance representation that not only allows to reconstruct the input sequence but also to re-render any time step into novel camera views with high fidelity .
Edit intent: clarity
Original:  Non-rigid NeRF (NR-NeRF) takes RGB images of a deforming object ( e.g., from a monocular video ) as input and then learns a geometry and appearance representation that not only allows to reconstruct the input sequence but also to re-render any time step into novel camera views with high fidelity .
Revised:  Non-rigid NeRF (NR-NeRF) takes RGB images of a deforming object ( e.g., from a monocular video ) as input and then learns a geometry and appearance representation .
Edit intent: coherence
Original:  In addition , the resulting representation enables correspondence estimation across views and time, and provides rigidity scores for each point in the scene .
Revised:  In addition to novel view synthesis, our formulation enables dense correspondence estimation across views and time, and provides rigidity scores for each point in the scene .
Edit intent: clarity
Original:  We urge the reader to watch the supplemental videos for qualitative results.
Revised:  We urge the reader to watch the supplemental video for qualitative results.
Edit intent: fluency
Original:  We will release our code .
Revised:  Our code will be open sourced .
Edit intent: clarity
Original:  Our approach takes RGB images of a dynamic scene as input , e.g., from a monocular video recording  , and creates a high-quality space-time geometry and appearance representation.
Revised:  Our approach takes RGB images of a dynamic scene as input ( e.g., from a monocular video recording , and creates a high-quality space-time geometry and appearance representation.
Edit intent: fluency
Original:  Our approach takes RGB images of a dynamic scene as input , e.g., from a monocular video recording  , and creates a high-quality space-time geometry and appearance representation.
Revised:  Our approach takes RGB images of a dynamic scene as input , e.g., from a monocular video recording ) , and creates a high-quality space-time geometry and appearance representation.
Edit intent: fluency
Original:  In particular, we show that even a single handheld consumer-grade camera is sufficient to synthesize sophisticated renderings of a dynamic scene from novel virtual camera views, for example a `bullet-time' video effect.
Revised:  We show that a single handheld consumer-grade camera is sufficient to synthesize sophisticated renderings of a dynamic scene from novel virtual camera views, for example a `bullet-time' video effect.
Edit intent: coherence
Original:  In particular, we show that even a single handheld consumer-grade camera is sufficient to synthesize sophisticated renderings of a dynamic scene from novel virtual camera views, for example a `bullet-time' video effect.
Revised:  In particular, we show that even a single handheld consumer-grade camera is sufficient to synthesize sophisticated renderings of a dynamic scene from novel virtual camera views, e.g. a `bullet-time' video effect.
Edit intent: coherence
Original:  Scene deformation is implemented as ray bending, where straight rays are deformed non-rigidly to represent scene motion .
Revised:  Scene deformation is implemented as ray bending, where straight rays are deformed non-rigidly .
Edit intent: clarity
Original:  We also propose a novel rigidity regression network that enables us to better constrain rigid regions of the scene, which leads to more stable results.
Revised:  We also propose a novel rigidity network to better constrain rigid regions of the scene, which leads to more stable results.
Edit intent: clarity
Original:  We also propose a novel rigidity regression network that enables us to better constrain rigid regions of the scene, which leads to more stable results.
Revised:  We also propose a novel rigidity regression network that enables us to better constrain rigid regions of the scene, leading to more stable results.
Edit intent: coherence
Original:  The ray bending and rigidity network are trained without any explicit supervision.
Revised:  The ray bending and rigidity network are trained without explicit supervision.
Edit intent: clarity
Original:  In addition to novel view synthesis, our formulation enables dense correspondence estimation across views and time, as well as compelling video editing applications such as motion exaggeration .
Revised:  Our formulation enables dense correspondence estimation across views and time, as well as compelling video editing applications such as motion exaggeration .
Edit intent: clarity
Original:  In addition to novel view synthesis, our formulation enables dense correspondence estimation across views and time, as well as compelling video editing applications such as motion exaggeration .
Revised:  In addition to novel view synthesis, our formulation enables dense correspondence estimation across views and time, and compelling video editing applications such as motion exaggeration .
Edit intent: coherence
Original:  We create such a model assuming that  the concentration of airborne infectious particles is governed by an advection-diffusion-reaction equation .
Revised:  We create such a model assuming that the concentration of infectious particles is governed by an advection-diffusion-reaction equation .
Edit intent: clarity
Original:  Guided by these principles, we identify several opportunities for rights-respecting, socio-technical solutions to detect and confront online abuse, including ' nudging', ' quarantining', value sensitive design, counter-narratives, style transfer, and AI-driven public education applications.
Revised:  Guided by these principles, we identify several opportunities for rights-respecting, socio-technical solutions to detect and confront online abuse, including ` nudging', ' quarantining', value sensitive design, counter-narratives, style transfer, and AI-driven public education applications.
Edit intent: fluency
Original:  Guided by these principles, we identify several opportunities for rights-respecting, socio-technical solutions to detect and confront online abuse, including ' nudging', ' quarantining', value sensitive design, counter-narratives, style transfer, and AI-driven public education applications.
Revised:  Guided by these principles, we identify several opportunities for rights-respecting, socio-technical solutions to detect and confront online abuse, including ' nudging', ` quarantining', value sensitive design, counter-narratives, style transfer, and AI-driven public education applications.
Edit intent: fluency
Original:  However, most existing similarity-based methods follow the transductive setting.
Revised:  However, existing similarity-based methods follow the transductive setting.
Edit intent: clarity
Original:  Besides, many similarity-based methods, especially neighborhood-based ones, cannot handle directly all three types of interaction prediction.
Edit intent: coherence
Original:  To address these issues, we propose a new method denoted as Weighted k Nearest Neighbor with Interaction Recovery (WkNNIR).
Revised:  To address these issues, we propose a new method denoted as Weighted k-Nearest Neighbor with Interaction Recovery (WkNNIR).
Edit intent: fluency
Original:  Lastly, we confirm the practical prediction ability of proposed methods to discover reliable interactions that  not reported in the original benchmark datasets.
Revised:  Lastly, we confirm the practical prediction ability of proposed methods to discover reliable interactions that were not reported in the original benchmark datasets.
Edit intent: coherence
Original:  Using accessible mathematics, we present optimally tight bounds for quotient and remainder computations.
Revised:  We present optimally tight bounds for quotient and remainder computations.
Edit intent: clarity
Original:  However, low adoption rates is a major issue that prevents these apps from achieving their full potential.
Revised:  However, low adoption rates have become a major issue that prevents these apps from achieving their full potential.
Edit intent: clarity
Original:  Secondly, using this dataset, we conduct a comprehensive study on the multi-genre phenomenon, in particular the impact of the multi-genre challenge on speaker recognition , and on how to utilize the valuable multi-genre data more efficiently .
Revised:  Secondly, using this dataset, we conduct a comprehensive study on the multi-genre phenomenon, in particular the impact of the multi-genre challenge on speaker recognition , and on how to utilize the valuable multi-genre training .
Edit intent: clarity
Original:  This approach is based on the normalized likelihood (NL) scoring framework, and is theoretically optimal if the statistics on both the enrollment and test conditions are accurate .
Revised:  This approach is based on the normalized likelihood (NL) scoring framework, and is theoretically optimal .
Edit intent: clarity
Original:  A comprehensive experimental study was conducted on three datasets with different types of mismatch: (1) physical channel mismatch, (2) speaking style mismatch, (3) near-far recording mismatch.
Revised:  A comprehensive experimental study was conducted on three datasets with different types of mismatch: (1) physical channel mismatch, (2) speaking behavior mismatch, (3) near-far recording mismatch.
Edit intent: clarity
Original: Retrieving information from an online search engine  is the first and most important step in many data mining tasks.
Revised: Retrieving information from an online search engine , is the first and most important step in many data mining tasks.
Edit intent: fluency
Original:  The proposed algorithm interacts with the opaque search engine to iteratively improve the query.
Revised:  The proposed iterative query selection algorithm (IQS) interacts with the opaque search engine to iteratively improve the query.
Edit intent: clarity
Original: The behavior of sharing information on social media should be fulfilled when the user is exhibiting attentive behavior.
Revised: The behaviour of sharing information on social media should be fulfilled when the user is exhibiting attentive behavior.
Edit intent: fluency
Original: The behavior of sharing information on social media should be fulfilled when the user is exhibiting attentive behavior.
Revised: The behavior of sharing information on social media should be fulfilled only when a user is exhibiting attentive behavior.
Edit intent: clarity
Original:  Attentive behavior is related to users' cognitive abilities in the processing of set information.
Revised:  Attentive behavior is related to users' cognitive abilities in their processing of set information.
Edit intent: clarity
Original:  The work described in this paper examines the issue of attentive factors that affects the misinformation-sharing behavior of the user' s on social media.
Revised:  The work described in this paper examines the issue of attentive factors that affect users' behaviour when they share misinformation on social media.
Edit intent: clarity
Original:  This research aims to identify the significance of the prevailing attention factor towards sharing misinformation on social media.
Revised:  The research aims to identify the significance of the prevailing attention factor towards sharing misinformation on social media.
Edit intent: fluency