wanyu/IteraTeR_v2 huggingface dataset:
Original:  The model displays an important feature well known to practitioners that in a certain inventory range the market maker does not actually want to capitalize on this active trading opportunity but should rather ``internalize'' the flow by appropriately adjusting the quotes  .
Revised:  The model displays an important feature well known to practitioners that within a certain inventory range the market maker does not actually want to capitalize on this active trading opportunity but should rather ``internalize'' the flow by appropriately adjusting the quotes .
Edit intent: fluency
Original:  The model displays an important feature well known to practitioners that in a certain inventory range the market maker does not actually want to capitalize on this active trading opportunity but should rather ``internalize'' the flow by appropriately adjusting the quotes  .
Revised:  The model displays an important feature well known to practitioners that in a certain inventory range the market maker internalizes the flow by appropriately adjusting the quotes .
Edit intent: clarity
Original:  A modified SELDnet baseline employing the recent ACCDOA representation for SELD problems accompanies the dataset and is described herein .
Revised:  A modified SELDnet baseline employing the recent ACCDOA representation of SELD problems accompanies the dataset and is described herein .
Edit intent: fluency
Original:  However,  most modern machine learning algorithms are not neurophysiologically plausible and thus are not directly implementable in neuromorphic hardware .
Revised:  However, it has been argued that most modern machine learning algorithms are not neurophysiologically plausible and thus are not directly implementable in neuromorphic hardware .
Edit intent: clarity
Original:  However,  most modern machine learning algorithms are not neurophysiologically plausible and thus are not directly implementable in neuromorphic hardware .
Revised:  However, most modern machine learning algorithms are not neurophysiologically plausible .
Edit intent: coherence
Original:   This implementation shows a path for using massively parallel, low-power, low-latency neuromorphic processors in modern deep learning applications.
Revised:  This implementation shows a path for using massively parallel, low-power, low-latency implementation of modern deep learning applications.
Edit intent: clarity
Original:  Then, we use these bounds to build safety and stability chance constraints that can be incorporated in a min-norm convex optimization program , called GP-CBF-CLF-SOCP.
Revised:  We then use these bounds to build safety and stability chance constraints that can be incorporated in a min-norm convex optimization program , called GP-CBF-CLF-SOCP.
Edit intent: coherence
Original:  Then, we use these bounds to build safety and stability chance constraints that can be incorporated in a min-norm convex optimization program , called GP-CBF-CLF-SOCP.
Revised:  Then, we use these bounds to build safety and stability chance constraints that can be incorporated in a min-norm convex optimization-based controller , called GP-CBF-CLF-SOCP.
Edit intent: clarity
Original:  The present work is a preliminary but necessary effort aimed at paving the way for a more comprehensive work on local time-stepping for the primitive equation set with realistic geography .
Revised:  The present work is a preliminary but necessary effort aimed at paving the way for a more comprehensive work on local time-stepping schemes. This is in fact the ultimate goal of using an LTS procedure and it is the one to which we direct all our optimization efforts .
Edit intent: clarity
Original:  Evaluation across programs of different lengths and under two different experimental settings reveal that when given the same time budget, our technique significantly improves the success rate over PCCoder arXiv:1809.04682v2 [ cs. LG ] and other ablation baselines.
Revised:  Evaluation across programs of different lengths and under two different experimental settings reveal that when given the same time budget, our technique significantly improves the success rate over PCCoder [ cs. LG ] and other ablation baselines.
Edit intent: clarity
Original:  We will find criteria on the category that ensure uniqueness, existence, and functoriality of the minimization aspects , where the proofs instantiate to those for reachability and bisimilarity minimization in the standard coalgebra literature.
Revised:  We will find criteria on the category that ensure uniqueness, existence, and functoriality of the minimization aspects . The proofs of these results instantiate to those for reachability and bisimilarity minimization in the standard coalgebra literature.
Edit intent: clarity
Original:  We will find criteria on the category that ensure uniqueness, existence, and functoriality of the minimization aspects , where the proofs instantiate to those for reachability and bisimilarity minimization in the standard coalgebra literature.
Revised:  We will find criteria on the category that ensure uniqueness, existence, and functoriality of the minimization aspects , where the proofs instantiate to those for reachability and observability minimization in the standard coalgebra literature.
Edit intent: clarity
Original:  The stochastic state transition of receptor induces the release of singling molecular, which triggers the state transition of other receptors.
Revised:  The stochastic state transition of receptor induces the release of signaling molecular, which triggers the state transition of other receptors.
Edit intent: fluency
Original:  It constructs a nonlinear singling network, and leads to robust switchlike properties which are critical to biological function.
Revised:  It constructs a nonlinear sigaling network, and leads to robust switchlike properties which are critical to biological function.
Edit intent: fluency
Original:  Network architectures and state transitions of receptor will affect the performance of this biological network.
Revised:  Network architectures and state transitions of receptor affect the performance of this biological network.
Edit intent: clarity
Original:  In our experiments, we were able to repeatable trigger bit-set and bit-reset operations changing the data stored in single JICG flip-flops despite their high-radiation fault tolerance.
Revised:  In our experiments, we were able to trigger bit-set and bit-reset operations changing the data stored in single JICG flip-flops despite their high-radiation fault tolerance.
Edit intent: clarity
Original:  In our experiments, we were able to repeatable trigger bit-set and bit-reset operations changing the data stored in single JICG flip-flops despite their high-radiation fault tolerance.
Revised:  In our experiments, we were able to repeatable trigger bit-set and bit-reset repeatedly changing the data stored in single JICG flip-flops despite their high-radiation fault tolerance.
Edit intent: clarity
Original:  In order to address these challenges, we propose a novel analytical framework for effective visualization and mining of topic modeling results .
Revised:  In order to address these challenges, we propose a novel analytical framework for estimating topic interactions and effective visualization for topic interpretation .
Edit intent: clarity
Original:  These results together provide a deeply mined and intuitive representation of relationships among topics related to a specific research area.
Revised:  These results together provide deeply mined and intuitive representation of relationships among topics related to a specific research area.
Edit intent: fluency
Original:  Moreover, in the proposed approach, the change of relationships among topics can be traced using a trajectory plot generated with different levels of word richness.
Revised:  Moreover, in the proposed approach, the change of relationships among topics using a trajectory plot generated with different levels of word richness.
Edit intent: clarity
Original: In this paper, we develop an adaptive high-order surface finite element method (FEM) to solve self-consistent field equations of polymers on general curved surfaces.
Revised: In this paper, we develop an adaptive high-order surface finite element method (FEM) to solve self-consistent field equations on general curved surfaces.
Edit intent: clarity
Original:  It is an improvement of the existing algorithm of J. Comp.
Revised:  J. Comp.
Edit intent: clarity
Original:  Phys. 387: 230-244 (2019)%DIFDELCMD < ] %%% in which a linear surface FEM was presented to address this problem.
Revised:  Phys. 387: 230-244 (2019)%DIFDELCMD < ] %%% 
Edit intent: coherence
Original:  The high-order surface FEM is obtained by the high-order surface geometrical approximation and  high-order function space approximation.
Revised:  The high-order surface FEM is obtained by the high-order surface geometrical approximation and the high-order function space approximation.
Edit intent: fluency
Original:   In order to describe the sharp interface in the strong segregation system more accurately, an adaptive FEM equipped with a novel Log marking strategy is proposed.
Revised:  In order to describe the sharp interface in the strongly segregated system more accurately, an adaptive FEM equipped with a novel Log marking strategy is proposed.
Edit intent: fluency
Original:   In order to describe the sharp interface in the strong segregation system more accurately, an adaptive FEM equipped with a novel Log marking strategy is proposed.
Revised:  In order to describe the sharp interface in the strong segregation system more accurately, an adaptive FEM equipped with a new Log marking strategy is proposed.
Edit intent: clarity
Original:  Compared with the traditional strategy, this new marking strategy can not only label the elements that need to be refined or coarsened, but also give the refined or coarsened times, which can make full use of the information of a posterior error estimator and improve the efficiency of the adaptive algorithm.
Revised:  Compared with the traditional strategy, the Log marking strategy can not only label the elements that need to be refined or coarsened, but also give the refined or coarsened times, which can make full use of the information of a posterior error estimator and improve the efficiency of the adaptive algorithm.
Edit intent: clarity
Original:  Compared with the traditional strategy, this new marking strategy can not only label the elements that need to be refined or coarsened, but also give the refined or coarsened times, which can make full use of the information of a posterior error estimator and improve the efficiency of the adaptive algorithm.
Revised:  Compared with the traditional strategy, this new marking strategy can not only label the elements that need to be refined or coarsened, but also give the refined or coarsened times, which can make full use of the information of a posterior error estimator and improve the ecciency of the adaptive algorithm.
Edit intent: clarity
Original:  Numerical results illustrate the efficiency of the proposed method, especially for strong segregation systems .
Revised:  Numerical results illustrate the ecciency of the proposed method, especially for strong segregation systems .
Edit intent: clarity
Original:  To answer this question, we tested human observers on a broad range of out-of-distribution (OOD) datasets, adding the "missing human baseline" by recording 85,120 psychophysical trials across 90 participants.
Revised:  To answer this question, we tested human observers on a broad range of out-of-distribution (OOD) datasets, recording 85,120 psychophysical trials across 90 participants.
Edit intent: coherence
Original:  Our findings are threefold. (1.) The longstanding  robustness gap between humans and CNNs is closing, with the best models now matching or exceeding human performance on most  OOD datasets. (2.) There is still a substantial image-level consistency gap, meaning that humans make different errors than models.
Revised:  Our findings are threefold. (1.) The longstanding robustness gap between humans and CNNs is closing, with the best models now matching or exceeding human performance on most of the investigated OOD datasets. (2.) There is still a substantial image-level consistency gap, meaning that humans make different errors than models.
Edit intent: clarity
Original:  By combining information flow tracking and specification mining , we are able to produce information flow properties of a design without prior knowledge of security agreements or specifications.
Revised:  By combining information flow tracking and specification mining to produce a set of information flow properties of a design without prior knowledge of security agreements or specifications.
Edit intent: clarity
Original: For a given shape S in the plane, one can ask what is the lowest possible density of a point set P that pierces ( ``intersects'', ``hits'' ) all translates of S.
Revised: For a given shape S in the plane, one can ask what is the lowest possible density of a point set P that pierces ( "intersects", "hits" ) all translates of S.
Edit intent: fluency
Original:  When |\mathcal F|=2 we exactly solve the case when one rectangle is more squarish than 2\times 1, and give bounds (within 10\,\\%DIF < of each other) for the %DIF > of each other) for the remaining case when one rectangle is wide and the other one is tall.
Revised:  When |\mathcal F|=2 we exactly solve the case when one rectangle is more squarish than 2\times 1, and give bounds (within 10\,\\%DIF < of each %DIF > of each other) for the remaining case when one rectangle is wide and the other one is tall.
Edit intent: clarity
Original:  In this paper, our main objective is to characterize the risk of fairwashing attacks , in particular by investigating the fidelity-unfairness trade-off.
Revised:  In this paper, we investigate the capability of fairwashing attacks , in particular by investigating the fidelity-unfairness trade-off.
Edit intent: clarity
Original:  In this paper, our main objective is to characterize the risk of fairwashing attacks , in particular by investigating the fidelity-unfairness trade-off.
Revised:  In this paper, our main objective is to characterize the risk of fairwashing attacks by analyzing their fidelity-unfairness trade-off.
Edit intent: clarity
Original:  For instance, we find that fairwashed explanation models can exhibit up to 99.20%DIFDELCMD < \\%%% %DIF < fidelity to the black-box models they explain while being 50%DIFDELCMD < \\%%% %DIF < less unfair.
Revised:  For instance, we find that fairwashed explanation models can exhibit up to 99.20%DIFDELCMD < \\%%% %DIF < fidelity to the black-box models they explain while %DIFDELCMD < \\%%% %DIF < less unfair.
Edit intent: clarity
Original:  Second, we show that fairwashed explanation models can generalize beyond the suing group ( i.e. , data points that are being explained), which will only worsen as more stable fairness methods get developed.
Revised:  Second, we show that fairwashed explanation models can generalize beyond the suing group ( i.e. , data points that are being explained), which will only worsen as more stable fairness methods get developed.
Edit intent: fluency
Original: Restless and collapsing bandits are commonly used to model constrained resource allocation in settings featuring arms with action-dependent transition probabilities, such as allocating health interventions among patients [Whittle, 1988;
Revised: Restless and collapsing bandits are commonly used to model constrained resource allocation in settings featuring arms with action-dependent transition probabilities, such as the allocation of health interventions among patients [Whittle, 1988;
Edit intent: fluency
Original:  However, state-of-the-art Whittle-index-based approaches to this planning problem either do not consider fairness among arms , or incentivize fairness without guaranteeing it [Mate et al., 2021].
Revised:  However, state-of-the-art Whittle-index-based approaches to this planning problem either do not consider fairness among arms or incentivize fairness without guaranteeing it [Mate et al., 2021].
Edit intent: fluency
Original:  We evaluate our algorithm on a real-world application, where interventions support continuous positive airway pressure (CPAP) therapy adherence among obstructive sleep apnea (OSA) patients, as well as simulations on a broader class of synthetic transition matrices.
Revised:  We evaluate our algorithm on a real-world application, where interventions support continuous positive airway pressure (CPAP) therapy adherence among obstructive sleep apnea (OSA) patients, as well as on a broader class of synthetic transition matrices.
Edit intent: clarity
Original:  This system, whose security relies on the hardness of the well-known MinRankproblem , is shown to be resilient to several straightforward algebraic attacks.
Revised:  This system, whose security relies on the hardness of the well-known MinRank problem , is shown to be resilient to several straightforward algebraic attacks.
Edit intent: fluency
Original:  In this paper, we address this question of `` well-definedness", but from a different angle.
Revised:  In this paper, we address this question of " well-definedness", but from a different angle.
Edit intent: fluency
Original:  In this paper, to further push forward this direction with a comprehensive study in both algorithm and system design, we build FedIoT platform that contains a synthesized dataset using N-BaIoT, FedDetect algorithm , and a system design for  IoT devices.
Revised:  In this paper, to further push forward this direction with a comprehensive study in both algorithm and system design, we build FedIoT platform that contains FedDetect algorithm for on-device anomaly data detection and a system design for IoT devices.
Edit intent: coherence
Original:  Our results demonstrate the efficacy of federated learning in detecting a large range of attack types  .
Revised:  Our results demonstrate the efficacy of federated learning in detecting a wider range of attack types .
Edit intent: clarity
Original:  This information can be represented using keypoints , which is a list of spatial locations in the input image.
Revised:  This information can be represented using feature points , which is a list of spatial locations in the input image.
Edit intent: clarity
Original:  Previous works show that keypoint representations learned during unsupervised pre-training using encoder-decoder architectures can provide good features for control tasks.
Revised:  Previous works show that feature points learned using unsupervised pre-training using encoder-decoder architectures can provide good features for control tasks.
Edit intent: clarity
Original:  In this paper, we show that it is possible to learn efficient keypoint representations end-to-end, without the need for unsupervised pre-training, decoders, or additional losses.
Revised:  In this paper, we show that it is possible to learn efficient feature point representations end-to-end, without the need for unsupervised pre-training, decoders, or additional losses.
Edit intent: clarity
Original:  Our proposed architecture consists of a differentiable keypoint extractor that feeds the coordinates of the estimated keypoints directly to a soft actor-critic agent.
Revised:  Our proposed architecture consists of a differentiable feature point extractor that feeds the coordinates of the estimated keypoints directly to a soft actor-critic agent.
Edit intent: clarity
Original:  Our proposed architecture consists of a differentiable keypoint extractor that feeds the coordinates of the estimated keypoints directly to a soft actor-critic agent.
Revised:  Our proposed architecture consists of a differentiable keypoint extractor that feeds the coordinates of the estimated feature points directly to a soft actor-critic agent.
Edit intent: clarity
Original:  While most existing works focus on exploiting IRS to enhance the performance of wireless  information transmission (WIT), the high beamforming gain achieved by passive IRS is also appealing for boosting the efficiency of radio-frequency (RF) based wireless power transfer (WPT) and improving its service coverage .
Revised:  Most existing works on IRS have focused on exploiting IRS to enhance the performance of wireless information transmission (WIT), the high beamforming gain achieved by passive IRS is also appealing for boosting the efficiency of radio-frequency (RF) based wireless power transfer (WPT) and improving its service coverage .
Edit intent: clarity
Original:  While most existing works focus on exploiting IRS to enhance the performance of wireless  information transmission (WIT), the high beamforming gain achieved by passive IRS is also appealing for boosting the efficiency of radio-frequency (RF) based wireless power transfer (WPT) and improving its service coverage .
Revised:  While most existing works focus on exploiting IRS to enhance the performance of wireless information transmission (WIT), while its potential for boosting the efficiency of radio-frequency (RF) based wireless power transfer (WPT) and improving its service coverage .
Edit intent: clarity
Original:  Although IRS-aided WPT shares certain similar characteristics with IRS-aided WIT, they also differ significantly in terms of the design objectives, transmitter/receiver architectures and hardware/power constraints, and so on, which thus may lead to distinct solutions in practice .
Revised:  Although IRS-aided WET shares similar characteristics with IRS-aided WIT, they also differ significantly in terms of the design objectives, transmitter/receiver architectures and hardware/power constraints, and so on, which thus may lead to distinct solutions in practice .
Edit intent: clarity
Original:  Although IRS-aided WPT shares certain similar characteristics with IRS-aided WIT, they also differ significantly in terms of the design objectives, transmitter/receiver architectures and hardware/power constraints, and so on, which thus may lead to distinct solutions in practice .
Revised:  Although IRS-aided WPT shares certain similar characteristics with IRS-aided WIT, they differ fundamentally in terms of the design objectives, transmitter/receiver architectures and hardware/power constraints, and so on, which thus may lead to distinct solutions in practice .
Edit intent: clarity
Original:  Although IRS-aided WPT shares certain similar characteristics with IRS-aided WIT, they also differ significantly in terms of the design objectives, transmitter/receiver architectures and hardware/power constraints, and so on, which thus may lead to distinct solutions in practice .
Revised:  Although IRS-aided WPT shares certain similar characteristics with IRS-aided WIT, they also differ significantly in terms of design objective, receiver architecture, and practical constraints .
Edit intent: clarity
Original:  In this paper, we provide a tutorial overview on  IRS-aided WPT and its more complicated integrations with WIT , namely IRS-aided simultaneous wireless information and power transfer (SWIPT) and IRS-aided wireless powered communication networks (WPCNs), from the communication and signal processing perspective.
Revised:  In this paper, we provide a tutorial overview on IRS-aided WPT and its more complicated integrations with WIT , namely IRS-aided simultaneous wireless information and power transfer (SWIPT) and IRS-aided wireless powered communication network (WPCN), mainly from a communication and signal processing perspective.
Edit intent: fluency
Original:  Furthermore, we point out important directions worthy of further investigation in future work .
Revised:  Furthermore, we point out important directions for future research and investigation .
Edit intent: clarity