wanyu/IteraTeR_v2 huggingface dataset:
Original:  These attacks aim at establishing hidden backdoors in the DNN such that the model performs well on benign samples but outputs a particular target label when a trigger is applied to the input.
Revised:  These attacks aim at establishing hidden backdoors in the DNN such that it performs well on benign samples but outputs a particular target label when a trigger is applied to the input.
Edit intent: clarity
Original:  These attacks aim at establishing hidden backdoors in the DNN such that the model performs well on benign samples but outputs a particular target label when a trigger is applied to the input.
Revised:  These attacks aim at establishing hidden backdoors in the DNN such that the model performs well on clean samples but outputs a particular target label when a trigger is applied to the input.
Edit intent: clarity
Original:  Current backdoor attacks rely on generating triggers in the image/pixel domain;
Revised:  Current backdoor attacks generate triggers in the image/pixel domain;
Edit intent: clarity
Original:  In this work , we propose a complete pipeline for generating a dynamic, efficient, and invisible backdoor attack in the frequency domain.
Revised:  To the best of our knowledge, this work is the first to propose a pipeline for generating a dynamic, efficient, and invisible backdoor attack in the frequency domain.
Edit intent: clarity
Original:  We show the advantages of utilizing the frequency domain for establishing undetectable and powerful backdoor attacks through extensive experiments on various datasets and network architectures.
Revised:  We show the advantages of utilizing the frequency domain for creating undetectable and powerful backdoor attacks through extensive experiments on various datasets and network architectures.
Edit intent: clarity
Original: Deploying optimal control strategies for coordination of connected and automated vehicles (CAVs) often requires re-evaluating the strategies in order to respond to unexpected changes in the presence of disturbances and uncertainties.
Revised: Deriving optimal control strategies for coordination of connected and automated vehicles (CAVs) often requires re-evaluating the strategies in order to respond to unexpected changes in the presence of disturbances and uncertainties.
Edit intent: clarity
Original:  We illustrate the effectiveness of our proposed approach through several numerical simulations.
Revised:  We illustrate the effectiveness of our proposed approach through numerical simulations.
Edit intent: clarity
Original:  Combining ideas from previous approaches, in this paper we define a complete system of dynamic epistemic logic for modeling security protocols.
Revised:  Combining ideas from previous approaches, in this paper we define a complete system of dynamic epistemic logic for modeling security protocols.
Edit intent: fluency
Original:  Such a mechanism is termed `` joint liability".
Revised:  Such a mechanism is termed " joint liability".
Edit intent: fluency
Original: After 20 years of development, V2X has been facing industrialization challenges from DSRC to C-V2X . On the one hand, the new requirements for spectrum, chips, equipment, and networks introduced by the PC5 interface have caused high technical barriers to industrialization.
Revised:  C-V2X . On the one hand, the new requirements for spectrum, chips, equipment, and networks introduced by the PC5 interface have caused high technical barriers to industrialization.
Edit intent: coherence
Original:  Aiming at the Uu interface based C-V2X solution (UC-V2X), this paper introduces a risk filtering algorithm through the V2X levels of capability , and proposes a software-defined C-V2X solution (SUC-V2X) , which systematically solves the C-V2X problems of industrialization.
Revised:  Aiming at the Uu interface based C-V2X solution (UC-V2X), this paper introduces a risk filtering algorithm through the V2X capability classification , and proposes a software-defined C-V2X solution (SUC-V2X) , which systematically solves the C-V2X problems of industrialization.
Edit intent: clarity
Original:  This paper further preliminarily verifies the performance of SUC-V2X .
Revised:  This paper further preliminarily verifies the performance of the solution .
Edit intent: clarity
Original: We prove that the genus of a regular language is decidable.
Revised: The article continues our study of the genus of a regular language is decidable.
Edit intent: clarity
Original:  We show that the original question is equivalent to the existence of a special kind of graph epimorphism - a directed emulator morphism -- onto the underlying graph of the minimal deterministic automaton for the regular language\underset{G \in S}{\min} .
Revised:  We show that the original question is equivalent to the existence of a special kind of graph epimorphism - a directed graph of the minimal deterministic automaton for the regular language\underset{G \in S}{\min} .
Edit intent: clarity
Original:  Accordingly, a novel formulation for tensor completion and an efficient optimization algorithm, called as tensor completion by parallel weighted matrix factorization via tensor train (TWMac-TT), is proposed.
Revised:  Accordingly, a novel formulation for tensor completion and an effective optimization algorithm, called as tensor completion by parallel weighted matrix factorization via tensor train (TWMac-TT), is proposed.
Edit intent: clarity
Original:  By combining two networks together, the whole model achieves 512 times compression for the intermediate feature and a performance loss within 2\% on both tasks.
Revised:  By combining two networks together, the whole model achieves 512x compression for the intermediate feature and a performance loss within 2\% on both tasks.
Edit intent: clarity
Original: With the increasing scale and diversification of interaction behaviors in E-commerce , more and more researchers pay attention to multi-behavior recommender systems which utilize interaction data of other auxiliary behaviors .
Revised: Nowadays, E-commerce , more and more researchers pay attention to multi-behavior recommender systems which utilize interaction data of other auxiliary behaviors .
Edit intent: coherence
Original:  Our MLFW database can be viewed and downloaded at URL
Revised:  MLFW database can be viewed and downloaded at URL
Edit intent: clarity
Original:  We establish a new benchmark for CardEst, which contains a new complex realworld dataset STATS and a diverse query workload STATS-CEB.
Revised:  We establish a new benchmark for CardEst, which contains a new complex real-world dataset STATS and a diverse query workload STATS-CEB.
Edit intent: fluency
Original:  In this paper we present a new framework which combines a deep neural network with the best tools of "classical " metaheuristics for graph coloring.
Revised:  In this paper we present a new framework that combines a deep neural network with the best tools of "classical " metaheuristics for graph coloring.
Edit intent: fluency
Original:  In this paper we present a new framework which combines a deep neural network with the best tools of "classical " metaheuristics for graph coloring.
Revised:  In this paper we present a new framework which combines a deep neural network with the best tools of classical metaheuristics for graph coloring.
Edit intent: fluency
Original:  The proposed algorithm is evaluated on the weighted graph coloring problem and computational results show that the proposed approach allows to obtain new upper bounds for medium and large graphs .
Revised:  The proposed method is evaluated on the weighted graph coloring problem and computational results show that the proposed approach allows to obtain new upper bounds for medium and large graphs .
Edit intent: clarity
Original:  A study of the contribution of deep learning in the algorithm highlights that it is possible to learn relevant patterns useful to obtain better solutions to this problem .
Revised:  A study of the contribution of deep learning in the method highlights that it is possible to learn relevant patterns useful to obtain better solutions to this problem .
Edit intent: clarity
Original:  We focus on motion tracking in challenging environments such as in narrow corridorsand dark spaces with aggressive motions  and abrupt lighting changes.
Revised:  We focus on motion tracking in challenging environments , such as narrow corridors, dark spaces with aggressive motions and abrupt lighting changes.
Edit intent: fluency
Original:  We focus on motion tracking in challenging environments such as in narrow corridorsand dark spaces with aggressive motions  and abrupt lighting changes.
Revised:  We focus on motion tracking in challenging environments such as in narrow corridorsand dark spaces with aggressive motions , and abrupt lighting changes.
Edit intent: fluency
Original:  While tracking motion across extra cameras should theoretically prevent failures, it causes additional complexity and computational burden.
Revised:  While tracking motion with extra cameras should theoretically prevent failures, it causes additional complexity and computational burden.
Edit intent: clarity
Original:  While tracking motion across extra cameras should theoretically prevent failures, it causes additional complexity and computational burden.
Revised:  While tracking motion across extra cameras should theoretically prevent failures, it leads to additional complexity and computational burden.
Edit intent: clarity
Original:  Second, we select a fixed budget of tracked features which are spread across the cameras to ensure that the limited computational budget is never exceeded .
Revised:  Second, we select a fixed budget of tracked features across the cameras to ensure that the limited computational budget is never exceeded .
Edit intent: clarity
Original:  Second, we select a fixed budget of tracked features which are spread across the cameras to ensure that the limited computational budget is never exceeded .
Revised:  Second, we select a fixed budget of tracked features which are spread across the cameras to reduce back-end optimization time .
Edit intent: clarity
Original:  We have found that using a smaller set of informative features can maintain the same tracking accuracy while reducing back-end optimization time .
Revised:  We have found that using a smaller set of informative features can maintain the same tracking accuracy .
Edit intent: clarity
Original:  Our proposed method was extensively tested using a hardware-synchronized device containing an IMU and four cameras (a front stereo pair and two lateral) in scenarios including  an underground mine, large open spaces, and building interiors with narrow stairs and corridors.
Revised:  Our proposed method was extensively tested using a hardware-synchronized device consisting of an IMU and four cameras (a front stereo pair and two lateral) in scenarios including an underground mine, large open spaces, and building interiors with narrow stairs and corridors.
Edit intent: clarity
Original:  Our proposed method was extensively tested using a hardware-synchronized device containing an IMU and four cameras (a front stereo pair and two lateral) in scenarios including  an underground mine, large open spaces, and building interiors with narrow stairs and corridors.
Revised:  Our proposed method was extensively tested using a hardware-synchronized device containing an IMU and four cameras (a front stereo pair and two lateral) in scenarios including : an underground mine, large open spaces, and building interiors with narrow stairs and corridors.
Edit intent: fluency
Original:  Finally, we demonstrate these properties in simulation and with a real-time experiment in a scaled testbed .
Revised:  Finally, we demonstrate these properties in simulation .
Edit intent: coherence
Original:  First, we prove that the problem remains NP-complete for the class of planar bipartite graphs with maximum degree three and girth of arbitrary large .
Revised:  First, we prove that the problem remains NP-complete for the class of planar bipartite graphs of maximum degree three and girth of arbitrary large .
Edit intent: fluency
Original:  First, we prove that the problem remains NP-complete for the class of planar bipartite graphs with maximum degree three and girth of arbitrary large .
Revised:  First, we prove that the problem remains NP-complete for the class of planar bipartite graphs with maximum degree three and arbitrarily large girth .
Edit intent: clarity
Original:  The LC maneuver is parsed into two stages: one is from the decision point to the execution point (finding a suitable gap), and the other is from the execution point to the end point (performing the LC maneuver).
Revised:  The LC maneuver is decomposed into two stages: one is from the decision point to the execution point (finding a suitable gap), and the other is from the execution point to the end point (performing the LC maneuver).
Edit intent: clarity
Original:  Thereafter, a multiobjective optimization problem integrating these two stages is constructed , in which the comfort, efficiency and safety of the LC vehicle and the surrounding vehicles are simultaneously considered.
Revised:  Thereafter, a multiobjective optimization problem integrating these two stages is posed , in which the comfort, efficiency and safety of the LC vehicle and the surrounding vehicles are simultaneously considered.
Edit intent: clarity
Original:  Through introducing the NSGA-II (Non-dominated Sorting Genetic Algorithm), the pareto-optimal frontier and pareto-optimal solution of this problem is obtained.
Revised:  Through introducing the NSGA-II (Non-dominated Sorting Genetic Algorithm), the pareto-optimal front of this problem is obtained.
Edit intent: clarity
Original:  Through the micro-level analysis of the operating status of each vehicle, macro-level analysis of the traffic flow state within the LC area, and the sensitivity analysis of pareto-optimal frontier , we verify the performance of our proposed algorithm.
Revised:  Through the micro-level analysis of the operating status of each vehicle, macro-level analysis of the traffic flow state within the LC area, and the sensitivity analysis of pareto-optimal fronts , we verify the performance of our proposed algorithm.
Edit intent: clarity
Original:  Results demonstrate that compared with the existing algorithm, our algorithm could provide the optimal execution point and trajectory with the least impact on surroundings .
Revised:  Our results demonstrate that compared with the existing algorithm, our algorithm could provide the optimal execution point and trajectory with the least impact on surroundings .
Edit intent: clarity
Original:  Results demonstrate that compared with the existing algorithm, our algorithm could provide the optimal execution point and trajectory with the least impact on surroundings .
Revised:  Results demonstrate that compared with the existing algorithm, our algorithm provides the optimal execution point and trajectory with the least impact on surroundings .
Edit intent: clarity
Original:  Results demonstrate that compared with the existing algorithm, our algorithm could provide the optimal execution point and trajectory with the least impact on surroundings .
Revised:  Results demonstrate that compared with the existing algorithm, our algorithm could provide the optimal execution point and trajectory with the least impact on surrounding vehicles .
Edit intent: clarity
Original:  We anticipate that this research could provide valuable insights into autonomous driving technology.
Revised:  This research could provide valuable insights into autonomous driving technology.
Edit intent: clarity
Original: We present a system that paints graffiti art with applications in artpreservation, human-robot collaboration, and other tasks which require large-scale dynamic motion .
Revised: We present a system that paints graffiti art with applications in artpreservation, human-robot collaboration .
Edit intent: clarity
Original:  The problem of painting graffiti in a human style is particularly challenging and requires a systems approach because the art and robotics must be designed around each other.
Revised:  The problem of painting graffiti in a human style is particularly challenging and requires a system-level approach because the art and robotics must be designed around each other.
Edit intent: clarity
Original:  The problem of painting graffiti in a human style is particularly challenging and requires a systems approach because the art and robotics must be designed around each other.
Revised:  The problem of painting graffiti in a human style is particularly challenging and requires a systems approach because the robotics and art must be designed around each other.
Edit intent: fluency
Original:   Our approach consists of three stages: artwork capture, robot hardware, and robot planning and control.
Revised:  Our approach consists of three stages: artwork capture, robot hardware, and planning control.
Edit intent: clarity
Original:  While we acknowledge that further work is needed for a system which can perfectly recreate human artwork, our results represent a contribution by demonstrating that we can reproduce artist motions up to 2m/s and 10m /s^2 within 2cm to paint artworks  .
Revised:  Our work represents an important step towards faithfully recreating human graffiti artwork by demonstrating that we can reproduce artist motions up to 2m/s and 10m /s^2 within 2cm to paint artworks .
Edit intent: clarity
Original:  Added material not in the original work is colored in red .
Revised:  Changes to the submitted manuscript are colored in blue .
Edit intent: clarity
Original: In this work, we track the lineage of tuples throughout their database lifetime.
Revised: We track the lineage of tuples throughout their database lifetime.
Edit intent: clarity
Original:  We integrate our lineage computations into the PostgreSQL system via an extension (ProvSQL) and experimentally exhibit useful results in terms of accuracy against exact, semiring-based, justifications  .
Revised:  We integrate our lineage computations into the PostgreSQL system via an extension (ProvSQL) and extensive experiments exhibit useful results in terms of accuracy against exact, semiring-based, justifications .
Edit intent: clarity
Original:  In the experiments, we focus on tuples with multiple generations of tuples in their lifelong lineage and analyze them in terms of direct and distant lineage .
Revised:  In the experiments, we focus on tuples with multiple generations of tuples in their lifelong lineage and analyze them in terms of direct and distant lineage .
Edit intent: fluency
Original:  We combine ratings from three news media ranking sites: Medias Bias Chart , News Guard and Media Bias/Fact Check (MBFC) to classify the news dataset into two levels of credibility: reliable and unreliable.
Revised:  We combine ratings from three news media ranking sites: Medias Bias Chart and Media Bias/Fact Check (MBFC) to classify the news dataset into two levels of credibility: reliable and unreliable.
Edit intent: coherence
Original: A distributed system keeps consistencyby disallowing data anomalies.
Revised: Transaction processing technology has three important contents: data anomalies, isolation levels, and concurrent control algorithms. Concurrent control algorithms are used to eliminate some or all data anomalies at different isolation levels to ensure data consistency. Isolation levels in the current ANSI standard are defined by disallowing certain kinds of data anomalies.
Edit intent: clarity
Original:  However, especially in the database, the definitions of data anomalies in the current ANSI standard are controversial.
Revised:  Yet, the definitions of data anomalies in the current ANSI standard are controversial.
Edit intent: coherence
Original:  However, especially in the database, the definitions of data anomalies in the current ANSI standard are controversial.
Revised:  However, especially in the database, the definitions of data anomalies in the ANSI standard are controversial.
Edit intent: clarity
Original:  Second , the definitions of anomalies are case-by-case , which could not have a comprehensive understanding of data anomalies .
Revised:  On the other hand , the definitions of anomalies are case-by-case , which could not have a comprehensive understanding of data anomalies .
Edit intent: coherence
Original:  Second , the definitions of anomalies are case-by-case , which could not have a comprehensive understanding of data anomalies .
Revised:  Second , the definitions are made in a case-by-case , which could not have a comprehensive understanding of data anomalies .
Edit intent: clarity
Original:  Second , the definitions of anomalies are case-by-case , which could not have a comprehensive understanding of data anomalies .
Revised:  Second , the definitions of anomalies are case-by-case manner and lead to a situation that even a senior DBA could not have a comprehensive understanding of data anomalies .
Edit intent: coherence
Original:  Second , the definitions of anomalies are case-by-case , which could not have a comprehensive understanding of data anomalies .
Revised:  Second , the definitions of anomalies are case-by-case , which could not have infallible knowledge of data anomalies .
Edit intent: clarity
Original:  In this paper, we first propose a second-order scheme for this equation by employing the recently proposed L2-type formula [A. ~A. ~ Alikhanov, C. ~ Huang, Appl.
Revised:  In this paper, we first propose a second-order scheme for this equation by employing the recently proposed L2-type formula [A. A. Alikhanov, C. ~ Huang, Appl.
Edit intent: clarity
Original:  In this paper, we first propose a second-order scheme for this equation by employing the recently proposed L2-type formula [A. ~A. ~ Alikhanov, C. ~ Huang, Appl.
Revised:  In this paper, we first propose a second-order scheme for this equation by employing the recently proposed L2-type formula [A. ~A. ~ Alikhanov, C. Huang, Appl.
Edit intent: fluency
Original:  Then, we prove the stability and the convergence of this scheme.
Revised:  Then, we prove the stability and the convergence of the proposed scheme.
Edit intent: clarity
Original:  Based on such the numerical scheme, a L2-type all-at-once system is derived.
Revised:  Based on such a numerical scheme, a L2-type all-at-once system is derived.
Edit intent: fluency
Original:  Based on such the numerical scheme, a L2-type all-at-once system is derived.
Revised:  Based on such the numerical scheme, an L2-type all-at-once system is derived.
Edit intent: fluency
Original: We present a study on the selection of a variety of activity patterns among neurons that are connected in  multiplex framework, with neurons on two layers with different functional couplings.
Revised: We present a study on the emergence of a variety of activity patterns among neurons that are connected in multiplex framework, with neurons on two layers with different functional couplings.
Edit intent: clarity
Original: We present a study on the selection of a variety of activity patterns among neurons that are connected in  multiplex framework, with neurons on two layers with different functional couplings.
Revised: We present a study on the selection of a variety of activity patterns among neurons that are connected in a multiplex framework, with neurons on two layers with different functional couplings.
Edit intent: fluency
Original:  With  Hindmarsh-Rose model for the dynamics of single neurons, we analyze the possible patterns of dynamics in each layer separately , and report emergent patterns of activity like  anti-phase  oscillations in multi-clusters with phase regularities and enhanced amplitude and frequency with mixed mode oscillations when the connections are inhibitory.
Revised:  With the Hindmarsh-Rose model for the dynamics of single neurons, we analyze the possible patterns of dynamics in each layer separately , and report emergent patterns of activity like anti-phase oscillations in multi-clusters with phase regularities and enhanced amplitude and frequency with mixed mode oscillations when the connections are inhibitory.
Edit intent: fluency